A game-theoretic approach towards congestion control in communication networks
ACM SIGCOMM Computer Communication Review
Explicit window adaptation: a method to enhance TCP performance
IEEE/ACM Transactions on Networking (TON)
Rate allocation and buffer management for differentiated services
Computer Networks: The International Journal of Computer and Telecommunications Networking - Special issue: Towards a new internet architecture
ICN '01 Proceedings of the First International Conference on Networking-Part 1
Tuning of QoS Aware Load Balancing Algorithm (QoS-LB) for Highly Loaded Server Clusters
ICN '01 Proceedings of the First International Conference on Networking-Part 2
Evaluating the number of active flows in a scheduler realizing fair statistical bandwidth sharing
SIGMETRICS '05 Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Random Early Detection method for ABR service
Computers and Electrical Engineering
Opportunistic link overbooking for resource efficiency under per-flow service guarantee
IEEE Transactions on Communications
Fast track article: Least attained recent service for packet scheduling over access links
Pervasive and Mobile Computing
Application performance and service differentiation for best effort traffic in ATM networks
Computer Communications
Adaptive prediction based approach for congestion estimation (APACE) in active queue management
Computer Communications
| Hi-index | 0.07 |
There has been much interest in using active queue management in routers in order to protect users from connections that are not very responsive to congestion notification. An Internet draft recommends schemes based on random early detection for achieving these goals, to the extent that it is possible, in a system without “per-flow” state. However, a “stateless” system with first-in/first-out (FIFO) queueing is very much handicapped in the degree to which flow isolation and fairness can be achieved. Starting with the observation that a “stateless” system is but one extreme in a spectrum of design choices and that per-flow queueing for a large number of flows is possible, we present active queue management mechanisms that are tailored to provide a high degree of isolation and fairness for TCP connections in a gigabit IP router using per-flow queueing. We show that IP flow state in a router can be bounded if the scheduling discipline used has finite memory, and we investigate the performance implications of different buffer management strategies in such a system. We show that merely using per-flow scheduling is not sufficient to achieve effective isolation and fairness, and it must be combined with appropriate buffer management strategies