Delay analysis for CBR traffic under static-priority scheduling

Katsuyoshi Iida, Tetsuya Takine, Hideki Sunahara, Yuji Oie

Research output: Contribution to journalArticle

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 languageEnglish
Pages (from-to)177-185
Number of pages9
JournalIEEE/ACM Transactions on Networking
Volume9
Issue number2
DOIs
Publication statusPublished - 2001 Apr
Externally publishedYes

Fingerprint

Transmission control protocol
Scheduling
Modems

Keywords

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

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Hardware and Architecture
  • Information Systems

Cite this

Delay analysis for CBR traffic under static-priority scheduling. / Iida, Katsuyoshi; Takine, Tetsuya; Sunahara, Hideki; Oie, Yuji.

In: IEEE/ACM Transactions on Networking, Vol. 9, No. 2, 04.2001, p. 177-185.

Research output: Contribution to journalArticle

Iida, Katsuyoshi ; Takine, Tetsuya ; Sunahara, Hideki ; Oie, Yuji. / Delay analysis for CBR traffic under static-priority scheduling. In: IEEE/ACM Transactions on Networking. 2001 ; Vol. 9, No. 2. pp. 177-185.
@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",
year = "2001",
month = "4",
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

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

VL - 9

SP - 177

EP - 185

JO - IEEE/ACM Transactions on Networking

JF - IEEE/ACM Transactions on Networking

SN - 1063-6692

IS - 2

ER -