Abstract
In this paper, we propose a routing strategy based on the global dynamic information of network traffic. In the strategy, packets will travel along the path with the minimal sum of links’ weight, which may vary with the traffic condition. During the whole evolution, if the queue length of a node exceeds a threshold, the link weight of its direct links will increase. Simulation results show that the maximal traffic capacity corresponds to an optimal value of the threshold. Furthermore, we compare the performance of the strategy with global dynamic (GD) routing strategy. It is found that the strategy can further improve the transport efficiency, especially in the congestion state. Our work may be helpful for the design of new routing strategies in networked traffic systems.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Physica A: Statistical Mechanics and its Applications
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
