Nothing Special   »   [go: up one dir, main page]

skip to main content
10.1145/3102304.3105574acmotherconferencesArticle/Chapter ViewAbstractPublication PagesicfndsConference Proceedingsconference-collections
research-article

A Parametric Study for Congestion Control in Queuing Networks

Published: 19 July 2017 Publication History

Abstract

Congestion avoidance mechanisms are used to prevent the saturation of the bottleneck under mean-field domain where large numbers of TCP connections interact with one another. It is clear that selections of parameters play an important role on the performance of networks. In the queuing networks, where numbers of TCP connection are too many, there is very high level of incoming traffic at the bottleneck. In order to avoid the congestion at the bottleneck, Random Early Detection (RED) algorithm is implemented and proven of good performance. To improve the existing performance, reported in previous works, this study demonstrates the impact of constant parameters on the performance of queuing networks and justifies with simulation results.

References

[1]
G. Abbas, Z. Halim, and Z. H. Abbas. 2016. Fairness-driven queue management: a survey and taxonomy. IEEE Communications Surveys & Tutorials 18, 1 (2016), 324-367.
[2]
M. Duke, E. Blanton, A. Zimmermann, R. Braden, and W. Eddy. 2015. A roadmap for transmission control protocol (TCP) specifiation documents. (2015).
[3]
K. R. Fall and W. R. Stevens. 2011. TCP/IP illustrated, volume 1: The protocols. addison-Wesley.
[4]
S. Floyd. 1994. TCP and Explicit Congestion notification. ACM SIGCOMM Computer Communication Review 24, 5 (1994), 8-23.
[5]
S. Floyd and Van Jacobson. 1993. Random early detection gateways for congestion avoidance. IEEE/ACM Transactions on Networking 1, 4 (1993), 397-413.
[6]
E. Kohler, M. Handley, and S. Floyd. 2006. Designing DCCP: Congestion control without reliability. In ACM SIGCOMM Computer Communication Review, Vol. 36. ACM, 27-38.
[7]
A. Kuzmanovic, A. Mondal, and S. Floyd. 2009. K. Ramakrishnan," Adding Explicit Congestion Notification (ECN) Capability to TCPâAZs SYN. Technical Report. ACK Packets", RFC 5562.
[8]
A. Langley. 2008. Probing the viability of TCP extensions. Google, Inc., Tech. Rep (2008).
[9]
S. Liu, T. Basar, and R. Srikant. 2008. TCP-Illinois: A loss-and delay-based congestion control algorithm for high-speed networks. Performance Evaluation 65, 6 (2008), 417-440.
[10]
R. Lübben and M. Fidler. 2016. On characteristic features of the application level delay distribution of TCP congestion avoidance. In Communications (ICC), 2016 IEEE International Conference on. IEEE, 1-7.
[11]
A. Medina, M. Allman, and S. Floyd. 2005. Measuring the evolution of transport protocols in the internet. ACM SIGCOMM Computer Communication Review 35, 2 (2005), 37-52.
[12]
OPNET Modeler. 2009. Opnet technologies inc. (2009).
[13]
S. Patel, S. Bhatnagar, and others. 2016. Adaptive mean queue size and its rate of change: queue management with random dropping. Telecommunication Systems (2016), 1-15.
[14]
R Srikant. 2004. The Mathematics of Internet Congestion Control. Springer, New Delhi, India.
[15]
B. Trammell and J. Hildebrand. 2014. Evolving transport in the internet. IEEE Internet Computing 18, 5 (2014), 60-64.

Cited By

View all
  • (2021)Prediction of Scenarios for Routing in MANETs Based on Expanding Ring Search and Random Early Detection Parameters Using Machine Learning TechniquesIEEE Access10.1109/ACCESS.2021.30678169(47033-47047)Online publication date: 2021

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Other conferences
ICFNDS '17: Proceedings of the International Conference on Future Networks and Distributed Systems
July 2017
325 pages
ISBN:9781450348447
DOI:10.1145/3102304
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

In-Cooperation

  • LABSTICC: Labsticc

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 19 July 2017

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. Congestion control
  2. Queuing Networks
  3. Random Early Detection
  4. TCP

Qualifiers

  • Research-article

Conference

ICFNDS '17

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)2
  • Downloads (Last 6 weeks)0
Reflects downloads up to 22 Nov 2024

Other Metrics

Citations

Cited By

View all
  • (2021)Prediction of Scenarios for Routing in MANETs Based on Expanding Ring Search and Random Early Detection Parameters Using Machine Learning TechniquesIEEE Access10.1109/ACCESS.2021.30678169(47033-47047)Online publication date: 2021

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media