Skyscraper broadcasting: a new broadcasting scheme for metropolitan video-on-demand systems
SIGCOMM '97 Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communication
Patching: a multicast technique for true video-on-demand services
MULTIMEDIA '98 Proceedings of the sixth ACM international conference on Multimedia
Efficient and scalable on-demand data streaming using UEP codes
MULTIMEDIA '01 Proceedings of the ninth ACM international conference on Multimedia
Optimised batch patching with classes of service
ACM SIGCOMM Computer Communication Review
Optimal proxy management for multimedia streaming in content distribution networks
NOSSDAV '02 Proceedings of the 12th international workshop on Network and operating systems support for digital audio and video
Scheduled video delivery for scalable on-demand service
NOSSDAV '02 Proceedings of the 12th international workshop on Network and operating systems support for digital audio and video
Video-on-demand: scalability and QoS control
Distributed multimedia databases
Broadcasting approaches for VoD services
Distributed multimedia databases
Scalability of multicast delivery for non-sequential streaming access
SIGMETRICS '02 Proceedings of the 2002 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Scheduling Video Streams in Video-on-Demand Systems: A Survey
Multimedia Tools and Applications
Minimizing Bandwidth Requirements for On-Demand Data Delivery
IEEE Transactions on Knowledge and Data Engineering
Interaction with broadcast video
Proceedings of the tenth ACM international conference on Multimedia
Sharing Multicast Videos Using Patching Streams
Multimedia Tools and Applications
Scheduling methods for broadcasting multiple continuous media data
MMDB '03 Proceedings of the 1st ACM international workshop on Multimedia databases
Generalized data retrieval for pyramid-based periodic broadcasting of videos
Future Generation Computer Systems - Special issue: Semantic grid and knowledge grid: the next-generation web
Competitive on-line stream merging algorithms for media-on-demand
Journal of Algorithms - Special issue: Twelfth annual ACM-SIAM symposium on discrete algorithms
Proceedings of the 2004 ACM workshop on Next-generation residential broadband challenges
Best-Effort Patching for Multicast True VoD Service
Multimedia Tools and Applications
Scalable streaming for heterogeneous clients
MULTIMEDIA '06 Proceedings of the 14th annual ACM international conference on Multimedia
A progressive flow auction approach for low-cost on-demand P2P media streaming
QShine '06 Proceedings of the 3rd international conference on Quality of service in heterogeneous wired/wireless networks
Convergence of periodic broadcasting and video-on-demand
Computer Communications
Multimedia Tools and Applications
A video broadcasting protocol for bandwidth-constrained clients
International Journal of Network Management
Scalable on-demand streaming of nonlinear media
IEEE/ACM Transactions on Networking (TON)
Hi-index | 0.00 |
Periodic broadcasting can be used to support near video-on-demand for popular videos. For a given bandwidth allocation, pyramid broadcasting schemes substantially reduce the viewer latency (waiting) time as compared with conventional broadcasting schemes. Nevertheless, such pyramid schemes typically have substantial storage requirements at the client end, and this results in set-top boxes needing disks with high transfer rate capabilities. In this paper, we present a permutation-based pyramid scheme in which the storage requirements and disk transfer rates are greatly reduced, and yet the viewer latency is smaller as well. Under the proposed approach, each video is partitioned into contiguous segments of geometrically increasing sizes and each segment is further divided into blocks, where a block is the basic unit of transmission. As in the original pyramid scheme, frequencies of transmission for the different segments of a video vary in a manner inversely proportional to their size. Instead of transmitting the blocks in each segment in sequential order, the proposed scheme transmits these blocks in a prespecified cyclic permutation to save on storage requirements in the client end. Performance analyses are provided to quantify the benefits of the new scheme.