Optimal Oblivious Routing in Hole-Free Networks

Costas Busch, Malik Magdon-Ismail

Research output: Chapter in Book/Report/Conference proceedingConference 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 languageEnglish (US)
Title of host publicationQuality, Reliability,Security and Robustness in Heterogeneous Networks - 7th Int. Conf. on Heterogeneous Networking for Quality, Reliability, Security and Robustness, QShine 2010 and DSRC 2010.
Pages421-437
Number of pages17
DOIs
StatePublished - 2012
Externally publishedYes
Event7th 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 2010Nov 19 2010

Publication series

NameLecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering, LNICST
Volume74 LNICST
ISSN (Print)1867-8211

Conference

Conference7th International Conference on Heterogeneous Networking for Quality, Reliability, Security and Robustness, QShine 2010, and Dedicated Short Range CommunicationsWorkshop, DSRC 2010
CountryUnited States
CityHouston, TX
Period11/17/1011/19/10

Keywords

  • congestion
  • oblivious routing
  • path stretch
  • sensor networks
  • wireless networks

ASJC Scopus subject areas

  • Computer Networks and Communications

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

Cite this