A precomputation scheme for Minimum Interference Routing: The Least-Critical-Path-First algorithm

Gábor Rétvári, József J. Bíró, Tibor Cinkler, Tamás Henk

Research output: Contribution to journalConference article

17 Citations (Scopus)


This paper focuses on the selection of bandwidth-guaranteed channels for communication sessions that require it. The basic idea comes from Minimum Interference Routing: select a feasible path that puts the least possible restriction on the available transmission capacity of other communicating parties. This is achieved by circumventing some critical bottleneck links. The main contribution of the paper is a novel characterization of link criticality, the criticality threshold, which can be readily precomputed for routing dozens of subsequent calls. Based on this finding we define a generic precomputation framework for minimum interference routing, the Least-Critical-Path-First routing algorithm. We show by means of extensive simulations that efficient route precomputation is possible even in the case, when accurate resource availability information is not immediately available.

Original languageEnglish
Pages (from-to)260-268
Number of pages9
JournalProceedings - IEEE INFOCOM
Publication statusPublished - Oct 10 2005
EventIEEE INFOCOM 2005 - Miami, FL, United States
Duration: Mar 13 2005Mar 17 2005

ASJC Scopus subject areas

  • Computer Science(all)
  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'A precomputation scheme for Minimum Interference Routing: The Least-Critical-Path-First algorithm'. Together they form a unique fingerprint.

  • Cite this