A note on deterministic end-to-end delay analysis in connection oriented networks

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.

[1]  H. M. Ahmed,et al.  IP switching for scalable IP services , 1997 .

[2]  Bruce M. Maggs,et al.  Fast Algorithms for Finding O(Congestion + Dilation) Packet Routing Schedules , 1999, Comb..

[3]  Abhay Parekh,et al.  A generalized processor sharing approach to flow control in integrated services networks: the single-node case , 1993, TNET.

[4]  Bruce M. Maggs,et al.  Packet routing and job-shop scheduling inO(congestion+dilation) steps , 1994, Comb..

[5]  Allan Borodin,et al.  Adversarial queueing theory , 1996, STOC '96.

[6]  S. Jamaloddin Golestani,et al.  Congestion-free communication in high-speed packet networks , 1991, IEEE Trans. Commun..

[7]  Shay Kutten,et al.  Greedy Packet Scheduling , 1990, WDAG.

[8]  Boaz Patt-Shamir,et al.  Greedy Packet Scheduling on Shortest Paths , 1993, J. Algorithms.

[9]  Andrea Fumagalli,et al.  A deterministic approach to the end-to-end analysis of packet flows in connection-oriented networks , 1998, TNET.

[10]  Baruch Awerbuch,et al.  Universal stability results for greedy contention-resolution protocols , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

[11]  Abhay Parekh,et al.  A generalized processor sharing approach to flow control in integrated services networks-the multiple node case , 1993, IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings.

[12]  Bruce M. Maggs,et al.  Universal packet routing algorithms , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[13]  Rafail Ostrovsky,et al.  Universal O(congestion + dilation + log1+εN) local control packet switching algorithms , 1997, STOC '97.

[14]  Rene L. Cruz,et al.  A calculus for network delay, Part I: Network elements in isolation , 1991, IEEE Trans. Inf. Theory.