Translucent optical network design: A novel two-step method

Rizzelli, Giuseppe; Maier, Guido; Pattavina, Achille

doi:10.1109/ecoc.2010.5621518

Cited by 3 publications

(8 citation statements)

References 3 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This study extends our previous work [10] by providing a comprehensive analytical design framework that jointly addresses network resource dimensioning (DWDM systems, TXPs, regenerating nodes) and network cost evaluation in terms of capital expenditure (CAPEX) and operational expenditure (OPEX).…”

Section: Prior Workmentioning

confidence: 59%

“…We demonstrate how our model can be easily extended to consider some deployment constraints, such as when some nodes may not be selected as regenerator sites (due to equipment-footprint or power constraints) or when a regenerator site may support only a limited number of regenerators, etc. Then, we provide the algorithmic details of a hybrid model (mixed ILP and heuristic briefly described in [10]) which will be used below as comparison for planning results.…”

Section: Translucent Design Approachesmentioning

confidence: 99%

“…The constraint that enforces the link disjointness of the working and the protection paths is expressed by Eq. (10). A given physical link (l, m) can support at most one single traffic flow of a given demand r (working or protection).…”

Section: A the K-p Ia-ilp Formulationmentioning

confidence: 99%

“…(8)], it should be noted that the link disjointness [Eq. (10)] has to be directly applied to the physical graph, while it cannot be imposed on the connectivity graph because two different logical edges can share some physical links. Moreover, even a single logical edge could also be traversed by the working and protection lightpath of a certain demand at the same time, since it may happen that two q th physical paths associated with the same logical edge are link disjoint.…”

Section: A the K-p Ia-ilp Formulationmentioning

confidence: 99%

“…Moreover, we show how to extend this formulation to encompass some practical deployment constraints. Besides, we also propose a hybrid ILP/heuristic procedure [10] applicable to large size design problems for which IA-ILP is not computationally practicable.…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

Impairment-Aware Design of Translucent DWDM Networks Based on the k-Path Connectivity Graph

Rizzelli

Tornatore

Maier

et al. 2012

J. Opt. Commun. Netw.

Self Cite

View full text Add to dashboard Cite

In this paper we propose a design procedure based on comprehensive integer linear programing (ILP) for translucent optical transport networks (OTNs), exploiting an extended version of the so-called "connectivity graph." For the first time to the best of our knowledge, we propose a mathematical approach that covers the manifold challenges of a realistic optical layer OTN design, jointly solving the regenerator placement problem (RPP) and the routing, fiber and wavelength assignment with regenerator problem (RFWA-RP). As a first contribution, we extend the concept of the connectivity graph to a k-path (k-p) connectivity graph. Second, the formulation addresses the problem of planning the number of dense wavelength division multiplexing systems, jointly solving the RPP and placing transponders. Third, we consider regeneration devices as wavelength converters also, showing the benefits arising from that aspect disregarded in the existing impairmentaware (IA) ILP formulations based on the connectivity graph. Finally we compare over different networks the results of our design procedure with those achieved by a hybrid method that combines a simplified IA-ILP formulation with a greedy heuristic. Moreover, an analytical framework to evaluate the network cost in terms of capital expenditure and operational expenditure is also presented. We show that the k-p connectivity graph represents a cost-effective tool for network design, as it allows one to greatly reduce the number of resources needed in both the protected and the unprotected scenarios. Index Terms-Connectivity graph; Impairment-aware integer linear programing (IA-ILP) formulation; Regenerator placement problem (RPP); Routing fiber and wavelength assignment with regenerator problem (RFWA-RP); Translucent network design.

show abstract

Section: Prior Workmentioning

confidence: 59%

Section: Translucent Design Approachesmentioning

confidence: 99%

Section: A the K-p Ia-ilp Formulationmentioning

confidence: 99%

Section: A the K-p Ia-ilp Formulationmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations