Area avoidance routing in distance-vector networks

Haim Zlatokrilov, Hanoch Levy

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

Network routing may be required, under certain applications, to avoid certain areas (or nodes). These areas can be of potential security threat, possess poor quality or have other undesired characteristics. Thus, protocols that can perform area avoidance routing can be beneficial for many objectives. Such routing is particularly challenging in distance-vector networks, where only the shortest-distance information is available to the nodes. We address this challenge by algorithms that retrieve distance-vector information from other nodes in the network, referred to as reference nodes, and exploit it for computing guaranteed area-avoiding paths. Having these paths, the source can direct the packets using loose source routing towards the destination. We lay out the model for area avoidance routing and study several algorithms for calculating area-avoiding paths. In addition, we address the problem of dynamically selecting reference nodes. We show, through analysis and extensive simulation, that in many cases a small number of reference nodes are sufficient for area avoidance routing1.

Original languageEnglish
Title of host publicationINFOCOM 2008
Subtitle of host publication27th IEEE Communications Society Conference on Computer Communications
Pages1148-1156
Number of pages9
DOIs
StatePublished - 2008
EventINFOCOM 2008: 27th IEEE Communications Society Conference on Computer Communications - Phoenix, AZ, United States
Duration: 13 Apr 200818 Apr 2008

Publication series

NameProceedings - IEEE INFOCOM
ISSN (Print)0743-166X

Conference

ConferenceINFOCOM 2008: 27th IEEE Communications Society Conference on Computer Communications
Country/TerritoryUnited States
CityPhoenix, AZ
Period13/04/0818/04/08

Keywords

  • Area avoidance
  • Distance vector
  • Routing
  • Security

Fingerprint

Dive into the research topics of 'Area avoidance routing in distance-vector networks'. Together they form a unique fingerprint.

Cite this