WSEAS TRANSACTIONS on COMMUNICATIONS
Implement real-time transmission mechanism for VBR Stream under 802.16 wireless networks
AIC'08 Proceedings of the 8th conference on Applied informatics and communications
Journal of Network and Computer Applications
Window-games between TCP flows
Theoretical Computer Science
Distributed WFQ scheduling converging to weighted max-min fairness
Computer Networks: The International Journal of Computer and Telecommunications Networking
Fair flow control of ABR service by per-VC virtual queuing
Computer Communications
Design a novel fairness model in WiMAX mesh networks
Computer Communications
Energy-based rate adaptation for 802.11n
Proceedings of the 18th annual international conference on Mobile computing and networking
Throttling Tor bandwidth parasites
Security'12 Proceedings of the 21st USENIX conference on Security symposium
On the competitiveness of AIMD-TCP within a general network
Theoretical Computer Science
Multi-server generalized processor sharing
Proceedings of the 24th International Teletraffic Congress
On the compound impact of opportunistic scheduling and D2D communications in cellular networks
Proceedings of the 16th ACM international conference on Modeling, analysis & simulation of wireless and mobile systems
Decoupled speed scaling: Analysis and evaluation
Performance Evaluation
| Hi-index | 0.07 |
The author studies a simple strategy, proposed independently by E.L. Hahne and R.G. Gallager (1986) and M.G.H. Katevenis (1987), for fairly allocating link capacity in a point-to-point packet network with virtual circuit routing. Each link offers its packet transmission slots to its user sessions by polling them in round-robin order. In addition, window flow control is used to prevent excessive packet queues at the network nodes. As the window size increases, the session throughput rates are shown to approach limits that are perfectly fair in the max-min sense. If each session has periodic input (perhaps with jitter) or has such heavy demand that packets are always waiting to enter the network, then a finite window size suffices to produce perfectly fair throughput rates. The results suggest that the transmission capacity not used by the small window session will be approximately fairly divided among the large window sessions. The focus is on the worst-case performance of round-robin scheduling with windows