44/2004 : Interference Minimizing Bandwidth Guaranteed On-Line Routing Algorithm for Traffic Engineering

RR Number

44/2004

Conference

12th IEEE International Conference on Networks (ICON 2004)

Author(s)

Karl Hendling, Thomas Losert, Wolfgang Huber, Martin Jandl

Abstract

This paper presents a fast and non-greedy interference minimizing routing algorithm (IMRA) for dynamic routing of bandwidth guaranteed LSPs (Label Switched Paths). The algorithm operates on-line by handling requests that arrive one by one without the need for a priori knowledge of traffic characteristics except the information on the ingress-egress pairs. Our proposed algorithm combines three criteria: minimization of interference, saving of residual link bandwidth, and optimal usage of network capacity. The most important feature is the fast path computation to achieve short response time, which is a crucial factor for on-line routing algorithms. IMRA’s complexity is low, consequently scalable for large networks and suitable for on-line routing. Experiments under dynamic (short-lived) LSP requests show better performance than existing non-greedy routing algorithms, while consuming lower computation effort.

Bibtex

@inProceedings{hendling:interferenceminimizing,
  author        = "Karl Hendling and Thomas Losert and Wolfgang Huber and Martin Jandl",
  title         = "{Interference Minimizing Bandwidth Guaranteed On-Line Routing Algorithm for Traffic Engineering}",
  booktitle     = "Proceedings of the 12th IEEE International Conference on Networks (ICON~2004)",
  address       = "Singapore, Singapore",
  pages         = "497--503",
  volume        = "2",
  month         = nov # "~16--19,",
  year          = 2004,
  note          = "ISBN~0-7803-8783-X",
  note2         = "IEEE Catalog~No. 04EX955",
  note3         = "ISSN: 1531-2216",
}

Download

Get icon04.pdf - Adobe PDF-format, (173.86 KB; posted at November 29 2004; )