Optimal regenerator placement in survivable translucent networks

Rahman, Quazi; Aneja, Y. P.; Bandyopadhyay, Subir; Jaekel, Arunita

doi:10.1109/drcn.2014.6816144

Cited by 6 publications

(14 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Experiments reported in [10] reveal that only a relatively small number of the constraints are usually needed, so that the basis size is, in general, quite small and the LP relaxations can be solved very quickly. We have used this algorithm as a key component for our heuristic, SOL-H.…”

Section: Heuristic Solution For Rpp With Path Protectionmentioning

confidence: 99%

“…In [10] was extended to optimally solve the RPP for survivable translucent networks where the restoration technique is used. Experiments reported in [10] reveal that only a relatively small number of the constraints are usually needed, so that the basis size is, in general, quite small and the LP relaxations can be solved very quickly.…”

Section: Heuristic Solution For Rpp With Path Protectionmentioning

confidence: 99%

“…R : a placement of regenerators that satisfies the requirements of RPP with path protection. placementF orRestoration(G, w) : a function that invokes the branch-and-cut algorithm in [10] to generate an initial placement of regenerators. The argument for the function is the weighted graph (G, w) representing the network, where G = (N, E).…”

Section: Heuristic Solution For Rpp With Path Protectionmentioning

confidence: 99%

“…In Step 1, the function placementF orRestoration(G, w) calls the branch-and-cut algorithm, developed in [10] to return a set of regenerator-capable nodes, which is saved in the set R 1 . In Step 6, we check, using function commodityCannotBeHandled, whether the current commodity, represented by source-destination pair, say (S, D), can be handled by the network using the regenerators in R 1 .…”

Section: Details Of the Heuristic Sol-hmentioning

confidence: 99%

“…In the heuristic, we have used the branch-and-cut approach for optimal RPP, satisfying the requirements for restoration, described in [10] to generate R 1 , an initial placement of regenerators. As pointed out above, this initial placement does not necessarily give a regenerator placement for RPP with path protection.…”

Section: Heuristic Solution For Rpp With Path Protectionmentioning

confidence: 99%

See 4 more Smart Citations

Optimal regenerator placement for path protection in impairment-aware WDM networks

Ramlall

Rahman

Aneja

et al. 2015

2015 IEEE 16th International Conference on High Performance Switching and Routing (HPSR)

Self Cite

View full text Add to dashboard Cite

This paper addresses the regenerator placement problem (RPP) when designing resilient, impairment aware WDM optical networks. For the RPP, we have proposed two solutions; an optimal solution for small networks (less than 10 nodes) and a near-optimal heuristic solution for practical-sized networks. The optimal solution uses an Integer Linear Program which can be implemented by any solver for mathematical programming. The heuristic makes use of an approach, proposed in a recent paper, that requires a formulation involving an exponential number of constraints. It was shown in that paper that this formulation can be solved very efficiently using a branch-and-cut algorithm and that the approach may be used to design resilient networks which guarantees restoration. In this paper we have shown that this branch-and-cut approach may be used as a part of a highly efficient heuristic which gave optimal results in an overwhelming number of cases that we tested.

show abstract

Section: Heuristic Solution For Rpp With Path Protectionmentioning

confidence: 99%

Section: Heuristic Solution For Rpp With Path Protectionmentioning

confidence: 99%

Section: Heuristic Solution For Rpp With Path Protectionmentioning

confidence: 99%

Section: Details Of the Heuristic Sol-hmentioning

confidence: 99%

Section: Heuristic Solution For Rpp With Path Protectionmentioning

confidence: 99%

See 3 more Smart Citations

Optimal regenerator placement for path protection in impairment-aware WDM networks

Ramlall

Rahman

Aneja

et al. 2015

2015 IEEE 16th International Conference on High Performance Switching and Routing (HPSR)

Self Cite

View full text Add to dashboard Cite

show abstract

A novel adaptive restoration algorithm for cost minimization of translucent optical networks

Toscano

Paparella

Morea

et al. 2017

19th Italian National Conference on Photonic Technologies (Fotonica 2017)

View full text Add to dashboard Cite

Minimizing Cost of Regeneration at Regeneration Sites–A New Approach for Dynamic Lightpath Establishment in Translucent Optical Networks

et al. 2020

View full text Add to dashboard Cite

Lightpaths in translucent optical networks have to undergo regeneration at certain nodes designated as regeneration sites to maintain its quality of transmission. Regenerating an optical signal necessitates optical-electronic-optical conversion and is thus a costly affair due to use of regeneration resources. Thus minimizing the cost of regeneration in such networks is vital. Minimizing cost of regeneration leads to two different problems; 1) the problem of minimizing the total cost of regeneration for the connections served and 2) the problem of minimizing the cost of regeneration at regeneration sites while serving the connections. The previous works on lightpath establishment in such networks have mostly addressed the first problem. In this paper we study the second problem i.e. the problem of minimizing the cost of regeneration at regeneration sites during dynamic establishment of lightpaths. As the problem is NP-Complete, we propose an Integer Linear Program for small networks and then propose two heuristic routing approaches for large networks. Time complexity analysis shows that our heuristic algorithms run in polynomial time. Extensive simulation experiments reveal that our approaches are not only efficient to address the problem but can also provide better blocking performance when regeneration resources are scarcely deployed at regeneration sites. INDEX TERMS Dynamic routing, minimizing regeneration, regeneration sites, translucent optical networks, wavelength assignment.

show abstract

Optimal regenerator placement in survivable translucent networks

Cited by 6 publications

References 20 publications

Optimal regenerator placement for path protection in impairment-aware WDM networks

Optimal regenerator placement for path protection in impairment-aware WDM networks

A novel adaptive restoration algorithm for cost minimization of translucent optical networks

Minimizing Cost of Regeneration at Regeneration Sites–A New Approach for Dynamic Lightpath Establishment in Translucent Optical Networks

Contact Info

Product

Resources

About