MONSTER: A media-on-demand servicing system based on P2P networks

0Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

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.

Cite

CITATION STYLE

APA

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

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free