Network topological optimization for packet routing using multi-objective simulated annealing method

A new multi-objective simulated annealing (MOSA) algorithm is proposed for optimizing network topology. In this paper, the MOSA algorithm is used to perform two-objective simultaneous optimization. The two objectives examined in this paper are the critical packet generation rate, and average number of overall packet loads. Our results indicate that homogeneous networks can support a large critical packet generation rate under the congestion-free state, but the networks must be able to sustain relatively heavy packet load pressure if the same packet generation rate is assigned to a more heterogeneous network. At the same time, it is also found that heterogeneous networks can relieve packet load pressure, but the network is likely to become congested due to an abrupt increase of packet loads. We find that when the network size is large, lowering the average number of packet loads and raising the critical packet generation rate need not to be compromised too much. We also point out that networks can be more robust to abrupt increase of packet loads if networks are structured more homogeneously in the process of network size increment.

[1]  G. J. Rodgers,et al.  Traffic on complex networks: Towards understanding global statistical properties from microscopic density fluctuations. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.

[2]  S. N. Dorogovtsev,et al.  Evolution of networks , 2001, cond-mat/0106144.

[3]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

[4]  Yamir Moreno,et al.  Improved routing strategies for Internet traffic delivery. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.

[5]  Murad S. Taqqu,et al.  On the Self-Similar Nature of Ethernet Traffic , 1993, SIGCOMM.

[6]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[7]  Xiaogang Jin,et al.  Optimal structure of complex networks for minimizing traffic congestion. , 2007, Chaos.

[8]  Piotr Czyzżak,et al.  Pareto simulated annealing—a metaheuristic technique for multiple‐objective combinatorial optimization , 1998 .

[9]  Balram Suman,et al.  Study of simulated annealing based algorithms for multiobjective optimization of a constrained problem , 2004, Comput. Chem. Eng..

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

[11]  Nong Ye,et al.  Onset of traffic congestion in complex networks. , 2005, Physical review. E, Statistical, nonlinear, and soft matter physics.

[12]  A Díaz-Guilera,et al.  Communication in networks with hierarchical branching. , 2001, Physical review letters.

[13]  Wen-Xu Wang,et al.  Method to enhance traffic capacity for scale-free networks. , 2007, Physical review. E, Statistical, nonlinear, and soft matter physics.

[14]  Arnold O. Allen,et al.  Probability, statistics and queueing theory - with computer science applications (2. ed.) , 1981, Int. CMG Conference.

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

[16]  Alexandre Arenas,et al.  Optimal network topologies for local search with congestion , 2002, Physical review letters.

[17]  Mark E. J. Newman,et al.  The Structure and Function of Complex Networks , 2003, SIAM Rev..

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

[19]  E. L. Ulungu,et al.  MOSA method: a tool for solving multiobjective combinatorial optimization problems , 1999 .

[20]  Massimo Maresca,et al.  Polymorphic-Torus Network , 1989, IEEE Trans. Computers.