Skyscraper broadcasting: a new broadcasting scheme for metropolitan video-on-demand systems

We investigate a novel multicast technique, called Skyscraper Broadcasting (SB), for video-on-demand applications. We discuss the data fragmentation technique, the broadcasting strategy, and the client design. We also show the correctness of our technique, and derive mathematical equations to analyze its storage requirement. To assess its performance, we compare it to the latest designs known as Pyramid Broadcasting (PB) and Permutation-Based Pyramid Broadcasting (PPB). Our study indicates that PB offers excellent access latency. However, it requires very large storage space and disk bandwidth at the receiving end. PPB is able to address these problems. However, this is accomplished at the expense of a larger access latency and more complex synchronization. With SB, we are able to achieve the low latency of PB while using only 20% of the buffer space required by PPB.

[1]  J. Leon Zhao,et al.  Buffer management for video database systems , 1995, Proceedings of the Eleventh International Conference on Data Engineering.

[2]  Jean-Yves Le Boudec,et al.  The Asynchronous Transfer Mode: A Tutorial , 1992, Comput. Networks ISDN Syst..

[3]  David J. DeWitt,et al.  The SPIFFI scalable video-on-demand system , 1995, SIGMOD '95.

[4]  Tomasz Imielinski,et al.  Metropolitan area video-on-demand service using pyramid broadcasting , 1996, Multimedia Systems.

[5]  Michael B. Jones,et al.  The Tiger Video Fileserver , 1996 .

[6]  Corporate.  IEEE Std 802.6-1990, IEEE Standards for Local and Metropolitan Area Networks: Distributed Queue Dual Bus (Dqdb) Subnetwork of a Metropolitan Area Network (Man) , 1991 .

[7]  Kien A. Hua,et al.  Earthworm: a network memory management technique for large-scale distributed multimedia applications , 1997, Proceedings of INFOCOM '97.

[8]  R. Michael Schafer,et al.  Multicasting in a growable packet (ATM) switch , 1991, IEEE INFCOM '91. The conference on Computer Communications. Tenth Annual Joint Comference of the IEEE Computer and Communications Societies Proceedings.

[9]  Philip S. Yu,et al.  A permutation-based pyramid broadcasting scheme for video-on-demand systems , 1996, Proceedings of the Third IEEE International Conference on Multimedia Computing and Systems.

[10]  David P. Anderson,et al.  Metascheduling for continuous media , 1993, TOCS.

[11]  Asit Dan,et al.  Generalized interval caching policy for mixed interactive and long video workloads , 1996, Electronic Imaging.

[12]  Asit Dan,et al.  Scheduling policies for an on-demand video server with batching , 1994, MULTIMEDIA '94.

[13]  Yen-Jen Oyang,et al.  Design of multimedia storage systems for on-demand playback , 1995, Proceedings of the Eleventh International Conference on Data Engineering.

[14]  P. Venkat Rangan,et al.  Designing a Multiuser HDTV Storage Server , 1993, IEEE J. Sel. Areas Commun..

[15]  Manoel A. Rodrigues.  Erasure node: performance improvements for the IEEE 802.6 MAN , 1990, Proceedings. IEEE INFOCOM '90: Ninth Annual Joint Conference of the IEEE Computer and Communications Societies@m_The Multiple Facets of Integration.

[16]  Kien A. Hua,et al.  Virtual Batching: A New Scheduling Technique for Video-on-Demand Servers , 1997, DASFAA.

[17]  Banu Özden,et al.  Demand paging for video-on-demand servers , 1995, Proceedings of the International Conference on Multimedia Computing and Systems.

[18]  Tomasz Imielinski,et al.  Pyramid broadcasting for video-on-demand service , 1995, Electronic Imaging.

[19]  Banu Özden,et al.  A Low-Cost Storage Server for Movie on Demand Databases , 1994, VLDB.

[20]  Philip S. Yu,et al.  On optimal batching policies for video-on-demand storage servers , 1996, Proceedings of the Third IEEE International Conference on Multimedia Computing and Systems.