Greedy Routing

2009-02-18 Thread Rod Beck
http://www.physorg.com/news154093231.html Roderick S. Beck Director of European Sales Hibernia Atlantic 13-15, rue Sedaine, 75011 Paris http://www.hiberniaatlantic.com

Re: Greedy Routing

2009-02-18 Thread Valdis . Kletnieks
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 suspiciously

RE: Greedy Routing

2009-02-18 Thread Deepak Jain
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

2009-02-18 Thread Jake Mertel
: 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, if the probability that two nodes

Re: Greedy routing

2009-02-18 Thread Brighten Godfrey
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