File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Quasi-static dynamic channel assignment using a linux PC cluster

TitleQuasi-static dynamic channel assignment using a linux PC cluster
Authors
KeywordsCellular communications
dynamic channel assignment
genetic algorithms
local search
parallel algorithms
Issue Date2000
PublisherIEEE.
Citation
The 4th International Conference/Exhibition on High Performance Computing in the Asia-Pacific Region Proceedings, Beijing, China, 14-17 May 2000, v. I, p. 170-175 How to Cite?
AbstractIn this paper, we propose a quasi-static approach which, using a powerful Linux/PC cluster, combines the merits of both traditional static and dynamic schemes for the channel assignment problem. The static component of our approach uses a parallel genetic algorithm to generate a suite of representative assignments based on a set of different estimated traffic scenarios. At on-line time, the dynamic component observes the actual traffic requirement and retrieve the representative assignment of the closest scenario from the off-line table. The retrieved assignment is then quickly refined by using a fast parallel local search algorithm. Our extensive simulation experiments have indicated that the proposed quasi-static system outperforms other dynamic channel assignment techniques significantly in terms of both blocking probabilities and computational overhead.
Persistent Identifierhttp://hdl.handle.net/10722/46205

 

DC FieldValueLanguage
dc.contributor.authorKwok, YKen_HK
dc.date.accessioned2007-10-30T06:44:46Z-
dc.date.available2007-10-30T06:44:46Z-
dc.date.issued2000en_HK
dc.identifier.citationThe 4th International Conference/Exhibition on High Performance Computing in the Asia-Pacific Region Proceedings, Beijing, China, 14-17 May 2000, v. I, p. 170-175en_HK
dc.identifier.urihttp://hdl.handle.net/10722/46205-
dc.description.abstractIn this paper, we propose a quasi-static approach which, using a powerful Linux/PC cluster, combines the merits of both traditional static and dynamic schemes for the channel assignment problem. The static component of our approach uses a parallel genetic algorithm to generate a suite of representative assignments based on a set of different estimated traffic scenarios. At on-line time, the dynamic component observes the actual traffic requirement and retrieve the representative assignment of the closest scenario from the off-line table. The retrieved assignment is then quickly refined by using a fast parallel local search algorithm. Our extensive simulation experiments have indicated that the proposed quasi-static system outperforms other dynamic channel assignment techniques significantly in terms of both blocking probabilities and computational overhead.en_HK
dc.languageengen_HK
dc.publisherIEEE.en_HK
dc.relation.ispartofInternational Conference/Exhibition on High Performance Computing in the Asia-Pacific Region Proceedings-
dc.rights©2000 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.en_HK
dc.rightsCreative Commons: Attribution 3.0 Hong Kong License-
dc.subjectCellular communicationsen_HK
dc.subjectdynamic channel assignmenten_HK
dc.subjectgenetic algorithmsen_HK
dc.subjectlocal searchen_HK
dc.subjectparallel algorithmsen_HK
dc.titleQuasi-static dynamic channel assignment using a linux PC clusteren_HK
dc.typeConference_Paperen_HK
dc.description.naturepublished_or_final_versionen_HK
dc.identifier.doi10.1109/HPC.2000.846542en_HK
dc.identifier.hkuros53858-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats