Improving Bandwidth Efficiency in Distributed Video-on-Demand Architectures

Abstract

Distributed Video-on-Demand (DVoD) systems are proposed as a solution to the limited streaming capacity and null scalability of centralized systems. In a previous work, we proposed a fully distributed large-scale VoD architecture, called Double P-Tree, which has shown itself to be a good approach to the design of flexible and scalable DVoD systems. In this paper, we present relevant design aspects related to video mapping and traffic balancing in order to improve Double P-Tree architecture performance. Our simulation results demonstrate that these techniques yield a more efficient system and considerably increase its streaming capacity. The results also show the crucial importance of topology connectivity in improving multicasting performance in DVoD systems. Finally, a comparison among several DVoD architectures was performed using simulation, and the results show that the Double P-Tree architecture incorporating mapping and load balancing policies outperforms similar DVoD architectures.

Distributed P2P Merging Policy to Decentralize the Multicasting Delivery

“…Patching, Chaining and DDCM delivery policies are incorporated in the simulator that is used in [3]. We assume that the inter-arrival time of the clients' request follows a Poisson arrival process with a mean of 1 λ , where λ is the request rate.…”