Peer-to-peer streaming over dynamic random Hamilton cycles

@article{Kim2012PeertopeerSO,
  title={Peer-to-peer streaming over dynamic random Hamilton cycles},
  author={Joohwan Kim and R. Srikant},
  journal={2012 Information Theory and Applications Workshop},
  year={2012},
  pages={415-419}
}
We 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, our 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… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

References

Publications referenced by this paper.
Showing 1-10 of 17 references

Peer-to-Peer Streaming Over Random Directed Hamilton Cycles

——
Technical Report, 2012, http://www.ifp.illinois.edu/∼joohwan/ Kim12tech.pdf . • 2012
View 3 Excerpts
Highly Influenced

P2P Streaming Over Dynamic Random M - Regular Graphs

J. Kim, R. Srikant
Technical Report, 2011, http://www.ifp.illinois.edu/ ∼joohwan/Kim11tech2.pdf . • 2011
View 1 Excerpt

P2P Streaming Capacity under Node Degree Bound

2010 IEEE 30th International Conference on Distributed Computing Systems • 2010
View 1 Excerpt

Gossiping With Multiple Messages

IEEE Transactions on Information Theory • 2007

Stochastic Fluid Theory for P2P Streaming Systems

IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications • 2007
View 1 Excerpt

CoolStreaming/DONet: a data-driven overlay network for peer-to-peer live media streaming

Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies. • 2005
View 1 Excerpt

Similar Papers

Loading similar papers…