A distributed adaptive cache update algorithm for the dynamic source routing protocol

Xin Yu, Zvi Kedem

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

On-demand routing protocols use route caches to make routing decisions. Due to mobility, cached routes easily become stale. To address the cache staleness issue, prior work in DSR used heuristics with ad hoc parameters to predict the lifetime of a link or a route. However, heuristics cannot accurately predict timeouts because topology changes are unpredictable. In this paper, we propose to proactively disseminate the broken link information to the nodes that have that link in their caches. We define a new cache structure called a cache table and present a distributed cache update algorithm. Each node maintains in its cache table the information necessary for cache updates. When a link failure is detected, the algorithm notifies all reachable nodes that have cached the link in a distributed manner. The algorithm does not use any ad hoc parameters, thus making route caches fully adaptive to topology changes. We show that the algorithm outperforms DSR with path caches and with Link-MaxLife, an adaptive timeout mechanism for link caches. We conclude that proactive cache updating is the key to the adaptation of on-demand routing protocols to mobility.

Original languageEnglish (US)
Title of host publicationProceedings - IEEE INFOCOM 2005. The Conference on Computer Communications - 24th Annual Joint Conference of the IEEE Computer and Communications Societies
EditorsK. Makki, E. Knightly
Pages730-739
Number of pages10
Volume1
DOIs
StatePublished - 2005
EventIEEE INFOCOM 2005 - Miami, FL, United States
Duration: Mar 13 2005Mar 17 2005

Other

OtherIEEE INFOCOM 2005
CountryUnited States
CityMiami, FL
Period3/13/053/17/05

Fingerprint

Routing protocols
Topology

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Hardware and Architecture

Cite this

Yu, X., & Kedem, Z. (2005). A distributed adaptive cache update algorithm for the dynamic source routing protocol. In K. Makki, & E. Knightly (Eds.), Proceedings - IEEE INFOCOM 2005. The Conference on Computer Communications - 24th Annual Joint Conference of the IEEE Computer and Communications Societies (Vol. 1, pp. 730-739) https://doi.org/10.1109/INFCOM.2005.1497938

A distributed adaptive cache update algorithm for the dynamic source routing protocol. / Yu, Xin; Kedem, Zvi.

Proceedings - IEEE INFOCOM 2005. The Conference on Computer Communications - 24th Annual Joint Conference of the IEEE Computer and Communications Societies. ed. / K. Makki; E. Knightly. Vol. 1 2005. p. 730-739.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Yu, X & Kedem, Z 2005, A distributed adaptive cache update algorithm for the dynamic source routing protocol. in K Makki & E Knightly (eds), Proceedings - IEEE INFOCOM 2005. The Conference on Computer Communications - 24th Annual Joint Conference of the IEEE Computer and Communications Societies. vol. 1, pp. 730-739, IEEE INFOCOM 2005, Miami, FL, United States, 3/13/05. https://doi.org/10.1109/INFCOM.2005.1497938
Yu X, Kedem Z. A distributed adaptive cache update algorithm for the dynamic source routing protocol. In Makki K, Knightly E, editors, Proceedings - IEEE INFOCOM 2005. The Conference on Computer Communications - 24th Annual Joint Conference of the IEEE Computer and Communications Societies. Vol. 1. 2005. p. 730-739 https://doi.org/10.1109/INFCOM.2005.1497938
Yu, Xin ; Kedem, Zvi. / A distributed adaptive cache update algorithm for the dynamic source routing protocol. Proceedings - IEEE INFOCOM 2005. The Conference on Computer Communications - 24th Annual Joint Conference of the IEEE Computer and Communications Societies. editor / K. Makki ; E. Knightly. Vol. 1 2005. pp. 730-739
@inproceedings{917869c0242d44bf95a16b9fb2d32597,
title = "A distributed adaptive cache update algorithm for the dynamic source routing protocol",
abstract = "On-demand routing protocols use route caches to make routing decisions. Due to mobility, cached routes easily become stale. To address the cache staleness issue, prior work in DSR used heuristics with ad hoc parameters to predict the lifetime of a link or a route. However, heuristics cannot accurately predict timeouts because topology changes are unpredictable. In this paper, we propose to proactively disseminate the broken link information to the nodes that have that link in their caches. We define a new cache structure called a cache table and present a distributed cache update algorithm. Each node maintains in its cache table the information necessary for cache updates. When a link failure is detected, the algorithm notifies all reachable nodes that have cached the link in a distributed manner. The algorithm does not use any ad hoc parameters, thus making route caches fully adaptive to topology changes. We show that the algorithm outperforms DSR with path caches and with Link-MaxLife, an adaptive timeout mechanism for link caches. We conclude that proactive cache updating is the key to the adaptation of on-demand routing protocols to mobility.",
author = "Xin Yu and Zvi Kedem",
year = "2005",
doi = "10.1109/INFCOM.2005.1497938",
language = "English (US)",
isbn = "0780389689",
volume = "1",
pages = "730--739",
editor = "K. Makki and E. Knightly",
booktitle = "Proceedings - IEEE INFOCOM 2005. The Conference on Computer Communications - 24th Annual Joint Conference of the IEEE Computer and Communications Societies",

}

