Efficiency Analysis of Evolutionary Algorithm for Congestion Problem Using Computer Experimentation System

This paper presents a proposed highly configurable evolutionary algorithm together with a computer experimentation system supporting its efficiency analysis. An important issue in the network survivability area dealing with the congestion problem in connection-oriented networks is the optimization task. The presented system enables planning and performing complex experiments with the proposed evolutionary algorithms. Particular emphasis was placed on parameter control and tuning process of evolutionary algorithm. Description of performed experiments and computational results are reported as well as plans for further research.

[1]  Luigi Fratta,et al.  The flow deviation method: An approach to store-and-forward communication network design , 1973, Networks.

[2]  Zbigniew Michalewicz,et al.  Parameter Control in Evolutionary Algorithms , 2007, Parameter Setting in Evolutionary Algorithms.

[3]  Andrzej Kasiński,et al.  Comparison of supervised learning methods for spike time coding in spiking neural networks , 2006 .

[4]  David B. Fogel,et al.  Evolutionary Computation: The Fossil Record , 1998 .

[5]  Dragan Nikolik,et al.  Wide Area Networks , 2003 .

[6]  Krzysztof Walkowiak,et al.  Ant algorithm for flow assignment in connection-oriented networks , 2005 .

[7]  Lester Randolph Ford,et al.  A Suggested Computation for Maximal Multi-Commodity Network Flows , 2004, Manag. Sci..

[8]  Krzysztof Walkowiak,et al.  Evolutionary Algorithm for Congestion Problem in Connection-Oriented Networks , 2005, ICCSA.

[9]  Krzysztof Walkowiak.  Maximizing residual capacity in connection-oriented networks , 2006, Adv. Decis. Sci..

[10]  Tarek M. Mahmoud.  A Genetic and Simulated Annealing Based Algorithms for Solving the Flow Assignment Problem in Computer Networks , 2007 .

[11]  Deep Medhi,et al.  Routing, flow, and capacity design in communication and computer networks , 2004 .

[12]  Krzysztof Walkowiak,et al.  QUASI-HIERARCHICAL EVOLUTION ALGORITHM FOR FLOW ASSIGNMENT IN SURVIVABLE CONNECTION-ORIENTED NETWORKS , 2006 .

[13]  Peter Steenkiste,et al.  On path selection for traffic with bandwidth guarantees , 1997, Proceedings 1997 International Conference on Network Protocols.