Live Video Services Using Fast Broadcasting Scheme
Satish Chand
DOI: 10.4236/cn.2010.21013   PDF    HTML     5,158 Downloads   8,827 Views   Citations


The Fast Broadcasting scheme is one of the simplest schemes that provide video services. In this scheme, the video is divided into equal-sized segments depending upon the bandwidth allocated by the video server. If the video length is not known, then this scheme cannot be applied as the number of video segments cannot be determined. In a live video wherein the video size is unknown, especially the ending time of the live broadcast, e.g., cricket match, this scheme cannot be applied. In this paper, we propose a model that helps the Fast Broadcasting scheme to support live video broadcasting. The basic architecture of the system consists of a live system with one video channel that broadcasts the live video and a video server that broadcasts the already broadcast live video to users.

Share and Cite:

S. Chand, "Live Video Services Using Fast Broadcasting Scheme," Communications and Network, Vol. 2 No. 1, 2010, pp. 79-85. doi: 10.4236/cn.2010.21013.

Conflicts of Interest

The authors declare no conflicts of interest.


[1] K. M. Ho and K. T. Lo, “Design of a decentralized video- on-demand system with cooperative clients in multicast environment,” Advances in Multimedia Information Pr- ocessing, Lecture Notes Computer Science, 4810, pp. 401–404, 2007.
[2] Y. B. L. Jack, “Channel folding – an algorithm to improve efficiency of multicast video-on-demand systems,” IEEE Transactions on Multimedia, Vol. 7, No. 2, pp. 366–378, 2005.
[3] W. F. Poon, K. T. Lo, and J. Feng, “A hierarchical video-on-demand system with double-rate batching,” JVCIR, Vol. 16, No. 1, pp. 1–18, 2005.
[4] D. J. Gemmell, H. M. Vin, D. Kandlur, P. V. Rangan, and L. A. Rowe, “Multimedia storage servers: a tutorial,” Computer, Vol. 28, No. 5, pp. 40–49, 1995.
[5] N. J. Sarhan and C. R. Das, “Caching and scheduling in nad based multimedia servers,” IEEE Transactions on Parallel and Distributed Systems, Vol. 5, No. 10, pp. 921–933, 2004.
[6] A. L. Chervnak, D. A. Patterson and R. H. Katz, “Choosing the best storage system for video service,” In Proceeding of third ACM international conference on Multimedia, San Francisco, USA, pp. 109–119, 1995.
[7] A. Dan and D. Sitaram, “Buffer management policy for an on-demand video server,” IBM Watson Research Center, RC 19347, 1994.
[8] C. C. Aggarwal, J. L. Wolf, and P. S. Yu, “A permutation based pyramid broadcasting scheme for video on demand systems,” In Proceeding International Conference on Multimedia Computing and Systems, pp. 118–126, 1996.
[9] L. Gao, J. Kurose, and D. Towsley, “Efficient schemes for broadcasting popular videos,” In Proceeding of NOSSDAV’98, pp. 183–194, 1998.
[10] A. L. N. Reddy, J. Wyllie, and K. B. R. Wijayratne, “Disk scheduling in a multimedia I/O system,” ACM Transactions on Computer Communication and Application (TOMCCAP), Vol. 1, No. 1, pp. 37–59, 2005.
[11] L. S. Juhn and L. M. Tseng, “Harmonic broadcasting scheme for video-on-demand service,” IEEE Transactions on Consumer Electronics, Vol. 43, No. 3, pp. 268–271, 1997.
[12] H. Om and S. Chand, “Geometrico-harmonic broadcasting scheme with continuous redundancy,” IEEE Transactions on Multimedia, Vol. 9, No. 1, pp. 410–419, 2007.
[13] S. Viswanathan and T. Imielinski, “Metropolitan area video-on-demand service using pyramid broadcasting,” ACM Multimedia System, Vol. 4, No. 4, pp. 197–208, 1996.
[14] L. S. Juhn and L. M. Tseng, “Fast data broadcasting and receiving scheme for popular video service,” IEEE Transactions on Broadcasting, Vol. 44, No. 1, pp. 100–105, 1998.

Copyright © 2023 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.