Oblivious routing on geometric networks

We study oblivious routing in which the packet paths are constructed independently of each other. We give a simple oblivious routing algorithm for geometric networks in which the nodes are embedded in the Euclidean plane. In our algorithm, a packet path is constructed by first choosing a random intermediate node in the space between the source and destination, and then the packet is sent to its destination through the intermediate node. We analyze the performance of the algorithm in terms of the stretch and congestion of the resulting paths. We show that the stretch is constant, and the congestion is near optimal when the network paths can be chosen to be close to the geodesic lines that connect the end points of the paths. We give applications of our general result to the mesh topology and uniformly distributed disc graphs. Previous oblivious routing algorithms with near optimal congestion use many intermediate nodes and do not control the stretch. Categories and Subject Descriptors...

• Type: Conference
• Year: 2005
• Where: SPAA
• Authors: Costas Busch, Malik Magdon-Ismail, Jing Xi
• Keywords: Distributed And Parallel Computing, Intermediate Nodes, Oblivious Routing, Oblivious Routing Algorithms, SPAA 2005