OFC/NFOEC 2008 - 2008 Conference on Optical Fiber Communication/National Fiber Optic Engineers Conference 2008
DOI: 10.1109/ofc.2008.4528659
|View full text |Cite
|
Sign up to set email alerts
|

Physical Impairment Based Regenerator Placement and Routing in Translucent Optical Networks

Abstract: A novel constraint-based routing (CBR) algorithm taking into account the dominant linear and nonlinear fiber optical transmission impairments has been analyzed. It is shown that CBR and intelligent regenerator placement decrease the blocking probability significantly. IntroductionIn future transparent optical transmission systems automatic wavelength switching will be introduced (automatically switched optical network, ASON). The rapidly increasing traffic demands require solutions, which reduce the operation… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

1
20
0

Year Published

2010
2010
2015
2015

Publication Types

Select...
4
3
2

Relationship

0
9

Authors

Journals

citations
Cited by 52 publications
(21 citation statements)
references
References 8 publications
1
20
0
Order By: Relevance
“…Commonly, the regenerator placement is solved first, producing a network for which the IA-RWA problem is then addressed. This strategy has been followed in [14]- [18] for static traffic, and in [11]- [13], [19]- [21] considering dynamic traffic. Other works have been presented which focus on minimizing the number of nodes with signal regeneration capability in the network, guaranteeing a certain degree of connectivity [19], [22], [23].…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…Commonly, the regenerator placement is solved first, producing a network for which the IA-RWA problem is then addressed. This strategy has been followed in [14]- [18] for static traffic, and in [11]- [13], [19]- [21] considering dynamic traffic. Other works have been presented which focus on minimizing the number of nodes with signal regeneration capability in the network, guaranteeing a certain degree of connectivity [19], [22], [23].…”
Section: Related Workmentioning
confidence: 99%
“…To this end, they suggest a two-step algorithm which is compared to a k-coverage algorithm for mobile and ad hoc wireless networks. The authors in [19], [23] propose a regenerator placement based on the greedy algorithm from [24] to get full-connectivity and two simple RWA algorithms based on shortest path and assigning the wavelengths by first-fit. One model considers the worst-case physical transmission penalties, while the other model takes into account the current network status in order to obtain the physical impairments.…”
Section: Related Workmentioning
confidence: 99%
“…Recent studies in OCS (e.g. [5]) show that better network performance can be achieved by treating the RP and the routing problem together in the so-called RRP problem.…”
Section: Related Workmentioning
confidence: 99%
“…First, because 3R regenerator is one of the most expensive components in the optical transport networks, much effort was dedicated to efficiently choosing regeneration sites and allocating regenerators [12]- [14], [8], [7], [15]. Second, given a set of regeneration sites and regenerators, a range of lightpath routing and wavelength assignment algorithms were developed to efficiently utilize the regeneration capability, such that lightpath demands are maximally satisfied and a minimum lightpath blocking probability is achieved [12], [7], [16]- [19].…”
Section: Introductionmentioning
confidence: 99%