Show simple item record

Providing efficient and reliable end -host multicast services on the Internet.

dc.contributor.authorWang, Wenjie
dc.contributor.advisorJamin, Sugih
dc.date.accessioned2016-08-30T16:04:56Z
dc.date.available2016-08-30T16:04:56Z
dc.date.issued2006
dc.identifier.urihttp://gateway.proquest.com/openurl?url_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:dissertation&res_dat=xri:pqm&rft_dat=xri:pqdiss:3224781
dc.identifier.urihttps://hdl.handle.net/2027.42/125921
dc.description.abstractThe fast emergence of P2P services, such as file sharing, Internet phone service, and video streaming demonstrates the potential of P2P network to deliver large files and high quality streams to a large audience. The successful commercialization of P2P audio services such as Skype illustrates the business potential of P2P services. End-host multicast is a natural protocol for P2P applications that deliver data in a one-to-many fashion. In this thesis, we present a comprehensive solution for providing efficient and reliable end-host multicast services on the Internet. Existing approaches have several drawbacks in their protocol design. First, existing approaches lack a systematic study of overlay construction. Second, existing published protocols focus on the overlay design itself without taking into account the heterogeneity of Internet hosts and network conditions. Finally, current efforts only focus on data dissemination from a single source. Supporting multi-source applications with current solutions may lead to sub-optimal performance. To address these drawbacks, we first conduct a systematic study on the effect of adding new links to an overlay and present an effective heuristic to reduce latencies between multicast group members. We then conduct empirical experiments on the Internet to collect statistics on user profiles of existing P2P systems. We discover that the prevalence of guarded hosts---hosts behind firewalls and NAT gateways---interferes with overlay construction, since guarded peers cannot accept incoming connections from other peers. Taking into account the existence of guarded hosts, we enhance our overlay improvement heuristic and develop the <italic>e</italic>* protocol to accommodate a large number of guarded hosts while achieving low average end-to-end latencies. Under realistic scenarios involving guarded hosts, <italic> e</italic>* can reduce average end-to-end latency on the overlay by 28-61% compared to existing protocols. We also improve the resiliency of overlays to membership churn, node failures, and targeted attacks. Finally, we implement our protocol and develop a video/audio multicast system that has been used to stream several workshops and conferences live online. Our experience with the deployment of our multicast tool confirms that our protocol can provide efficient and reliable overlay services on the Internet.
dc.format.extent151 p.
dc.languageEnglish
dc.language.isoEN
dc.subjectEfficient
dc.subjectEnd-host Multicast
dc.subjectInternet
dc.subjectPeer-to-peer
dc.subjectProviding
dc.subjectReliable
dc.subjectServices
dc.titleProviding efficient and reliable end -host multicast services on the Internet.
dc.typeThesis
dc.description.thesisdegreenamePhDen_US
dc.description.thesisdegreedisciplineApplied Sciences
dc.description.thesisdegreedisciplineComputer science
dc.description.thesisdegreegrantorUniversity of Michigan, Horace H. Rackham School of Graduate Studies
dc.description.bitstreamurlhttp://deepblue.lib.umich.edu/bitstream/2027.42/125921/2/3224781.pdf
dc.owningcollnameDissertations and Theses (Ph.D. and Master's)


Files in this item

Show simple item record

Remediation of Harmful Language

The University of Michigan Library aims to describe library materials in a way that respects the people and communities who create, use, and are represented in our collections. Report harmful or offensive language in catalog records, finding aids, or elsewhere in our collections anonymously through our metadata feedback form. More information at Remediation of Harmful Language.

Accessibility

If you are unable to use this file in its current format, please select the Contact Us link and we can modify it to make it more accessible to you.