Skip to main content
Log in

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

  • Published:
Wireless Networks Aims and scope Submit manuscript

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. N. Shacham, Multipoint communication by hierarchically encoded data,Proc. IEEE INFOCOM '92, Florence, Italy, Vol. 3 (1992) pp. 2107–2114.

    Google Scholar 

  2. S. Deering, Host extensions for IP multicasting,RFC1112 (1989).

  3. IEEE standard for information technology - protocols for distributed interactive simulation applications, entity information and interaction,IEEE Standard 1278–1993 (1993).

  4. D. Clark, The design philosophy of the DARPA Internet protocols,ACM SIGCOMM '88 (1988).

  5. R.G.D. Bertsekas,Data Networks (Prentice Hall, 1992).

  6. J. Moy, OSPF version 2,Internet RFC1583 (1994).

  7. D. Waitzman, S. Deering and C. Partridge, Distance vector multicast routing protocol,RFC1075 (1988).

  8. S. Deering, Multicast routing in a datagram internetwork, Ph.D. Thesis, Stanford University (1991).

  9. J. Moy, Multicast extension to OSPF,Internet RFC1584 (1994).

  10. S. Deering, D. Estrin, D. Farinacci, V. Jacobson, C.-g. Liu and L. Wei, Protocol independent multicast (PIM): Motivation and architecture,Internet Draft (1995).

  11. A.J. Ballardie, P.F. Francis and J. Crowcroft, Core based trees,Proc. ACM SIGCOMM '93, San Francisco (1993).

  12. T. Ballardie, Core based tree (CBT) multicast — Architectural overview and specification,Internet Draft [expires January 1995] (1994).

  13. T. Ballardie, Core based tree (CBT) multicast — Architectural overview and specification,Internet Draft [expires June 1995] (1995).

  14. A. Thyagarajan and S. Deering, Hierarchical distance-vector multicast routing for the Mbone, Proc. ACM SIGCOMM '95 (1995).

  15. L. Zhang, S. Deering, D. Estrin, S. Shenker and D. Zappala, RSVP: A new resource ReSerVation Protocol, IEEE Network Mag.(September 1993)8–18.

  16. M.S. Corson and A. Ephremides, A distributed routing algorithm for mobile wireless networks, Wireless Networks 1 (1995) 61–82.

    Article  Google Scholar 

  17. E.N. Gilbert and H.O. Pollak, Steiner minimal trees, SIAM J. Appl. Math. 16(1968) 1–29.

    Article  Google Scholar 

  18. R.E. Miller and J.W. Thatcher, Reducibility among combinatorial problems, in:Complexity of Computer Communications, ed. R.M. Karp (Plenum, New York, 1972) pp. 85–103.

    Google Scholar 

  19. C. Chow, On multicast path finding algorithms,Proc. IEEE INFOCOM '91, Bal Harbour, Florida, Vol. 3 (1991) pp. 1274–1283.

    Google Scholar 

  20. P. Winter, Steiner problem in networks: A survey, Networks 17 (1987) 129–167.

    Google Scholar 

  21. V. Kompella, J. Pasquale and G. Polyzos, Multicast routing for multimedia communications, IEEE/ACM Trans. Networking 1 (1993) 286–292.

    Article  Google Scholar 

  22. L. Kou, G. Markowski and L. Berman, A fast algorithm for Steiner trees, Acta Informatica 15 (1981) 141–145.

    Article  Google Scholar 

  23. K. Barath-Kumar and J.M. Jaffe, Routing to multiple destinations in computer networks, IEEE Trans. Commun. 31 (1983) 343–351.

    Article  Google Scholar 

  24. H. Takahashi and A. Matsuyama, An approximation solution for the Steiner problem in graphs, Math. Japonic 24 (1980) 573–577.

    Google Scholar 

  25. B. Waxman, Routing of multipoint connections, IEEE J. Select. Areas Commun. 6 (1988) 1617–1622.

    Article  Google Scholar 

  26. N. Shachum and J. Meditch, An algorithm for optimal multicast of multimedia streams,Proc. IEEE INFOCOM '94. Toronto, Ontario, Vol. 3 (1994) pp. 856–864.

    Google Scholar 

  27. M. Doar and I. Leslie, How bad is naive multicast routing,Proc. IEEE INFOCOM '93. San Francisco, CA (1993) pp. 82–89.

  28. S. Deering and D. Cheriton, Multicast routing in datagram internetworks and extended LANs, ACM Trans. Comp. Syst. (May 1990) 85–111.

  29. L. Wei and D. Estrin, The trade-offs of multicast trees and algorithms,Int. Conf. Comp. Commun. and Networks (1994).

  30. C. Topolcic, Experimental Internet stream protocol, version 2 (ST-II),Internet RFC 1190 (1990).

  31. L. Delgrossi, R.G. Herrtwich, F.O. Hoffmann and S. Schaller, Receiver-initiated communication with ST-II, Technical Report 43.9314, IBM European Networking Center, Heidelberg (1993).

  32. D. Mitzel, D. Estrin, S. Shenker and L. Zhang, An architectural comparison of ST-II and RSVP,Proc. IEEE INFOCOM '94, Toronto, Ontario, Canada (1994).

  33. L. Delgrossi, R.G. Herrtwich, C. Vogt and L.C. Wolf, Reservation protocols for internetworks: A comparison of ST-II and RSVP,Fourth Int. Workshop on Network and Operating Syst. Support for Digital Audio and Video, Lancaster, UK (1993).

  34. S. Shukla, E. Boyer and J.E. Klinker, Multicast tree construction in network topologies with asymmetric link loads, Naval Post-graduate School TR: NPS-EC-94-012 (1994).

  35. N. Shacham, Preemption-based bandwidth reallocation in multimedia, multiparty communications, preprint (1994).

  36. D. Clark, S. Shenker and L. Zhang, Supporting real-time applications in an integrated services packet network: Architecture and mechanism,Proc. ACM SIGCOMM (1992).

  37. M.S. Corson and S. Batsell, A reservation-based multicast (RBM) routing protocol for mobile networks: Overview of initial route construction,INFOCOM '95, Boston, MA (1995).

  38. M.S. Corson and S. Batsell, A reservation-based multicast (RBM) routing protocol for mobile networks: Specification of initial route construction phase, NRL Memorandum Report, U.S. Naval Research Laboratory (1995).

  39. V. Jacobson, Congestion control and avoidance,Proc. ACM SIGCOMM '88 (1988) pp. 314–329.

Download references

Author information

Authors and Affiliations

Authors

Additional information

This work was sponsored by the U.S. Navy and the American Society for Engineering Education under the U.S. Navy's Summer Faculty Research Program.

Each application must specify a mechanism for ensuring that a processor is always aware of its associated entities. For example, in the current Internet architecture, a group membership protocol [2] serves a similar function of keeping routers informed of the membership their directly attached subnetworks.

A processor can be viewed as either an IP router or an ATM switch.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Corson, M.S., Batsell, S.G. A reservation-based multicast (RBM) routing protocol for mobile networks: initial route construction phase. Wireless Netw 1, 427–450 (1995). https://doi.org/10.1007/BF01985755

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01985755

Keywords

Navigation