Double P-Tree: A Distributed Architecture for Large-Scale Video-on-Demand

Cores Prado, Fernando; Ripoll, A.; Luque, Emilio

doi:https://doi.org/10.1007/3-540-45706-2_115

View/Open

Postprint (214.7Kb)

Issue date

2002

Author

Cores Prado, Fernando

Ripoll, A.

Luque, Emilio

Suggested citation

Cores Prado, Fernando; Ripoll, A.; Luque, Emilio; . (2002) . Double P-Tree: A Distributed Architecture for Large-Scale Video-on-Demand. Lecture Notes in Computer Science, 2002, vol. 2400, p. 816-825. https://doi.org/10.1007/3-540-45706-2_115.

Abstract

In order to ensure a more widespread implementation of video-ondemand (VoD) services, it is essential that the design of cost-effective largescale VoD (LVoD) architectures be able to support hundreds of thousands of concurrent users. The main keys for the designing of such architectures are high streaming

capacity, low costs, scalability, fault tolerance, load balance, low complexity and resource sharing among user requests. To achieve these objectives, we propose a distributed architecture, called double P-Tree, which is based on a tree topology of independent local networks with proxies. The proxy functionality has been modified in such a way that it works at the same time as cache for the most-watched videos, and as a distributed mirror for the remaining videos. In this way, we manage to distribute main server functionality (as a repository of all system videos, server of proxy-misses and system manager) among all local proxies. The evaluation of this new architecture, through an analytical model, shows that double P-Tree architecture is a good approach for the building of scalable and fault-tolerant LVoD systems. Experimental results show that this architecture achieves a good tradeoff between effective bandwidth and storage requirements.

URI

http://hdl.handle.net/10459.1/57233

DOI

https://doi.org/10.1007/3-540-45706-2_115

Is part of

Lecture Notes in Computer Science, 2002, vol. 2400, p. 816-825