Please use this identifier to cite or link to this item:
|Type:||Artigo de periódico|
|Title:||Inter-arrival Planning For Sub-graph Routing Protection In Wdm Networks|
|Abstract:||We propose an inter-arrival planning strategy that strongly reduces path and wavelength reassignment in WDM networks protected by sub-graph routing. It has been recently demonstrated that Sub-Graph Routing Protection outperforms Backup Multiplexing in terms of blocking probability and link utilization. However, a major drawback is that upon occurrence of a link failure, even connections that do not traverse the faulty link may have to reassign their path or wavelength to accommodate others, interrupting the service. In this paper we show that offline inter-arrival planning of protection resources can efficiently reduce reassignment while preserving blocking performance. © Springer-Verlag 2004.|
|Appears in Collections:||Unicamp - Artigos e Outros Documentos|
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.