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

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

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

17 Citations (Scopus)

Abstract

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
Title of host publicationProceedings - IEEE INFOCOM
EditorsK. Makki, E. Knightly
Pages260-268
Number of pages9
Volume1
Publication statusPublished - 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 algorithms
Availability
Bandwidth
Communication

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Hardware and Architecture

Cite this

Rétvári, G., Bíró, J. J., Cinkler, T., & Henk, T. (2005). A precomputation scheme for Minimum Interference Routing: The Least-Critical-Path-First algorithm. In K. Makki, & E. Knightly (Eds.), Proceedings - IEEE INFOCOM (Vol. 1, pp. 260-268)

A precomputation scheme for Minimum Interference Routing : The Least-Critical-Path-First algorithm. / Rétvári, Gábor; Bíró, József J.; Cinkler, T.; Henk, Tamás.

Proceedings - IEEE INFOCOM. ed. / K. Makki; E. Knightly. Vol. 1 2005. p. 260-268.

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

Rétvári, G, Bíró, JJ, Cinkler, T & Henk, T 2005, A precomputation scheme for Minimum Interference Routing: The Least-Critical-Path-First algorithm. in K Makki & E Knightly (eds), Proceedings - IEEE INFOCOM. vol. 1, pp. 260-268, IEEE INFOCOM 2005, Miami, FL, United States, 3/13/05.
Rétvári G, Bíró JJ, Cinkler T, Henk T. A precomputation scheme for Minimum Interference Routing: The Least-Critical-Path-First algorithm. In Makki K, Knightly E, editors, Proceedings - IEEE INFOCOM. Vol. 1. 2005. p. 260-268
Rétvári, Gábor ; Bíró, József J. ; Cinkler, T. ; Henk, Tamás. / A precomputation scheme for Minimum Interference Routing : The Least-Critical-Path-First algorithm. Proceedings - IEEE INFOCOM. editor / K. Makki ; E. Knightly. Vol. 1 2005. pp. 260-268
@inproceedings{cef3abb5272645faa60f61f748bf6b7d,
title = "A precomputation scheme for Minimum Interference Routing: The Least-Critical-Path-First algorithm",
abstract = "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.",
author = "G{\'a}bor R{\'e}tv{\'a}ri and B{\'i}r{\'o}, {J{\'o}zsef J.} and T. Cinkler and Tam{\'a}s Henk",
year = "2005",
language = "English",
volume = "1",
pages = "260--268",
editor = "K. Makki and E. Knightly",
booktitle = "Proceedings - IEEE INFOCOM",

}

TY - GEN

T1 - A precomputation scheme for Minimum Interference Routing

T2 - The Least-Critical-Path-First algorithm

AU - Rétvári, Gábor

AU - Bíró, József J.

AU - Cinkler, T.

AU - Henk, Tamás

PY - 2005

Y1 - 2005

N2 - 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.

AB - 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.

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

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

M3 - Conference contribution

AN - SCOPUS:25844450260

VL - 1

SP - 260

EP - 268

BT - Proceedings - IEEE INFOCOM

A2 - Makki, K.

A2 - Knightly, E.

ER -