A precomputation scheme for Minimum Interference Routing: The Least-Critical-Path-First algorithm

Proceedings - IEEE INFOCOM

Volumn 1, Issue , 2005, Pages 260-268

  Rétvári, Gábor ^a   Bíró, József J ^a   Cinkler, Tibor ^a   Henk, Tamás ^a  

^a BUDAPEST UNIVERSITY OF TECHNOLOGY AND ECONOMICS   (Hungary)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BANDWIDTH; COMMUNICATION CHANNELS (INFORMATION THEORY); COMPUTER SIMULATION; SIGNAL INTERFERENCE; TELECOMMUNICATION LINKS;

BANDWIDTH-GUARANTEED CHANNELS; LEAST-CRITICAL-PATH-FIRST ALGORITHMS; MINIMUM INTERFERENCE ROUTING; TRANSMISSION CAPACITY;

ROUTERS;

EID: 25844450260     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (15)

1. R. Guerin, A. Orda, and D. Williams, "QoS routing mechanisms and OSPF extensions." IETF RFC 2676, 1999.
2. Z. Wang and J. Crowcroft, "Quality of Service routing for supporting multimedia applications," IEEE Journal on Selected Areas in Communications, vol. 14, pp. 1228-1234, 1996.
3. K. Kar, M. Kodialam, and T. Lakshman, "Minimum interference routing of bandwidth guaranteed tunnels with MPLS traffic engineering applications," IEEE Journal on Selected Areas in Communications, vol. 18, December 2000.
4. I. Iliadis and D. Bauer, "A new class of online minimum-interference routing algorithms." in Networking 2002, Proceedings of Second the International IFIP-TC6 Networking Conference, p. 959 ff., May 19-24 2002.
5. K. Kar, M. Kodialam, and T. V. Lakshman, "MPLS traffic engineering using enhanced minimum interference routing: An approach based on lexicographic max-flow." Proceedings of Eighth International Workshop on Quality of Service (IWQoS), Pittsburgh, USA, June 2000.
6. K. Gopalan, T. cker Chiueh, and Y.-J. Lin, "Load balancing routing with bandwidth-delay guarantees," IEEE Communications Magazine, vol. 42, pp. 108-113. June 2004.
7. S. Suri, M. Waldvogel, D. Bauer, and P. R. Warkhede, "Profile-based routing and traffic engineering," Computer Communications, vol. 26, pp. 351-365, 2003.
8. S.-W. Tan, S.-W. Lee, and B. Vaillaint, "Non-greedy minimum interference routing algorithm for bandwidth-guaranteed flows," Computer Communications Journal, vol. 25, pp. 1640-1652, November 2002.
9. A. Orda and A. Sprintson, "QoS routing: the precomputation perspective," in INFOCOM (1), pp. 128-136, 2000.
10. G. Apostolopoulos, R. Guerin, S. Kamat, and S. K. Tripathi, "Quality of service based routing: A performance perspective," in SIGCOMM, pp. 17-28, 1998.
11. H. Alnuweiri, L. Wong, and T. Al-Khasib, "Performance of new link state advertisement mechanisms in routing protocols with traffic engineering extensions," IEEE Communications Magazine, vol. 42, pp. 151-162, May 2004.
12. R. K. A. snd T. L. Magnanti and J. B. Orlin, Network Flows: Theory, Algorithms, and Applications. Prentice-Hall. Englewood Cliffs, NJ, 1993.
13. M. S. Bazaraa, J. J. J., and H. D. Sherali, Linear Programming and Network Flows. John Wiley & Sons, January 1990.
14. A. Medina, A. Lakhina, I. Matta, and J. Byers, "BRITE: Universal topology generation from a user's perspective," Tech. Rep. 2001-003, 1 2001.
15. G. Apostolopoulos, R. Guerin, and S. Kamat, "Implementation and performance measurements of QoS routing extensions to OSPF," in INFOCOM (2), pp. 680-688, 1999.