Practical Channel Transition for Near-VOD Services

Chien, Wei-De; Yeh, None Yuan-Shiang; Wang, Jia-Shung

doi:10.1109/tbc.2005.852251

Cited by 30 publications

(19 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Various (near) on-demand services have already been proposed over broadcast networks [7], [14], [15], [19], [20]. However, an Internet Protocol (IP) network is excellently suited to support such interactive TV services, because it has a native return channel to easily convey the user requests (or preferences) to the control center and because it can straightforwardly address each user individually.…”

Section: Introductionmentioning

confidence: 99%

Performance analysis of a caching algorithm for a catch-up television service

Avramova

Vleeschauwer²,

Wittevrongel

et al. 2010

Multimedia Systems

View full text Add to dashboard Cite

The Catch-Up TV (CUTV) service allows users to watch video content that was previously broadcast live on TV channels and later placed on an on-line video store. Upon a request from a user to watch a recently missed episode of his/her favourite TV series, the content is streamed from the video server to the customer's receiver device. This requires that an individual flow is set up for the duration of the video, and since it is hard to impossible to employ multicast streaming for this purpose (as users seldomly issue a request for the same episode at the same time), these flows are unicast.In this paper we demonstrate that with the growing popularity of the CUTV service, the number of simultaneously running unicast flows on the aggregation parts of the network threaten to lead to an unwieldy increase in required bandwidth. Anticipating this problem and trying to alleviate it, the network operators deploy caches in strategic places in the network. We investigate the performance of such a caching strategy and the impact of its size and the cache update logic.We first analyse and model the evolution of video popularity over time based on traces we collected during ten months. Through simulations we compare the performance of the traditional LRU (Least-Recently Used) and LFU (Least-Frequently Used) caching algorithms to our own algorithm. We also compare their performance with a "perfect" caching algorithm, which knows and hence does not have to estimate the video request rates.In the experimental data we see that the video parameters from the popularity evolution law can be clustered.Therefore we investigate theoretical models than can capture these clusters and we study the impact of clustering on the caching performance. Finally, some considerations on the optimal cache placement are presented.

show abstract

Section: Introductionmentioning

confidence: 99%

Performance analysis of a caching algorithm for a catch-up television service

Avramova

Vleeschauwer²,

Wittevrongel

et al. 2010

Multimedia Systems

View full text Add to dashboard Cite

show abstract

“…Recently, several channel transition protocols [13][14][15][16][17][18][19] for different PB schemes have been designed. In [13], Tseng et al first addressed the issue and proposed a channel transition protocol for the Fast Broadcasting scheme [2].…”

Section: Introductionmentioning

confidence: 99%

“…Other channel transition protocols for the Fast Broadcasting scheme were proposed in [16,17]. The protocol in [16] allows the old and new segments to be transmitted on the same channel without overlap.…”

Section: Introductionmentioning

confidence: 99%

Seamless channel transition for slotted generalized fibonacci broadcasting

Chen

Yan

et al. 2007

Multimedia Systems

View full text Add to dashboard Cite

Periodic Broadcasting schemes are costeffective methods of implementation of Near Video on Demand systems. While the schemes enjoy the advantage of reducing the demand on server bandwidth, they suffer from the problem of insensitivity to the popularity of videos. However, the popularity of a video does not remain constant in the real world; it varies with time, social events, and so on. From a service provider's viewpoint, given a set of popular videos and limited server bandwidth, it would be desirable to adjust the bandwidth allocated to each of the videos dynamically and seamlessly according to the level of its hotness.Slotted Generalized Fibonacci Broadcasting (SGFB). We then propose a seamless channel transition enhancement on top of the SGFB scheme so that the service provider is capable of adjusting the channel allocation policy to make the most benefit out of the available bandwidth. The correctness of SGFB together with its performance analysis will be presented. Furthermore, we shall provide mathematical analysis to demonstrate its channel transition behavior.

show abstract

“…The first idea of SWCT was from the study of the channel transitions in FB and we had announced it in [11].…”

Section: The Stairway Channel Transition Schemementioning

confidence: 99%

“…The positive case also follows FB by letting the new channel C i+m ′ succeeds the old channel C i . For all i, 1≤ i≤ k-1, the verification process is similar to that in [11]. For i=k,…”

Section: Swct Over Empbmentioning

confidence: 99%

Seamless Channel Transition for Pyramid-Based Near-Vod Services

Chien

Yang²,

Wang³

2005 IEEE International Conference on Multimedia and Expo

View full text Add to dashboard Cite

Periodic broadcasting is known as an efficient technique for delivering popular videos by reducing bandwidth requirement for transmitting streaming video to simultaneous viewers. The channel transition problem is a noticed issue to be concerned about the variability of popularity of video and resource management in periodic broadcasting. In this paper, we approach a general seamless channel transition scheme for pyramid-based broadcasting protocols and present the Stairway Channel Transition (SWCT) scheme. Compared to the existing schemes that are only designed for dedicated broadcasting protocols, our design possesses more flexibility, while it does not reduce the performance of the original protocols.

show abstract

Practical Channel Transition for Near-VOD Services

Cited by 30 publications

References 12 publications

Performance analysis of a caching algorithm for a catch-up television service

Performance analysis of a caching algorithm for a catch-up television service

Seamless channel transition for slotted generalized fibonacci broadcasting

Seamless Channel Transition for Pyramid-Based Near-Vod Services

Contact Info

Product

Resources

About