More Web Proxy on the site http://driver.im/

article

Alternate path routing for multicast

Author:

Daniel ZappalaAuthors Info & Claims

IEEE/ACM Transactions on Networking (TON), Volume 12, Issue 1

Pages 30 - 43

https://doi.org/10.1109/TNET.2003.820255

Published: 01 February 2004 Publication History

Abstract

Current network-layer multicast routing protocols build multicast trees based only on hop count and policy. If a tree cannot meet application requirements, the receivers have no alternative. In this paper, we propose a general and modular architecture that integrates alternate path routing with the network's multicast services. This enables individual multicast receivers to reroute a multicast tree according to their needs, subject to policy restrictions. Our design focuses on the two primary components of this architecture--a loop-free path installation protocol and a scalable, distributed path computation algorithm. Based on a simulation study, we demonstrate that using alternate path routing enables receivers to find acceptable paths nearly as well as a link-state protocol, with much lower overhead. We also show that our approach scales to large networks and that performance improves as a multicast group grows in size.

References

[1]

{1} J. M. McQuillan, I. Richer, and E. C. Rosen, "An overview of the new routing algorithm for the ARPANET," ACM SIGCOMM Comput. Commun. Rev., vol. 25, no. 1, Jan. 1995.

[2]

{2} A. Khanna and J. Zinky, "The revised ARPANET routing metric," ACM SIGCOMM Comput. Commun. Rev., vol. 19, no. 4, Sept. 1989.

[3]

{3} S. Shenker, "Fundamental design issues for the future Internet," IEEE J. Select. Areas Commun., vol. 13, pp. 1176-1188, Sept. 1995.

[4]

{4} S. Savage, A. Collins, E. Hoffman, J. Snell, and T. Anderson, "The end-to-end effects of Internet path selection," in Proc. ACM SIGCOMM, Aug. 1999, pp. 289-299.

[5]

{5} D. Zappala, "Multicast routing support for real-time applications," Ph.D. dissertation, Univ. of Southern California, Los Angeles, 1997.

[6]

{6} D. Zappala, "Alternate path routing for multicast," in Proc. IEEE INFOCOM, vol. 3, Mar. 2000, pp. 1576-1585.

[7]

{7} S. Yan, M. Faloutsos, and A. Banerjea, "QoS-aware multicast routing for the Internet: The design and evaluation of QoSMIC," IEEE/ACM Trans. Networking, vol. 10, pp. 54-66, Feb. 2002.

[8]

{8} S. Chen, K. Nahrstedt, and Y. Shavitt, "A QoS-aware multicast routing protocol," IEEE J. Select. Areas Commun., vol. 18, pp. 2580-2592, Dec. 2000.

[9]

{9} G. H. Ash, A. H. Kafker, and K. R. Krishnan, "Servicing and real-time control of networks with dynamic routing," Bell Syst. Tech. J., vol. 60, no. 8, Oct. 1981.

[10]

{10} B. R. Hurley, C. J. R. Seidl, and W. F. Sewell, "A survey of dynamic routing methods for circuit-switched traffic," IEEE Commun. Mag., vol. 25, pp. 13-21, Sept. 1987.

[11]

{11} J. M. Akinpelu, "The overload performance of engineered networks with nonhierarchical and hierarchical routing," AT&T Bell Labs Tech. J., vol. 63, no. 7, Sept. 1984.

[12]

{12} R. Attar, "A distributed adaptive multi-path routing--Consistent and conflicting decision making," in Proc. 5th Annu. Berkeley Workshop Distributed Data Management and Computer Networks, Feb. 1981, pp. 217-236.

[13]

{13} D. J. Nelson, K. Sayood, and H. Chang, "An extended least-hop distributed routing algorithm," IEEE Trans. Commun., vol. 38, pp. 520-528, Apr. 1990.

[14]

{14} Z. Wang and J. Crowcroft, "Shortest path first with emergency exits," in Proc. ACM SIGCOMM, Sept. 1990, pp. 166-176.

[15]

{15} L. Breslau, "Adaptive source routing of real-time traffic in integrated services networks," Ph.D. dissertation, Univ. of Southern California, Los Angeles, Dec. 1995.

[16]

