Most current-generation P2P content distribution protocols use fine-granularity blocks to distribute content in a decentralized fashion. Such systems often suffer from a significant variation in block distributions, such that certain blocks become rare or even unavailable, adversely affecting content availability and download efficiency. This phenomenon is further aggravated by peer dynamics which is inherent in P2P networks.
In this thesis, we quantitatively analyze how network coding may improve block availability and introduce resilience to peer dynamics.
Since in reality, network coding can only be performed within segments, each containing a subset of blocks, we explore the fundamental tradeoff
between the resilience gain of network coding and its inherent coding complexity, as the number of blocks in a segment varies.
As another application of the resilience of network coding, we also devise an indirect data collection scheme based on network coding for the purpose of large-scale network measurements.
| Identifer | oai:union.ndltd.org:TORONTO/oai:tspace.library.utoronto.ca:1807/17440 |
| Date | 14 July 2009 |
| Creators | Niu, Di |
| Contributors | Li, Baochun |
| Source Sets | University of Toronto |
| Language | en_ca |
| Detected Language | English |
| Type | Thesis |
Page generated in 0.0018 seconds