Publication | Closed Access
Generalized minimum information path routing strategy on scale-free networks
15
Citations
18
References
2011
Year
Network Routing AlgorithmNetwork ScienceGraph TheoryScale-free NetworksRouting StrategyEdge ComputingEngineeringNetwork RoutingNetwork AnalysisRoutingScalable RoutingRobust RoutingComputer ScienceCombinatorial OptimizationTunable ParameterMinimum Information PathRouting Protocol
This paper presents a new routing strategy by introducing a tunable parameter into the minimum information path routing strategy we proposed previously. It is found that network transmission capacity can be considerably enhanced by adjusting the parameter with various allocations of node capability for packet delivery. Moreover, the proposed routing strategy provides a traffic load distribution which can better match the allocation of node capability than that of traditional efficient routing strategies, leading to a network with improved transmission performance. This routing strategy, without deviating from the shortest-path routing strategy in the length of paths too much, produces improved performance indexes such as critical generating rate, average length of paths and average search information.
| Year | Citations | |
|---|---|---|
Page 1
Page 1