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.
Full Text
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call