A Distributed Algorithm for Overlay Backbone Multicast Routing in Content Delivery Networks

Download files
Access & Terms of Use
open access
Abstract
To support large-scale live Internet broadcasting services effciently in content delivery networks (CDNs), it is essential to exploit peer-to-peer capabilities among end users. This way, the access band-width demand on CDN servers in the overlay backbone can be largely reduced. Such a streaming infrastructure gives rise to a challenging over- lay 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.
Persistent link to this record
DOI
Additional Link
Author(s)
Guo, Jun
Jha, Sanjay
Supervisor(s)
Creator(s)
Editor(s)
Translator(s)
Curator(s)
Designer(s)
Arranger(s)
Composer(s)
Recordist(s)
Conference Proceedings Editor(s)
Other Contributor(s)
Corporate/Industry Contributor(s)
Publication Year
2008
Resource Type
Conference Paper
Degree Type
UNSW Faculty
Files
download NETWORKING08.pdf 213.58 KB Adobe Portable Document Format
Related dataset(s)