Data networks
Feedback control of congestion in packet switching networks: the case of a single congested node
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
Space/time trade-offs in hash coding with allowable errors
Communications of the ACM
TCP performance over end-to-end rate control and stochastic available capacity
IEEE/ACM Transactions on Networking (TON)
On the use and performance of content distribution networks
IMW '01 Proceedings of the 1st ACM SIGCOMM Workshop on Internet Measurement
Feedback Consolidation Algorithm for ABR Point to Multipoint Connections in ATM Networks
ICON '01 Proceedings of the 9th IEEE International Conference on Networks
Bitmap algorithms for counting active flows on high speed links
Proceedings of the 3rd ACM SIGCOMM conference on Internet measurement
Design and performance evaluation of a rate feedback control architecture for TCP/IP networks
PCC '02 Proceedings of the Performance, Computing, and Communications Conference, 2002. on 21st IEEE International
Hi-index | 0.00 |
In current Internet, applications employ lots of sessions with multiple connections between multiple senders and receivers. Sessions or users with more connections gain higher throughput. To obtain more network resource, applications tend to create more connections. It causes unfair bandwidth allocation by per-connection TCP rate allocation and the network suffers lots of TCP overheads. In this paper, we explore the issue on fair share allocation of bandwidth among sessions or users. Various fairness definitions are discussed in this study. Then, we propose a novel distributed scheme to achieve various fairness definitions. Simulation results show that our distributed scheme could achieve fair allocation according to each fairness definition.