Novel Node-Arc Model and Multiiteration Heuristics for Static Routing and Spectrum Assignment in Elastic Optical Networks

Cai, Anliang; Shen, Gangxiang; Peng, Limei; Zukerman, Moshe

doi:10.1109/jlt.2013.2282696

Cited by 87 publications

(58 citation statements)

References 25 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In the literature, both node-link (NL) [16], link-route (LR) [7], and link-lightpath (LL) [10] modeling approaches for formulating RSA as an MIP problem have been utilized. Compact NL formulations involve a set of so-called flow conservation constraints, which determine the routes of traffic flows.…”

Section: A Related Workmentioning

confidence: 99%

“…There are several studies that focus on the complexity of MIP formulations of RSA in terms of the number of involved variables and constraints, and the computation times required to solve them using MIP solvers [16], [17], [18], [19]. Even though solvable in moderate-size networks with fixed-size spectrum demands (a 10-node network with 45 demands was evaluated in [16]), NL models are complicated and difficult to solve in distance-adaptive EONs [20].…”

Section: A Related Workmentioning

confidence: 99%

“…Even though solvable in moderate-size networks with fixed-size spectrum demands (a 10-node network with 45 demands was evaluated in [16]), NL models are complicated and difficult to solve in distance-adaptive EONs [20]. Indeed, in such networks, the size of allocated spectrum is not fixed but depends on routing and, to account for it, additional variables and constraints should appear in NL models.…”

Section: A Related Workmentioning

confidence: 99%

See 2 more Smart Citations

Solving Large Instances of the RSA Problem in Flexgrid Elastic Optical Networks

Klinkowski

Żotkiewicz

Walkowiak

et al. 2016

J. Opt. Commun. Netw.

View full text Add to dashboard Cite

Abstract-We present an optimization procedure that mixes advanced large scale optimization methods and heuristics to solve large instances (with over 1.7 million integer variables) of the routing and spectrum allocation (RSA) problem -a basic optimization problem in flexgrid elastic optical networks. We formulate the problem as a mixed-integer program for which we develop a branch-and-price algorithm enhanced with such techniques as problem relaxations and cuts for improving lower bounds for the optimal objective value, and an RSA heuristic for improving the upper bounds. All these elements are combined into an effective optimization procedure. The results of numerical experiments run on network topologies of different dimensions and with large demand sets show that the algorithm performs well and can be applied to the problem instances that are difficult to solve using commercial solvers such as CPLEX.Index Terms-branch and price, cuts, elastic optical networks, large-scale optimization, mixed-integer programming, relaxations, routing and spectrum allocation.

show abstract

Section: A Related Workmentioning

confidence: 99%

Section: A Related Workmentioning

confidence: 99%

Section: A Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Solving Large Instances of the RSA Problem in Flexgrid Elastic Optical Networks

Klinkowski

Żotkiewicz

Walkowiak

et al. 2016

J. Opt. Commun. Netw.

View full text Add to dashboard Cite

show abstract

“…Constraint (5) ensures that c is no smaller than the total number of used FSs on any fiber link in the network. Constraint (6) ensures that c is no greater than all the traffic demand. Constraints (5) and (6) are redundant to reduce the feasible solution space of the ILP model.…”

Section: )mentioning

confidence: 99%

“…One is arc-path, and the other is node-arc, and to shorten model-solving times, two relaxed ILP models were also evaluated. To enhance the computational efficiency of node-arc ILP model, Cai et al developed a new node-arc model [6] based on the arc-path model of [4]. Among these studies, we find that most of them focused on the RSA problem with a single route.…”

Section: Introductionmentioning

confidence: 99%

How much can sub-band virtual concatenation (VCAT) help static routing and spectrum assignment in elastic optical networks? (Invited)

Yuan

Shen

2014

2014 IEEE International Conference on Communication Systems

Self Cite

View full text Add to dashboard Cite

Orthogonal Frequency Division Multiplexing (OFDM) has recently been proposed as a modulation technique for optical networks due to its higher spectral efficiency and superior impairment tolerance. There have been extensive studies on routing and spectrum assignment (RSA) of the OFDM-based elastic optical network, of which most focus on a single route for each lightpath service. In this paper, we study the RSA problem for the elastic optical network considering the multi-path subband virtual concatenation (VCAT) technique that allows the sub-bands of a VCAT lightpath connection to be transmitted over different routes. We develop integer linear programing (ILP) models to optimally solve the problem. We evaluate the benefit of the multi-path sub-band VCAT technique for the RSA problem through comparing with the non-VCAT case. In addition, because of the limitation of synchronization in the sub-band VCAT technique, we set a maximal distance difference among the sub-band paths of a VCAT connection to evaluate how the limitation can impact the RSA performance. We find that the multi-path sub-band VCAT technique shows a stronger benefit in a network with a higher nodal degree.

show abstract

Solving the routing and spectrum assignment problem, driven by combinatorial properties

da Silva,

Kerivin,

Nant

et al. 2023

Networks

View full text Add to dashboard Cite

The routing and spectrum assignment problem in modern optical networks is an NP‐hard problem that has received increasing attention during the last years. The majority of existing integer linear programming models for the problem uses edge‐path formulations where variables are associated with all possible routing paths so that the number of variables grows exponentially with the size of the instance. To bypass this difficulty, precomputed subsets of all possible paths per demand are typically used, which cannot guarantee optimality of the solutions in general. Our contribution is to provide a framework for the use of edge‐path formulations to minimize the spectrum width of a solution. For that, we select an appropriate subset of paths to operate on with the help of combinatorial properties in such a way that optimality of the solution can be guaranteed. Computational results indicate that our approach is indeed promising to solve the routing and spectrum assignment problem.

show abstract

Novel Node-Arc Model and Multiiteration Heuristics for Static Routing and Spectrum Assignment in Elastic Optical Networks

Cited by 87 publications

References 25 publications

Solving Large Instances of the RSA Problem in Flexgrid Elastic Optical Networks

Solving Large Instances of the RSA Problem in Flexgrid Elastic Optical Networks

How much can sub-band virtual concatenation (VCAT) help static routing and spectrum assignment in elastic optical networks? (Invited)

Solving the routing and spectrum assignment problem, driven by combinatorial properties

Contact Info

Product

Resources

About