Distributed routing in tree networks with few landmarks

Emiris, IZ; Markou, E; Pagourtzis, A

dc.contributor.author	Emiris, IZ	en
dc.contributor.author	Markou, E	en
dc.contributor.author	Pagourtzis, A	en
dc.date.accessioned	2014-03-01T02:44:00Z
dc.date.available	2014-03-01T02:44:00Z
dc.date.issued	2006	en
dc.identifier.issn	03029743	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/31616
dc.subject	Mobile Agent	en
dc.subject	Routing Algorithm	en
dc.subject	Tree Network	en
dc.subject.other	Distributed routing	en
dc.subject.other	Global informations	en
dc.subject.other	Information distributions	en
dc.subject.other	Landmark node	en
dc.subject.other	Landmark selection	en
dc.subject.other	Memory consumption	en
dc.subject.other	Memory requirements	en
dc.subject.other	Navigation algorithms	en
dc.subject.other	Short-path	en
dc.subject.other	Stretch factor	en
dc.subject.other	Target nodes	en
dc.subject.other	Tree network	en
dc.subject.other	Tree topology	en
dc.subject.other	Algorithms	en
dc.subject.other	Mobile agents	en
dc.subject.other	Wireless networks	en
dc.title	Distributed routing in tree networks with few landmarks	en
heal.type	conferenceItem	en
heal.identifier.primary	10.1007/11922377_5	en
heal.identifier.secondary	http://dx.doi.org/10.1007/11922377_5	en
heal.publicationDate	2006	en
heal.abstract	We consider the problem of finding a short path between any two nodes of a network when no global information is available, nor any oracle to help in routing. A mobile agent, situated in a starting node, has to walk to a target node traversing a path of minimum length. All information about adjacencies is distributed to certain nodes called landmarks. We wish to minimize the total memory requirements as well as keep the memory requirements per landmark to reasonable levels. We propose a landmark selection and information distribution scheme with overall memory requirement linear in the number of nodes, and constant memory consumption per non-landmark node. We prove that a navigation algorithm using this scheme attains a constant stretch factor overhead in tree topologies, compared to an optimal landmark-based routing algorithm that obeys certain restrictions. The flexibility of our approach allows for various trade-offs, such as between the number of landmarks and the size of the region assigned to each landmark. © 2006 Springer-Verlag.	en
heal.journalName	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)	en
dc.identifier.doi	10.1007/11922377_5	en
dc.identifier.volume	4235 LNCS	en
dc.identifier.spage	45	en
dc.identifier.epage	57	en