Share Email Print

Proceedings Paper

Delay analysis for CBR traffic in static-priority scheduling: single-node and homogeneous CBR traffic case
Author(s): Katsuyoshi Iida; Tetsuya Takine; Hideki Sunahara; Yuji Oie
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

The quality of the real-time traffic severely depends on its loss rate and delay time. In the integrated service networks, the real-time traffic and the non-real-time traffic share the network resources so that one can affect the quality of another and vice versa. In this context, it is very crucial to develop some mechanism to guarantees the quality-of-service required by the real-time traffic. In this paper, we analyze the delay time of CBR packets from real-time sources when CBR packets have the priority over UBR packets in a manner that UBR packets are serviced only if no CBR packets are waiting in the buffer. Furthermore, we obtain various numerical results on the statistical bound on delay time such as the 99.9-percentile delay and compare it with the deterministic bound. By the comparison, we show that CAC (Call Admission Control) based upon the statistical bound is very effective in using the network resources efficiently when CBR packets can tolerate some loss due to late arrival.

Paper Details

Date Published: 10 October 1997
PDF: 12 pages
Proc. SPIE 3231, Performance and Control of Network Systems, (10 October 1997); doi: 10.1117/12.290420
Show Author Affiliations
Katsuyoshi Iida, Nara Institute of Science and Technology (Japan)
Tetsuya Takine, Osaka Univ. (Japan)
Hideki Sunahara, Nara Institute of Science and Technology (Japan)
Yuji Oie, Kyushu Institute of Technology (Japan)

Published in SPIE Proceedings Vol. 3231:
Performance and Control of Network Systems
Wai Sum Lai; Hisashi Kobayashi, Editor(s)

© SPIE. Terms of Use
Back to Top
Sign in to read the full article
Create a free SPIE account to get access to
premium articles and original research
Forgot your username?