Analysis of call and service control in telecommunications by using genetic algorithms

This paper deals with an approach for the analysis of call and service controls in telecommunications where genetic algorithms are used for finishing time evaluation. A simple genetic algorithm with crossover, mutation and reproduction operators, an improved algorithm with cloning operator as well as an adaptive genetic algorithm are elaborated. Some experimental results are reported.

[1]  Vjekoslav Sinkovic,et al.  A model of massively parallel call and service processing in telecommunications , 1997, J. Syst. Archit..

[2]  Eduardo B. Fernández,et al.  Bounds on the Number of Processors and Time for Multiprocessor Optimal Schedules , 1973, IEEE Transactions on Computers.

[3]  C. V. Ramamoorthy,et al.  Optimal Scheduling Strategies in a Multiprocessor System , 1972, IEEE Transactions on Computers.

[4]  Nirwan Ansari,et al.  A Genetic Algorithm for Multiprocessor Scheduling , 1994, IEEE Trans. Parallel Distributed Syst..

[5]  C. Siva Ram Murthy,et al.  Scheduling Precedence Constrained Task Graphs with Non-Negligible Intertask Communication onto Multiprocessors , 1994, IEEE Trans. Parallel Distributed Syst..

[6]  Ignac Lovrek,et al.  Performance of Genetic Algorithm Used for Analysis of Call and Service Processing in Telecommunications , 1995, ICANNGA.

[7]  Ignac Lovrek,et al.  An approach to massively parallel call and service processing in telecommunications , 1994, Proceedings of the First International Conference on Massively Parallel Computing Systems (MPCS) The Challenges of General-Purpose and Special-Purpose Computing.

[8]  D. E. Goldberg,et al.  Genetic Algorithms in Search, Optimization & Machine Learning , 1989 .