Please use this identifier to cite or link to this item:
Type: Artigo de evento
Title: On-arrival Planning For Sub-graph Routing Protection In Wdm Networks
Author: Mello D.A.A.
Savasini M.S.
Pelegrini J.U.
Waldman H.
Abstract: In this paper we incorporate the rerouting of backup paths to the Call Admission Control algorithm of Sub-Graph Routing Protection (SGRP). Sub-Graph Routing Protection with On-Arrival Planning (SGRP-OAP) has the two-fold benefit of strongly reducing the blocking probability of the protected system while eliminating the physical rerouting of established connections, which is a major drawback of the original proposal of SGRP. The new scheme is so capacity-efficient that, for all investigated topologies, at low traffic intensity the blocking probability of the system protected against single link failures is the same as the blocking probability of the unprotected system. This is possible because the new protection scheme is extremely effective in using the idle network capacity to provide backup paths. © 2005 by International Federation for Information Processing.
Editor: Springer New York LLC
Rights: fechado
Identifier DOI: 
Date Issue: 2005
Appears in Collections:Artigos e Materiais de Revistas Científicas - Unicamp

Files in This Item:
File Description SizeFormat 
2-s2.0-84902489845.pdf415.14 kBAdobe PDFView/Open

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