Online multicast routing with bandwidth guarantees: A new approach using multicast network flow

IEEE/ACM Transactions on Networking

Volumn 11, Issue 4, 2003, Pages 676-686

  Kodialam, Murali ^a   Lakshman, T V ^a   Sengupta, Sudipta ^a  

^a LUCENT TECHNOLOGIES   (United States)

Author keywords

MPLS; Multicast; Quality of service (QoS) routing

Indexed keywords

ALGORITHMS; BANDWIDTH; NETWORK PROTOCOLS; QUALITY OF SERVICE; SIGNAL RECEIVERS; TELECOMMUNICATION NETWORKS;

MULTICAST ROUTING;

MULTICASTING;

EID: 0041414292     PISSN: 10636692     EISSN: None     Source Type: Journal    
DOI: 10.1109/TNET.2003.815302     Document Type: Article

References (23)

1. R. K. Ahuja, T. L. Magnanti, and J. B. Orlin, Networks Flows: Theory, Algorithms, and Applications. Englewood Cliffs, NJ: Prentice-Hall, 1993.
2. L. Kleinrock, Queuetng Systems: Theory. New York: Wiley, Jan. 1975, vol. 1.
3. M. J. Alexander and G. Robins, "New performance-driven FPGA' routing algorithms," IEEE Trans. Computer-Aided Design, vol. 15, pp. 1505-1517, Dec. 1996.
4. D. O. Awduche, L. Berger, D. Gan, T. Li, V. Srinivasan, and G. Swallow, "Extensions to RSVP for LSP Tunnels," IETF, RFC 3209, Dec. 2001.
5. D. O. Awduche, J. Malcom, J. Agogbua, M. OD̀ell, and J. McManus, "Requirements for traffic engineering over MPLS," IETF, RFC 2702, Sept. 1999.
6. P. Berman and V. Ramaiyer, "Improved approximation algorithms for the Steiner tree problem," J. Algorithms, vol. 17, pp. 381-408, 1994.
7. M. Bern and P. Plassman, "The Steiner problems with edge lengths 1 and 2," Inform. Processing Lett., vol. 32, pp. 171-176, 1989.
8. E. Rosen, A. Viswanathan, and R. Gallon, "Multiprotocol label switching architecture," IETF, RFC 3031, Jan. 2001.
9. M. Charikar, C. Chekuri, T. Cheung, Z. Dai, A. Goel, S. Guha, and M. Li, "Approximation algorithms for directed Steiner problems," in Proc. 9th ACM/SIAM Symp. Discrete Algorithms, 1998, pp. 192-200.
10. T. Cormen, C. E. Leiserson, and R. L. Rivest, Introduction to Algorithms. Cambridge, MA: MIT Press, 1990.
11. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of N'T-Completeness. New York: Freeman, 1979.
12. G. Apostolopoulos, S. Kamat, D. Williams, R. Guerin, A. Orda, and T. Przygienda, "QoS routing mechanisms and OSPF extensions," IETF, RFC 2676, Aug. 1999.
13. D. Katz, D. Yeung, and K. Kompella, "Traffic engineering extensions to OSPF Version 2," IETF, Internet Draft, draft-katz-yeung-ospf-traffic10.txt, June 2003.
14. K. Kompella et al., "OSPF extensions in support of generalized MPLS," IETF, Internet Draft, draft-ietf-ccamp-ospf-gmpls-extensions-09.txt, Dec. 2002.
15. R. Guerin, D. Williams, and A. Orda, "QoS routing mechanisms and OSPF extensions," in Proc. IEEE Globecom, 1997, pp. 1903-1908.
16. M. Karpinsky and A. Zelikovsky, "New approximation algorithms for the Steiner tree problem," Electronic Colloquium on Computational Complexity (ECCC), Tech. Rep. TR95-030, 1995.
17. M. Kodialam and T. V. Lakshman, "Minimum interference routing with applications to MPLS traffic engineering," in Proc. IEEE INFOCOM, 2000, pp. 376-385.
18. N. O. Duffield, P. Goyal, A. Greenberg, P. Mishra, and K. K. Ramakrishnan, "A flexible model for resource management in virtual private networks," in Proc. ACM SIGCOMM, Sept. 1999, pp. 95-104.
19. D. Ooms, B. Sales, W. Livens, A. Acharya, F. Griffoul, and F. Ansari, "Overview of IP multicast in a Multi-Protocol Label Switching (MPLS) environment," IETF, RFC 3353, Aug. 2002.
20. S. Ramanathan, "Multicast tree generation in networks with asymmetric links," IEEE Trans. Networking, vol. 4, pp. 558-568, Aug. 1996.
21. E. Rosen, A. Viswanathan, and R. Gallon, "Multiprotocol label switching architecture," IETF, RFC 3031, Jan. 2001.
22. B. M. Waxnian, "Performance evaluation of multipoint routing algorithms," in Proc. IEEE INFOCOM, 1993, pp. 980-986.
23. B. Awerbuch, Y. Arar, and Y. Bartal, "On-line generalized Steiner problem," in Proc, 7th Annu. ACM/SIAM Symp. Discrete Algorithms, Jan. 1996, pp. 68-74.