Storage optimization for a peer-to-peer video-on-demand network

Dyaberi, Jagadeesh M.; Kannan, Karthik; Pai, Vijay S.

doi:10.1145/1730836.1730844

Cited by 9 publications

(5 citation statements)

References 34 publications

(33 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Figure 7 shows the greater improvement of having tracker to manifest the VCR-based requests to locate and retrieve effectively in the proposed system. Further, for explanations by looking at this case from a slightly different perspective, we have the users/clients requesting for a segment (same or each different) that is spatially ahead, and we find this method of combining multiple subsystems working together is more efficient for VCR (seek) than that given in [20,29].…”

Section: The Total Viewing Time Of the Video For Peer Group B Ismentioning

confidence: 94%

“…The Video-on-Demand (VoD) as portrayed in large number of systems involves the server component, the proxy or content distribution server along with huge number of clients who are end users of the VoD systems [16,18,19]. At the server side, the existing literature has extensively discussed numerous solutions to optimize the storage/retrieval of video files [8,10,20]. Any server, which maintains video files in its database with a single version pertaining to a particular bit rate, cannot serve multiple heterogeneous clients with ease and without degrading the quality.…”

Section: Related Researchmentioning

confidence: 99%

“…If there is any problem in transmitting the base layer itself, then the end video's quality is reduced drastically. The hierarchical encoding is more suitable for multicast to heterogeneous clients while the switching streams can be used in both unicast and multicast [20]. But when a video is played at client side, the user may wish to fast forward (FF), rewind (RW), and so forth.…”

Section: Related Researchmentioning

confidence: 99%

“…CoopNet, PALS, PROP, Toast, and Zebroid provide on-demand streaming using P2P networks. Each of these systems seeks to support an infrastructure-based system with P2P networks and thus achieves scalability to some extent [20,21]. However, all these existing solutions are not sufficient to provide effective services in the current scenario.…”

Section: Related Researchmentioning

confidence: 99%

See 3 more Smart Citations

Enhancing Scalability in On-Demand Video Streaming Services for P2P Systems

Annie

Yogesh

Kannan

2012

Advances in Multimedia

View full text Add to dashboard Cite

Recently, many video applications like video telephony, video conferencing, Video-on-Demand (VoD), and so forth have produced heterogeneous consumers in the Internet. In such a scenario, media servers play vital role when a large number of concurrent requests are sent by heterogeneous users. Moreover, the server and distributed client systems participating in the Internet communication have to provide suitable resources to heterogeneous users to meet their requirements satisfactorily. The challenges in providing suitable resources are to analyze the user service pattern, bandwidth and buffer availability, nature of applications used, and Quality of Service (QoS) requirements for the heterogeneous users. Therefore, it is necessary to provide suitable techniques to handle these challenges. In this paper, we propose a framework for peer-to-peer- (P2P-) based VoD service in order to provide effective video streaming. It consists of four functional modules, namely, Quality Preserving Multivariate Video Model (QPMVM) for efficient server management, tracker for efficient peer management, heuristic-based content distribution, and light weight incentivized sharing mechanism. The first two of these modules are confined to a single entity of the framework while the other two are distributed across entities. Experimental results show that the proposed framework avoids overloading the server, increases the number of clients served, and does not compromise on QoS, irrespective of the fact that the expected framework is slightly reduced.

show abstract

Section: The Total Viewing Time Of the Video For Peer Group B Ismentioning

confidence: 94%

Section: Related Researchmentioning

confidence: 99%

Section: Related Researchmentioning

confidence: 99%

Section: Related Researchmentioning

confidence: 99%

See 2 more Smart Citations

Enhancing Scalability in On-Demand Video Streaming Services for P2P Systems

Annie

Yogesh

Kannan

2012

Advances in Multimedia

View full text Add to dashboard Cite

show abstract

“…In (Chen et al, 2010), there is a strategy for placement of popular videos, while the authors in (Brosh et al, 2009) propose distribution strategies that prove to be highly efficient when the not so popular videos are stored in the peers. The authors of (Dyaberi et al, 2010), apart from the BitTorrent-based peer-assisted VoD system, propose a distribution algorithm, which decides on the optimal number of replicas of the videos that have to be stored in the peers according to the popularity of the contents and the storage and streaming constrains of the peers.…”

Section: Related Workmentioning

confidence: 99%

Architectures for Video-on-Demand content distribution in managed networks

Gramatikov¹

View full text Add to dashboard Cite

The demand of video contents has rapidly increased in the past years as a result of the wide deployment of IPTV and the variety of services offered by the network operators. One of the services that has especially become attractive to the customers is real-time Video on Demand (VoD) because it offers an immediate streaming of a large variety of video contents.The price that the operators have to pay for this convenience is the increased traffic in the networks, which are becoming more congested due to the higher demand for VoD contents and the increased quality of the videos. Therefore, one of the main objectives of this thesis is finding solutions that would reduce the traffic in the core of the network, keeping the quality of service on satisfactory level and reducing the traffic cost.The thesis proposes a system of hierarchical structure of streaming servers that runs an algorithm for optimal placement of the contents according to the users' behavior and the state of the network. Since any algorithm for optimal content distribution reaches a limit upon which no further improvements can be made, including service customers themselves (the peers) in the streaming process can further reduce the network traffic. This process is achieved by taking advantage of the control that the operator has in the privately managed networks over the Set-Top Boxes placed at the clients' premises. The operator reserves certain storage and streaming capacity on the peers to store the video contents and to stream them to the other clients in order to alleviate the streaming servers.Because of the inability of the peers to completely substitute the streaming servers, the thesis proposes a system for peer-assisted streaming. Some of the important questions addressed in the thesis are how the system parameters and the various distributions of the video contents on the peers would impact the overall system performance. In order to give answers to these questions, the thesis proposes a precise and flexible stochastic model that takes into consideration parameters like uplink and storage capacity of the peers, number of peers, size of the video content library, size of contents and content distribution scheme to estimate the benefits of the peer-assisted streaming. The work also proposes an extended version of the mathematical model by including the failure probability of the peers and their recovery time in the set of parameters. These models are used as tools for conducting thorough analyses of the peer-assisted system for VoD streaming for the wide range of defined parameters.

show abstract