Routing and Wavelength Assignment in Optical Networks from Maximum Edge-Disjoint Paths

Hsu, Chia Chun; Cho, Hsun‐Jung; Song, Fang

doi:10.1007/978-3-319-01796-9_10

Cited by 7 publications

(8 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The second hypothesis is that selecting, within the set of shortest paths, a subset that allows to balance the load of each link in the network [23,24] reduces the global blocking probability of the network. Consequently, the method mostly used to establish routes is the "Shortest Path Balanced Routing" (SPBR) one [25,26,27,12,28,29,30,31,32,33].…”

Section: State Of the Artmentioning

confidence: 99%

“…Observe that we address here the general case where the load can be different for each connection, the so-called heterogeneous situation, instead of the usual homogeneous case where the load is assumed to be the same for all users [25,26,27,12,28,29,30,31,32,33].…”

Section: Model and Assumptionsmentioning

confidence: 99%

“…When reviewing the current methods of Routing and Wavelength Dimensioning, it was noted that the algorithm most commonly referenced today, and considered the best so far, is SPBR [25,26,27,12,28,29,30,31,32,33] (see Section 1). Consequently, this was the method chosen for comparison.…”

Section: Examplesmentioning

confidence: 99%

See 2 more Smart Citations

A method for joint routing, wavelength dimensioning and fault tolerance for any set of simultaneous failures on dynamic WDM optical networks

Jara

Vallejos

Rubino

2017

Optical Fiber Technology

View full text Add to dashboard Cite

The design of optical networks decomposes into different tasks, where the engineers must basically organize the way the main system's resources are used, minimizing the design and operation costs and respecting critical performance constraints. More specifically, network operators face the challenge of solving routing and wavelength dimensioning problems while aiming to simultaneously minimize the network cost and to ensure that the network performance meets the level established in the Service Level Agreement (SLA). We call this the Routing and Wavelength Dimensioning (R&WD) problem. Another important problem to be solved is how to deal with failures of links when the network is operating. When at least one link fails, a high rate of data loss may occur. To avoid it, the network must be designed in such a manner that upon one or multiple failures, the affected connections can still communicate using alternative routes, a mechanism known as Fault Tolerance (FT). When the mechanism allows to deal with an arbitrary number of faults, we speak about Multiple Fault Tolerance (MFT). The different tasks before mentioned are usually solved separately, or in some cases by pairs, leading to solutions that are not necessarily close to optimal ones. This paper proposes a novel method to simultaneously solve all of them, that is, the Routing, the Wavelength Dimensioning, and the Multiple Fault Tolerance problems. The method allows to obtain: a) all the primary routes by which each connection normally transmits its information, b) the additional routes, called secondary routes, used to keep each user connected in cases where one or more simultaneous failures occur, and c) the number of wavelengths available at each link of the network, calculated such that the blocking probability of each connection is lower than a predetermined threshold (which is a network

show abstract

Section: State Of the Artmentioning

confidence: 99%

Section: Model and Assumptionsmentioning

confidence: 99%

See 1 more Smart Citation

A method for joint routing, wavelength dimensioning and fault tolerance for any set of simultaneous failures on dynamic WDM optical networks

Jara

Vallejos

Rubino

2017

Optical Fiber Technology

View full text Add to dashboard Cite

show abstract

“…Among the static (MC)RWA problems, the one for unicast traffic was extensively studied in the literature. Typical work can be found in [6], [18], [20], [21]. In [18], several static RWA strategies resulted from possible combinations of static routing and First-Fit wavelength assignment [14] are proposed to minimize the blocking probability.…”

Section: Related Work and Motivationmentioning

confidence: 99%

Minimizing Blocking Probability for the Multicast Routing and Wavelength Assignment Problem in WDM Networks: Exact Solutions and Heuristic Algorithms

Le¹,

Zhou

Molnar³

2014

J. Opt. Commun. Netw.

View full text Add to dashboard Cite

International audienceGiven a sparse splitting wavelength division multiplexing (WDM) network and a set of available wavelengths, we investigate the problem of provisioning a set of multicast requests simultaneously with the objective of minimizing the blocking probability. Two blocking models are taken into account: full blocking probability and partial blocking probability. As the problem is NP-hard, we propose an integer linear programming (ILP) formulation with two variants (each for a blocking model) to search for the optimal solution and several efficient adaptive heuristic algorithms to compute approximated solutions. In particular, instead of using light-trees, both ILP and heuristics use light-hierarchy, a recently proposed optimal route under sparse splitting configurations. Extensive simulations reveal that our adaptive algorithms are able to compute near-optimal solutions, and they outperform static approaches under both blocking probability models. The results also show that it is more advantageous to provision multiple multicast communications with light-hierarchies, since they are able to accommodate more requests and destinations compared to the light-tree solutions

show abstract

“…Simultaneously, congestion and possible failures are reduced (for further details, see Barabasi and Albert, ; Baveja and Srinivasan, ). Regarding the practical application areas of the EDP problem, we can mention the two following areas: very large scale integration (VLSI) design (Chan et al., ) and virtual circuit routing (Hsu et al., ; Altarelli et al., ). In VLSI design, the EDP problem is similar to the escape problem (Chan et al., ), where it is required to find a maximal number of wiring disjoint paths in grids (i.e., those that avoid the overlaps) between pairs of terminals.…”

Section: Introductionmentioning

confidence: 99%

Solving the edge‐disjoint paths problem using a two‐stage method

Martín

Sánchez

Beltrán-Royo

et al. 2018

Int Trans Operational Res

View full text Add to dashboard Cite

There exists a wide variety of network problems where several connection requests occur simultaneously. In general, each request is attended by finding a route in the network, where the origin and destination of such a route are those hosts that wish to establish a connection for information exchange. As is well documented in the related literature, the exchange of information through disjoint routes increases the effective bandwidth, velocity, and the probability of receiving the corresponding information. The definition of disjoint paths may refer to nodes, edges, or both. One of the most studied variants is the one where disjointness implies not to share edges. This optimization problem is usually known as the maximum edge‐disjoint paths problem. This scriptNP‐hard optimization problem has applications in real‐time communications, very large scale integration design, scheduling, bin packing, or load balancing. The proposed approach hybridizes an integer linear programming formulation of the problem with an evolutionary algorithm. Empirical results using 174 previously reported instances show that the proposed procedure compares favorably to previous metaheuristics for this problem. We confirm the significance of the results by conducting nonparametric statistical tests.

show abstract

Routing and Wavelength Assignment in Optical Networks from Maximum Edge-Disjoint Paths

Cited by 7 publications

References 7 publications

A method for joint routing, wavelength dimensioning and fault tolerance for any set of simultaneous failures on dynamic WDM optical networks

A method for joint routing, wavelength dimensioning and fault tolerance for any set of simultaneous failures on dynamic WDM optical networks

Minimizing Blocking Probability for the Multicast Routing and Wavelength Assignment Problem in WDM Networks: Exact Solutions and Heuristic Algorithms

Solving the edge‐disjoint paths problem using a two‐stage method

Contact Info

Product

Resources

About