VirtualClock: a new traffic control algorithm for packet-switched networks
ACM Transactions on Computer Systems (TOCS)
Delay guarantee of virtual clock server
IEEE/ACM Transactions on Networking (TON)
IEEE/ACM Transactions on Networking (TON)
Hierarchical packet fair queueing algorithms
IEEE/ACM Transactions on Networking (TON)
Rate-proportional servers: a design methodology for fair queueing algorithms
IEEE/ACM Transactions on Networking (TON)
Time-shift scheduling—fair scheduling of flows in high-speed networks
IEEE/ACM Transactions on Networking (TON)
Latency-rate servers: a general model for analysis of traffic scheduling algorithms
IEEE/ACM Transactions on Networking (TON)
Providing guaranteed services without per flow management
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Measurement-based admission control with aggregate traffic envelopes
IEEE/ACM Transactions on Networking (TON)
Preserving quality of service guarantees in spite of flow aggregation
IEEE/ACM Transactions on Networking (TON)
Determining End-to-End Delay Bounds in Heterogeneous Networks
NOSSDAV '95 Proceedings of the 5th International Workshop on Network and Operating System Support for Digital Audio and Video
A simple model of real-time flow aggregation
IEEE/ACM Transactions on Networking (TON)
Scalable quality of service across multiple domains
Computer Communications
WF2Q: worst-case fair weighted fair queueing
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
| Hi-index | 0.00 |
Currently, the Internet provides mainly best effort services. As multimedia applications emerge, a demand for quality of service guarantees follows. Packet-scheduling protocols, such as Virtual Clock and Weighted Fair Queuing, were designed to fulfill this demand by reserving network resources for each individual packet stream (also known as flows). This leads to a scalability problem in the core of the network, because routers are expected to maintain state information for each individual flow. One method to mitigate this problem is to merge together into a single flow those flows following a common path through the core. This drastically reduces the number of flows managed by a router. Initial flow aggregation methods were non-work conserving. This prevents flows from taking advantage of unused bandwidth, that is, from exceeding their reserved rate when the network is lightly loaded. Recently, this was remedied with the introduction of work-conserving flow aggregation methods. However, these methods are unfair, i.e., a flow that takes advantage of unused bandwidth may temporarily be denied service from the network. In this paper, we propose a flow aggregation method that is fair, and thus, flows are not punished if they exceed their reserved rate. We show that this new method still conserves the end-to-end delay guarantee of work-conserving flow aggregation. Moreover, because of its fairness, it also provides an end-to-end throughput guarantee.