IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.00 |
Most application-level data units are too large to be carried in a single packet (or cell) and must be fragmented for network delivery. For many applications, the end-to-end delays and loss rate of their data units are much more relevant measures of performance than QoS parameters specified for individual packets (or cells). The concept of a block (or burst) was introduced to represent a sequence of cells which may contain an entire application data unit, a portion of one, or multiple application data units. In this paper, we describe how a real-time VBR service with QoS parameters for block transfer delay, block loss rate, and block delay variation, can be provided by integrating concepts and delay guarantee results from our previous work on burst scheduling, together with ideas from ATM block transfer and hierarchical link sharing. Two new contributions are presented. First, we show how to extend existing end-to-end delay bounds for bursts to networks with hierarchical link sharina. Second, 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 with a specified block loss rate.