Paper Info
Title
Real-time block transfer under a link-sharing hierarchy
Abstract
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-to-end 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.
Year
DOI
Venue
1997
10.1109/90.663938
IEEE/ACM Transactions on Networking
Keywords
Field
DocType
Asynchronous transfer mode,Delay,Protocols,Bandwidth,Performance loss,Loss measurement,Quality of service,Admission control,Throughput,Switches
Admission control,Computer science,Scheduling (computing),Network packet,Quality of service,Computer network,Asynchronous Transfer Mode,Bandwidth (signal processing),Throughput,Variable bitrate,Distributed computing
Conference
Volume
Issue
ISSN
6
1
1063-6692
ISBN
Citations 
PageRank 
0-8186-7780-5
11
0.67
References 
Authors
27
2
Name
Order
Citations
PageRank
Geoffrey G. Xie179397.20
Simon S. Lam235161370.30