{16} S. D. Patek, R. Venkateswaran, and J. Liebeherr, "Enhancing aggregate QoS through alternate routing," in Proc. IEEE GLOBECOM, vol. 1, 2000, pp. 611-615.

[17]

{17} H. F. Salama, D. S. Reeves, and Y. Viniotis, "Evaluation of multicast routing algorithms for real-time communication on high-speed networks," IEEE J. Select. Areas Commun., vol. 15, pp. 332-345, Apr. 1997.

[18]

{18} G. Rouskas and I. Baldine, "Multicast routing with end-to-end delay and delay variation constraints," in Proc. IEEE INFOCOM, vol. 1, Mar. 1996, pp. 353-360.

[19]

{19} F. Hao and E. W. Zegura, "On scalable QoS routing: Performance evaluation of topology aggregation," in Proc. IEEE INFOCOM, vol. 1, Mar. 2000, pp. 147-156.

[20]

{20} Q. Sun and H. Langendorfer, "A distributed delay-constrained dynamic multicast routing algorithm," in Proc. Eur. Workshop Interactive Distributed Multimedia Systems and Telecommunication Services, 1997, pp. 97-106.

[21]

{21} M. Faloutsos, A. Banerjea, and R. Pankaj, "QoSMIC: Quality of service multicast Internet protocol," in Proc. ACM SIGCOMM, Aug. 1998, pp. 144-153.

[22]

{22} K. Carlberg and J. Crowcroft, "Building shared trees using a one-to-many joining mechanism," ACM SIGCOMM Comput. Commun. Rev., vol. 27, no. 1, pp. 5-11, Jan. 1997.

[23]

{23} D. Zappala and D. Zhou, "Performance evaluation of path searching heuristics for multicast QoS routing," in IEEE Int. Conf. Computer Communications and Networks (ICCCN), Oct. 2002, pp. 248-254.

[24]

{24} S. Chen, K. Nahrstedt, and Y. Shavitt, "A QoS-aware multicast routing protocol," in Proc. IEEE INFOCOM, vol. 3, Mar. 2000, pp. 1594-1603.

[25]

{25} L. Zhang, S. Deering, D. Estrin, S. Shenker, and D. Zappala, "RSVP: A new resource reservation protocol," IEEE Commun. Mag., vol. 40, pp. 116-127, May 2002.

[26]

{26} S. Deering, D. Estrin, D. Farinacci, V. Jacobson, C.-G. Liu, and L. Wei, "An architecture for wide-area multicast routing," in Proc. ACM SIGCOMM, Aug. 1994, pp. 126-135.

[27]

{27} D. Zappala, "RSVP loop prevention for wildcard reservations,", Internet Draft, Feb. 1996.

[28]

{28} L. Wang, A. Terzis, and L. Zhang, RSVP refresh overhead reduction by state compression, Mar. 2000.

[29]

{29} S. Deering, "Multicast routing in internetworks and extended LANs," in Proc. ACM SIGCOMM, Aug. 1988, pp. 55-64.

[30]

{30} C. Cheng, R. Riley, S. Kumar, and J. Garcia-Luna-Aceves, "A loop-free extended Bellman-Ford routing protocol without bouncing effect," in Proc. ACM SIGCOMM, Sept. 1989, pp. 224-236.

[31]

{31} B. Rajagopalan and M. Faiman, "A new responsive distributed shortest-path routing algorithm," in Proc. ACM SIGCOMM, Sept. 1989, pp. 237-246.

[32]

{32} K. Calvert and E. Zegura. Georgia Tech Internetwork Topology Models. {Online}. Available: http://www.cc.gatech.edu

[33]

{33} I. S. Project. Mbone Map from 23 February 1999. ISI, USC. {Online}. Available: http://www.isi.edu/scan/mbone.html

[34]

{34} S. McCanne, S. Floyd, and K. Fall. LBNL Network Simulator. {Online}. Available: http://ee.lbl.gov/ns

Cited By

