Congestion avoidance and control
SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
A delay-based approach for congestion avoidance in interconnected heterogeneous computer networks
ACM SIGCOMM Computer Communication Review
A control-theoretic approach to flow control
SIGCOMM '91 Proceedings of the conference on Communications architecture & protocols
IEEE/ACM Transactions on Networking (TON)
Random early detection gateways for congestion avoidance
IEEE/ACM Transactions on Networking (TON)
TCP Vegas: new techniques for congestion detection and avoidance
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
TCP and explicit congestion notification
ACM SIGCOMM Computer Communication Review
Efficient fair queueing using deficit round robin
SIGCOMM '95 Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Measuring bottleneck link speed in packet-switched networks
Performance Evaluation
Improving the start-up behavior of a congestion control scheme for TCP
Conference proceedings on Applications, technologies, architectures, and protocols for computer communications
Rate-proportional servers: a design methodology for fair queueing algorithms
IEEE/ACM Transactions on Networking (TON)
End-to-end internet packet dynamics
IEEE/ACM Transactions on Networking (TON)
The ERICA switch algorithm for ABR traffic management in ATM networks
IEEE/ACM Transactions on Networking (TON)
Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication
Measuring link bandwidths using a deterministic model of packet delay
Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication
IEEE/ACM Transactions on Networking (TON)
Stateless core: a scalable approach for quality of service in the internet
Stateless core: a scalable approach for quality of service in the internet
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
Credit-based flow control for ATM networks
IEEE Network: The Magazine of Global Internetworking
| Hi-index | 0.00 |
Fair bandwidth sharing has been an active research area since the early days of networking. Today's networks employ packet dropping as the primary mechanism for reacting to congestion, while transport layer protocols are designed to adapt their rates based on the observed packet losses. Due to the increasing transmission speed and a disproportionate decrease in the end-to-end delay, future networks are expected to have a high bandwidth-delay product as compared to the networks of today. The cost of a packet retransmission increases with the increase in the bandwidth-delay product and decrease in buffer sizes. Hence, there is a need to develop new techniques, for a future clean-slate network design, to achieve fair bandwidth sharing that do not primarily rely on packet dropping. To this end, this paper develops a framework for fair bandwidth sharing called Access Mechanism for Efficient Sharing (AMES), where every core router in the network employs link-specific queuing, round-robin scheduling, and reacts to congestion by restricting the adjacent routers from transmitting, rather than dropping packets. The core-routers do not maintain any perflow information, nor perform any flow-specific operation. We demonstrate the link utilization and fairness characteristics of the AMES framework through extensive simulations and compare it to the Core Stateless Fair Queuing (CSFQ) architecture developed in the literature.