Congestion avoidance and control
SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
Analysis of the increase and decrease algorithms for congestion avoidance in computer networks
Computer Networks and ISDN Systems
Making greed work in networks: a game-theoretic analysis of switch service disciplines
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
TCP and explicit congestion notification
ACM SIGCOMM Computer Communication Review
Internet Web servers: workload characterization and performance implications
IEEE/ACM Transactions on Networking (TON)
Modeling TCP throughput: a simple model and its empirical validation
Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
Differentiated end-to-end Internet services using a weighted proportional fair sharing TCP
ACM SIGCOMM Computer Communication Review
Promoting the use of end-to-end congestion control in the Internet
IEEE/ACM Transactions on Networking (TON)
Selfish behavior and stability of the internet:: a game-theoretic analysis of TCP
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
A Game Theoretic Approach to Decentralized Flow Control of Markovian Queueing Networks
Performance '87 Proceedings of the 12th IFIP WG 7.3 International Symposium on Computer Performance Modelling, Measurement and Evaluation
General AIMD congestion control
ICNP '00 Proceedings of the 2000 International Conference on Network Protocols
TCP-Friendly SIMD Congestion Control and Its Convergence Behavior
ICNP '01 Proceedings of the Ninth International Conference on Network Protocols
| Hi-index | 0.00 |
Relative differentiation in distributed resource sharing can be implemented using heterogeneous linear controls with binary feedback and this method can provide efficient and weighted max-min fair resource allocations. We prove this using a discrete-time model of a single resource, shared among a number of users with heterogeneous Additive Increase Multiplicative Decrease (AIMD) controls. AIMD has been implemented in the congestion avoidance mechanism of Internet's Transmission Control Protocol (TCP) and beyond its simplicity it has been proved extremely efficient and robust. We show how AIMD can be parametrized in order to allow the scaling of user allocations according to a given set of weights. We also analyze the effects of different parameter choices on the performance and the oscillating behaviour of the system. Our analysis is supported by simulations and the results provide useful insights to the performance and the properties of distributed resource sharing.