Multicast routing algorithms and protocols: A tutorial

IEEE Network

Volumn 14, Issue 1, 2000, Pages 90-102

  Sahasrabuddhe, Laxman H ^a   Mukherjee, Biswanath ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b NONE

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CONGESTION CONTROL (COMMUNICATION); DATA COMMUNICATION SYSTEMS; LOCAL AREA NETWORKS; NETWORK PROTOCOLS; PACKET NETWORKS; TELECOMMUNICATION TRAFFIC; WIDE AREA NETWORKS;

MULTICAST ROUTING;

MULTICASTING;

EID: 0033900912     PISSN: 08908044     EISSN: None     Source Type: Journal    
DOI: 10.1109/65.819175     Document Type: Article

References (46)

1. P. Winter, "Steiner Problem in Networks: A Survey," Networks, vol. 17, Summer 1987, pp. 129-67.
2. C. Diot, W. Dabbous, and J. Crowcroft, "Multipoint Communication: A Survey of Protocols, Functions, and Mechanisms," IEEE JSAC, vol. 15, Apr. 1997, pp. 277-90.
3. G. Carle and E. W. Biersack, "Survey of Error Recovery Techniques for IP-Based Audio-Visual Multicast Applications," IEEE Network, vol. 11, Nov./Dec. 1997, pp. 24-36.
4. K. Obraczka, "Multicast Transport Protocols: A Survey and Taxonomy," IEEE Commun. Mag., vol. 36, Jan. 1998, pp. 94-102.
5. S. Paul, Multicasting on the Internet and Its Applications, Boston, MA: Kluwer, 1998.
6. C. K. Miller, Multicast Networking and Applications, Reading, MA: Addison-Wesley, 1999.
7. R. M. Karp, Complexity of Computer Computations, New York: Plenum, 1972, pp. 85-103.
8. R. E. Bellman, "On a Routing Problem," Qtrly. Applied Math., vol. 16, 1958, pp. 87-90.
9. E. W. Dijkstra, "A Note on Two Problems in Connection with Graphs," Numer. Math., vol. 1, 1959, pp. 269-71.
10. J. B. Kruksal, "On the Shortest Spanning Subtree of A Graph and the Traveling Salesman Problem," Proc. Amer. Math. Soc., vol. 7, 1956, pp. 48-50.
11. R. C. Prim, "Shortest Connection Networks and Some Generalizations," Bell Sys. Tech. J., vol. 36, 1957, pp. 1389-1401.
12. A. Z. Zelikovsky, "An 11/6-Approximation Algorithm for the Network Steiner Problem," Algorithmica, vol. 9, May 1993, pp. 463-70.
13. L. Kou, G. Markowsky, and L. Berman, "A Fast Algorithm for Steiner Trees," Acta Informatica, vol. 15, no. 2, 1981, pp. 141-45.
14. J. Plesnik, "A Bound for the Steiner Tree Problem in Graphs," Mathematica Slovaca, vol. 31, no. 2, 1981, pp. 155-63.
15. V. J. Rayward-Smith and A. Clare, "On Finding Steiner Vertices," Networks, vol. 16, Fall 1986, pp. 283-94.
16. H. Takahashi and A. Matsuyama, "An Approximate Solution for the Steiner Problem in Graphs," Mathematica Japonica, vol. 24, no. 6, 1980, pp. 573-77.
17. S. Ramanathan, "Multicast Tree Generation in Networks with Asymmetric Links," IEEE/ACM Trans. Net., vol. 4, Aug. 1996, pp. 558-68.
18. D. S. Johnson, J. K. Lenstra, and A. H. G. R. Kan, "The Complexity of the Network Design Problem," Networks, vol. 8, Winter 1978, pp. 279-85.
19. D. W. Wall, "Mechanisms for Broadcast and Selective Broadcast," Ph.D. thesis, Stanford Univ., June 1980.
20. K. Bharath-Kumar and J. M. Jaffe, "Routing to Multiple Destinations in Computer Networks," IEEE Trans. Commun., vol. COM-31, Mar. 1983, pp. 343-51.
21. L. Wei and D. Estrin, "The Trade-Offs of Multicast Trees and Algorithms," Proc. Int'l. Conf. Comp. Commun. Networks, Sept. 1994.
22. T. Ballardie, P. Francis, and J. Crowcroft, "Core Based Trees (CBT): An Architecture for Scalable Inter-Domain Multicast Routing," Comp. Commun. Rev., vol. 23, Oct. 1993, pp. 85-95.
23. T. Ballardie, "Core Based Trees (CBT version 2) Multicast Routing," RFC 2189, Sept. 1997.
24. B. M. Waxman, "Routing of Multipoint Connections," IEEE JSAC, vol. 6, Dec. 1988, pp. 1617-22.
25. V. P. Kompella, J. C. Pasquale, and G. C. Polyzos, "Multicast Routing for Multimedia Communication," IEEE/ACM Trans. Net., vol. 1, June 1993, pp. 286-92.
26. G. N. Rouskas and I. Baldine, "Multicast Routing with End-To-End Delay and Delay Variation Constraints," IEEE JSAC, vol. 15, Apr. 1997, pp. 346-56.
27. F. Bauer and A. Varma, "Degree-Constrained Multicasting in Point-To-Point Networks," Proc. IEEE INFOCOM '95, vol. 4, Apr. 1995, pp. 369-76.
28. S. Voss, "Problems with Generalized Steiner Problems," Algorithmica, vol. 7, no. 2, 1992-1993, pp. 333-35.
29. H. Eriksson, "MBone: the Multicast Backbone," Commun. ACM, vol. 37, Aug. 1994, pp. 54-60.
30. S. E. Deering, "Host extensions for IP multicasting," RFC 1112, Aug. 1989.
31. D. Waitzman and C. Partridge, "Distance Vector Multicast Routing Protocol," RFC 1075, Nov. 1988.
32. J. Moy, "Multicast Routing Extensions for OSPF," Commun. ACM, vol. 37, Aug. 1994, pp. 61-66.
33. J. Moy, "OSPF Version 2," RFC 2328, Apr. 1998.
34. S. Deering et al., "The PIM Architecture for Wide-Area Multicast Routing," IEEE/ACM Trans. Net., vol. 4, Apr. 1996, pp. 153-62.
35. D. Estrin et al., "Protocol Independent Multicast-Sparse Mode (PIM-SM): Protocol specification," RFC 2362, June 1998.
36. D. Thaler, D. Estrin, and D. Meyer, "Border Gateway Multicast Protocol (BGMP): Protocol Specification," Internet draft, Aug. 1998.
37. H. Holbrook and D. Cheriton, "IP Multicast Channels: EXPRESS Support for Large-Scale Single-Source Applications," Proc., ACM SIGCOMM '99, Sept. 1999.
38. R. Perlman et al., "Simple Multicast: A Design for Simple, Low-Overhead Multicast," Internet draft, Feb. 1999.
39. S. E. Deering and D. R. Cheriton, "Multicast Routing in Datagram Internetworks and Extended LANs," ACM Trans. Comp. Sys., vol. 8, May 1983, pp. 85-110.
40. Y. K. Dalal and R. M. Metcalfe, "Reverse Path Forwarding of Broadcast Packets," Commun. ACM, vol. 21, pp. 1040-48, Dec. 1978.
41. D. Meyer, "Administratively Scoped IP Multicast," RFC 2365, July 1998.
42. D. Thaler, M. Handley, and D. Estrin, "The Internet Multicast Address Allocation Architecture," Internet draft, Oct. 1999.
43. C. Hedrick, "Routing Information Protocol," RFC 1058, June 1988.
44. S. Deering et al., "Protocol Independent Multicast-Dense Mode (PIM-DM): Protocol Specification," Internet draft, June 1999.
45. D. Estrin et al., "Protocol Independent Multicast-Sparse Mode (PIM-SM): Protocol Specification," Internet draft, Oct. 1999.
46. D. Estrin et al., "The Multicast Address-Set Claim (MASC) Protocol," Internet draft, Aug. 1999.