Analysis and simulation of a fair queueing algorithm
SIGCOMM '89 Symposium proceedings on Communications architectures & protocols
Virtual clock: a new traffic control algorithm for packet switching networks
SIGCOMM '90 Proceedings of the ACM symposium on Communications architectures & protocols
IEEE/ACM Transactions on Networking (TON)
Dynamics of TCP traffic over ATM networks
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
Performance bounds in communication networks with variable-rate links
SIGCOMM '95 Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Delay guarantee of virtual clock server
IEEE/ACM Transactions on Networking (TON)
Link-sharing and resource management models for packet networks
IEEE/ACM Transactions on Networking (TON)
Hierarchical packet fair queueing algorithms
Conference proceedings on Applications, technologies, architectures, and protocols for computer communications
Start-time fair queueing: a scheduling algorithm for integrated services packet switching networks
Conference proceedings on Applications, technologies, architectures, and protocols for computer communications
Group Priority Scheduling
Real-time block transfer under a link-sharing hierarchy
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 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.