Efficient network QoS provisioning based on per node traffic shaping
IEEE/ACM Transactions on Networking (TON)
Efficient support of delay and rate guarantees in an internet
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
Generalized guaranteed rate scheduling algorithms: a framework
IEEE/ACM Transactions on Networking (TON)
Real-Time Systems - Flexible Scheduling on Real-Time Systems
Performance Evaluation of Resource Division Policies for PGPS Scheduling in ATM Networks
NETWORKING '00 Proceedings of the IFIP-TC6 / European Commission International Conference on Broadband Communications, High Performance Networking, and Performance of Communication Networks
An integrated platform for quality-of-service support in mobile multimedia clustered ad hoc networks
The handbook of ad hoc wireless networks
Minimizing end-to-end delay in high-speed networks with a simple coordinated schedule
Journal of Algorithms
Efficient network QoS provisioning based on per node traffic shaping
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 1
TCP ACK Pacing in ATM networks
Computer Communications
| Hi-index | 0.00 |
In this paper, we define a class of generalized Guaranteed Rate (GR) scheduling algorithms that includes algorithms which allocate variable rate to packets of a flow. We demonstrate that several work conserving and non-work conserving algorithms that either only allocate rate or separate rate and delay allocation belong to GR. We define work conserving generalized Virtual Clock, Packet-by-Packet Generalized Processor Sharing and Self Clocked Fair Queuing scheduling algorithms that can allocate variable rate to the packets of a flow. We also define scheduling algorithms suitable for servers where packet fragmentation may occur. We demonstrate that if a class of rate controllers is employed for a flow in conjunction with any scheduling algorithm in GR, then the resulting non-work conserving algorithm also belongs to GR. This leads to the definition of several non-work conserving algorithms. We then present a method for deriving the delay guarantee of a network of servers when: (1) different rates are allocated to packets of a flow at different servers along the path and the bottleneck server for each packet may be different, and (2) packet fragmentation and/or reassembly may occur. This delay guarantee enables a network to provide various service guarantees to flows conforming to any specification. We illustrate this by utilizing delay guarantee to derive delay bounds for flows conforming to Leaky Bucket, Exponentially Bounded Burstiness and Flow Specification. Our method for determining these bounds is not only simple and valid in internetworks, but also leads to tighter results. We finally present architectural principles for the design of networks that employ scheduling algorithms in GR class. We demonstrate that GR class not only simplifies the design of networks, but also provides support for application with different characteristics and requirements.