Efficient traffic management in networks with limited resources: the switching routing strategy

The study of network traffic dynamics in the presence of limited links bandwidth and finite node storage capacity is of significant importance, and it has garnered attention across various scientific disciplines. In this work, the switching routing strategy is applied to address this challenge and s...

Full description

Saved in:
Bibliographic Details
Main Authors: Mishra, Ankit, Wen, Tao, Cheong, Kang Hao
Other Authors: School of Computer Science and Engineering
Format: Article
Language:English
Published: 2024
Subjects:
Online Access:https://hdl.handle.net/10356/175873
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Nanyang Technological University
Language: English
id sg-ntu-dr.10356-175873
record_format dspace
spelling sg-ntu-dr.10356-1758732024-05-08T06:47:53Z Efficient traffic management in networks with limited resources: the switching routing strategy Mishra, Ankit Wen, Tao Cheong, Kang Hao School of Computer Science and Engineering School of Physical and Mathematical Sciences Singapore University of Technology and Design Computer and Information Science Parrondo's paradox Packet transmission The study of network traffic dynamics in the presence of limited links bandwidth and finite node storage capacity is of significant importance, and it has garnered attention across various scientific disciplines. In this work, the switching routing strategy is applied to address this challenge and several key findings are highlighted. When networks possess infinite bandwidth, the switching strategy is efficient when the number of packets n exceeds the node storage capacity. This is observed in both Erdős-Rényi random and Barabási-Albert scale-free networks. When bandwidth constraints are introduced, the switching strategy remains efficient for networks with a large number of nodes, that is, n≥2.5C for scale-free networks and n≥2.7C for random networks. Furthermore, the efficacy of the switching strategy is more pronounced in scale-free networks than in random networks, indicating the significant role of the structural characteristics. Additionally, the results indicate that the impact of the switching strategy becomes more remarkable with increasing number of packets and storage capacity of nodes. This work sheds light on the dynamics of network traffic in the presence of bandwidth and storage constraints, providing insights into the conditions under which the switching strategy can effectively optimize traffic flow. Ministry of Education (MOE) This project was supported by the Singapore Ministry of Education (MOE) Academic Research Fund (AcRF) Tier 2, Grant No. MOE-T2EP50120-0021. 2024-05-08T06:47:53Z 2024-05-08T06:47:53Z 2024 Journal Article Mishra, A., Wen, T. & Cheong, K. H. (2024). Efficient traffic management in networks with limited resources: the switching routing strategy. Chaos, Solitons and Fractals, 181, 114658-. https://dx.doi.org/10.1016/j.chaos.2024.114658 0960-0779 https://hdl.handle.net/10356/175873 10.1016/j.chaos.2024.114658 2-s2.0-85187208021 181 114658 en MOE-T2EP50120-0021 Chaos, Solitons and Fractals © 2024 Published by Elsevier Ltd. All rights reserved.
institution Nanyang Technological University
building NTU Library
continent Asia
country Singapore
Singapore
content_provider NTU Library
collection DR-NTU
language English
topic Computer and Information Science
Parrondo's paradox
Packet transmission
spellingShingle Computer and Information Science
Parrondo's paradox
Packet transmission
Mishra, Ankit
Wen, Tao
Cheong, Kang Hao
Efficient traffic management in networks with limited resources: the switching routing strategy
description The study of network traffic dynamics in the presence of limited links bandwidth and finite node storage capacity is of significant importance, and it has garnered attention across various scientific disciplines. In this work, the switching routing strategy is applied to address this challenge and several key findings are highlighted. When networks possess infinite bandwidth, the switching strategy is efficient when the number of packets n exceeds the node storage capacity. This is observed in both Erdős-Rényi random and Barabási-Albert scale-free networks. When bandwidth constraints are introduced, the switching strategy remains efficient for networks with a large number of nodes, that is, n≥2.5C for scale-free networks and n≥2.7C for random networks. Furthermore, the efficacy of the switching strategy is more pronounced in scale-free networks than in random networks, indicating the significant role of the structural characteristics. Additionally, the results indicate that the impact of the switching strategy becomes more remarkable with increasing number of packets and storage capacity of nodes. This work sheds light on the dynamics of network traffic in the presence of bandwidth and storage constraints, providing insights into the conditions under which the switching strategy can effectively optimize traffic flow.
author2 School of Computer Science and Engineering
author_facet School of Computer Science and Engineering
Mishra, Ankit
Wen, Tao
Cheong, Kang Hao
format Article
author Mishra, Ankit
Wen, Tao
Cheong, Kang Hao
author_sort Mishra, Ankit
title Efficient traffic management in networks with limited resources: the switching routing strategy
title_short Efficient traffic management in networks with limited resources: the switching routing strategy
title_full Efficient traffic management in networks with limited resources: the switching routing strategy
title_fullStr Efficient traffic management in networks with limited resources: the switching routing strategy
title_full_unstemmed Efficient traffic management in networks with limited resources: the switching routing strategy
title_sort efficient traffic management in networks with limited resources: the switching routing strategy
publishDate 2024
url https://hdl.handle.net/10356/175873
_version_ 1800916323091349504