Home  |   Login  |   Logout  |   Access Information  |   Alerts  |   Purchase History  |   Cart  |   Sitemap  |   Help   
 
Abstract
BROWSE SEARCH IEEE XPLORE GUIDE SUPPORT
arrow_left View Search Results  
Email/Printer Friendly Format  
 

Deterministic delay bounds for VBR video in packet-switching networks: fundamental limits and practical trade-offs

Wrege, D.E.   Knightly, E.W.   Hui Zhang   Liebeherr, J.  
Dept. of Comput. Sci., Virginia Univ., Charlottesville, VA, USA;
This paper appears in: Networking, IEEE/ACM Transactions on
Publication Date: June 1996
Volume: 4 , Issue: 3
On page(s): 352 - 362
ISSN: 1063-6692
Digital Object Identifier: 10.1109/90.502234
Current Version Published: 2002-08-06

Abstract
Compressed digital video is one of the most important traffic types in future integrated services networks. However, a network service that supports delay-sensitive video imposes many problems since compressed video sources are variable bit rate (VBR) with a high degree of burstiness. In this paper, we consider a network service that can provide deterministic guarantees on the minimum throughput and the maximum delay of VBR video traffic. A common belief is that due to the burstiness of VBR traffic, such a service will not be efficient and will necessarily result in low network utilization. We investigate the fundamental limits and trade-offs in providing deterministic performance guarantees to video and use a set of 10 to 30 min. long MPEG-compressed video traces for evaluation. Contrary to conventional wisdom, we are able to show that, in many cases, a deterministic service can be provided to video traffic while maintaining a reasonable level of network utilization. We first consider an ideal network environment that employs the most accurate deterministic, time-invariant video traffic characterizations, the optimal earliest-deadline-first packet schedulers, and exact admission control conditions. The utilization achievable in this situation provides the fundamental limits of a deterministic service. We then investigate the utilization limits in a network environment that takes into account practical constraints, such as the need for simple and efficient policing mechanisms, packet scheduling algorithms, and admission control tests

Index Terms
Available to subscribers and IEEE members.

References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
You are not logged in.
Guests may access Abstract records free of charge.
Login
Username
Password
» Forgot your password?
Please remember to log out when you have finished your session.
You must log in to access:
• Advanced or Author Search
• CrossRef Search
• AbstractPlus Records
• Full Text PDF
• Full Text HTML
Access this document
Full Text PDF icon
Full Text: PDF (1044 KB)
» Buy this document now
» Learn more about
» Learn more about
   purchasing articles
   and standards
Rights and Permissions>
» Learn More
Download this citation
Available to subscribers and IEEE members.
 
arrow_left View Search Results  
Indexed by IEE Inspec
© Copyright 2010 IEEE – All Rights Reserved