Networking requirements for interactive video on demand

Nussbaumer, J.-P.; Patel, B.; Schaffa, F.; Sterbenz, James P. G.

doi:10.1109/49.391753

Cited by 127 publications

(41 citation statements)

References 2 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Regular Q-ary trees are commonly used for the derivation of numerical results for algorithms operating on trees [37,10]; it has also be seen that numerical results from regular tree topologies are in good accordance with experimental results from actual internet tree topologies [38]. The entire set of parameters (demand and topology) for each experiment is indicated in the title of the corresponding graph.…”

Section: Numerical Results Under Igreedymentioning

confidence: 54%

On the optimization of storage capacity allocation for content distribution

Laoutaris¹,

Zissimopoulos²,

Stavrakakis³

2005

Computer Networks

View full text Add to dashboard Cite

The addition of storage capacity in network nodes for the caching or replication of popular data objects results in reduced end-user delay, reduced network traffic, and improved scalability.The problem of allocating an available storage budget to the nodes of a hierarchical content distribution system is formulated; optimal algorithms, as well as fast/efficient heuristics, are developed for its solution. An innovative aspect of the presented approach is that it combines all relevant subproblems, concerning node locations, node sizes, and object placement, and solves them jointly in a single optimization step. The developed algorithms may be utilized in content distribution networks that employ either replication or caching/replacement. In addition to reducing the average fetch distance for the requested content, they also cater to load balancing and workload constraints on a given node. Strictly hierarchical, as well as hierarchical with peering, request routing models are considered.

show abstract

Section: Numerical Results Under Igreedymentioning

confidence: 54%

On the optimization of storage capacity allocation for content distribution

Laoutaris¹,

Zissimopoulos²,

Stavrakakis³

2005

Computer Networks

View full text Add to dashboard Cite

show abstract

“…Among the first to mention that intermediate servers in a hierarchical VoD distribution system can decrease cost are Nussbaumeret.al. [11], who provided also simple arguments for this.…”

Section: Related Workmentioning

confidence: 99%

“…While they do not consider the aging of individual movies, because they still need a short-term model, they consider the distribution of hits on the available videos and chose the Zipf distribution to model the video popularity. Nussbaumer, aiming at optimizing the cache usage in a single server system or cluster, also assumes the Zipf distribution ( [4]) to model video popularity ( [11]). The distribution of movies or blocks of single movies over multiple machines for load-levelling or availability purposes has been investigated in [3].…”

Section: Related Workmentioning

confidence: 99%

Life-Cycle Considerations for Wide-Area Distribution of Multimedia Data

Griwodz

Steinmetz²

1999

High-Performance Networks for Multimedia Applications

View full text Add to dashboard Cite

Abstract:Various applications for world-wide multimedia object distribution arise currently as more and more companies integrate streamed continuous media elements in their web pages and as TV broadcasters add computer programs and data to their video streams.Currently, the streams that can be found on the web have only very small data volume, but as network capacities increase, the data volume that is used by applications will also be increased. TV applications have a lack of networking support and are unable to give feedback to the sender. In the future the integration of computer networks, telephony and broadcast networks will achieve a functional integration of these two worlds.But as the amount of continuous media data which is offered for everybody to retrieve increases, simple caching mechanisms that work currently well will not be appropriate any more. To address this danger, the introduction of distribution mechanisms which provide more coordination among caches is necessary. As a basis for such a development, we investigate the probability of movies to be requested. This is chosen as a starting point because the current simple caching mechanisms operate very successfully for small-volume data such as text or icons, and high-quality movies are currently the most attractive medium which has the very high requirements in terms of storage as well as bandwidth. In this paper, we review current models on access probabilities and we give strong indication that the current assumptions about hit rates are invalid if the number of users connecting to an individual server differ widely. Since on-demand retrieval of large continuous media streams (especially movies) is currently available only as music CD and movie rental or sale, we take that data as a basis to create a model for access probabilities on this most storage-and bandwidth-demanding multimedia data. 168CHAPTER 10

show abstract

“…Particularly, for video applications, the case we are interested in, several network architectures have been developed that enable users to have access to a wide range of video programs on demand. In the following sections we examine a hierarchical architecture for a VoD distributed network, which fits the existing tree topology used in today's cable TV systems [2], [18], [20], [21].…”

Section: Introductionmentioning

confidence: 99%

“…Notice that the utilization of a node depends on the level it belongs to. As we move down 2 We have also simulated two additional scenarios in which the streams have ADUs with uniform length distribution in the intervals [1,5] and [1,20], respectively. However, due to lack of space we omit these results.…”

mentioning

confidence: 99%

Performance Evaluation of the Deadline Credit Scheduling Algorithm for Soft-Real-Time Applications in Distributed Video-on-Demand Systems

Alexandraki

Paterakis

2005

Cluster Comput

View full text Add to dashboard Cite

Video-on-Demand (VoD) systems are expected to support a variety of multimedia services to the users, such as tele-education, teleconference, remote working, videotelephony, highdefinition TV, etc. These applications necessitate abundant bandwidth and buffer space as well as appropriate software and hardware for the efficient manipulation of the network's resources.In this work we investigate a promising scheduling algorithm referred to as the Deadline Credit (DC) algorithm, which exploits the available bandwidth and buffer space to serve a diverse class of prerecorded video applications. We provide simulation results when the DC algorithm is applied to a hierarchical architecture distributed VoD network, which fits the existing tree topology used in today's cable TV systems. The issues investigated via the simulations are: the system utilization, the influence of the buffer space on the delivered Quality of Service, and the fairness of the scheduling mechanism. We examine cases with homogenous as well as diverse video streams, and extend our system to support interactive VCR-like functions. We also contribute a modification to the DC algorithm so that in cases when the video applications have different displaying periods, the video streams obtain a fair share of the network's resources. Finally, we validate our results by simulating actual videos encoded in MPEG-4 and H.263 formats.Keywords: Scheduling video applications, distributed VoD systems, MPEG-4, H.263, VCR-like operations. IntroductionTelecommunication networks have lately extended to support a variety of services to the users such as tele-education, teleconference, remote working, videotelephony, high-definition TV, web video streaming, etc. These applications dictate the need for high-speed networks, and also necessitate the appropriate software and hardware for the efficient integration of a diverse class of applications with different characteristics. These demanding requirements led to the concept of broadband integrated digital networks (B-ISDN), which are systems of high capabilities that enable the transmission of several different applications.Several research areas have been developed in order to increase the efficiency of the network and keep the Quality of Services (QoS) at a satisfactory level. One significant area that affects the quality provided by the network is the scheduling process. Since several applications should be concurrently serviced, the role of the scheduling process is to select each time the application that should be served next.The applications that telecommunication networks support are generally classified into two categories based on the delay that they can undergo during connection: the real time and the nonreal time applications. Real time applications involve a kind of interactivity and consequently can tolerate no delay. The characteristic of these applications is that the network's resources which provide the services need to be reserved for the duration of the connection. This necessitates ample bandwi...

show abstract

Networking requirements for interactive video on demand

Cited by 127 publications

References 2 publications

On the optimization of storage capacity allocation for content distribution

On the optimization of storage capacity allocation for content distribution

Life-Cycle Considerations for Wide-Area Distribution of Multimedia Data

Performance Evaluation of the Deadline Credit Scheduling Algorithm for Soft-Real-Time Applications in Distributed Video-on-Demand Systems

Contact Info

Product

Resources

About