Current studentsExisting staffContact us
 

Analysis on extended ant routing algorithms for network routing and management

Simple item page
dc.contributor.authorSum, J.
dc.contributor.authorShen, H.
dc.contributor.authorYoung, G.
dc.contributor.authorWu, J.
dc.contributor.authorLeung, C.
dc.date.issued2003
dc.description.abstractAdvances in mobile agent research have brought in a new method for network routing, ant routing. Recently, we have derived some preliminary results regarding the agent population growth property and the jumping behavior for an ant routing algorithm. The focus was on the expected number of agents in a node. In practice, the number of agents propagating on each network channel is also critical as the network channel bandwidth is limited. In this paper, we first propose two extended ant routing algorithms, and then provide an in-depth analysis on the population growth behavior of the propagating agents for these algorithms, both at nodes (hosts) and on edges (channels) of the network.
dc.description.statementofresponsibilityJohn Sum, Hong Shen, G. Young, Jie Wu and Chi-Sing Leung
dc.identifier.citationJournal of Supercomputing, 2003; 24(3):327-340
dc.identifier.doi10.1023/A:1022088915084
dc.identifier.issn0920-8542
dc.identifier.issn1573-0484
dc.identifier.orcidShen, H. [0000-0002-3663-6591] [0000-0003-0649-0648]
dc.identifier.urihttp://hdl.handle.net/2440/36755
dc.language.isoen
dc.publisherKluwer Academic Publ
dc.rights© 2003 Kluwer Academic Publishers
dc.source.urihttp://www.springerlink.com/content/vn05575q443k7782/
dc.subjectInternet
dc.subjectmobile agents
dc.subjectrouting algorithms
dc.titleAnalysis on extended ant routing algorithms for network routing and management
dc.typeJournal article
pubs.publication-statusPublished

Files

Collections

Computer Science publications