TY - GEN
T1 - Optimal Oblivious Routing in Hole-Free Networks
AU - Busch, Costas
AU - Magdon-Ismail, Malik
N1 - Copyright:
Copyright 2013 Elsevier B.V., All rights reserved.
PY - 2012
Y1 - 2012
N2 - 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.
AB - 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.
KW - congestion
KW - oblivious routing
KW - path stretch
KW - sensor networks
KW - wireless networks
UR - http://www.scopus.com/inward/record.url?scp=84885017840&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84885017840&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-29222-4_30
DO - 10.1007/978-3-642-29222-4_30
M3 - Conference contribution
AN - SCOPUS:84885017840
SN - 9783642292217
T3 - Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering, LNICST
SP - 421
EP - 437
BT - 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.
T2 - 7th International Conference on Heterogeneous Networking for Quality, Reliability, Security and Robustness, QShine 2010, and Dedicated Short Range CommunicationsWorkshop, DSRC 2010
Y2 - 17 November 2010 through 19 November 2010
ER -