文档下载 文档下载导航
设为首页 | 加入收藏
搜索 请输入内容:  
 导航当前位置: 文档下载 > 所有分类 > A Channel-Based Heuristic Distribution Protocol for Video-onDemand
侵权投诉

A Channel-Based Heuristic Distribution Protocol for Video-onDemand

We present a new dynamic broadcasting protocol improving upon existing protocols in two ways. First, our channel-based heuristic distribution protocol uses a heuristic segment allocation scheme for the k broadcasting channels assigned to each video. Second

A CHANNEL-BASED HEURISTIC DISTRIBUTION PROTOCOL

FOR VIDEO-ON-DEMAND

Qiong Zhang

Jehan-François Pâris1 Department of Computer Science

University of Houston Houston, TX 77204-3010

Abstract

We present a new dynamic broadcasting protocol improv-ing upon existing protocols in two ways. F irst, our

channel-based heuristic distributionprotocol uses heuris-a tic segment allocation scheme for the k broadcasting channels assigned to each video. Second, it can require all customers to wait for a minimum waiting time before watching the video of their choice. As a result, our proto-col performs as well as the best reactive distribution protocols at low request arrival rates and as well as the best broadcasting protocols at high request arrival rates.

1. INTRODUCTION

Broadcasting protocols provide the most cost-effective solution for distributing popular videos on demand to large customer bases. As result, a they offer the best hope for the successful deployment of metropolitan video-on-demand (VOD) services. Broadcasting protocols anticipate customer demand and distribute the various segments of each video according to a deterministic schedule. The bandwidth savings can be considerable since the top ten to twenty most popular vid-eos are likely to account for over forty percent ofthe total demand [4]

The first truly efficient broadcasting protocol was Viswanathan and Imielinski's pyramid broadcastingproto- col [10]. P yramid broadcasting and all broadcasting protocols it inspired assume that customers will receive their videos through a set-top box (STB) capable of(a) simultaneously receiving data from several video channels and (b) storing in a local buffer up to 60 percent of each video being watched. As a result, the best broadcasting protocols only require six times the video consumption rate to achieve a maximum waiting time of 32 seconds fora two-hour video [9]. Broadcasting protocols have nevertheless one major draw-back: they are poorly suited for distributing less popular videos, say, videos that are requested less than ten times an hour [3, 8]. This would not be problem a if the frequency of requests for any given video were not likely to vary widely

1

Both authors were supported in part by the Texas Advanced

Research Program under grant 003652-0124-1999 and the National Science Foundation under grant CCR-9988390.

with the time of the day. For instance, child-oriented fare

will always be in higher demand during the day and early evening hours than at night. Conversely, videos appealing to older viewers are likely to follow an opposite pattern. The best solution to this problem is offered by dynamic broadcastingprotocols. These protocols operate like con-ventional broadcasting protocols but keep track of user requests, which allows them to skip segment transmissions that are not needed by any user. As a result, theyrequire much less bandwidth when requests become less frequent. Two examples of this approach are the universal distribu-tion (UD) protocol [8] and the dynamic heuristic broadcastingprotocol [3]. While both protocols perform satisfactorily at low to medium request arrival rates, their bandwidth requirements at high request arrival rates still exceed those of fixed-delay broadcasting protocols,such as the fixed-delay pagoda broadcasting protocol [9]. The channel-based heuristic distribution(CBHD) protocol we present does not suffer from this limitation. I performs t as well as the best reactive protocols at low to medium requests arrival rates and as well as the fixed-delay pagoda broadcasting protocol at high request arrival rate.

2. PREVIOUS WORK

For brevity sake, we will focus our discussion on the distri-bution protocols that are directly relevant to our work. These include the fast broadcasting protocol [7], on which the original universal distribution protocol was based. Juhn and Tseng's fast broadcasting(FB) protocol is one of the most intuitive broadcasting protocols. It allocates to each video channels k whose bandwidths are all equal to the video consumption rate It then b . partitions each video 2– 1 segments kinto Sto Schannel 1

2k–1of equal duration As d . Figure 1 indicates, the first continuously rebroadcasts segment Sthird channel 1the , second channel transmits segments Sand transmits segments Sto 4 SMore 2 S3and , the 7 . generally, channel with j 1

≤ j

≤

ktransmits segments S2j-1to S22jj–in 1such way a that each segment is repeated once every –1d

time units. The fixed-delay pagoda broadcasting(FDPB) protocol [9] is more a recent protocol that requires all users to wait for a fixed delay before watching the video they have selected. The protocol uses this delay to reduce the bandwidth

第1页

你可能喜欢

热门文档

相关文档

站点地图 | 文档上传 | 侵权投诉 | 手机版
本站所有资源均来自互联网,本站只负责收集和整理,均不承担任何法律责任,如有侵权等其它行为请联系我们.
文档下载 Copyright 2013 doc.guandang.net All Rights Reserved.  -  email