Balancing throughput and delay performance by effective shortest path routing

In this paper, effective shortest path routing algorithm is proposed to balance the throughput and delay performance in the scale free networks. The model under packet retransmission condition is created to model the some protocols, like TCP, more accurately. The ESP is compared to other routing algorithms, such as shortest path first and optimal routing. The result shows ESP has better throughput than SPF does and less delay than OR does.

[1]  Neo D. Martinez,et al.  Food-web structure and network theory: The role of connectance and size , 2002, Proceedings of the National Academy of Sciences of the United States of America.

[2]  Jeffery L. Kennington,et al.  An Incremental Procedure for Improving Path Assignment in a Telecommunications Network , 2003, J. Heuristics.

[3]  Bo Hu,et al.  Efficient routing on complex networks. , 2006, Physical review. E, Statistical, nonlinear, and soft matter physics.

[4]  M. Barthelemy.  Betweenness centrality in large complex networks , 2003, cond-mat/0309436.

[5]  M E J Newman,et al.  Finding and evaluating community structure in networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[6]  Albert-László Barabási,et al.  Statistical mechanics of complex networks , 2001, ArXiv.

[7]  Ulrich Killat,et al.  Load balancing in IP networks by optimising link weights , 2005, Eur. Trans. Telecommun..

[8]  Andrei Z. Broder,et al.  Graph structure in the Web , 2000, Comput. Networks.

[9]  Michel Minoux,et al.  A Comparison of Heuristics for the Discrete Cost Multicommodity Network Optimization Problem , 2003, J. Heuristics.

[10]  Alessandro Vespignani,et al.  Large-scale topological and dynamical properties of the Internet. , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.

[11]  D. Fell,et al.  The small world inside large metabolic networks , 2000, Proceedings of the Royal Society of London. Series B: Biological Sciences.

[12]  K. Goh,et al.  Universal behavior of load distribution in scale-free networks. , 2001, Physical review letters.

[13]  Michalis Faloutsos,et al.  On power-law relationships of the Internet topology , 1999, SIGCOMM '99.

[14]  Yong Yu,et al.  Optimal routing on complex networks , 2006, Physical review. E, Statistical, nonlinear, and soft matter physics.

[15]  FaloutsosMichalis,et al.  On power-law relationships of the Internet topology , 1999 .

[16]  Mikkel Thorup,et al.  Optimizing OSPF/IS-IS weights in a changing world , 2002, IEEE J. Sel. Areas Commun..

[17]  R. Albert,et al.  The large-scale organization of metabolic networks , 2000, Nature.

[18]  Panos M. Pardalos,et al.  A Genetic Algorithm for the Weight Setting Problem in OSPF Routing , 2002, J. Comb. Optim..

[19]  Roger Guimerà,et al.  Robust patterns in food web structure. , 2001, Physical review letters.

[20]  S. N. Dorogovtsev,et al.  Giant strongly connected component of directed networks. , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.