Virtual clock: a new traffic control algorithm for packet switching networks
SIGCOMM '90 Proceedings of the ACM symposium on Communications architectures & protocols
IEEE/ACM Transactions on Networking (TON)
Smoothing variable-bit-rate video in an Internetwork
IEEE/ACM Transactions on Networking (TON)
Study of multiplexing for group-based quality of service delivery
Proceedings of the IFIP TC6 WG6.3/WG6.4 Fourth International Workshop on ATM Networks, Performance Modelling and Analysis, Volume 3
Traffic Characteristics and Smoothness Criteria in VBR Video Traffic Smoothing
ICMCS '97 Proceedings of the 1997 International Conference on Multimedia Computing and Systems
Smoothing and Prefetching Video from Distributed Servers
ICNP '99 Proceedings of the Seventh Annual International Conference on Network Protocols
Earliest Due First Scheduling for Application-Level QoS Delivery
MMNET '97 Proceedings of the IEEE Conference on Protocols for Multimedia Systems - Multimedia Networking (PROMSMmNet'97)
Proxy Prefix Caching for Multimedia Streams TITLE2:
Proxy Prefix Caching for Multimedia Streams TITLE2:
Group Priority Scheduling
Real-Time Block Transfer Under a Link Sharing Hierarchy
Real-Time Block Transfer Under a Link Sharing Hierarchy
Video-on-demand over ATM: constant-rate transmission and transport
IEEE Journal on Selected Areas in Communications
High-performance prefetching protocols for VBR prerecorded video
IEEE Network: The Magazine of Global Internetworking
RaDiO edge: rate-distortion optimized proxy-driven streaming from the network edge
IEEE/ACM Transactions on Networking (TON)
Multi-tiered, burstiness-aware bandwidth estimation and scheduling for VBR video flows
Proceedings of the Nineteenth International Workshop on Quality of Service
Hi-index | 0.00 |
In this paper, an efficient scheme is proposed based on the introduced deadline-credit-based (DC) policy. This scheme is appropriate for any prerecorded media, but is particularly relevant for prerecorded semisoft continuous media (CM) applications. Semisoft are applications with very small initial delay tolerance and, thus, for which very small amount of content may be sent in advance. The proposed policy pushes content toward the end user during the session by taking advantage of any bandwidth underutilization periods, exploiting available storage, and building up fairly a deadline credit to be consumed during periods of overutilization. The scheduling policy is studied for the single-hop case (applicable to the server of the content), as well as for the multihop case (applicable to the server and network nodes). The derived results demonstrate the ability of the proposed scheme to decrease the amount of required bandwidth (or equivalently induced losses) with respect to alternative schemes without requiring large initial delay, which is not acceptable for semisoft CM applications.