Search in Complex Networks : a New Method of Naming

Computer Science – Networking and Internet Architecture

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

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.

Rate now

     

Profile ID: LFWR-SCP-O-449317

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.