Using peer-to-peer overlay network to provide video-on-demand service has been a promising solution due to its potential high scalability and low deployment cost. However, it remains a great challenge to construct an efficient overlay network for peer-to-peer video-on-demand systems owing to their inherent dynamicity caused by frequent VCR operations or joining/leaving operations. In this paper, we propose a ring based overlay network to handle this problem, called RINDY, in which each peer maintains a gossip-ring to explore appropriate data suppliers and several skip-rings with power law radius to assist the quick relocation of VCR operations. Our simulation results show that RINDY achieves better load balance in the control overhead than tree based overlay. As compared with the traditional client/server model, it saves more server bandwidth and achieves lower start-up latency when lots of users watch a same video simultaneously. © Springer-Verlag Berlin Heidelberg 2006.
CITATION STYLE
Cheng, B., Jin, H., & Liao, X. (2006). RINDY: A ring based overlay network for peer-to-peer on-demand streaming. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4159 LNCS, pp. 1048–1058). Springer Verlag. https://doi.org/10.1007/11833529_106
Mendeley helps you to discover research relevant for your work.