A hybrid genetic approach for channel reuse in multiple access telecommunication networks

The evolving broadband integrated services digital network is reinforcing the demand for high-speed and high-performance multiple access networks. The number of channels available to support the isochronous traffic in these networks is limited by technology, due to implementation costs. We introduce a method using channel sharing/reusing in an effort to provide efficient management of isochronous traffic under this limitation. The proposed method is based on a hybrid genetic algorithm and aims to accomplish the establishment of a maximal number of connections with the minimal number of isochronous channels. Experimental results are provided and they are compared with those of a deterministic graph coloring algorithm. The performance of the proposed algorithm in all simulation runs reveals the robustness, the flexibility and the efficiency of using evolutionary approaches to complex real-world problems.

[1]  Jean-Michel Renders,et al.  Hybrid methods using genetic algorithms for global optimization , 1996, IEEE Trans. Syst. Man Cybern. Part B.

[2]  Lawrence. Davis,et al.  Handbook Of Genetic Algorithms , 1990 .

[3]  Nobuo Funabiki,et al.  A gradual neural-network approach for frequency assignment in satellite communication systems , 1997, IEEE Trans. Neural Networks.

[4]  Z.L. Budrikis,et al.  The QPSX MAN , 1988, IEEE Communications Magazine.

[5]  Stephan Olariu,et al.  An Optimal Greedy Heuristic to Color Interval Graphs , 1991, Inf. Process. Lett..

[6]  Goutam Chakraborty,et al.  Genetic algorithm for broadcast scheduling in packet radio networks , 1998, 1998 IEEE International Conference on Evolutionary Computation Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98TH8360).

[7]  Dietmar Kunz,et al.  Channel assignment for cellular radio using simulated annealing , 1993 .

[8]  William Stallings,et al.  Local and metropolitan area networks (5th ed.) , 1993 .

[9]  Harilaos G. Sandalidis,et al.  An efficient evolutionary algorithm for channel resource management in cellular mobile systems , 1998, IEEE Trans. Evol. Comput..

[10]  Moshe Sidi,et al.  Topological design of local area networks using genetic algorithms , 1995, Proceedings of INFOCOM'95.

[11]  Lance D. Chambers,et al.  Practical Handbook of Genetic Algorithms , 1995 .

[12]  William Stallings,et al.  Local and Metropolitan Area Networks , 1993 .

[13]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[14]  M. Golumbic.  Algorithmic graph theory and perfect graphs , 1980 .

[15]  Jean-Lien C. Wu,et al.  Bandwidth allocation in ATM networks using genetic algorithms and neural networks , 1997, GLOBECOM 97. IEEE Global Telecommunications Conference. Conference Record.

[16]  John A. Miller,et al.  An evaluation of local improvement operators for genetic algorithms , 1993, IEEE Trans. Syst. Man Cybern..

[17]  M. Markaki,et al.  A hybrid genetic algorithm for the provision of isochronous service in high speed networks , 1997, Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97).

[18]  Henrik Esbensen,et al.  Finding (Near-)Optimal Steiner Trees in Large Graphs , 1995, International Conference on Genetic Algorithms.

[19]  Thomas Bäck,et al.  An evolutionary heuristic for the maximum independent set problem , 1994, Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence.

[20]  Nen-Fu Huang,et al.  A study of isochronous channel reuse in DQDB metropolitan area networks , 1998, TNET.

[21]  Thomas Bäck,et al.  Evolutionary Algorithms in Theory and Practice , 1996 .

[22]  Oliver Vornberger,et al.  Hybrid genetic algorithms for constrained placement problems , 1997, IEEE Trans. Evol. Comput..