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

Kassotakis, IE; Markaki, ME; Vasilakos, AV

dc.contributor.author	Kassotakis, IE	en
dc.contributor.author	Markaki, ME	en
dc.contributor.author	Vasilakos, AV	en
dc.date.accessioned	2014-03-01T01:49:41Z
dc.date.available	2014-03-01T01:49:41Z
dc.date.issued	2000	en
dc.identifier.issn	0733-8716	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/25893
dc.subject	channel reuse	en
dc.subject	hybrid genetic algorithm	en
dc.subject	NP-complete	en
dc.subject	isochronous service	en
dc.subject.classification	Engineering, Electrical & Electronic	en
dc.subject.classification	Telecommunications	en
dc.subject.other	AREA NETWORKS	en
dc.subject.other	ALGORITHMS	en
dc.subject.other	ASSIGNMENT	en
dc.title	A hybrid genetic approach for channel reuse in multiple access telecommunication networks	en
heal.type	journalArticle	en
heal.language	English	en
heal.publicationDate	2000	en
heal.abstract	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.	en
heal.publisher	IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC	en
heal.journalName	IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS	en
dc.identifier.isi	ISI:000085750500008	en
dc.identifier.volume	18	en
dc.identifier.issue	2	en
dc.identifier.spage	234	en
dc.identifier.epage	243	en