Convergence of ant routing algorithms -- Results for a simple parallel network and perspectives

Simple item page
dc.contributor.authorYoo, Joon-Hyuken_US
dc.contributor.authorLa, Richard J.en_US
dc.contributor.authorMakowski, Armand M.en_US
dc.contributor.departmentISRen_US
dc.contributor.departmentCSHCNen_US
dc.date.accessioned2007-05-23T10:14:35Z
dc.date.available2007-05-23T10:14:35Z
dc.date.issued2003en_US
dc.description.abstractWe study the convergence property of a family of distributed routing algorithms based on the ant colony metaphor, namely the uniform and regular ant routing algorithms discussed by Subramanian et al. For a simple two-node network, we show that the probabilistic routing tables converge in distribution (resp. in the a.s. sense) for the uniform (resp. regular) case. To the best of the authors' knowledge, the results given here appear to be the first formal convergence results for ant routing algorithms. Although they hold only for a very limited class of networks, their analysis already provide some useful lessons for extending the results to more complicated networks. We also discuss some of implementation issues that naturally arise from the convergence analysis.en_US
dc.format.extent148247 bytes
dc.format.mimetypeapplication/pdf
dc.identifier.urihttp://hdl.handle.net/1903/6399
dc.language.isoen_USen_US
dc.relation.ispartofseriesISR; TR 2003-44en_US
dc.relation.ispartofseriesCSHCN; TR 2003-21en_US
dc.subjectGlobal Communication Systemsen_US
dc.titleConvergence of ant routing algorithms -- Results for a simple parallel network and perspectivesen_US
dc.typeTechnical Reporten_US

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
TR_2003-44.pdf
Size:
144.77 KB
Format:
Adobe Portable Document Format
Download

Collections

Institute for Systems Research Technical Reports