Traffic Dynamics Based on Local Routing Strategy in a Weighted Scale-Free Network

In this paper, the traffic flow on weighted scale-free networks is investigated based on local routing strategy using link weights. The capacity of links is controlled by max(βwlj , 1). It is shown by simulations that two critical threshold βc1 and βc2 exist. When β > βc1, both the network capaci...

Full description

Bibliographic Details
Main Authors: Hu, Mao Bin, Wu, Yong Hong, Jiang, R., Wu, Q., Wang, W.
Format: Book Chapter
Published: Springer 2009
Online Access:http://hdl.handle.net/20.500.11937/14353
_version_ 1848748600456118272
author Hu, Mao Bin
Wu, Yong Hong
Jiang, R.
Wu, Q.
Wang, W.
author_facet Hu, Mao Bin
Wu, Yong Hong
Jiang, R.
Wu, Q.
Wang, W.
author_sort Hu, Mao Bin
building Curtin Institutional Repository
collection Online Access
description In this paper, the traffic flow on weighted scale-free networks is investigated based on local routing strategy using link weights. The capacity of links is controlled by max(βwlj , 1). It is shown by simulations that two critical threshold βc1 and βc2 exist. When β > βc1, both the network capacity and the corresponding αc value remain unchanged. When βc1 > β > βc2, the network capacity decreases and the critical value of αc increases with the decrease of β. When β < βc2, αc decreases with the decrease of β. The behaviour can be explained by investigating the average number of packets on nodes and delivered through links.
first_indexed 2025-11-14T07:07:37Z
format Book Chapter
id curtin-20.500.11937-14353
institution Curtin University Malaysia
institution_category Local University
last_indexed 2025-11-14T07:07:37Z
publishDate 2009
publisher Springer
recordtype eprints
repository_type Digital Repository
spelling curtin-20.500.11937-143532017-01-30T11:43:14Z Traffic Dynamics Based on Local Routing Strategy in a Weighted Scale-Free Network Hu, Mao Bin Wu, Yong Hong Jiang, R. Wu, Q. Wang, W. In this paper, the traffic flow on weighted scale-free networks is investigated based on local routing strategy using link weights. The capacity of links is controlled by max(βwlj , 1). It is shown by simulations that two critical threshold βc1 and βc2 exist. When β > βc1, both the network capacity and the corresponding αc value remain unchanged. When βc1 > β > βc2, the network capacity decreases and the critical value of αc increases with the decrease of β. When β < βc2, αc decreases with the decrease of β. The behaviour can be explained by investigating the average number of packets on nodes and delivered through links. 2009 Book Chapter http://hdl.handle.net/20.500.11937/14353 Springer restricted
spellingShingle Hu, Mao Bin
Wu, Yong Hong
Jiang, R.
Wu, Q.
Wang, W.
Traffic Dynamics Based on Local Routing Strategy in a Weighted Scale-Free Network
title Traffic Dynamics Based on Local Routing Strategy in a Weighted Scale-Free Network
title_full Traffic Dynamics Based on Local Routing Strategy in a Weighted Scale-Free Network
title_fullStr Traffic Dynamics Based on Local Routing Strategy in a Weighted Scale-Free Network
title_full_unstemmed Traffic Dynamics Based on Local Routing Strategy in a Weighted Scale-Free Network
title_short Traffic Dynamics Based on Local Routing Strategy in a Weighted Scale-Free Network
title_sort traffic dynamics based on local routing strategy in a weighted scale-free network
url http://hdl.handle.net/20.500.11937/14353