On Bandwidth-Efficient Overlay Multicast
Authors:
- 8 October 2007
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Parallel and Distributed Systems
- Vol. 18 (11) , 1503-1515
Abstract
In this paper, we propose a new multicast delivery mechanism for bandwidth-demanding applications in IP networks. Our mechanism, referred to as multiple-destination overlay multicast (MOM), combines the advantages of IP multicast and overlay multicast. We formulate the MOM routing problem as an optimization problem. We then design an algorithm based on Lagrangian relaxation on our formulation and propose a distributed protocol based on the algorithm. For network operators, MOM consumes less network bandwidth than both IP multicast and overlay multicast. For users, MOM uses less interface bandwidth than overlay multicast.Keywords
This publication has 27 references indexed in Scilit:
- A case for end system multicastIEEE Journal on Selected Areas in Communications, 2002
- Multicast routing and bandwidth dimensioning in overlay networksIEEE Journal on Selected Areas in Communications, 2002
- Application-layer multicasting with Delaunay triangulation overlaysIEEE Journal on Selected Areas in Communications, 2002
- Scaling of multicast treesACM SIGCOMM Computer Communication Review, 1999
- A quantitative comparison of graph-based models for Internet topologyIEEE/ACM Transactions on Networking, 1997
- The PIM architecture for wide-area multicast routingIEEE/ACM Transactions on Networking, 1996
- Multicast routing extensions for OSPFCommunications of the ACM, 1994
- Core based trees (CBT)ACM SIGCOMM Computer Communication Review, 1993
- Routing of multipoint connectionsIEEE Journal on Selected Areas in Communications, 1988
- Datagram routing for internet multicastingACM SIGCOMM Computer Communication Review, 1984