@inproceedings{b2985bf3068c4490bf6a772c9a2191ba,
title = "Optimal Oblivious Routing in Hole-Free Networks",
abstract = "We study oblivious routing algorithms in which the packet paths are constructed independently of each other. Oblivious algorithms are inherently distributed and they can be designed to efficiently balance the network utilization. We give an oblivious routing algorithm for the class of hole-free networks, in which the nodes are topologically embedded in simple areas of the plane. Such networks appear frequently in wireless and sensor network topologies. The algorithm achieves optimal congestion and stretch. The stretch of the resulting paths is constant. The congestion is O(C* logn), where C* is the optimal non-oblivious congestion and n is the number of nodes. This congestion bound is asymptotically worst-case optimal for oblivious routing algorithms.",
keywords = "congestion, oblivious routing, path stretch, sensor networks, wireless networks",
author = "Costas Busch and Malik Magdon-Ismail",
year = "2012",
doi = "10.1007/978-3-642-29222-4_30",
language = "English (US)",
isbn = "9783642292217",
series = "Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering, LNICST",
pages = "421--437",
booktitle = "Quality, Reliability,Security and Robustness in Heterogeneous Networks - 7th Int. Conf. on Heterogeneous Networking for Quality, Reliability, Security and Robustness, QShine 2010 and DSRC 2010.",
note = "7th International Conference on Heterogeneous Networking for Quality, Reliability, Security and Robustness, QShine 2010, and Dedicated Short Range CommunicationsWorkshop, DSRC 2010 ; Conference date: 17-11-2010 Through 19-11-2010",
}