Computer Science – Networking and Internet Architecture
Scientific paper
2006-01-18
Europhys. Lett., 74 (6), pp. 1102-1108 (2006)
Computer Science
Networking and Internet Architecture
5 pages, 4 figures
Scientific paper
10.1209/epl/i2006-10049-1
We 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.
Carmi Shai
Cohen Reuven
Dolev Danny
No associations
LandOfFree
Search in Complex Networks : a New Method of Naming does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Search in Complex Networks : a New Method of Naming, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Search in Complex Networks : a New Method of Naming will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-449317