Scalable on-demand streaming of stored complex multimedia

Previous research has developed a number of efficient protocols for streaming popular multimedia files on-demand to potentially large numbers of concurrent clients. These protocols can achieve server bandwidth usage that grows much slower than linearly with the file request rate, and with the inverse of client start-up delay. This hesis makes the following three main contributions to the design and performance evaluation of such protocols. The first contribution is an investigation of the network bandwidth requirements for scalable on-demand streaming. The results suggest that the minimum required network bandwidth for scalable on-demand streaming typically scales as K/ln(K) as the number of client sites K increases for fixed request rate per client site, and as ln(N/(ND+1)) as the total file request rate N increases or client start-up delay D decreases, for a fixed number of sites. Multicast delivery trees configured to minimize network bandwidth usage rather than latency are found to only modestly reduce the minimum required network bandwidth. Furthermore, it is possible to achieve close to the minimum possible network and server bandwidth usage simultaneously with practical scalable delivery protocols. Second, the thesis addresses the problem of scalable on-demand streaming of a more complex type of media than is typically considered, namely variable bit rate (VBR) media. A lower bound on the minimum required server bandwidth for scalable on-demand streaming of VBR media is derived. The lower bound analysis motivates the design of a new immediate service protocol termed VBR bandwidth skimming (VBRBS) that uses constant bit rate streaming, when sufficient client storage space is available, yet fruitfully exploits the knowledge of a VBR profile. Finally, the thesis proposes non-linear media containing parallel sequences of data frames, among which clients can dynamically select at designated branch points, and investigates the design and performance issues in scalable on-demand streaming of such media. Lower bounds on the minimum required server bandwidth for various non-linear media scalable on-demand streaming approaches are derived, practical non-linear media scalable delivery protocols are developed, and, as a proof-of-concept, a simple scalable delivery protocol is implemented in a non-linear media streaming prototype system

Novel Proactive Patch Peer Protocol to Support Faster Delivery of Video-on-Demand

© ASEE 2011An important feature in the convergence of network is provision of multimedia applications. Multimedia consists of different classes but video-on-demand (VoD) has been more focusing research area in recent years. VoD enables the users to watch and select the contents of songs and movies on demand. There is still no concrete technique to attain the goals of delivering the video on demand fastly. Secondly the delivery of video on demand to heterogeneous mobile environment is very exigent task because multimedia services face various limitations mostly caused by the wireless channel unpredictability, limited bandwidth, assorted behavior of protocols, standards and fading effect, etc. The users mostly face the issues of downloading the on-line applications and data by using VoD method on heterogamous networks. To reduce these problems, we propose and simulate the novel technique of proactive patch peer (PPP) protocol to support the delivery of VoD. This protocol gets the peer from server and requests the remaining part (patch) for playing the video from one distance neighbour node on the basis of stored information for one hop distance of node onto the profile of requesting nodes. The protocol uses unicast scheme to reduce the network traffic load and avoid the bottleneck. The other features of PPP are to save the bandwidth and make the faster delivery of video on demand as compare with other previous techniques. We first present the concept and architecture of PPP, and then introduce used techniques for unicast VoD method. We also target and evaluate the multicasting issues for delivery of VoD. Our experimental results demonstrate on the basis of simulation that the proposed PPP is more effective, faster and bandwidth saving protocol for delivery of VoD

Scalable On-Demand Streaming of Non-Linear Media

Abstract — A conventional video file contains a single temporally-ordered sequence of video frames. Clients requesting on-demand streaming of such a file receive (all or intervals of) the same content. For popular files that receive many requests during a file playback time, scalable streaming protocols based on multicast or broadcast have been devised. Such protocols require server and network bandwidth that grow much slower than linearly with the file request rate. This paper considers “non-linear ” video content in which there are parallel sequences of frames. Clients dynamically select which branch of the video they wish to follow, sufficiently ahead of each branch point so as to allow the video to be delivered without jitter. An example might be “choose-your-own-ending ” movies. With traditional scalable delivery architectures such as movie theaters or TV broadcasting, such personalization of the delivered video content is very difficult or impossible. It becomes feasible, in principle at least, when the video is streamed to individual clients over a network. This paper analyzes the minimal server bandwidth requirements, and proposes and evaluates practical scalable delivery protocols, for on-demand streaming of nonlinear media. I