This paper presents MONSTER, a MoD servicing system based on P2P networks. In MONSTER, the media server divides each clip into several segments; the peer hosts caching same segment consist of a cluster, and several clusters work together to transmit a whole clip to other peers. Sharing the peer hosts' resource makes the media server not the bottleneck of MoD servicing system, and system can accommodate more users concurrently. This paper introduces the model of MONSTER, and presents the clip caching strategy and cluster scheduling algorithm. The simulation results show that, with enough peer hosts and the caching time, the capacity of MONSTER is much better than the conventional MoD systems. © Springer-Verlag 2004.
CITATION STYLE
Chen, Y., & Dai, Q. (2004). MONSTER: A media-on-demand servicing system based on P2P networks. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3251, 634–641. https://doi.org/10.1007/978-3-540-30208-7_85
Mendeley helps you to discover research relevant for your work.