TY - GEN

T1 - A distributed adaptive cache update algorithm for the dynamic source routing protocol

AU - Yu, Xin

AU - Kedem, Zvi

PY - 2005

Y1 - 2005

N2 - On-demand routing protocols use route caches to make routing decisions. Due to mobility, cached routes easily become stale. To address the cache staleness issue, prior work in DSR used heuristics with ad hoc parameters to predict the lifetime of a link or a route. However, heuristics cannot accurately predict timeouts because topology changes are unpredictable. In this paper, we propose to proactively disseminate the broken link information to the nodes that have that link in their caches. We define a new cache structure called a cache table and present a distributed cache update algorithm. Each node maintains in its cache table the information necessary for cache updates. When a link failure is detected, the algorithm notifies all reachable nodes that have cached the link in a distributed manner. The algorithm does not use any ad hoc parameters, thus making route caches fully adaptive to topology changes. We show that the algorithm outperforms DSR with path caches and with Link-MaxLife, an adaptive timeout mechanism for link caches. We conclude that proactive cache updating is the key to the adaptation of on-demand routing protocols to mobility.

AB - On-demand routing protocols use route caches to make routing decisions. Due to mobility, cached routes easily become stale. To address the cache staleness issue, prior work in DSR used heuristics with ad hoc parameters to predict the lifetime of a link or a route. However, heuristics cannot accurately predict timeouts because topology changes are unpredictable. In this paper, we propose to proactively disseminate the broken link information to the nodes that have that link in their caches. We define a new cache structure called a cache table and present a distributed cache update algorithm. Each node maintains in its cache table the information necessary for cache updates. When a link failure is detected, the algorithm notifies all reachable nodes that have cached the link in a distributed manner. The algorithm does not use any ad hoc parameters, thus making route caches fully adaptive to topology changes. We show that the algorithm outperforms DSR with path caches and with Link-MaxLife, an adaptive timeout mechanism for link caches. We conclude that proactive cache updating is the key to the adaptation of on-demand routing protocols to mobility.

UR - http://www.scopus.com/inward/record.url?scp=25844520827&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=25844520827&partnerID=8YFLogxK

U2 - 10.1109/INFCOM.2005.1497938

DO - 10.1109/INFCOM.2005.1497938

M3 - Conference contribution

AN - SCOPUS:25844520827

SN - 0780389689

VL - 1

SP - 730

EP - 739

BT - Proceedings - IEEE INFOCOM 2005. The Conference on Computer Communications - 24th Annual Joint Conference of the IEEE Computer and Communications Societies

A2 - Makki, K.

A2 - Knightly, E.

ER -