Delay analysis for CBR traffic under static-priority scheduling

Katsuyoshi Iida, Tetsuya Takine, Hideki Sunahara, Yuji Oie

Research output: Contribution to journalArticlepeer-review

20 Citations (Scopus)


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
Issue number2
Publication statusPublished - 2001 Apr
Externally publishedYes


  • 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


Dive into the research topics of 'Delay analysis for CBR traffic under static-priority scheduling'. Together they form a unique fingerprint.

Cite this