Please use this identifier to cite or link to this item: http://hdl.handle.net/2440/33544
Citations
Scopus Web of Science® Altmetric
?
?
Full metadata record
DC FieldValueLanguage
dc.contributor.authorSum, J.en
dc.contributor.authorShen, H.en
dc.contributor.authorLeung, C.en
dc.contributor.authorYoung, G.en
dc.date.issued2003en
dc.identifier.citationIEEE Transactions on Parallel and Distributed Systems, 2003; 14(3):193-202en
dc.identifier.issn1045-9219en
dc.identifier.urihttp://hdl.handle.net/2440/33544-
dc.description.abstractAnt routing is a method for network routing in agent technology. Although its effectiveness and efficiency have been demonstrated and reported in the literature, its properties have not yet been well studied. This paper presents some preliminary analysis on an ant algorithm in regard to its population growing property and jumping behavior. Results conclude that as long as the value max, {i/spl Omega//sub j/|} is known, the practitioner is able to design the algorithm parameters, such as the number of agents being created for each request, k, and the maximum allowable number of jumps of an agent, in order to meet the network constraint.en
dc.description.statementofresponsibilityJohn Sum, Hong Shen, Chi-sing Leung, and G. Youngen
dc.format.extent345656 bytesen
dc.format.mimetypeapplication/pdfen
dc.language.isoenen
dc.publisherIEEE Computer Socen
dc.rights© 2003 IEEEen
dc.titleAnalysis on a mobile agent-based algorithm for network routing and managementen
dc.typeJournal articleen
dc.identifier.rmid0020064335en
dc.identifier.doi10.1109/TPDS.2003.1189578en
dc.identifier.pubid50369-
pubs.library.collectionComputer Science publicationsen
pubs.verification-statusVerifieden
pubs.publication-statusPublisheden
dc.identifier.orcidShen, H. [0000-0002-3663-6591]en
Appears in Collections:Computer Science publications

Files in This Item:
File Description SizeFormat 
hdl_33544.pdf337.55 kBPublisher's PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.