Analysis and simulation of a fair queueing algorithm
SIGCOMM '89 Symposium proceedings on Communications architectures & protocols
End-to-end routing behavior in the Internet
Conference proceedings on Applications, technologies, architectures, and protocols for computer communications
Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
A wireless fair service algorithm for packet cellular networks
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
Achieving Per-Flow Weighted Rate Fairness in a Core Stateless Network
ICDCS '00 Proceedings of the The 20th International Conference on Distributed Computing Systems ( ICDCS 2000)
Hi-index | 0.00 |
Several router mechanisms have been proposed to achieve fair rate allocations. However, most of them require the proposed mechanisms to be deployed at all routers within an autonomous domain in order to achieve the desired, or any appreciably improved, quality of service. In this paper, we present an incrementally deployable QoS architecture called iQ. iQ consists of a set of core- and edge-router mechanisms that allow for changing one router at a time, improving the rate fairness provided by the network gracefully, for each additional iQ router deployed. We use simulations to compare the incremental deployability of the iQ architecture with that of existing approaches.