Most application-level data units are too large to be carried in a single packet (or cell) and must be segmented for network delivery. To an application, the end-toend delays and loss rate of its data units are much more relevant performance measures than ones specified for individual packets (or cells). The concept of a burst (or block) was introduced to represent a sequence of packets (or cells) that carry an application data unit. In this paper, we describe how a real-time VBR service, with QoS parameters for block transfer delay and block loss rate, can be provided by integrating concepts and delay guarantee results from our previous work on burst scheduling, together with ideas from ATM block transfer. Two new contributions are presented herein. First, we design an admission control algorithm to provide the following classes of service: bounded-delay block transfer with no loss, and bounded-delay block transfer at a specified block loss rate. Second, we show how to extend existing end-to-end delay bounds to networks with hierarchical link sharing.
|
1447
|
A Generalized Processor Sharing Approach to Flow Control
– Parekh
- 1992
|
|
646
|
A scheme for real-time channel establishment in wide-area networks
– Ferrari, Verma
- 1990
|
|
551
|
Supporting real-time applications in an integrated services packet network: Architecture and mechanism
– Clark, Shenker, et al.
- 1992
|
|
512
|
Virtual Clock: A New Traffic Control Algorithm for Packet Switching Networks
– Zhang
- 1991
|
|
454
|
Link-sharing and resource management models for packet networks
– Floyd, Jacobson
- 1995
|
|
381
|
Equivalent capacity and its application to bandwidth allocation in high-speed networks
– Guerin, Ahmadi, et al.
- 1991
|
|
282
|
Measurement-based Admission Control Algorithms for Controlled-load Service: A Structural Examination
– Jamin, Shenker
- 1997
|
|
251
|
Dynamics of TCP Traffic over ATM Networks
– Romanow, Floyd
- 1995
|
|
250
|
Analysis and Simulation of a Fair Queuing Algorithm
– Demers, Keshav, et al.
- 1989
|
|
247
|
Hierarchical packet fair queueing algorithms
– Bennett, Zhang
- 1996
|
|
216
|
Efficient fair queueing using deficit round robin
– Shreedhar, Varghese
- 1995
|
|
157
|
RCBR: A Simple and Efficient Service for Multiple Time-Scale Traffic
– Grossglauser, Keshav, et al.
- 1995
|
|
155
|
Probability theory
– Loève
- 1955
|
|
153
|
Start-time fair queueing: A scheduling algorithm for integrated servicepacket switching networks
– Goyal, Vin, et al.
- 1996
|
|
97
|
Large Deviations for Performance Analysis
– SHWARTZ, WEISS
- 1993
|
|
64
|
A reservation principle with applications to the ATM traffic control
– Boyer, Tranchier
- 1992
|
|
59
|
Predictive Dynamic Bandwidth Allocation for Efficient Transportof RealTime VBR Video over ATM
– Chong, Li, et al.
- 1995
|
|
57
|
Delay Guarantee of Virtual Clock Server
– Xie, Lam
- 1995
|
|
54
|
Resource management in wide-area ATM networks using effective bandwidths
– Veciana, Kesidis, et al.
- 1995
|
|
45
|
Maintaining High Throughput during Overload in ATM Switches
– Turner
- 1996
|
|
44
|
A simulation study of fair queueing and policy enforcement
– Davin, Heybey
- 1990
|
|
44
|
A Self-Clocked Fair Queueing Scheme for High Speed Applications
– Golestani
- 1994
|
|
43
|
RED-VBR: A Renegotiation-Based Approach to Support Delay-Sensitive VBR Video
– Zhang, Knightly
- 1997
|
|
36
|
Leave-in-Time: A New Service Discipline for Real-Time Communications in a PacketSwitching Data Network", SIGCOMM
– Figueira, Pasquale
- 1995
|
|
27
|
Burst scheduling: Architecture and algorithm for switching packet video
– Lam, Xie
- 1995
|
|
23
|
The available bit rate service for data in ATM networks
– Chen, Liu, et al.
- 1996
|
|
22
|
Performance bounds in communication networks with variable-rate links
– Lee
- 1995
|
|
20
|
Group priority scheduling
– Lam, Xie
- 1996
|
|
17
|
Quality-of-Service Issues in High-Speed Networks
– Nagarajan
- 1993
|
|
8
|
Traffic Control and Congestion Control in B-ISDN
– 371
|
|
6
|
Burst scheduling networks
– Lam, Xie
- 1994
|
|
4
|
Admission control and loss management for an application-level statistical service
– Xie, Lam
- 1997
|
|
3
|
Burst scheduling networks. Performance Evaluation
– Lam, Xie
- 1997
|
|
3
|
Analysis of burstiness and jitter in real-time communications
– Wang, Crowcroft
- 1993
|
|
1
|
A simulation of fair queueing and policy enforcement
– Davin, Heybey
- 1990
|
|
1
|
priority scheduling
– “Group
- 1997
|
|
1
|
Delay guarantee of virtual Clark server
– Xie, Lam
- 1995
|
|
1
|
block transfer under a link sharing hierarchy
– “Real-time
- 1997
|
|
