Compact roundtrip routing with topology-independent node names

This paper presents compact roundtrip routing schemes with local tables of size ˜O( √ n) and stretch 6 for any directed network with arbitrary edge weights; and with local tables of size ˜O( −1 n2/k ) and stretch min((2k/2 − 1)(k + ), 16k2 + 8k − 8), for any directed network with polynomially-sized edges, both in the topology-independent node-name model.1 These are the first topology-independent results that apply to routing in directed networks. Categories and Subject Descriptors C.2.1 [Computer-Communication Networks]: Network Architecture and Design—Network Communications, Store and Forward Networks; G.2.2 [Discrete Mathematics]: Graph Theory— Path and Circuit Problems, Network Problems, Trees, Graph labeling. Keywords Compact Routing, Digraphs, Stretch, Distributed Lookup Tables.

• Type: Conference
• Year: 2003
• Where: PODC
• Authors: Marta Arias, Lenore Cowen, Kofi A. Laing
• Keywords: Directed Networks, Distributed And Parallel Computing, Local Tables, PODC 2003, Roundtrip Routing Schemes