Adaptive genetic algorithm for channel sharing in high speed networks

Markaki, M; Kassotakis, I; Vasilakos, A

dc.contributor.author	Markaki, M	en
dc.contributor.author	Kassotakis, I	en
dc.contributor.author	Vasilakos, A	en
dc.date.accessioned	2014-03-01T01:13:33Z
dc.date.available	2014-03-01T01:13:33Z
dc.date.issued	1998	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/12564
dc.subject	Genetics	en
dc.subject	Graph Coloring	en
dc.subject	High Speed	en
dc.subject	High Speed Networks	en
dc.subject	Hybrid Genetic Algorithm	en
dc.subject	Adaptive Genetic Algorithm	en
dc.subject	Fiber Optic	en
dc.subject	Integrated Service Digital Network	en
dc.subject	Metropolitan Area Network	en
dc.subject.other	Adaptive algorithms	en
dc.subject.other	Communication channels (information theory)	en
dc.subject.other	Fiber optic networks	en
dc.subject.other	Genetic algorithms	en
dc.subject.other	Local area networks	en
dc.subject.other	Metropolitan area networks	en
dc.subject.other	Telecommunication traffic	en
dc.subject.other	High speed networks	en
dc.subject.other	Hybrid genetic reuse algorithm (HGRA)	en
dc.subject.other	Voice/data communication systems	en
dc.title	Adaptive genetic algorithm for channel sharing in high speed networks	en
heal.type	journalArticle	en
heal.identifier.primary	10.1109/GLOCOM.1998.776468	en
heal.identifier.secondary	http://dx.doi.org/10.1109/GLOCOM.1998.776468	en
heal.publicationDate	1998	en
heal.abstract	The evolving Broadband Integrated Services Digital Network (B-ISDN) is reinforcing the demand for high-speed and high-performance fiber optic local and metropolitan area networks (LANs and MANs). The number of channels available to support the isochronous traffic in high-speed LANs/MANs is limited by technology, in order to minimize the implementation costs. We provide a method using channel sharing/reusing to provide efficient management of isochronous traffic under this limitation. The proposed method is based on a hybrid genetic algorithm called Hybrid Genetic Reuse Algorithm (HGRA) and aims to accomplish the establishment of a maximal number of connections with the minimal number of isochronous channels. Simulation results are provided and they are compared with those of a graph coloring algorithm, named ICRA. The results show that the proposed method exhibits better performance than ICRA in almost all simulation runs and shows the robustness, flexibility, efficiency of using evolutionary approaches to complex real-world problems.	en
heal.publisher	IEEE, Piscataway, NJ, United States	en
heal.journalName	Conference Record / IEEE Global Telecommunications Conference	en
dc.identifier.doi	10.1109/GLOCOM.1998.776468	en
dc.identifier.volume	5	en
dc.identifier.spage	2658	en
dc.identifier.epage	2663	en