Stephen Deering
Deborah L. Estrin
- 1 A. J. Ballardie, P. F. Francis, and J. Crowcroft. "(7ore based trees," ill Prec. ACM SI(;('OMM. San Francisco, 1993.]]Google Scholar
- 2 M. W. Bern and R. I.. Graham. "The shonesl-network problem." Scient{fic American. pp 84 89. Jan. 1989.]]Google Scholar
- 3 C. Topolcic (Ed}, L~tperimenttd Interncl Stream I~roltn'td.~ Version 2 (st-ill, RFC119(1. Oct. 1990.]] Google Scholar
- 4 B. Cain, A. Tbyagarajan. and S. Dcering, hlli'lTlt'l (;rotlp Management Prol~wol. Version 3. Working draft, Jul~r 1995]]Google Scholar
- 5 S. Casner, "Second ietf interact audit~ast." in Internel Societx News. vol. 1. no, 3, p. 23, 1992.]]Google Scholar
- 6 D. D. Clark, "The design philosophy of the darpa internel protocols." in Prec. ACM SI(;COMM, 1988.]] Google Scholar
- 7 Y. K. Dalai and R. M. Metcalfc, "Reverse path forwarding of broadeas! packets," ('onlmun. ACM. vol. 21. no. 12, pp. lfMt)- IO48, 1978]] Google Scholar
- 8 S. Deering, Hosl Etten.~ions 15,' It' Multica,~litLg, RFCI I 12. Aug. 1989.]]Google Scholar
- 9 --. "Multicast Routing in a Datagnmt lmernetu, ork,' Ph.D 7hcsi~. Stanford Universit), 1991]] Google Scholar
- 10 S. Deering and D. Cheriton. "Multicast routing in a datagram internelworks and extended lans,' in ACM D'w~s Ct.nl~ul. 5'v~t.. pp 85 I I 1. May 1990.]] Google Scholar
- 11 S. Deering, D Estrin. D, Farinacci, and V, Jacobsen. Protocol Inde penden! Multicast fPIML Dense M,de Protocol: Specification, Internet Draft. Mar. 1994.]]Google Scholar
- 12 S. Deering. D, Estrin, D. Farinacci. V, Jacobsen, C. Liu, and L. Wei. Protocol Independent Mtdtit'a,~t (PIM): Motivation and Architecture. Working Draft, Nov. 1994.]]Google Scholar
- 13 --, Protocol Ind~7~emk'nt Multica~t tPIML' Spec{lication. Working Draft, No',. 1994.]]Google Scholar
- 14 __, Protocol Independent Multicaxl ( PIM}. .S'par~e Mode Protocol.' .Specificution, Working Draft, Sept. 1995.]]Google Scholar
- 15 M. Dear and 1. Leslie, "Hey, bad is naive muhicast routing." in Pn,c, IEEE INI"OCOM'93, 1993.]]Google Scholar
- 16 D. Estrin. T, Li, Y. Rekhler. and D Zappala, .~ourcc Demand Routing Protocol: Packet Formul wM Forwardm,~, Spe~ t/h'ntitm." IETF Working Draft. Mar. 1995.]]Google Scholar
- 17 S. Floyd, V. Jacobsen, C. Liu. S McCanne. and 1,. Zhang. "A reliable multicast framework for light-weight sessions and application lexel framing." in Prec. A('M SIG('OMM, 1995.]] Google Scholar
- 18 R. Frederick, "Left audio & videocasl." }rllerllt'l ,~Jot'Jt'lY ,,~e~4";. ~t:,J. 1. no. 4. p. 19. 1993.]]Google Scholar
- 19 E. N. Gilbert and It. O. Pollak. -Steiner minimal tree,,." SIAM.I. Applied Mathematics. '~ol. 16. no I. pp. I 29. Jan. 1908.]]Google Scholar
- 20 S. Hares and J. Scudder, hlrp/hr IlL Working Dralt. Sept. 1993.]]Google Scholar
- 21 R. M. Karp, Redm'ihilitv nmon,lff ('omhinatorial I'r, hlem Ne',,, York: Plennum, 1972.]]Google Scholar
- 22 L Kou. (; Markowsk,,. and l,. Berman. "A fast algorithm for qeiner trees," /h-ta h!/;,'maticu, vol, 15, pp. 141 145. 1981.]]Google Scholar
- 23 G. Malkin. RIP ICt:~'itm 2 Cart3'i,,t, Addilianal h!/ormatitm. RFCI388. June 1993.]]Google Scholar
- 24 J. Moy, OSI'F ~, rxitm 2. RFCI247. Oct. 1991.]]Google Scholar
- 25 --, MOSPF: Analy~i.~ trod Kv~erieme, Mar. 1994. RFCI585]]Google Scholar
- 26 --. Multicaxt Krlenwon to OSI'{.'. RFCI584. Mar. 1994.]]Google Scholar
- 27 V. J. Ra?.ard Smith and A ('lare. On I"indi,g Steiner ~}'rtu'c~, Net works, vol. 16, pp. 284 294, 1986.]]Google Scholar
- 28 Y. Rekhter and T. Li (Eds.), A Bt*rder (;atewav Prototol 4 IB(iP-4). RFCI771. Mar. 1995.]] Google Scholar
- 29 D. Waitzman, S. Deering. and C Parlridgc. {)J~ltliltt' ~~'tlor M#IIi~'o~I Routing Proto('ol, RFC 1075, No'.. 1988.]]Google Scholar
- 30 D. Wall. "Mechanisms fi*r hroadcast and selective broadcasC' Ph.D. thesis, Stanford Uni',ersity, Stanfi~rd, CA. Tech. Rep.. no, 190. June 198O.]] Google Scholar
- 31 B. M. Waxman, "Routing t)f muhipont conn~clion,,," ht, EE .L Select. Area~ ('t~mmttrL, sol 6, no. 9. Dec. 1988.]]Google Scholar
- 32 L. Wei and D. Estrin, "A comparis.n of multicasl tree,, and algorithms," Computer Science I)epartment, University of Southern California, Tech. Rep. {;SC-CS-9Y560. SepL 1993.]]Google Scholar
- 33 "The Irade-offs of muhicast trees and algorithms.- in Prt,~. 1994 hit. C(,~?l: ('ot~lptlt. ('oltlmltll. NelworJ~. San Francisco, ('A, Sepl. 1994.]]Google Scholar
- 34 L. Wei, F. Liaw, D. Estrin, A. Rowmano, and T. Lyon, "Analysis of a resequencer model for multicast over ATM networks," in 3rd Int. Workshop Network Operating Syst. Support Digital Audio Video, San Diego, CA, Nov. 1992.]] Google Scholar
- 35 P. Winter, "Steiner problem in networks: a survey," in Nem,orks, vol. 17, no. 2, pp. 129-167, 1987.]] Google Scholar
- 36 L. Zhang, R. Braden, D. Estdn, S. Herzog, and S. Jamim Resouwe Reservation Protocol (RSVP), Version l, Functional Specification, IETF Working Draft, July 1995.]] Google Scholar
Index Terms
- The PIM architecture for wide-area multicast routing
Recommendations
An architecture for wide-area multicast routing
Existing multicast routing mechanisms were intended for use within regions where a group is widely represented or bandwidth is universally plentiful. When group members, and senders to those group members, are distributed sparsely across a wide area, ...
An architecture for wide-area multicast routing
SIGCOMM '94: Proceedings of the conference on Communications architectures, protocols and applicationsExisting multicast routing mechanisms were intended for use within regions where a group is widely represented or bandwidth is universally plentiful. When group members, and senders to those group members, are distributed sparsely across a wide area, ...
Reviews
Nikunja K. Swain
Traditional multicast routing is protocol-dependent. It is best suited for local area networks and less suited for sparsely distributed groups. This paper proposes a protocol independent multicast (PIM) architecture that compliments the existing multicast routing algorithms and efficiently establishes distribution trees for sparsely distributed groups. The paper starts with a brief description of existing multicast routing algorithms and points out their limitations. The authors provide appropriate illustrations to clarify their discussion. They then discuss a more recent protocol, core-based tree (CBT). CBT addresses the broadcasting problems (sparsely distributed groups) encountered in earlier protocols, but introduces a traffic concentration problem, because CBT imposes a single shared tree for each multicast group. The authors then discuss the two main objectives of the PIM protocol: to avoid the broadcasting and traffic concentration problems encountered in multicast and CBT, respectively, and to support sparsely distributed groups efficiently and effectively. Some of the other advantages of PIM over CBT are simplicity, versatility, and an interface check of incoming data to avoid data looping. The authors outline the requirements of the PIM protocol—efficient sparse group support, routing protocol independence, robustness, and interoperability—and discuss how to fulfill these requirements. Then they point out several open issues (information aggregation, interaction with RSVP, and policy-based and TOS routing). Effective resolution of these issues requires more research and development. The paper is well written. The authors must be commended for producing a much-needed concept in a timely manner.
Access critical reviews of Computing literature here
Become a reviewer for Computing Reviews.
Comments