Optimal Oblivious Routing in Hole-Free Networks

Costas Busch; Malik Magdon-Ismail

doi:10.1007/978-3-642-29222-4_30

Optimal Oblivious Routing in Hole-Free Networks

Costas Busch, Malik Magdon-Ismail

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

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.

Original language	English (US)
Title of host publication	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.
Pages	421-437
Number of pages	17
DOIs	https://doi.org/10.1007/978-3-642-29222-4_30
State	Published - 2012
Externally published	Yes
Event	7th International Conference on Heterogeneous Networking for Quality, Reliability, Security and Robustness, QShine 2010, and Dedicated Short Range CommunicationsWorkshop, DSRC 2010 - Houston, TX, United States Duration: Nov 17 2010 → Nov 19 2010

Publication series

Name	Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering, LNICST
Volume	74 LNICST
ISSN (Print)	1867-8211

Conference

Conference	7th International Conference on Heterogeneous Networking for Quality, Reliability, Security and Robustness, QShine 2010, and Dedicated Short Range CommunicationsWorkshop, DSRC 2010
Country	United States
City	Houston, TX
Period	11/17/10 → 11/19/10

Keywords

congestion
oblivious routing
path stretch
sensor networks
wireless networks

ASJC Scopus subject areas

Computer Networks and Communications

Access to Document

10.1007/978-3-642-29222-4_30

Fingerprint Dive into the research topics of 'Optimal Oblivious Routing in Hole-Free Networks'. Together they form a unique fingerprint.

Cite this

Busch, C., & Magdon-Ismail, M. (2012). Optimal Oblivious Routing in Hole-Free Networks. In 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. (pp. 421-437). (Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering, LNICST; Vol. 74 LNICST). https://doi.org/10.1007/978-3-642-29222-4_30

Optimal Oblivious Routing in Hole-Free Networks. / Busch, Costas; Magdon-Ismail, Malik.

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.. 2012. p. 421-437 (Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering, LNICST; Vol. 74 LNICST).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Busch, C & Magdon-Ismail, M 2012, Optimal Oblivious Routing in Hole-Free Networks. in 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.. Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering, LNICST, vol. 74 LNICST, pp. 421-437, 7th International Conference on Heterogeneous Networking for Quality, Reliability, Security and Robustness, QShine 2010, and Dedicated Short Range CommunicationsWorkshop, DSRC 2010, Houston, TX, United States, 11/17/10. https://doi.org/10.1007/978-3-642-29222-4_30

Busch C, Magdon-Ismail M. Optimal Oblivious Routing in Hole-Free Networks. In 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.. 2012. p. 421-437. (Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering, LNICST). https://doi.org/10.1007/978-3-642-29222-4_30

Busch, Costas ; Magdon-Ismail, Malik. / Optimal Oblivious Routing in Hole-Free Networks. 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.. 2012. pp. 421-437 (Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering, LNICST).

@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",

note = "Copyright: Copyright 2013 Elsevier B.V., All rights reserved.; 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",

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.",

}

TY - GEN

T1 - Optimal Oblivious Routing in Hole-Free Networks

AU - Busch, Costas

AU - Magdon-Ismail, Malik

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 -