{"id":{"repo_id":"uiuc","oai_identifier":"oai:www.ideals.illinois.edu:2142/81680"},"canonical_url":"https://search.dev.ndltd.org/etd/uiuc/oai:www.ideals.illinois.edu:2142/81680","repository":{"repo_id":"uiuc","name":"University of Illinois - Urbana-Champaign","base_url":"https://www.ideals.illinois.edu/oai-pmh"},"display":{"title":"Content Distribution in Overlay Multicast","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.","abstract_html":"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.","abstract_has_math":false,"creators":["Cui, Yi"],"institution":"University of Illinois at Urbana-Champaign","degree_name":"Ph.D.","degree_level":"Dissertation","degree_discipline":"Computer Science","degree_department":null,"school":null,"contributors":["Nahrstedt, Klara"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2015,"date_issued":"2015-09-25T20:19:59Z","date_published":"2015-09-25T20:19:59Z","updated_at":"2026-07-22T22:26:16Z","subjects":["Computer Science"],"languages":["eng"],"rights":[],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier","label":"Identifier","values":["(MiAaPQ)AAI3198962"],"render_values":[{"text":"(MiAaPQ)AAI3198962","href":null,"code":true}]}]},"links":{"outbound_url":"http://hdl.handle.net/2142/81680","outbound_label":"Handle","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Nahrstedt, Klara"]},{"key":"dc:creator","label":"Author","values":["Cui, Yi"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2015-09-25T20:19:59Z","10000-01-01","2005"]},{"key":"dc:type","label":"Dc Type","values":["text"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Computer Science"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Dissertation"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Ph.D."]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["University of Illinois at Urbana-Champaign"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Computer Science"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["eng"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["http://hdl.handle.net/2142/81680","(MiAaPQ)AAI3198962"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["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.","Made available in DSpace on 2015-09-25T20:19:59Z (GMT). No. of bitstreams: 2 license.txt: 4848 bytes, checksum: 96035ab3f5e1c23cc7138a224ce498bd (MD5) 3198962.pdf: 3584253 bytes, checksum: 1d666a63ca4e1831acead5de2c4324c3 (MD5) Previous issue date: 2005","Embargo set by: Seth Robbins for item 82961 Lift date: Forever Reason: Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","U of I Only","139 p.","Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2005."]},{"key":"dc:title","label":"Title","values":["Content Distribution in Overlay Multicast"]}]}],"canonical_facts":{"dc:contributor":["Nahrstedt, Klara"],"dc:creator":["Cui, Yi"],"dc:date":["2015-09-25T20:19:59Z","10000-01-01","2005"],"dc:description":["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.","Made available in DSpace on 2015-09-25T20:19:59Z (GMT). No. of bitstreams: 2 license.txt: 4848 bytes, checksum: 96035ab3f5e1c23cc7138a224ce498bd (MD5) 3198962.pdf: 3584253 bytes, checksum: 1d666a63ca4e1831acead5de2c4324c3 (MD5) Previous issue date: 2005","Embargo set by: Seth Robbins for item 82961 Lift date: Forever Reason: Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","U of I Only","139 p.","Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2005."],"dc:identifier":["http://hdl.handle.net/2142/81680","(MiAaPQ)AAI3198962"],"dc:language":["eng"],"dc:subject":["Computer Science"],"dc:title":["Content Distribution in Overlay Multicast"],"dc:type":["text"],"thesis:degree_discipline":["Computer Science"],"thesis:degree_level":["Dissertation"],"thesis:degree_name":["Ph.D."],"thesis:institution_name":["University of Illinois at Urbana-Champaign"]},"updated_at":"2026-07-22T22:26:16Z"}