A join-the-shortest-queue prefetching protocol for VBR video on demand

被引:8
|
作者
Reisslein, M
Ross, KW
机构
关键词
D O I
10.1109/ICNP.1997.643693
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
We present a high-performance prefetching protocol for the delivery of prerecorded VBR video from a server across a packet-switched network to a large number of clients. Not only does the protocol give constant percept ual quality and almost 100% link utilization, but it also allows for immediate commencement of the video upon user request and near instantaneous response to pause/resume and temporal jumps. The protocol requires (1) that each client have a small amount of memory dedicated to the application (2) that there is one bottleneck shared link between the server and the clients. Our protocol is based on the observation that there are frequent periods of time during which the shared link's bandwidth is under utilized. During these periods the server can prefetch frames from any of the ongoing videos and send the frames to the buffers in the appropriate clients. The server chooses prefetched frames according to a join-the-shortest-queue policy. We present simulation results of our prefetch policy that are based on MPEG encoded traces.
引用
收藏
页码:63 / 72
页数:10
相关论文
共 50 条
  • [21] Large deviations without principle: join the shortest queue
    Ridder, A
    Shwartz, A
    MATHEMATICAL METHODS OF OPERATIONS RESEARCH, 2005, 62 (03) : 467 - 483
  • [22] High-performance prefetching protocols for VBR prerecorded video
    GMD FOKUS
    IEEE Network, 6 (46-55):
  • [23] High-performance prefetching protocols for VBR prerecorded video
    Reisslein, M
    Ross, KW
    IEEE NETWORK, 1998, 12 (06): : 46 - 55
  • [24] DECAY OF TAILS AT EQUILIBRIUM FOR FIFO JOIN THE SHORTEST QUEUE NETWORKS
    Bramson, Maury
    Lu, Yi
    Prabhakar, Balaji
    ANNALS OF APPLIED PROBABILITY, 2013, 23 (05): : 1841 - 1878
  • [25] Overloading parallel servers when arrivals join the shortest queue
    McDonald, D
    STOCHASTIC NETWORKS: STABILITY AND RARE EVENTS, 1996, 117 : 169 - 196
  • [26] The Join the Shortest Orbit Queue System with a Finite Priority Line
    Dimitriou, Ioannis
    PERFORMANCE ENGINEERING AND STOCHASTIC MODELING, 2021, 13104 : 375 - 395
  • [27] An approximate analysis of the Join the Shortest Queue (JS']JSQ) policy
    Lin, HC
    Raghavendra, CS
    IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 1996, 7 (03) : 301 - 307
  • [28] VBR video data scheduling using window-based prefetching
    Kim, IH
    Kim, JW
    Lee, SW
    Chung, KD
    IEEE INTERNATIONAL CONFERENCE ON MULTIMEDIA COMPUTING AND SYSTEMS, PROCEEDINGS VOL 1, 1999, : 159 - 164
  • [29] VBR video data scheduling using window-based prefetching
    Pusan Natl Univ, Pusan, Korea, Republic of
    Int Conf Multimedia Comput Syst Proc, (159-164):
  • [30] TWO PARALLEL QUEUES WITH INFINITE SERVERS AND JOIN THE SHORTEST QUEUE DISCIPLINE
    Guillemin, F.
    Olivier, P.
    Simonian, A.
    Tanguy, C.
    STOCHASTIC MODELS, 2015, 31 (04) : 636 - 672