This item is only available for download by members of the University of Illinois community. Students, faculty, and staff at the U of I may log in with your NetID and password to view the item. If you are trying to access an Illinois-restricted dissertation or thesis, you can request a copy through your library's Inter-Library Loan office or purchase a copy directly from ProQuest.
Permalink
https://hdl.handle.net/2142/81680
Description
Title
Content Distribution in Overlay Multicast
Author(s)
Cui, Yi
Issue Date
2005
Doctoral Committee Chair(s)
Nahrstedt, Klara
Department of Study
Computer Science
Discipline
Computer Science
Degree Granting Institution
University of Illinois at Urbana-Champaign
Degree Name
Ph.D.
Degree Level
Dissertation
Keyword(s)
Computer Science
Language
eng
Abstract
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.
Use this login method if you
don't
have an
@illinois.edu
email address.
(Oops, I do have one)
IDEALS migrated to a new platform on June 23, 2022. If you created
your account prior to this date, you will have to reset your password
using the forgot-password link below.
