Analysis and simulation of a fair queueing algorithm
SIGCOMM '89 Symposium proceedings on Communications architectures & protocols
Connections with multiple congested gateways in packet-switched networks part 1: one-way traffic
ACM SIGCOMM Computer Communication Review
Random early detection gateways for congestion avoidance
IEEE/ACM Transactions on Networking (TON)
Efficient fair queueing using deficit round-robin
IEEE/ACM Transactions on Networking (TON)
The performance of TCP/IP for networks with high bandwidth-delay products and random loss
IEEE/ACM Transactions on Networking (TON)
Dynamics of random early detection
SIGCOMM '97 Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communication
Fair end-to-end window-based congestion control
IEEE/ACM Transactions on Networking (TON)
The BLUE active queue management algorithms
IEEE/ACM Transactions on Networking (TON)
IEEE/ACM Transactions on Networking (TON)
General AIMD congestion control
ICNP '00 Proceedings of the 2000 International Conference on Network Protocols
Controlling High-Bandwidth Flows at the Congested Router
ICNP '01 Proceedings of the Ninth International Conference on Network Protocols
Approximate fairness through differential dropping
ACM SIGCOMM Computer Communication Review
Scalable TCP: improving performance in highspeed wide area networks
ACM SIGCOMM Computer Communication Review
The Mathematics of Internet Congestion Control (Systems and Control: Foundations and Applications)
The Mathematics of Internet Congestion Control (Systems and Control: Foundations and Applications)
Understanding CHOKe: throughput and spatial characteristics
IEEE/ACM Transactions on Networking (TON)
A stochastic model of TCP/IP with stationary random losses
IEEE/ACM Transactions on Networking (TON)
Achieving End-to-end Fairness in 802.11e Based Wireless Multi-Hop Mesh Networks Without Coordination
Mobile Networks and Applications
Generalizing the CHOKe flow protection
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |
Making drop decisions to enforce the max-min fair resource allocation in a network of standard TCP flows without any explicit state information is a challenging problem. Here we propose a solution to this problem by developing a suite of stateless queue management schemes that we refer to as Multi-Level Comparison with index l (MLC(l)). We show analytically, using a Markov chain model, that for an arbitrary network topology of standard TCP flows and queues employing MLC(l), the resource allocation converges to max-min fair as l increases. The analytical findings are verified experimentally using packet level ns2 simulations.