2008 5th International Conference on Broadband Communications, Networks and Systems 2008
DOI: 10.1109/broadnets.2008.4769153
|View full text |Cite
|
Sign up to set email alerts
|

Tabu search optimization in translucent network regenerator allocation

Abstract: This paper introduces the Tabu Search optimization algorithm to solve the regenerator allocation problem in translucent networks. The problem consists of finding the minimum number of regenerator nodes which primarily affects the cost of the translucent network. The problem is first solved with an ILP formulation to find the optimal solution without taking into consideration its time performance. The optical reach limit due to the dispersion compensation module and full (static) traffic demand with a 1+1 prote… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
5
0

Year Published

2011
2011
2022
2022

Publication Types

Select...
3
2

Relationship

0
5

Authors

Journals

citations
Cited by 7 publications
(5 citation statements)
references
References 12 publications
0
5
0
Order By: Relevance
“…Using optical reach to estimate impairments, an ILP for an optimal solution and a heuristic, based on game theoretic approach, were proposed in [22] for a network using path protection. Tabu Search was used in [64].…”
Section: Algorithms For Rpp In Network Handling Ad-hoc Lightpath Demmentioning
confidence: 99%
“…Using optical reach to estimate impairments, an ILP for an optimal solution and a heuristic, based on game theoretic approach, were proposed in [22] for a network using path protection. Tabu Search was used in [64].…”
Section: Algorithms For Rpp In Network Handling Ad-hoc Lightpath Demmentioning
confidence: 99%
“…As mentioned earlier, two main problems that have been studied in the literature, for wide-area translucent network design, are the RP problem and the RRA problem. A number of ILP-based approaches [6,7,10,13], for the sparse RP problem have been proposed in recent years, where the goal of each is, typically, to minimize regenerator usage. In [6], the authors propose an ILP formulation, where the objective is to maximize the number of lightpaths that can be established.…”
Section: Reviewmentioning
confidence: 99%
“…In [13], an ILP and a game theoretic algorithm for minimizing the number of regenerators is proposed. The ILP formulation in [10] minimizes the number of regeneration sites, but only finds appropriate routes for the lightpaths, and does not consider wavelength assignment. In [9], the authors present an exhaustive search algorithm that minimizes the number of regenerators, or regenerator sites.…”
Section: Reviewmentioning
confidence: 99%
See 1 more Smart Citation
“…As examples, (i) in [24], the authors focused on the planning and deployment of re-amplification, re-shaping, and re-timing (3R) regenerators accordingly to the network and traffic information; (ii) in [25], two heuristics were proposed for the regenerator assignment. In this case, one of the heuristics targets to deploy the highest order modulation format possible, while the other one tries to reach the maximum transmission distance before performing signal regeneration; (iii) in [26], three metrics were proposed for the regenerator placement focusing on minimizing the network cost, which was evaluated as a function of the total number of regenerators and nodes with 3R capacity; (iv) in [27], the authors focused on minimizing the total number of regenerators when network protection capability was also deployed. (v) in [28] an optimized regenerator assignment strategy based on the QoT of the links was reported.…”
mentioning
confidence: 99%