Peer-to-Peer Streaming Over Dynamic Random Hamilton Cycles

The authors are motivated by the problem of designing a simple distributed algorithm for peer-to-peer streaming applications that can achieve high throughput and low delay, while allowing the neighbor set maintained by each peer to be small. While previous works have mostly used tree structures, their algorithm constructs multiple random directed Hamilton cycles and disseminates content over the superposed graph of the cycles. Compared with the algorithms constructing trees, the complexity to dynamically update the network topology in response to peer churn does not increase with the network size under their algorithm.

Provided by: University of Idaho Topic: Collaboration Date Added: Feb 2012 Format: PDF

Find By Topic