Search in Complex Networks : a New Method of Naming

Simple item page
dc.creatorCarmi, Shai
dc.creatorCohen, Reuven
dc.creatorDolev, Danny
dc.date2006-01-18
dc.date.accessioned2026-07-07T06:57:59Z
dc.date.available2026-07-07T06:57:59Z
dc.descriptionWe suggest a method for routing when the source does not posses full information about the shortest path to the destination. The method is particularly useful for scale-free networks, and exploits its unique characteristics. By assigning new (short) names to nodes (aka labelling) we are able to reduce significantly the memory requirement at the routers, yet we succeed in routing with high probability through paths very close in distance to the shortest ones.
dc.description5 pages, 4 figures
dc.identifierhttps://arxiv.org/abs/cs/0601082
dc.identifierhttp://arxiv.org/abs/cs/0601082
dc.identifierEurophys. Lett., 74 (6), pp. 1102-1108 (2006)
dc.identifierdoi:10.1209/epl/i2006-10049-1
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/107179
dc.subjectNetworking and Internet Architecture
dc.subjectDisordered Systems and Neural Networks
dc.titleSearch in Complex Networks : a New Method of Naming
dc.typetext

Files

Collections

arXiv