TY - GEN
T1 - New flow control paradigm for next generation networks
AU - Pu, Jian
AU - Hamdi, Mounir
PY - 2006
Y1 - 2006
N2 - Quick Flow Control Protocol (QFCP) is a new congestion control protocol designed for high bandwidth-delay product networks. QFCP has two good features: "quick start" and "quick convergence". It allows a sender to start with a high initial sending rate identified by routers along the path, and all running flows converge to the fair-share sending rate quickly based on feedback from routers. Although it needs the assistance of routers, QFCP does not require routers to store any per-flow information or to do any complex per-packet calculation. The rate allocation algorithm is quite simple and only needs to be run periodically by routers. We have implemented QFCP in Network Simulator (NS). Simulations have been done to address the issues such as fairness, convergence, responsiveness and utilization, as well as flow completion time for Poison-arriving Paretodistributed-size flows. Performance evaluation of these simulations is presented in this paper. The preliminary results are promising.
AB - Quick Flow Control Protocol (QFCP) is a new congestion control protocol designed for high bandwidth-delay product networks. QFCP has two good features: "quick start" and "quick convergence". It allows a sender to start with a high initial sending rate identified by routers along the path, and all running flows converge to the fair-share sending rate quickly based on feedback from routers. Although it needs the assistance of routers, QFCP does not require routers to store any per-flow information or to do any complex per-packet calculation. The rate allocation algorithm is quite simple and only needs to be run periodically by routers. We have implemented QFCP in Network Simulator (NS). Simulations have been done to address the issues such as fairness, convergence, responsiveness and utilization, as well as flow completion time for Poison-arriving Paretodistributed-size flows. Performance evaluation of these simulations is presented in this paper. The preliminary results are promising.
UR - http://www.scopus.com/inward/record.url?scp=47649133253&partnerID=8YFLogxK
U2 - 10.1109/SARNOF.2006.4534801
DO - 10.1109/SARNOF.2006.4534801
M3 - Conference contribution
AN - SCOPUS:47649133253
SN - 1424400023
SN - 9781424400027
T3 - 2006 IEEE Sarnoff Symposium
BT - 2006 IEEE Sarnoff Symposium
PB - IEEE Computer Society
T2 - 2006 IEEE Sarnoff Symposium
Y2 - 27 March 2006 through 28 March 2006
ER -