Abstract
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.
This research was supported in part by the Hong Kong Research Grant Council under Grant RGC HKUST6260/04E.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Katabi, D., Handley, M., Rohrs, C.: Congestion control for high bandwidth-delay product networks. In: Proceedings of ACM SIGCOMM 2002 the conference on applications, technologies, architectures, and protocols for computer communications, pp. 89–102. ACM Press, Pittsburgh (2002)
Xia, Y., Subramanian, L., Stoica, I., Kalyanaraman, S.: One more bit is enough. In: Proceedings of SIGCOMM 2005 the Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications, Philadelphia, Pennsylvania, USA (2005)
Dukkipati, N., Kobayashi, M., Zhang-Shen, R., McKeown, N.: Processor sharing flows in the internet. In: de Meer, H., Bhatti, N. (eds.) IWQoS 2005. LNCS, vol. 3552, pp. 271–285. Springer, Heidelberg (2005)
Crovella, M.E., Bestavros, A.: Self-similarity in World Wide Web traffic: evidence and possible causes. IEEE/ACM Transactions on Networking 5, 835–846 (1997)
Claffy, K., Miller, G., Thompson, K.: The Nature of the Beast: Recent Traffic Measurements from an Internet Backbone. In: Proceedings of INET 1998 (1998)
Liang, G., Matta, I.: The war between mice and elephants. In: Proceedings of ICNP, pp. 180–188 (2001)
Ebrahimi-Taghizadeh, S., Helmy, A., Gupta, S.: TCP vs. TCP: a systematic study of adverse impact of short-lived TCP flows on long-lived TCP flows. In: Proceedings of INFOCOM 2005, vol. 2, pp. 926–937 (2005)
Jain, A., Floyd, S., Allman, M., Sarolahti, P.: Quick-Start for TCP and IP. IETF Internet-draft, work in progress (2005)
Jin, C., Wei, D.X., Low, S.H.: FAST TCP: motivation, architecture, algorithms, performance. In: Proceedings of INFOCOM 2004 the Twenty-third Annual Joint Conference of the IEEE Computer and Communications Societies, vol. 4, pp. 2490–2501 (2004)
The network simulator ns-2, http://www.isi.edu/nsnam/ns
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Pu, J., Hamdi, M. (2009). QFCP: A Router-Assisted Congestion Control Mechanism for Heterogeneous Networks (Extended). In: Damiani, E., Yetongnon, K., Chbeir, R., Dipanda, A. (eds) Advanced Internet Based Systems and Applications. SITIS 2006. Lecture Notes in Computer Science, vol 4879. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-01350-8_11
Download citation
DOI: https://doi.org/10.1007/978-3-642-01350-8_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-01349-2
Online ISBN: 978-3-642-01350-8
eBook Packages: Computer ScienceComputer Science (R0)