![](/jspui/image/dspace_header.jpg)
Please use this identifier to cite or link to this item:
https://idr.nitk.ac.in/jspui/handle/123456789/13964
Title: | Congestion controlling schemes for high-speed data networks: A survey |
Authors: | Kharat P. Kulkarni M. |
Issue Date: | 2019 |
Citation: | Journal of High Speed Networks, 2019, Vol.25, 1, pp.41-60 |
Abstract: | The data networks are basically designed with the aim of maximum throughput and fair resource allocation by managing available resources. A transport layer plays an important role in throughput and fairness with the help of congestion control algorithms (variants). This survey targets mainly congestion issues in high-speed data networks to improve efficiency at connection or flow level. Transmission Control Protocol (TCP) is a dominating transport layer protocol in the existing network because of its reliable service and deployment in most of the routers. A cause of congestion may be different in wired and wireless network and needs to be handled separately. Packet delay, packet loss and time out (RTO) are not caused by congestion in case of wireless network. This has been taken into account in our consideration. To overcome the dominance of TCP, Google proposed UDP based solution to handle congestion control and reliable service with minimum latency and control overhead. In the literature several methods are proposed to classify transport layer Protocols. In this survey congestion control proposals are classified based on situation handled by the algorithm such as pure congestion, link loss, packet reordering, path optimization etc. and at the end congestion control at flow level has been addressed. © 2019 - IOS Press and the authors. |
URI: | 10.3233/JHS-190602 http://idr.nitk.ac.in/jspui/handle/123456789/13964 |
Appears in Collections: | 5. Miscellaneous Publications |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
4 Congestion controlling schemes.pdf | 460.61 kB | Adobe PDF | ![]() View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.