Re: Greedy routing

On Wed, 18 Feb 2009 22:12:02 GMT, Rod Beck said: http://www.physorg.com/news154093231.html From the fine article: "In greedy routing, a node passes information to the neighboring node that is closest to the final destination in an abstract space called hidden metric space." Sounds susp

RE: Greedy Routing

du; Rod Beck Cc: nanog list Subject: RE: Greedy Routing > > Maybe there's some critical insight in the paper that Physorg managed > to totally not mention, I dunno. I saw it the same way... " As the researchers explain, some types of networks are not navigable. For instance,

RE: Greedy Routing

> > Maybe there's some critical insight in the paper that Physorg managed > to totally not mention, I dunno. I saw it the same way... " As the researchers explain, some types of networks are not navigable. For instance, if the probability that two nodes are linked doesn't depend on the metric

Re: Greedy Routing

On Wed, 18 Feb 2009 22:12:02 GMT, Rod Beck said: > http://www.physorg.com/news154093231.html >From the fine article: "In greedy routing, a node passes information to the neighboring node that is closest to the final destination in an abstract space called hidden metric space." Sounds suspiciousl