Inter-arrival Planning for Sub-graph Routing Protection in WDM Networks

Mello, Darli A. A.; Pelegrini, Jefferson U.; Savasini, Marcio S.; Pavani, Gustavo Sousa; Waldman, Hélio

doi:10.1007/978-3-540-27824-5_45

Cited by 6 publications

(8 citation statements)

References 2 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…This is shown to be much less of a factor than previously thought, due to the introduction of constrained routing, Inter-Arrival Planning [16], and Dynamic SubGraph Routing [17]. Constrained routing reduces the probability of reassignment below that of backup multiplexing protection.…”

Section: Discussionmentioning

confidence: 87%

“…Path/trunk constrained routing sharply increased overall connection blocking probability and is not seen as a viable solution unless minimization of probability of reassignment is more crucial than the minimization of blocking probability in a particular network. Solutions to this problem have been presented in the form of Inter-Arrival Planning [16] and Dynamic SubGraph Routing Protection [17]. These papers indicate that using constrained trunk routing, coupled with off-line optimization, may reduce or eliminate is not considered due to its drastically higher blocking probability.…”

Section: Resultsmentioning

confidence: 99%

“…Inter-Arrival Planning, proposed in [16], enlists the off-line processing of sub-graph states to heuristically maximize the performance of trunk constrained routing, and significantly reduce the associated performance penalties. Dynamic SubGraph Routing [17] boosts the capacity-efficiency of sub-graph routing and also attempts to solve the issue of connection reconfiguration (in terms of path and trunk reassignment).…”

Section: Constrained Sub-graph Routingmentioning

confidence: 99%

See 2 more Smart Citations

Sub-graph routing: A generalized fault-tolerant strategy for link failures in WDM optical networks

Frederick¹,

Datta²,

Somani³

2006

Computer Networks

View full text Add to dashboard Cite

Section: Discussionmentioning

confidence: 87%

Section: Resultsmentioning

confidence: 99%

Section: Constrained Sub-graph Routingmentioning

confidence: 99%

See 1 more Smart Citation

Sub-graph routing: A generalized fault-tolerant strategy for link failures in WDM optical networks

Frederick¹,

Datta²,

Somani³

2006

Computer Networks

View full text Add to dashboard Cite

“…Outra proposta recente sugere uma estratégia de planejamento entre chegadas associada ao esquema de protec ¸ão por sub-grafos [6]. Este planejamento tenta agregar inteligência ao gerenciamento dos caminhos de protec ¸ão, visando diminuir a probabilidade de realocac ¸ão ao mesmo tempo em que a probabilidade de bloqueio mantém-se praticamente igual.…”

unclassified

Colorimento Flexível de Caminhos de Proteção em Redes Ópticas WDM Protegidas por Sub-Grafos

Savasini¹,

Mello²,

Pelegrini³

et al. 2004

Anais Do XXI Simpósio Brasileiro De Telecomunicações

View full text Add to dashboard Cite

Resumo-A protec ¸ão por roteamento em sub-grafos (SGRP) em redes WDM de caminhos ópticos foi recentemente introduzida como uma alternativa eficiente em termos de utilizac ¸ão da rede. Entretanto, uma desvantagem relevante é a chamada realocac ¸ão altruísta, que se caracteriza pela realocac ¸ão, no momento da falha, do caminho ou comprimento de onda de conexões que não utilizam o enlace que falhou. Este artigo aprimora o conceito de protec ¸ão por roteamento em sub-grafos por meio de uma heurística no RWA em sub-grafos que elimina a realocac ¸ão altruísta. Comparada a outros métodos de supressão da realocac ¸ão altruísta, a nova heurística exerce impacto reduzido sobre a probabilidade de bloqueio e apresenta baixa complexidade computacional. Essa melhoria é alcanc ¸ada ao custo da re-otimizac ¸ão do comprimento de onda dos caminhos de protec ¸ão no momento da aceitac ¸ão de uma nova conexão. Palavras-Chave-Protec ¸ão e Restaurac ¸ão, Protec ¸ão por Roteamento em Sub-Grafos, Protec ¸ão por Caminho, Redes Ópticas, WDMAbstract-Sub-Graph Routing Protection (SGRP) in lightpath switched WDM networks was recently introduced as an efficient alternative in terms of network utilization. However, a major drawback of SGRP is that, upon the occurrence of a link failure, even connections that do not traverse the faulty link may have their path or wavelength reassigned. This paper improves the SGRP concept introducing a heuristic in the RWA in the subgraphs that suppresses the altruistic reassignment. When compared to other methods for altruistic reassignment suppression, this new heuristic exhibits a reduced impact on the blocking probability with low computation complexity. This improvement is achieved at the cost of re-optimizing the wavelength of backup paths whenever a new connection is accepted.

show abstract

“…This property results in the possible interruption of an altruistic connection as discussed in [17]. However, constrained routing [61], Inter-Arrival Planning [17], and Dynamic Sub-Graph…”

Section: Chapter 3 Subgraph-based Routingmentioning

confidence: 99%

Survivability approaches for multiple failures in WDM optical networks

Datta

Somani

View full text Add to dashboard Cite

Inter-arrival Planning for Sub-graph Routing Protection in WDM Networks

Cited by 6 publications

References 2 publications

Sub-graph routing: A generalized fault-tolerant strategy for link failures in WDM optical networks

Sub-graph routing: A generalized fault-tolerant strategy for link failures in WDM optical networks

Colorimento Flexível de Caminhos de Proteção em Redes Ópticas WDM Protegidas por Sub-Grafos

Survivability approaches for multiple failures in WDM optical networks

Contact Info

Product

Resources

About