New Genetic Optimization Strategies In Efficient Off-Line Traffic Engineering For Simulating Multi-Service UMTS Cellular Networks

This paper presents new strategies for offline traffic engineering, when designing multi-service UMTS networks, based on an efficient modification of basic genetic optimization techniques. More specifically, the problem setup includes Mobile Internet access as the most emergent trade in the telecommunications industry due to the advancement of cellular smartphones, tablets, notebooks and netbooks based computing and communicating technologies. In this real world set-up, the integration of deployed wireless networks with the Internet and the transparent interworking among different wireless technologies, namely EDGE/GPRS/CDMA2000 cellular and Wireless LAN (WLAN), appears to be a demanding objective for mobile communications service providers. The mixture and convergence of mobile and fixed infrastructures related services make it urgent to tackle quality of service and traffic engineering for mobile networks at the fundamental transport level with regards to OSI network analysis. A good solution to address such issues is the Multi-Protocol Label Switching (MPLS) technology providing a fused control instrument with connectionless multiprotocol capabilities, functioning over different communication media while supporting traffic engineering and quality of service (QoS) offering smooth traffic over the complex network of mobile and fixed communication infrastructures. Therefore, the MPLS architecture offers the required capacity to integrate different services over wired and wireless infrastructures in a unified convergent approach. Based on these concepts, this research proposal investigates traffic engineering solutions in MPLS involved wireless cellular networks. In this paper, two new methods for the solution of the off-line Traffic Engineering (TE) problem in multi-service wireless networks based on a certain efficient modification of basic genetic optimisation are presented. In the first method the off-line TE problem is formulated as an optimisation model with linear constraints and then solved using a new modified version of the Genetic Algorithm for Numerical Optimisation for Constraint Problems (GENOCOP). Besides, a hybrid method for the solution of the aforementioned problem involving modified GENOCOP and a heuristic TE algorithm is also provided. The performance of the above methods against a standard LP-based optimisation method is examined in terms of two different network topologies mixing both wireless and wired links and numerical test results are provided.

[1]  Deep Medhi,et al.  Some approaches to solving a multihour broadband network capacity design problem with single-path routing , 2000, Telecommun. Syst..

[2]  Kim-Fung Man,et al.  Using Genetic Algorithms to Design Mesh Networks , 1997, Computer.

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

[4]  Rita Girão-Silva,et al.  Highlights on a Multiobjective Routing Method for Multiservice MPLS Networks with Traffic Splitting , 2013 .

[5]  Athanasios V. Vasilakos,et al.  Aggregated bandwidth allocation: investigation of performance of classical constrained and genetic algorithm based optimisation techniques , 2002, Comput. Commun..

[6]  Abdullah Konak,et al.  A hybrid genetic algorithm approach for backbone design of communication networks , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

[7]  S. Vaton,et al.  Robust and Reactive Traffic Engineering for Dynamic Traffic Demands , 2008, 2008 Next Generation Internet Networks.

[8]  Sam Kwong,et al.  Genetic algorithms and their applications , 1996, IEEE Signal Process. Mag..

[9]  Anton Riedl,et al.  A hybrid genetic algorithm for routing optimization in IP networks utilizing bandwidth and delay metrics , 2002, IEEE Workshop on IP Operations and Management.

[10]  Lorentz Jäntschi,et al.  Tendency of Evolution Supervised by Genetic Algorithms , 2010 .

[11]  Ezhan Karasan,et al.  Robust path design algorithms for traffic engineering with restoration in MPLS networks , 2002, Proceedings ISCC 2002 Seventh International Symposium on Computers and Communications.

[12]  Jingchao Chen.  Dijkstra's Shortest Path Algorithm , 2003 .

[13]  Z. Michalewicz,et al.  Genocop III: a co-evolutionary algorithm for numerical optimization problems with nonlinear constraints , 1995, Proceedings of 1995 IEEE International Conference on Evolutionary Computation.

[14]  Watit Benjapolakul,et al.  Optimum virtual paths system based in ATM network using genetic algorithm , 1997, Proceedings of ICICS, 1997 International Conference on Information, Communications and Signal Processing. Theme: Trends in Information Systems Engineering and Wireless Multimedia Communications (Cat..

[15]  Moshe Sidi,et al.  Topological design of local-area networks using genetic algorithms , 1996, TNET.

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

[17]  Rallis C. Papademetriou,et al.  NetLab - an interactive simulation environment for communication networks , 2003, International Conference on Information Technology: Research and Education, 2003. Proceedings. ITRE2003..

[18]  K. Yamasaki,et al.  A dynamic routing control based on a genetic algorithm , 1993, IEEE International Conference on Neural Networks.

[19]  El-Sayed M. El-Alfy,et al.  A Pareto-based hybrid multiobjective evolutionary approach for constrained multipath traffic engineering optimization in MPLS/GMPLS networks , 2013, J. Netw. Comput. Appl..

[20]  S. Tanterdtid,et al.  Optimizing ATM network throughput based on virtual path concept by using genetic algorithm , 1997, 1997 IEEE International Conference on Intelligent Processing Systems (Cat. No.97TH8335).

[21]  Daniela Panno,et al.  Computational intelligence in telecommunications networks , 2002, Comput. Commun..

[22]  Alexandru Nicolau,et al.  R-Kleene: A High-Performance Divide-and-Conquer Algorithm for the All-Pair Shortest Path for Densely Connected Networks , 2007, Algorithmica.

[23]  Xiao Yuan,et al.  The Application of GENOCOP in Production Plan , 2012 .

[24]  Cheng Jin,et al.  MATE: MPLS adaptive traffic engineering , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[25]  I. Y. Wang,et al.  The bandwidth allocation of ATM through genetic algorithm , 1991, IEEE Global Telecommunications Conference GLOBECOM '91: Countdown to the New Millennium. Conference Record.

[26]  S. V. Raghavan,et al.  Bandwidth-demand prediction in virtual path in ATM networks using genetic algorithms , 1999, Comput. Commun..

[27]  David B. Fogel,et al.  Evolutionary Computation: Towards a New Philosophy of Machine Intelligence , 1995 .

[28]  Thomas Bäck,et al.  Evolutionary computation: Toward a new philosophy of machine intelligence , 1997, Complex..