Competitive video on demand schedulers for popular movies

Bouras, Christos; Kapoulas, Vaggelis; Pantziou, Grammati; Spirakis, Paul G.

doi:10.1016/s0166-218x(02)00233-0

Cited by 9 publications

(5 citation statements)

References 26 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…As in many previous works (e.g., [3,6,9,10,18,20]), we assume that all jobs have the same length . (Note that this assumption is not unrealistic and is applicable to PDD systems using DNS servers.…”

Section: The Modelmentioning

confidence: 99%

Design and Analysis of Online Batching Systems

Hung

Ting

2008

Algorithmica

View full text Add to dashboard Cite

In this paper, we study the design and analysis of online batching systems, which can be used to model many popular IT systems such as the Video-On-Demand system and the Pull-based Data Dissemination system. We analyze how the start-up delay affects the performance of these systems and investigate the tradeoff relationship between the number of servers and the length of the start-up delay. We also study a simple online algorithm for scheduling online batching systems. By deriving close lower and upper bounds, we prove that our algorithm is near optimal.

show abstract

Section: The Modelmentioning

confidence: 99%

Design and Analysis of Online Batching Systems

Hung

Ting

2008

Algorithmica

View full text Add to dashboard Cite

show abstract

“…Our work combines the above approaches with an adaptive scheme that attempts to achieve a preferable balance between optimal utilization of the network and minimal overhead for the Bandwidth Broker operation. An adaptive scheme designed for the scheduling of popular video on demand that also uses delayed notification is presented in Bouras et al [17]. In Mykoniati et al [18], the admission control approach taken by the TEQUILA project is presented, which is based on a feedback model that can be tuned by operational policies and strategies.…”

Section: Admission Control Modulementioning

confidence: 99%

An efficient architecture for Bandwidth Brokers in DiffServ networks

Bouras

Stamos

2007

Int J Network Mgmt

View full text Add to dashboard Cite

SUMMARYIn this article we examine the architecture of an entity used for automatic management and provisioning of resources for DiffServ networks. We examine the existing literature and implementations in this area, focusing on the design choices made, and we propose an architecture for the design of Bandwidth Brokers that combines an adaptive admission control algorithm for increased utilization of network resources and a mechanism for reducing the complexity overhead that intends to be both simple and effective. Specifically, we present a novel architecture for the admission control module that aims at achieving a satisfactory balance between maximizing the resource utilization for the network provider and minimizing the overhead of the module. We complement our theoretical discussion with extensive experimental simulations for the proposed Bandwidth Broker components and analysis of the results. The simulations study the possible configurations of the proposed algorithm and also compare it with alternative admission control policies.

show abstract

Section: Admission Control Modulementioning

confidence: 99%

An adaptive admission control algorithm for bandwidth brokers

Bouras

Stamos

Third IEEE International Symposium on Network Computing and Applications, 2004. (NCA 2004). Proceedings.

View full text Add to dashboard Cite

This paper focuses on the operation of the Bandwidth Broker, an entity that is responsible for managing the bandwidth within a network domain and for the communication with Bandwidth Brokers of neighboring domains. A very important aspect of the BandwidthBroker is its admission control module that determines whether the bandwidth reservation requests are going to be accepted or not. We summarize the status of the current research in this field and propose a novel architecture for the admission control module that aims at achieving a satisfactory balance between maximizing the resource utilization for the network provider and minimizing the overhead of the module. This is achieved by gathering and examining sets of book-ahead requests and by adapting the size of the set to be examined so that the network utilization and the computation overhead are appropriately balanced.

show abstract

Competitive video on demand schedulers for popular movies

Cited by 9 publications

References 26 publications

Design and Analysis of Online Batching Systems

Design and Analysis of Online Batching Systems

An efficient architecture for Bandwidth Brokers in DiffServ networks

An adaptive admission control algorithm for bandwidth brokers

Contact Info

Product

Resources

About