Convergence Properties For Uniform Ant Routing

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:08Z
dc.date.available2007-05-23T10:14:08Z
dc.date.issued2003en_US
dc.description.abstractWe study the convergence property of a family of distributed routingalgorithms based on the ant colony metaphor, which generalize the uniform ant routing algorithms proposed earlier. For a simple two-node network, we show that the probabilistic routing tables under these algorithms converge in distribution, and discuss some of implementation issues.en_US
dc.format.extent96878 bytes
dc.format.mimetypeapplication/pdf
dc.identifier.urihttp://hdl.handle.net/1903/6376
dc.language.isoen_USen_US
dc.relation.ispartofseriesISR; TR 2003-24en_US
dc.relation.ispartofseriesCSHCN; TR 2003-15en_US
dc.subjectGlobal Communication Systemsen_US
dc.titleConvergence Properties For Uniform Ant Routingen_US
dc.typeTechnical Reporten_US

Files

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

Collections

Institute for Systems Research Technical Reports