Erkan ABarr JClear TIzu Cdel Alamo CMohammed HNadimpalli MSheard JKorhonen A(2018)Developing a Holistic Understanding of Systems and Algorithms through Research PapersProceedings of the 2017 ITiCSE Conference on Working Group Reports10.1145/3174781.3174786(86-104)Online publication date: 30-Jan-2018
https://dl.acm.org/doi/10.1145/3174781.3174786
Wang HMeng XLi SXu H(2010)A tree-based particle swarm optimization for multicast routingComputer Networks: The International Journal of Computer and Telecommunications Networking10.1016/j.comnet.2010.05.00654:15(2775-2786)Online publication date: 1-Oct-2010
https://dl.acm.org/doi/10.1016/j.comnet.2010.05.006
Srinivasan RVaidehi VRanjani NSathya MSubramani D(2007)Multi-path routing scheme for non-interactive multicast communicationsInternational Journal of Network Management10.1002/nem.63617:6(399-413)Online publication date: 1-Nov-2007
https://dl.acm.org/doi/10.1002/nem.636
Show More Cited By

Index Terms

Alternate path routing for multicast

Recommendations

Domain Constrained Multicast: A New Approach for IP Multicast Routing

One of major reasons why IP multicast has not been well deployed is the complexity of IP multicast routing. Since existing IP multicast routing protocols have been designed independently of IP unicast routing protocols, a router must maintain routing ...
Scalable Internet multicast routing
ICCCN '95: Proceedings of the 4th International Conference on Computer Communications and Networks

Abstract: In distributed network applications such as multiparty teleconferencing, users often need to send the same message to several other users. To achieve such one-to-many or many-to-many communication efficiently in wide-area internetworks, it is ...
An efficient multicast routing protocol in wireless mobile networks

Providing multicast service to mobile hosts in wireless mobile networking environments is difficult due to frequent changes of mobile host location and group membership. If a conventional multicast routing protocol is used in wireless mobile networks, ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image IEEE/ACM Transactions on Networking

IEEE/ACM Transactions on Networking Volume 12, Issue 1

February 2004

199 pages

ISSN:1063-6692

Issue’s Table of Contents

Publisher

IEEE Press

Publication History

Published: 01 February 2004

Published in TON Volume 12, Issue 1

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

6
Total Citations
View Citations
990
Total Downloads

Downloads (Last 12 months)1
Downloads (Last 6 weeks)0

Reflects downloads up to 20 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

Erkan ABarr JClear TIzu Cdel Alamo CMohammed HNadimpalli MSheard JKorhonen A(2018)Developing a Holistic Understanding of Systems and Algorithms through Research PapersProceedings of the 2017 ITiCSE Conference on Working Group Reports10.1145/3174781.3174786(86-104)Online publication date: 30-Jan-2018
https://dl.acm.org/doi/10.1145/3174781.3174786
Wang HMeng XLi SXu H(2010)A tree-based particle swarm optimization for multicast routingComputer Networks: The International Journal of Computer and Telecommunications Networking10.1016/j.comnet.2010.05.00654:15(2775-2786)Online publication date: 1-Oct-2010
https://dl.acm.org/doi/10.1016/j.comnet.2010.05.006
Srinivasan RVaidehi VRanjani NSathya MSubramani D(2007)Multi-path routing scheme for non-interactive multicast communicationsInternational Journal of Network Management10.1002/nem.63617:6(399-413)Online publication date: 1-Nov-2007
https://dl.acm.org/doi/10.1002/nem.636
Alba EMolina GChicano F(2006)Optimal placement of antennae using metaheuristicsProceedings of the 6th international conference on Numerical methods and applications10.5555/1764344.1764374(214-222)Online publication date: 20-Aug-2006
https://dl.acm.org/doi/10.5555/1764344.1764374
Wang XCao JCheng HHuang M(2006)QoS multicast routing for multimedia group communications using intelligent computational methodsComputer Communications10.1016/j.comcom.2006.02.01529:12(2217-2229)Online publication date: 1-Aug-2006
https://dl.acm.org/doi/10.1016/j.comcom.2006.02.015
Manoharan RThambidurai PPradhiba S(2004)QoS driven online multicast routing algorithmProceedings of the 7th international conference on Intelligent Information Technology10.1007/978-3-540-30561-3_10(87-96)Online publication date: 20-Dec-2004
https://dl.acm.org/doi/10.1007/978-3-540-30561-3_10

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Article

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Issue’s Table of Contents