Download Buffering Techniques for Delivery of Compressed Video in by Wu-Chi Feng PDF

By Wu-Chi Feng

Many rising applied sciences comparable to video conferencing, video-on-demand, and electronic libraries require the effective supply of compressed video streams. For purposes that require the supply of compressed kept multimedia streams, the a priori wisdom to be had approximately those compressed streams can reduction within the allocation of server and community assets. by utilizing a client-side buffer, the source necessities from the server and community may be minimized.
Buffering ideas for supply of Compressed Video in Video-on-Demand Systems provides a accomplished description of buffering options for the supply of compressed, prerecorded multimedia information. whereas those options could be utilized to any compressed information streams, this booklet focusses totally on the supply of video streams due to the huge source requisites that they could devour. The ebook first describes buffering ideas for the continual playback of saved video assets. specifically, numerous bandwidth smoothing (or buffering) algorithms which are provably optimum below sure stipulations are provided. to supply a well-rounded dialogue, the publication then describes extensions that reduction within the skill to supply interactive supply of video throughout networks. in particular, reservation recommendations that bear in mind interactive capabilities comparable to fast-forward and rewind are defined. furthermore, extensions to the bandwidth smoothing algorithms provided within the first few chapters are defined. those algorithms are designed with interactive, non-stop playback of saved video in brain and also are provably optimum less than sure constraints.
Buffering strategies for supply of Compressed Video in Video-on-Demand Systems serves as a good source for multimedia platforms, networking and video-on-demand designers, and should be used as a textual content for complex classes at the subject.

Show description

Read Online or Download Buffering Techniques for Delivery of Compressed Video in Video-on-Demand Systems (The Springer International Series in Engineering and Computer Science) PDF

Similar computers books

RibbonX For Dummies (For Dummies (Computer Tech))

Comprises coding examples and pattern conversion courses! Create VBA, VB. web, and C# customized functions with this radical new interfaceAre you prepared to take on RibbonX? This pleasant, plain-English consultant delivers the information and methods you want to layout and enforce Ribbon apps speedy, in addition to lots of examples for operating in VBA and visible Studio(r).

PCI Express Technology 3.0

"MindShare books are severe within the figuring out of advanced technical subject matters, corresponding to PCI show three. zero structure. a lot of our clients and companions depend upon those books for the good fortune in their tasks. " Joe Mendolia - vp, LeCroy PCI show three. zero is the newest new release of the preferred peripheral interface present in almost each workstation, server, and business computing device.

Additional info for Buffering Techniques for Delivery of Compressed Video in Video-on-Demand Systems (The Springer International Series in Engineering and Computer Science)

Sample text

As a result, the CBA algorithm with a maximum buffer constraint (referred to from now on as the CBA algorithm) results in a plan that: • requires no prefetching of data before playback begins • has the minimum number of bandwidth increase changes • has the smallest peak bandwidth requirement • has the largest minimum bandwidth requirement In our discussion, we modify the definition of critical points and critical bandwidths to work with a maximum buffer constraint. Given some starting point and the buffer occupancy at the starting point, the critical bandwidth is the bandwidth such that the buffer limitations are not violated for the largest number of frames.

If the critical point is on Funder(i), then a decrease in bandwidth is required in the next run and the critical point is used as the starting point for the next run. 5). 6). This search requires the calculation of an initial buffer occupancy between the maximum buffer size and 0 because the frontier of the run connects Fover(i) and Fuhrer(i). For a run k+l that requires an increase in bandwidth from the last run k, the bandwidth is allocated at a slope such that the run extends as far out in time as possible.

This search is always performed a line connecting Flow(i ) and Fhi(i ) OR Fhi(i ) and Flow(i ). Because this search is on a line that connects Fhi and Flo w which planbetter m u s t cross, planbetter cannot pick a next run that is longer than the one chosen by planop r Otherwise, planop t would have found it in its search. We continue this process for all runs within the planop t. Because every ith run in planbene r c a n n o t have a critical point further than the ith run in planop t, planbetter must have at least as many runs as planop t.

Download PDF sample

Rated 4.09 of 5 – based on 31 votes