1887
banner image
No data available.
Please log in to see this content.
You have no subscription access to this content.
No metrics data to plot.
The attempt to load metrics for this article has failed.
The attempt to plot a graph for these metrics has failed.
Self avoiding paths routing algorithm in scale-free networks
Rent:
Rent this article for
USD
10.1063/1.4790864
/content/aip/journal/chaos/23/1/10.1063/1.4790864
http://aip.metastore.ingenta.com/content/aip/journal/chaos/23/1/10.1063/1.4790864
View: Figures

Figures

Image of FIG. 1.
FIG. 1.

Path discovery process of the SAPR algorithm. (a) The algorithm is in node u and tries to check for node v with an already existing path via t. (b) In this case, the path through u is found to have the lowest cost and the path through t is removed, so the node costs are updated for the two paths down to the source node s. The operations +1 and −1 are to be performed on the number of paths on every node along the two paths (see the two pseudo-codes in text).

Image of FIG. 2.
FIG. 2.

Number of current packets in the network Ncur as a function of the number of iterations Niter for the SAPR algorithm for different values of the parameter α (BA network with N = 1000).

Image of FIG. 3.
FIG. 3.

Plot of the average path length as a function of the number N of nodes in the BA network for , 4.0, and 6.0.

Image of FIG. 4.
FIG. 4.

Order parameter η (given by Eq. (6) ) of the SAPR algorithm as a function of the packet generation rate R for different α values. The arrow indicates the position of the critical value for (BA network with N = 1000).

Image of FIG. 5.
FIG. 5.

Plot of the average travel time as a function of the packet generation rate R for the algorithms SPR and EPR compared with the SAPR algorithm with (BA network with N = 1000).

Image of FIG. 6.
FIG. 6.

Plot of the average travel time as a function of the packet generation rate R for the algorithms SPR and EPR compared with the SAPR algorithm with , for the AS-733 Oregon Route Views dataset network with N = 549.

Image of FIG. 7.
FIG. 7.

Variation of the average path length vs. α. The values of corresponding to the algorithms SPR and EPR are indicated for comparison by the arrows (BA network with N = 1000).

Image of FIG. 8.
FIG. 8.

Critical packet generation rate Rc as a function of α values. The arrows indicate the values corresponding to the SPR and the EPR algorithms (BA network with N = 1000).

Image of FIG. 9.
FIG. 9.

Dependence of the number of paths Npaths traversing each node on the node degree k for the three algorithms: SPR, EPR, SAPR (with ) and EPR2 (BA network with N = 1000).

Image of FIG. 10.
FIG. 10.

Plot of the average travel time as a function of the packet generation rate R for the algorithms SPR and OR compared with the SAPR algorithm with for the BA network with N = 200 nodes.

Loading

Article metrics loading...

/content/aip/journal/chaos/23/1/10.1063/1.4790864
2013-02-08
2014-04-20
Loading

Full text loading...

This is a required field
Please enter a valid email address
752b84549af89a08dbdd7fdb8b9568b5 journal.articlezxybnytfddd
Scitation: Self avoiding paths routing algorithm in scale-free networks
http://aip.metastore.ingenta.com/content/aip/journal/chaos/23/1/10.1063/1.4790864
10.1063/1.4790864
SEARCH_EXPAND_ITEM