File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Designing B-ISDN network topologies using the genetic algorithm

TitleDesigning B-ISDN network topologies using the genetic algorithm
Authors
Qin, ZhigangWu, Felix FLaw, Nathan
KeywordsComputers
Computer engineering
Issue Date1997
PublisherIEEE, Computer Society.
Citation
International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems Proceedings, Haifa, Israel, 12-15 January 1997, p. 140-145 How to Cite?
DOI: http://dx.doi.org/10.1109/MASCOT.1997.567599
AbstractIn this paper, the topology design of B-ISDN networks is addressed. We model the topological planning as a non-linear mixed-integer programming problem. The genetic algorithm, an effective optimization method, is applied to this problem. Since the randomness of the genetic algorithm cannot guarantee the biconnectivity requirement in the topologies generated by the genetic algorithm, we propose an algorithm to make all topologies at least biconnected while increasing the overall cost of the topologies the least. The result for a 20-node test case is presented in the paper and it is shown that the algorithm we propose has a very good convergence property.
Persistent Identifierhttp://hdl.handle.net/10722/46007
ISSN
1526-7539
2020 SCImago Journal Rankings: 0.178

 

DC FieldValueLanguage
dc.contributor.authorQin, Zhigangen_HK
dc.contributor.authorWu, Felix Fen_HK
dc.contributor.authorLaw, Nathanen_HK
dc.date.accessioned2007-10-30T06:40:30Z-
dc.date.available2007-10-30T06:40:30Z-
dc.date.issued1997en_HK
dc.identifier.citationInternational Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems Proceedings, Haifa, Israel, 12-15 January 1997, p. 140-145en_HK
dc.identifier.issn1526-7539en_HK
dc.identifier.urihttp://hdl.handle.net/10722/46007-
dc.description.abstractIn this paper, the topology design of B-ISDN networks is addressed. We model the topological planning as a non-linear mixed-integer programming problem. The genetic algorithm, an effective optimization method, is applied to this problem. Since the randomness of the genetic algorithm cannot guarantee the biconnectivity requirement in the topologies generated by the genetic algorithm, we propose an algorithm to make all topologies at least biconnected while increasing the overall cost of the topologies the least. The result for a 20-node test case is presented in the paper and it is shown that the algorithm we propose has a very good convergence property.en_HK
dc.format.extent628038 bytes-
dc.format.extent12538 bytes-
dc.format.mimetypeapplication/pdf-
dc.format.mimetypetext/plain-
dc.languageengen_HK
dc.publisherIEEE, Computer Society.en_HK
dc.relation.ispartofIEEE International Workshop on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems - Proceedingsen_HK
dc.rights©1997 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.-
dc.subjectComputersen_HK
dc.subjectComputer engineeringen_HK
dc.titleDesigning B-ISDN network topologies using the genetic algorithmen_HK
dc.typeConference_Paperen_HK
dc.identifier.openurlhttp://library.hku.hk:4550/resserv?sid=HKU:IR&issn=1526-7539&volume=&spage=140&epage=145&date=1997&atitle=Designing+B-ISDN+network+topologies+using+the+genetic+algorithmen_HK
dc.identifier.emailWu, Felix F: ffwu@eee.hku.hken_HK
dc.identifier.authorityWu, Felix F=rp00194en_HK
dc.description.naturepublished_or_final_versionen_HK
dc.identifier.doi10.1109/MASCOT.1997.567599en_HK
dc.identifier.scopuseid_2-s2.0-0030736731en_HK
dc.identifier.hkuros27112-
dc.identifier.spage140en_HK
dc.identifier.epage145en_HK
dc.identifier.scopusauthoridQin, Zhigang=7202822681en_HK
dc.identifier.scopusauthoridWu, Felix F=7403465107en_HK
dc.identifier.scopusauthoridLaw, Nathan=7005934139en_HK
dc.identifier.issnl1526-7539-

Export via OAI-PMH Interface in XML Formats

OR

Export to Other Non-XML Formats