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

IEEE International Conference on Communications

Volumn 2, Issue , 1999, Pages 1223-1227

  Zhang, Hongbiao ^a  

^a NOKIA RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONNECTION ORIENTED NETWORKS; END TO END DELAY; PACKET FLOWS; SOURCE RATE; UPPER BOUND;

COMMUNICATION;

EID: 0842288085     PISSN: 15503607     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICC.1999.765509     Document Type: Conference Paper

References (16)

1. I. Chlamtac, A. Farag6, H. Zhang, and A. Fumagalli, "A Deterministic Approach to the End-to-End Analysis of Packet Flows in Connection Oriented Networks". IEEE/ACM Bans. Networking, Vol. 6, No. 4, Aug. 1998.
2. I. Chlamtac, A. Farag6 and H. Zhang, "A New Criterion for Route Selection in Communication Networks with Delay Sensitive Traffic", International Conf. on Computer Communication and Networks (ICCCN'gS), Rockville, Maryland, Oct. 1996, pp. 317-320.
3. A. Borodin, J. Kleinberg, P. Raghavan, M. Sudan and D.P. Williamson, "Adversarial Queueing Theory", 22nd Annual ACM Symp. on Theory of Computing (STOC'96), Philadelphia, Pennsylvania, May
4. M. Andrews, B. Awerbuch, A. Fernandez, J. Kleinberg, T. Leighton and Z. Liu, "Universal Stability Results for Greedy Contention Resolution Protocols", 37th Annual IEEE Symp. on Foundations of Computer Science (FOCS'96), Burlington, Vermont, Oct
5. R.L. Cruz, "A Calculus for Network Delay, Part I: Network Elements in Isolation", IEEE Bans. Information Theory, 37(1991), pp. 114-131. "Part 11: Network Analysis", pp. 132-141.
6. S. J. Golestani, "Congestion-Free Communication in High-speed Packet Networks", IEEE Bans. Communications, 39(1991), pp. 1802-1812.
7. A.K. Parekh and R.G. Gallager, "A Generalized 1996, pp. 376-385. 1996, pp. 380-389.
8. Processor-Sharing Approach to Flow Control in Integrated Services Networks: The Single Node Case", IEEE/ACM Bans. Networking, 1( 1993), pp. 344-357.
9. A.K. Parekh and R.G. Gallager, "A Generalized Processor-Sharing Approach to Flow Control in Integrated Services Networks: The Multiple Node Case", IEEE/ACM Bans. Networking, 2(1994), pp. 137-150.
10. F.T. Leighton, B.M. Maggs and S.B. Rao, "Universal Packet Routing Algorithm", 2gth Annual IEEE Symp. on Foundations of Computer Science (FOCS'88), White Plains, New York, Oct. 1988, pp. 256-269.
11. F.T. Leighton, B.M. Maggs and S.B. Rao, "Packet Routing and Job-Shop Scheduling in O(congestion+dilation) Steps", Combinaton'ca, 14(1994/2), pp. 167-186.
12. F.T. Leighton and B.M. Maggs, "Fast Algorithms for Finding O(congestion+dilation) Packet Routing Schedules", 28th Hawaii International Conference on System Sciences, Jan. 1995, pp. 555-563.
13. I. Cidon, S. Kutten, Y. Mansour and D. Peleg, "Greedy Packet Scheduling", 4th International Workshop on Distributed Algorithms", Bari, Italy, Sep. 1990.
14. Y. Mansour and B. Patt-Shamir, "Greedy Packet Scheduling on Shortest Paths", Journal of Algorithms, 14(1993), pp. 449-465.
15. R. O Trovsky and Y. Rabani, "Universal O(congestion +dilation + log1+' N ) Local Control Packet Switching Algorithms", 23'd Annual ACM Symp. on Theory of Computing (STOC'97), El Paso, Texas, May 1997, pp. 644-653.
16. H. Ahmed, R. Callon, A. Malis and J. Moy, "IP Switching for Scalable IP Services, " Proceedings of the IEEE, Vol. 85, No. 12, Dec. 1997.