compact roundtrip routing with topology-independent node names
This paper presents compact roundtrip routing schemes with local tables of size  (?n) and stretch 6 for any directed network with arbitrary edge weights; and with local tables of size  (? ?1 n 2/ k ) and stretch min((2 k /2 ?1)( k + ?), 16 k 2 + 8 k ? 8), for any directed network with polynomially-sized edges, both in the topology-independent node-name mode l . These are the first topology-independent results that apply to routing in directed networks.
compact routing paper scheme locality tables size stretch direct network digraphs compact routing distributed lookup tables topologies