Abstract
In this paper, we first propose a traffic model based on scale-free network to investigate the connections between the topology of a network and the routing strategies work on it. Then, we put forward a topology function with a tunable exponential parameter to represent the static part of local routing strategies. In order to make routing algorithms still work well even when the network falls into a congested state, we add the dynamic ingredient into them so that packets could avoid those congesting nodes when traffic jam occurs. In order to maximize the throughput of the network, we investigate the performance of a class of routing strategies that based on degree of nodes and put forward a new class of dynamic local routing strategies based on probabilistic betweenness of nodes. Experimental results show that the new class of algorithms work well even when the traffic of the network is very heavy.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
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.