Please use this identifier to cite or link to this item:
Type: Artigo de periódico
Title: A minimum interference routing algorithm with reduced computational complexity
Author: Figueiredo, GB
da Fonseca, NLS
Monteiro, JAS
Abstract: Minimum interference routing algorithms are designed to reduce rejection's of future requests for the establishment of Label Switched Paths (LSPs) but make no assumption about specific patterns of arrival request. This paper introduces a novel minimum interference routing algorithm, Light Minimum Interference Routing (LMIR), which is based on a new approach to the identification of critical links. This approach reduces the computational complexity involved in finding a path for the establishment of an LSP. The LMIR is shown to have the same precision as existing algorithms but with less computational complexity. (c) 2005 Elsevier B.V. All rights reserved.
Subject: traffic engineering
minimum interference routing
Country: Holanda
Editor: Elsevier Science Bv
Rights: fechado
Identifier DOI: 10.1016/j.comnet.2005.06.015
Date Issue: 2006
Appears in Collections:Artigos e Materiais de Revistas Científicas - Unicamp

Files in This Item:
File Description SizeFormat 
WOS000238635900004.pdf514.24 kBAdobe PDFView/Open

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.