Greedy Routing
Nearly every solution to the problem of routing in small world involves the application of greedy routing. This sort of routing depends on a relative reference point by which any node in the path can choose the next node it believes is closest to the destination. That is, there must be something to be greedy about. For example, this could be geographic location, IP address, etc. In the case of Milgram's original small-world experiment, participants knew the location and occupation of the final recipient and could therefore forward messages based on those parameters.
Read more about this topic: Small World Routing
Famous quotes containing the word greedy:
“Don’t make your enemies happy.
Make up with your lover,
who’s greedy to be back
in your good graces.
Daughter,
because you’ve taken anger to extremes,
you won’t amount
to a hill of beans.”
—Hla Stavhana (c. 50 A.D.)