KEYWORDS: Internet, Performance modeling, Analytical research, Local area networks, Computer simulations, Algorithm development, Systems modeling, Data storage, Mechanics, Video
Stream merging is a technique for efficiently delivering popular media-on-demand using multicast and client buffers. The basic idea is that clients may simultaneously receive more data than they need for playback and store parts of the transmission in their buffers to be played back later. It was shown that with these additional capabilities, the bandwidth requirements for servers are dramatically reduced compared with traditional unicast systems and multicast systems that use only batching. Recently, several algorithms for stream merging have been proposed, and we perform a comprehensive comparison in this paper. We present the differences in philosophy and mechanics among the various algorithms, and illustrate the trade-offs between their system complexity and performance. We measure performance in average, maximum, and time-varying server bandwidth usage under different assumptions for the client request patterns. The result of this study is a deeper understanding of the system complexity and performance trade-offs for the various algorithms.
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
PERSONAL Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.