Hop-by-hop routing algorithms for premium traffic

Computer Communication Review

Volumn 32, Issue 5, 2002, Pages 73-88

  Wang, Jun ^a   Nahrstedt, Klara ^a  

^a University of Illinois at Urbana Champaign   (United States)

Author keywords

Differentiated Service; Hop by hop Routing; Premium Class; Saturate Bandwidth

Indexed keywords

DIFFERENTIATED SERVICE; HOP-BY-HOP ROUTING; PREMIUM CLASS; SATURATE BANDWIDTH;

ALGORITHMS; BANDWIDTH; HEURISTIC METHODS; TELECOMMUNICATION NETWORKS; TELECOMMUNICATION TRAFFIC;

ROUTERS;

EID: 18244397250     PISSN: 01464833     EISSN: 01464833     Source Type: Conference Proceeding    
DOI: 10.1145/774749.774760     Document Type: Article

References (28)

1. G. Apostolopoulos, D. Williams, S. Kamat, R. Guerin, A. Orda, and T. Przygienda. QoS Routing Mechanisms and OSPF Extensions. RFC 2676, Aug. 1999.
2. D. Bertsekas and R. Gallager. Data Networks. Prentice Hall, 1990.
3. S. Chen and K. Nahrstedt. An Overview of Quality-of-Service Routing for the Next Generation High-Speed Networks: Problems and Solutions. IEEE Network, Special Issue on Transmission and Distribution of Digital Video, Nov./Dec. 1998.
4. S. Chen and K. Nahrstedt. Distributed QoS Routing with Imprecise State Information. In Proceedings of 7th IEEE International Conference on Computer, Communications and Networks (ICCCN'98), pages 614-621, Lafayette, LA, October 1998.
5. T. Cormen, C. Leiserson, and R. Rivest. Introduction to Algorithms. The MIT Press, Cambridge, Massachusetts, 1990.
6. S. et. al. An Architecture for Differentiated Services. RFC 2475, December 1998.
7. M. Garey and D. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, San Francisco, CA, 1979.
8. J. Jaffe. Bottleneck flow control. IEEE Transactions on Communication, 29:954-962, 1981.
9. J. Kleinberg. Single-source Unsplittable Flow. In Proceedings of the 37th Annual Symposium on Foundations of Computer Science, pages 68-77, October 1996.
10. J. Kleinberg, Y. Rabani, and E. Tardos. Fairness in routing and load balancing. In 40th Annual Symposium on Foundations of Computer Science, pages 568-578, 1999.
11. K.Nichols, V.Jacobson, and L.Zhang. A Two-bit Differentiated Services Architecture for the Internet. RFC 2638, July 1999.
12. M. Kodialam and T. Lakshman. Minimum Interference Routing with Applications to MPLS Traffic Engineering. In Proceedings of IEEE Infocom 2000, March 2000.
13. S. Kolliopoulos and C. Stein. Improved Approximation Algorithms for Unsplittable Flow Problems. In Proceedings of the 38th Annual Symposium on Foundations of Computer Science, 1997.
14. J. Lenstra, D. Shmoys, and E. Tardos. Approximation algorithms for scheduling unrelated parallel machines. In 28th IEEE FOCS, 1987.
15. Q. Ma and P. Steenkiste. On path selection for traffic with bandwidth guarantees. In 5th IEEE International Conference on Network Protocols, Atlanta, GA, pages 191-202, October 1997.
16. Q. Ma and P. Steenkiste. Supporting Dynamic Inter-Class Resource Sharing: A Multi-class QoS Routing Algorithm. In IEEE Proceedings of INFOCOM '99, pages 649-660, 1999.
17. Q. Ma, P. Steenkiste, and H. Zhang. Routing high-bandwidth traffic in max-min fair share networks. In Proceedings of ACM SIGCOMM'96, pages 206-217, Palo Alto, CA, Oct 1996.
18. I. Matta and A. U. Shankar. Type-of-Service Routing in Datagram Delivery Systems. IEEE Journal of Selected Areas in Communications, 13(8), October 1995.
19. A. Medina, A. Lakhina, I. Matta, and J. Byers. BRITE: An Approach to Universal Topology Generation. In Proceedings of the International Workshop on Modeling, Analysis and Simulation of Computer and Telecommunications Systems-MASCOTS '01, Cincinnati, Ohio, August 2001.
20. P. V. Mieghem, H. D. Neve, and F. Kuipers. Hop-by-hop Quality of Service Routing. Computer Networks, 37(3-4):407-423, 2001.
21. M.May, J.C.Bolot, C.Diot, and A.Jean-Marie. Simple Performance Models of Differentiated Services Schemes for the Internet. In Proceedings of IEEE Infocom 1999, March 1999.
22. A. Orda. Routing with end-to-end QoS guarantees in broadband networks. IEEE/ACM Transactions on Networking, 7(3), June 1999.
23. A. Orda and A. Sprintson. QoS Routing: the Precomputation Perspective. In Proceedings of IEEE Infocom 2000, March 2000.
24. A. Shaikh, J. Rexford, and K. Shin. Load-Sensitive Routing of Long-Lived IP Flows. In Proceedings of ACM SIGCOMM'99, 1999.
25. J. Sobrinho. Algebra and algorithms for QoS path computation and hop-by-hop routing in the Internet. In IEEE INFOCOM 2001, Anchorage, Alaska, pages 727-735, April 2001.
26. J. Wang and K. Nahrstedt. Hop-by-Hop Routing Algorithms For Premium-class Traffic In DiffServ Networks. In Proceedings of IEEE Infocom 2002, June 2002.
27. J. Wang, Y. Wang, and K. Nahrstedt. Quantitative Study of Differentiated Service Model Using UltraSAN. Tech. Report UIUCDCS-R-2001-2237, Department of Computer Science, University of Illinois at Urbana-Champaign, July 2001.
28. L. Xiao, J. Wang, and K. Nahrstedt. The Enhanced Ticket-based Routing Algorithm. In Proceedings of IEEE ICC 2002, New York, NY USA, April 28-May 2 2002.