Title :
A note on deterministic end-to-end delay analysis in connection oriented networks
Author_Institution :
Ascend Commun. Inc., Westford, MA, USA
Abstract :
This paper continues the research on deterministic end-to-end delay analysis of packet flows in connection-oriented networks. It extends the results presented by Chlamtac, Farago, Zhang, and Fumagalli (see IEEE/ACM Trans. Networking, vol.6, no.4, 1998) by obtaining a smaller upper bound of end-to-end delay in connection-oriented networks under the same source rate condition. It further investigates the tightness of this upper bound and proves that it is tight for multipoint-to-point trees
Keywords :
buffer storage; delays; network topology; packet switching; queueing theory; telecommunication networks; FIFO; buffer-delay bound; connection oriented networks; deterministic end-to-end delay analysis; multipoint-to-point trees; packet flows; queueing delay; source rate condition; upper bound tightness; Communication system traffic control; Delay effects; Delay lines; High-speed networks; Intelligent networks; Interference; Protocols; Stability; Topology; Upper bound;
Conference_Titel :
Communications, 1999. ICC '99. 1999 IEEE International Conference on
Conference_Location :
Vancouver, BC
Print_ISBN :
0-7803-5284-X
DOI :
10.1109/ICC.1999.765509
