Analysis of the increase and decrease algorithms for congestion avoidance in computer networks
Computer Networks and ISDN Systems
Resource control for elastic traffic in CDMA networks
Proceedings of the 8th annual international conference on Mobile computing and networking
Enhancing TCP fairness in ad hoc wireless networks using neighborhood RED
Proceedings of the 9th annual international conference on Mobile computing and networking
End-to-end congestion control schemes: utility functions, random losses and ECN marks
IEEE/ACM Transactions on Networking (TON)
IEEE Network: The Magazine of Global Internetworking
Hi-index | 0.00 |
In this paper we propose an approach to increase TCP’s fairness in multihop wireless networks, using ECN as a congestion signalling mechanism. The novel idea we introduce is that the marking probability at a wireless node is a function of the aggregate utilization in the node’s neighborhood, which is determined by the sum of the receiving rates of all nodes within its collision domain. A node’s received rate can be communicated to neighboring nodes by piggy-backing it on control packets, such as CTS and RTS messages, or data packets. Simulation results demonstrate that our approach can improve TCP’s fairness in a multihop wireless network compared to drop tail queueing, while achieving the same aggregate throughput. Moreover, the proposed approach yields smaller average packet delay and delay jitter compared to drop tail queueing.