Delay analysis for CBR traffic under static-priority scheduling

Katsuyoshi Iida; Tetsuya Takine; Hideki Sunahara; Yuji Oie

doi:10.1109/90.917074

Delay analysis for CBR traffic under static-priority scheduling

Katsuyoshi Iida, Tetsuya Takine, Hideki Sunahara, Yuji Oie

Research output: Contribution to journal › Article › peer-review

20 Citations (Scopus)

Abstract

We examine the delay performance of packets from constant-bit-rate (CBR) traffic whose delay is affected by non- real-time traffic. The delay performance is analyzed by solving the nD/D/1 queue with vacations. We obtain an exact and closed form solution, hence obviating the need of any approximations or numerical Laplace inversions. We then provide various numerical results for low-bit-rate transmission links, in which packets can experience large delay. From our quantitative evaluation, we conclude that there exists an optimum packet size for a given delay bound. In extremely slow links, such as modem links, transmission control protocol (TCP) packets should be segmented to reduce the CBR delay. We therefore investigate the delay impact of TCP packet sizes as well.

Original language	English
Pages (from-to)	177-185
Number of pages	9
Journal	IEEE/ACM Transactions on Networking
Volume	9
Issue number	2
DOIs	https://doi.org/10.1109/90.917074
Publication status	Published - 2001 Apr
Externally published	Yes

Keywords

Access networks
Constant bit rate
Delay analysis
G.723.1
Static priority scheduling

ASJC Scopus subject areas

Software
Computer Science Applications
Computer Networks and Communications
Electrical and Electronic Engineering

Access to Document

10.1109/90.917074

Cite this

@article{31fa85b0c85a45f7b6bcc5aba206ebca,

title = "Delay analysis for CBR traffic under static-priority scheduling",

abstract = "We examine the delay performance of packets from constant-bit-rate (CBR) traffic whose delay is affected by non- real-time traffic. The delay performance is analyzed by solving the nD/D/1 queue with vacations. We obtain an exact and closed form solution, hence obviating the need of any approximations or numerical Laplace inversions. We then provide various numerical results for low-bit-rate transmission links, in which packets can experience large delay. From our quantitative evaluation, we conclude that there exists an optimum packet size for a given delay bound. In extremely slow links, such as modem links, transmission control protocol (TCP) packets should be segmented to reduce the CBR delay. We therefore investigate the delay impact of TCP packet sizes as well.",

keywords = "Access networks, Constant bit rate, Delay analysis, G.723.1, Static priority scheduling",

author = "Katsuyoshi Iida and Tetsuya Takine and Hideki Sunahara and Yuji Oie",

note = "Funding Information: Manuscript received November 11, 1999; revised July 13, 2000; approved by IEEE/ACM TRANSACTIONS ON NETWORKING Editor G. de Veciana. The work of T. Takine was supported in part by Grant-in-Aid for Scientific Research (C) of the Japan Society for the Promotion of Science under Grant 12650380. The work of Y. Oie was supported in part by the Research for the Future Program of the Japan Society for the Promotion of Science under the Project “Integrated Network Architecture for Advanced Multimedia Application Systems” (JSPS-RFTF97R16301), by the Telecommunication Advancement Organization of Japan under the Project “Global Experimental Networks for Information Society Project,” and by a Grant-in Aid for Scientific Research (C) of the Japan Society for the Promotion of Science under Grant 12450156. A preliminary version of this paper was presented at the SPIE International Symposium of Voice, Video, and Data Communications, Dallas, TX, November, 1997.",

year = "2001",

month = apr,

doi = "10.1109/90.917074",

language = "English",

volume = "9",

pages = "177--185",

journal = "IEEE/ACM Transactions on Networking",

issn = "1063-6692",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

number = "2",

}

TY - JOUR

T1 - Delay analysis for CBR traffic under static-priority scheduling

AU - Iida, Katsuyoshi

AU - Takine, Tetsuya

AU - Sunahara, Hideki

AU - Oie, Yuji

N1 - Funding Information: Manuscript received November 11, 1999; revised July 13, 2000; approved by IEEE/ACM TRANSACTIONS ON NETWORKING Editor G. de Veciana. The work of T. Takine was supported in part by Grant-in-Aid for Scientific Research (C) of the Japan Society for the Promotion of Science under Grant 12650380. The work of Y. Oie was supported in part by the Research for the Future Program of the Japan Society for the Promotion of Science under the Project “Integrated Network Architecture for Advanced Multimedia Application Systems” (JSPS-RFTF97R16301), by the Telecommunication Advancement Organization of Japan under the Project “Global Experimental Networks for Information Society Project,” and by a Grant-in Aid for Scientific Research (C) of the Japan Society for the Promotion of Science under Grant 12450156. A preliminary version of this paper was presented at the SPIE International Symposium of Voice, Video, and Data Communications, Dallas, TX, November, 1997.

PY - 2001/4

Y1 - 2001/4

N2 - We examine the delay performance of packets from constant-bit-rate (CBR) traffic whose delay is affected by non- real-time traffic. The delay performance is analyzed by solving the nD/D/1 queue with vacations. We obtain an exact and closed form solution, hence obviating the need of any approximations or numerical Laplace inversions. We then provide various numerical results for low-bit-rate transmission links, in which packets can experience large delay. From our quantitative evaluation, we conclude that there exists an optimum packet size for a given delay bound. In extremely slow links, such as modem links, transmission control protocol (TCP) packets should be segmented to reduce the CBR delay. We therefore investigate the delay impact of TCP packet sizes as well.

AB - We examine the delay performance of packets from constant-bit-rate (CBR) traffic whose delay is affected by non- real-time traffic. The delay performance is analyzed by solving the nD/D/1 queue with vacations. We obtain an exact and closed form solution, hence obviating the need of any approximations or numerical Laplace inversions. We then provide various numerical results for low-bit-rate transmission links, in which packets can experience large delay. From our quantitative evaluation, we conclude that there exists an optimum packet size for a given delay bound. In extremely slow links, such as modem links, transmission control protocol (TCP) packets should be segmented to reduce the CBR delay. We therefore investigate the delay impact of TCP packet sizes as well.

KW - Access networks

KW - Constant bit rate

KW - Delay analysis

KW - G.723.1

KW - Static priority scheduling

UR - http://www.scopus.com/inward/record.url?scp=0035309906&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0035309906&partnerID=8YFLogxK

U2 - 10.1109/90.917074

DO - 10.1109/90.917074

M3 - Article

AN - SCOPUS:0035309906

SN - 1063-6692

VL - 9

SP - 177

EP - 185

JO - IEEE/ACM Transactions on Networking

JF - IEEE/ACM Transactions on Networking

IS - 2

ER -

Delay analysis for CBR traffic under static-priority scheduling

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this