Content Distribution in Overlay Multicast

First, regarding the on-demand challenge, we propose an overlay-based on-demand media distribution solution. Through analytical and experimental analysis, we exhibit the great potential of overlay-based solution at saving server load and network bandwidth consumption compared to the ideal IP-multicast-based solutions. Second, regarding the high throughput challenge, using multi-commodity flow theory, we establish the theoretical foundation for multi-tree overlay multicast. Based on this foundation, we propose a series of algorithms, which can achieve maximum throughput for multiple sessions, while maintaining weighted max-min fairness among them. Finally, combining the techniques developed to individually address the above challenges, we propose an overlay-based dynamic high-bandwidth content distribution solution. We prove the approximation bound of our solution regarding the optimal throughput, and show that this bound is greatly outperformed when experimenting under various node dynamics and network topologies.

Name thesis:degree_name

Ph.D.

Level thesis:degree_level

Dissertation

Discipline thesis:degree_discipline

Computer Science

Grantor

University of Illinois at Urbana-Champaign

Year dc:date

2015

Author dc:creator

• Cui, Yi

Contributors dc:contributor

• Nahrstedt, Klara

• Computer Science

Language dc:language

eng

Identifier

(MiAaPQ)AAI3198962

OAI identifier oai:identifier

oai:www.ideals.illinois.edu:2142/81680