Self-similarity in World Wide Web traffic: evidence and possible causes
IEEE/ACM Transactions on Networking (TON)
Congestion control for high bandwidth-delay product networks
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
The War between Mice and Elephants
ICNP '01 Proceedings of the Ninth International Conference on Network Protocols
Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
Processor sharing flows in the internet
IWQoS'05 Proceedings of the 13th international conference on Quality of Service
| Hi-index | 0.00 |
Most existing end-to-end congestion control protocols employ packet loss or round-trip delay to imply network congestion. However, this kind of implicit signal mechanism may not work well in heterogeneous networks. Recently some router-assisted congestion control protocols are proposed to address this challenge and Quick Flow Control Protocol (QFCP) is one of them. QFCP allows flows to start with high initial sending rates and to converge to the fair-share rate quickly based on feedback from routers. The rate allocation algorithm is quite simple and only needs to be run periodically by routers. We have implemented QFCP in ns-2. Simulations have been done to address the issues such as flow completion time of Poisson-arriving Pareto-distributed-size flows, adaptability to changing flow numbers, fairness on flows with different RTTs, robustness to non-congestion packet losses, and performance on multiple bottleneck links. The preliminary results are promising.