Nothing Special   »   [go: up one dir, main page]
Skip to main content
Springer Nature Link
Log in

Development of a Real-Time Dynamic Weighting Method in Routing for Congestion Control: Application and Analysis

  • Published:
Wireless Personal Communications Aims and scope Submit manuscript

Abstract

Congestion control issues have received consistent attention from several telecommunication researchers and practitioners for many years because network congestion often causes significant packet loss and delay problems. Although many suggested methods for these issues and problems can be available in telecommunication literature, there is room for improvement. This paper's primary objective is to propose a dynamic weighting method in routing to reduce congestion during peak hours by predicting incoming traffics and optimizing weights in the adjacency matrix of the routing table online. While changing weight values in the routing table, this method implicitly changes the routing path of many nodes through the congested node. As a result, the packet losses and delays can be decreased in used nodes. The main steps of this proposed framework are fourfold. First, the candidate weighing list is calculated based on the routing table of the congested node. Second, a proposed auto-adaptive framework (AAF) is used to predict congestion levels and apply the weighing list in the network node. Third, the evaluation of network congestion is then performed by the probability of packet losses due to overflowing buffers. Finally, the case study results demonstrate that the proposed AAF framework can significantly reduce network congestion.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10

Similar content being viewed by others

References

  1. Abualigah, L., & Diabat, A. (2020). A novel hybrid antlion optimization algorithm for multi-objective task scheduling problems in cloud computing environments. Cluster Computing, 1–19.

  2. Li, F., Gong, J., Liang, Y., & Zhou, J. (2016). Real-time congestion prediction for urban arterials using adaptive data-driven methods. Multimedia Tools and Applications, 75(24), 17573–17592.

    Article  Google Scholar 

  3. Curcio, I. D., Kalliokulju, J., & Lundan, M. (2006). AMR mode selection enhancement in 3G networks. Multimedia Tools and Applications, 28(3), 259–281.

    Article  Google Scholar 

  4. Chiang, M. (2005). Balancing transport and physical layers in wireless multihop networks: Jointly optimal congestion control and power control. IEEE Journal on Selected Areas in Communications, 23(1), 104–116.

    Article  Google Scholar 

  5. Seligman, M., Fall, K., & Mundur, P. (2007). Storage routing for DTN congestion control. Wireless Communications and Mobile Computing, 7(10), 1183–1196.

    Article  Google Scholar 

  6. Jacobson, V. (1995). Congestion avoidance and control. ACM SIGCOMM Computer Communication Review, 25(1), 157–187.

    Article  Google Scholar 

  7. Jacobson, V., Braden, R., & Zhang, L. (1990). TCP extension for high-speed paths. RFC-1185, October.

  8. Xu, Z., Tang, J., Yin, C., Wang, Y., & Xue, G. (2019). Experience-driven congestion control: When multi-path TCP meets deep reinforcement learning. IEEE Journal on Selected Areas in Communications, 37(6), 1325–1336.

    Article  Google Scholar 

  9. Safaldin, M., Otair, M., & Abualigah, L. (2020). Improved binary gray wolf optimizer and SVM for intrusion detection system in wireless sensor networks. Journal of Ambient Intelligence and Humanized Computing, 1–18.

  10. Navarro, M., Rangel, J. C., & Cruz, E. (2018). Automatic OSPF topology map generation using information of the OSPF database. KnE Engineering, 3, 853–861.

    Article  Google Scholar 

  11. Abualigah, L., Diabat, A., Mirjalili, S., Abd Elaziz, M., and Gandomi, A. H. (2020). The arithmetic optimization algorithm. In Computer methods in applied mechanics and engineering.

  12. Bang-Jensen, J., & Gutin, G. Z. (2008). Digraphs: Theory, algorithms and applications. Berlin: Springer.

    MATH  Google Scholar 

  13. Li, J., Felner, A., Koenig, S., & Kumar, T. S. (2019). Using fastmap to solve graph problems in a euclidean space. In Proceedings of the international conference on automated planning and scheduling (vol. 29, no. 1, pp. 273–278).

  14. Knight, S., Weaver, D., Whipple, D., Hinden, R., Mitzel, D., Hunt, P., & Lindem, A. (1998). Virtual router redundancy protocol. In RFC2338, April.

  15. Heyman, D. P., & Lakshman, T. V. (1996). What are the implications of long-range dependence for VBR-video traffic engineering? IEEE/ACM Transactions on Networking, 4(3), 301–317.

    Article  Google Scholar 

  16. Ryu, B. K., & Elwalid, A. (1996). The importance of long-range dependence of VBR video traffic in ATM traffic engineering: Myths and realities. ACM SIGCOMM Computer Communication Review, 26(4), 3–14.

    Article  Google Scholar 

  17. Floyd, S., & Jacobson, V. (1993). Random early detection gateways for congestion avoidance. IEEE/ACM Transactions on Networking, 1(4), 397–413.

    Article  Google Scholar 

  18. Luo, J., Jin, J., & Shan, F. (2017). Standardization of low-latency TCP with explicit congestion notification: A survey. IEEE Internet Computing, 21(1), 48–55.

    Article  Google Scholar 

  19. Reddy, Y. N., & Srinivas, P. V. S. (2018). A combined TCP-friendly rate control with WFQ approach for congestion control for MANET. International Journal of Computer Network and Information Security, 10(6), 52–59.

    Article  Google Scholar 

  20. He, G., Gao, Y., Hou, J. C., & Park, K. (2002). A case for exploiting self-similarity of network traffic in TCP congestion control. In 10th IEEE international conference on network protocols, 2002. Proceedings (pp. 34–43). IEEE.

  21. Khasawneh, A. M., Abualigah, L., & Al Shinwan, M. (2020). Void aware routing protocols in underwater wireless sensor networks: Variants and challenges. Journal of Physics Conference Series, 1550(3), 032145.

    Article  Google Scholar 

  22. Jain, R. (1986). A timeout-based congestion control scheme for window flow-controlled networks. IEEE Journal on Selected Areas in Communications, 4(7), 1162–1167.

    Article  Google Scholar 

  23. Bux, W., & Grillo, D. (1985). Flow control in local-area networks of interconnected token rings. IEEE Transactions on Communications, 33(10), 1058–1066.

    Article  Google Scholar 

  24. Jain, R. (1989). A delay-based approach for congestion avoidance in interconnected heterogeneous computer networks. ACM SIGCOMM Computer Communication Review, 19(5), 56–71.

    Article  Google Scholar 

  25. Fortz, B., & Thorup, M. (2000). Internet traffic engineering by optimizing OSPF weights. In Proceedings IEEE INFOCOM 2000. conference on computer communications. Nineteenth annual joint conference of the IEEE computer and communications societies (Cat. No. 00CH37064) (Vol. 2, pp. 519–528). IEEE.

  26. De, D., Ray, S., Konar, A., & Chatterjee, A. (2005). A fuzzy logic controller based dynamic routing algorithm with SPDE based differential evolution approach.

  27. Kaur, H. T., Ye, T., Kalyanaraman, S., & Vastola, K. S. (2003). Minimizing packet loss by optimizing OSPF weights using online simulation. In MASCOTS (p. 79).

  28. Fortz, B., & Thorup, M. (2004). Increasing internet capacity using local search. Computational Optimization and Applications, 29(1), 13–48.

    Article  MathSciNet  Google Scholar 

  29. Pióro, M., Szentesi, Á., Harmatos, J., Jüttner, A., Gajowniczek, P., & Kozdrowski, S. (2002). On open shortest path first related network optimisation problems. Performance Evaluation, 48(1–4), 201–223.

    Article  Google Scholar 

  30. Vallet, J., & Brun, O. (2014). Online OSPF weights optimization in IP networks. Computer Networks, 60, 1–12.

    Article  Google Scholar 

  31. Abualigah, L., Shehab, M., Alshinwan, M., Alabool, H., Abuaddous, H. Y., Khasawneh, A. M., & Al Diabat, M. (2020). TS-GWO: IoT tasks scheduling in cloud computing using grey wolf optimizer. In I. Pan, M. Abd-Elaziz, & S. Bhattacharyya (Eds.), Swarm intelligence for cloud computing (pp. 127–152). Boca Raton: Chapman and Hall/CRC.

    Chapter  Google Scholar 

  32. Al Shinwan, M., Abualigah, L., Le, N. D., Kim, C., & Khasawneh, A. M. (2020). An intelligent long-lived TCP based on real-time traffic regulation. Multimedia Tools and Applications, pp. 1–18.

  33. Feng, H., & Shu, Y. (2005). Study on network traffic prediction techniques. In Proceedings. 2005 International conference on wireless communications, networking and mobile computing, 2005. (Vol. 2, pp. 1041–1044). IEEE.

  34. Zachary, S., Ziedins, I., & Kelly, F. P. (1996). Stochastic networks: Theory and applications. Oxford: Oxford University Press.

    MATH  Google Scholar 

  35. Brandes, U. (2001). A faster algorithm for betweenness centrality. Journal of mathematical sociology, 25(2), 163–177.

    Article  Google Scholar 

  36. Boston University Representative Internet Topology Generator, [Online]. Available: http://www.cs.bu.edu/bri.

  37. Nayyar, A., & Singh, R. (2019). IEEMARP-a novel energy efficient multipath routing protocol based on ant Colony optimization (ACO) for dynamic sensor networks. Multimedia Tools and Applications, 79, 1–32.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Computer Sciences and Informatics, Amman Arab University, Amman, Jordan

    Mohammad Alshinwan & Laith Abualigah

  2. Department of Computer Engineering, Inje University, Gimhae, South Korea

    Chul-Soo Kim

  3. College of Computing and Informatics, Saudi Electronic University, Abha, Saudi Arabia

    Hamzeh Alabool

Authors
  1. Mohammad Alshinwan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Laith Abualigah
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Chul-Soo Kim
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Hamzeh Alabool
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Laith Abualigah.

Ethics declarations

Conflict of interst

Conflict of interest in the present work, we have not used any material from previously published. So we have no conflict of interest.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Alshinwan, M., Abualigah, L., Kim, CS. et al. Development of a Real-Time Dynamic Weighting Method in Routing for Congestion Control: Application and Analysis. Wireless Pers Commun 118, 755–772 (2021). https://doi.org/10.1007/s11277-020-08041-3

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11277-020-08041-3

Keywords

Search

Navigation