Design of Congestion Control Protocol for Wireless Networks With Small Flow Completion Time
Atul M. Gonsai, Bhargavi Goswami, Udit Narayan Kar · 2014
Why the flow completion time must be faster for congestion control algorithms? How the existing and newly proposed congestion control algorithms are far away from minimizing download times? And now the question remains is how to bring solution to the tough problem of reducing flow completion time in theory and practically, especially for multimedia long flows over wireless networking equipments. When internet users are downloading web page, downloading a file, sending an attachment, send/read mail, always involve the network in almost any interaction. Every user wishes to complete the transaction in the time as small as possible. Thus, each one over the internet demands smallest possible flow completion time. Nowadays, people are less concerned about network throughput, network efficiency, optimum network utility or packet drop rate or packet delivery ratio. They behave selfish wanting always to complete their flow as fast as possible. Here in this paper we are presenting the design of a newly created protocol called TCPBooster developed and suggested by us to reduce the limitations of existing congestion control protocol over wireless networks.