A distributed algorithm for overlay backbone multicast routing in content delivery networks

Authors:
Jun Guo;Sanjay Jha
Affiliations:
School of Computer Science and Engineering, The University of New South Wales, Sydney, NSW, Australia;School of Computer Science and Engineering, The University of New South Wales, Sydney, NSW, Australia
Venue:
NETWORKING'08 Proceedings of the 7th international IFIP-TC6 networking conference on AdHoc and sensor networks, wireless networks, next generation internet
Year:
2008

Citing 10
Cited 0

Multicast routing in datagram internetworks and extended LANs

ACM Transactions on Computer Systems (TOCS)
A case for end system multicast (keynote address)

Proceedings of the 2000 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Topology-aware overlay networks for group communication

NOSSDAV '02 Proceedings of the 12th international workshop on Network and operating systems support for digital audio and video
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Globally Distributed Content Delivery

IEEE Internet Computing
Scalable application layer multicast

Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
An analysis of live streaming workloads on the internet

Proceedings of the 4th ACM SIGCOMM conference on Internet measurement
How to model an internetwork

INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 2
TOMA: a viable solution for large-scale multicast service support

NETWORKING'05 Proceedings of the 4th IFIP-TC6 international conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communication Systems
Deployment issues for the IP multicast service and architecture

IEEE Network: The Magazine of Global Internetworking

Quantified Score

Hi-index	0.00

Visualization

Abstract

To support large-scale live Internet broadcasting services efficiently in content delivery networks (CDNs), it is essential to exploit peer-to-peer capabilities among end users. This way, the access bandwidth demand on CDN servers in the overlay backbone can be largely reduced. Such a streaming infrastructure gives rise to a challenging overlay backbone multicast routing problem (OBMRP) to optimize multicast routing among CDN servers in the overlay backbone. In this paper, we take a graph theoretic approach and frame OBMRP as a constrained spanning tree problem which is shown to be NP-hard. We present a lightweight distributed algorithm for OBMRP. Simulation experiments confirm that our proposed algorithm converges to good quality solutions and requires small control overhead.