Gustavo B. Figueiredo (1), Nelson L. Saldanha da Fonseca (1), José A. Suruagy Monteiro (2)
e-mails: gustavo@ic.unicamp.br, nfonseca@ic.unicamp.br, suruagy@unifacs.br
Minimum Interference Routing algorithms aim at reducing rejections 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.
Keywords:Routing algorithm, Minimum Interference, Light Minimum Interference Routing
@INPROCEEDINGS{figueiredo04:401, AUTHOR = {Gustavo B. Figueiredo and Nelson L. Saldanha da Fonseca and José A. Suruagy Monteiro}, TITLE = {A Minimum Interference Routing Algorithm}, BOOKTITLE = {30ma Conferencia Latinoamericana de Informática (CLEI2004)}, YEAR = {2004}, editor = {Mauricio Solar and David Fernández-Baca and Ernesto Cuadros-Vargas}, pages = {1159--1178}, address = {}, month = Sep, organization = {Sociedad Peruana de Computación}, note = {ISBN 9972-9876-2-0}, file = {http://clei2004.spc.org.pe/es/html/pdfs/401.pdf} }
PDF de este artículo
PDF de CLEI2004 (incluye todos los artículos)
Página principal CLEI 2004
Generado por Sociedad Peruana de Computación