- About
-
The Global ETD Search service is a free service for researchers
to find electronic theses and dissertations. This service is
provided by the
Networked Digital Library of Theses and Dissertations.
Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
Search results
Showing 1 to 2 of 2 (0.093 seconds)Spelling suggestions: "subject:"oog collection"" "subject:"oog eollection""
| 1 |
On the Resilience of Network Coding in Peer-to-Peer Networks and its ApplicationsNiu, Di 14 July 2009 (has links)
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.
|
| 2 |
On the Resilience of Network Coding in Peer-to-Peer Networks and its ApplicationsNiu, Di 14 July 2009 (has links)
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.
|
Page generated in 0.0959 seconds