Subject: Re: [rrg] Critique of Compact Routing

From: [email-masked]
Date: Sun, 4 Jan 2009 11:34:02 EST

Even worse:
In § 4.4 of this document the authors postolate that there is a   ~15 times 
path lengths increase due to hierarchical routing (obviously I mixed  up this 
number with (only!) stretch-3 mentioned at some other lines).
Either the research work is not trust-worthy or the authors had a very very  
bad hierarchical routing model in mind. 
Again: the conclusion that  any hierarchical routing model has such a  bad 
stretch behavior - note:
fifteen times the shortest path length !  - tells me that the authors  have 
never heard of Kurt Mehlhorn's algorithm, published in 1988,  including his  
proof that the distilled hierarchical mesh contains all  shortest path trees 
that interconnect the hierarchical nodes.
 
Heiner
 
In einer eMail vom 29.12.2008 23:56:13 Westeuropäische Normalzeit schreibt  
[email-masked]:

In an  earlier message 000565 I mentioned a paper:

On Compact  Routing for the Internet
Dmitri Krioukov, kc claffy, Kevin  Fall, Arthur Brady
ACM SIGCOMM CCR, v.37, n.3, p.41-52,  2007

This is available at:

http://arxiv.org/abs/0708.2309

-  Robin
_______________________________________________
rrg mailing  list
[email-masked]
https://www.irtf.org/mailman/listinfo/rrg

_______________________________________________
rrg mailing list
[email-masked]
https://www.irtf.org/mailman/listinfo/rrg