A reservation-based multicast (RBM) routing protocol for mobile networks: initial route construction phase

We propose a combined multicast routing, resource reservation and admission control protocol, termed Reservation-Based Multicast (RBM), that borrows the “Rendezvous Point” or “Core” concept from multicast routing algorithms proposed for the Internet, but which is intended for operation in mobile networks and routes hierarchically-encoded data streams based on user-specified fidelity requirements, real-time delivery thresholds and prevailing network bandwidth constraints. The protocol exhibits the fully distributed operation and receiver-initiated orientation of these proposed algorithms; but, unlike them, the protocol is tightly coupled to a class of underlying, distributed, unicast routing protocols thereby facilitating operation in a dynamic topology. This paper focuses on the initial route construction phase, assumed to occur during a static “snapshot” of the dynamic topology, and is therefore applicable to fixed networks as well, e.g. the Internet.

[1]  D. Estrin,et al.  RSVP: a new resource reservation protocol , 1993, IEEE Communications Magazine.

[2]  Anthony Ephremides,et al.  A distributed routing algorithm for mobile wireless networks , 1995, Wirel. Networks.

[3]  Stephen Gordon Batsell,et al.  A reservation-based multicast (RBM) routing protocol for mobile networks: overview of initial route construction , 1995, Proceedings of INFOCOM'95.

[4]  Nachum Shacham Preemption-based admission control in multimedia multiparty communications , 1995, Proceedings of INFOCOM'95.

[5]  C. Edward Chow,et al.  On multicast path finding algorithms , 1991, IEEE INFCOM '91. The conference on Computer Communications. Tenth Annual Joint Comference of the IEEE Computer and Communications Societies Proceedings.

[6]  Scott Shenker,et al.  Supporting real-time applications in an Integrated Services Packet Network: architecture and mechanism , 1992, SIGCOMM '92.

[7]  David D. Clark,et al.  The design philosophy of the DARPA internet protocols , 1988, SIGCOMM '88.

[8]  V. Jacobson,et al.  Protocol Independent Multicast (PIM): Motivation and Architecture , 1995 .

[9]  Wolfgang Effelsberg,et al.  Dynamic Join and Leave for Real-Time Multicast , 1993 .

[10]  Pawel Winter,et al.  Steiner problem in networks: A survey , 1987, Networks.

[11]  K. Bharath-Kumar,et al.  Routing to Multiple Destinations in Computer Networks , 1983, IEEE Trans. Commun..

[12]  Stephen Deering,et al.  Multicast routing in a datagram internetwork , 1992 .

[13]  Deborah Estrin,et al.  An architectural comparison of ST-II and RSVP , 1994, Proceedings of INFOCOM '94 Conference on Computer Communications.

[14]  Stephen E. Deering,et al.  Multicast routing in datagram internetworks and extended LANs , 1990, TOCS.

[15]  Nachum Shacham,et al.  Multipoint communication by hierarchically encoded data , 1992, [Proceedings] IEEE INFOCOM '92: The Conference on Computer Communications.

[16]  Stephen E. Deering,et al.  Host extensions for IP multicasting , 1986, RFC.

[17]  J. S. Meditch,et al.  An algorithm for optimal multicast of multimedia streams , 1994, Proceedings of INFOCOM '94 Conference on Computer Communications.

[18]  L. Wei,et al.  The trade-offs of multicast trees and algorithms , 1994 .

[19]  Tony Ballardie Core Based Tree (CBT) Multicast - Architectural Overview and Specification , 1995 .

[20]  Shridhar B. Shukla,et al.  Multicast tree construction in network topologies with asymmetric link loads , 1994 .

[21]  George C. Polyzos,et al.  Multicast routing for multimedia communication , 1993, TNET.

[22]  Stephen E. Deering,et al.  Hierarchical distance-vector multicast routing for the MBone , 1995, SIGCOMM '95.

[23]  Claudio Topolcic,et al.  Experimental Internet Stream Protocol: Version 2 (ST-II) , 1990, RFC.

[24]  BERNARD M. WAXMAN,et al.  Routing of multipoint connections , 1988, IEEE J. Sel. Areas Commun..

[25]  Tony Ballardie,et al.  Core based trees , 1993 .

[26]  Luca Delgrossi,et al.  Reservation Protocols for Internetworks: A Comparison of ST-II and RSVP , 1993, NOSSDAV.

[27]  Ian M. Leslie,et al.  How bad is naive multicast routing? , 1993, IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings.

[28]  H. Pollak,et al.  Steiner Minimal Trees , 1968 .

[29]  Raymond E. Miller,et al.  Complexity of Computer Computations , 1972 .

[30]  V. Jacobson,et al.  Congestion avoidance and control , 1988, CCRV.

[31]  Donald F. Towsley,et al.  A comparison of sender-initiated and receiver-initiated reliable multicast protocols , 1994, IEEE J. Sel. Areas Commun..

[32]  Stephen E. Deering,et al.  Distance Vector Multicast Routing Protocol , 1988, RFC.