How much the wavelength dimensioning methods and a tightened QoS provision impact on the dynamic WDM optical networks capacity?

Jara, Nicolás; Pempelfort, Hermann; Rubino, Gerardo; Vallejos, Reinaldo

doi:10.1016/j.osn.2019.100540

Cited by 4 publications

(2 citation statements)

References 33 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Recently, a heuristic algorithm that iteratively updates wavelength channels on different network links was proposed in [ 39 ]. However, it also considers fixed path routing, which greedily routes different end pairs on a few links common to their shortest paths.…”

Section: Literature Reviewmentioning

confidence: 99%

Joint routing, link capacity dimensioning, and switch port optimization for dynamic traffic in optical networks

Khan

Khattak

et al. 2021

ETRI Journal

View full text Add to dashboard Cite

This paper considers a challenging problem: to simultaneously optimize the cost and the quality of service in opaque wavelength division multiplexing (WDM) networks. An optimization problem is proposed that takes the information including network topology, traffic between end nodes, and the target level of congestion at each link/ node in WDM networks. The outputs of this problem include routing, link channel capacities, and the optimum number of switch ports locally added/dropped at all switch nodes. The total network cost is reduced to maintain a minimum congestion level on all links, which provides an efficient trade-off solution for the network design problem. The optimal information is utilized for dynamic traffic in WDM networks, which is shown to achieve the desired performance with the guaranteed quality of service in different networks. It was found that for an average link blocking probability equal to 0.015, the proposed model achieves a net channel gain in terms of wavelength channels ( 𝛾 w ) equal to 35.72 % , 39.09 % , and 36.93 % compared to shortest path first routing and 𝛾 w equal to 29.41 % , 37.35 % , and 27.47 % compared to alternate routing in three different networks.

show abstract

Section: Literature Reviewmentioning

confidence: 99%

Joint routing, link capacity dimensioning, and switch port optimization for dynamic traffic in optical networks

Khan

Khattak

et al. 2021

ETRI Journal

View full text Add to dashboard Cite

show abstract

“…We use an ON-OFF model (as in [29]- [32]) to represent the traffic between a given source-destination pair. Consider user c. During any of its ON periods, whose average length is t ON c , the source transmits at a constant rate (which is the rate associated with the wavelength, that is, a technological constant in our model).…”

Section: A Modelmentioning

confidence: 99%

A Fault-Tolerance Solution to Any Set of Failure Scenarios on Dynamic WDM Optical Networks With Wavelength Continuity Constraints

et al. 2020

Self Cite

View full text Add to dashboard Cite

Survivability of internet services is a significant and crucial challenge in designing optical networks. A robust infrastructure and transmission protocols are needed to maintain communication, despite the existence of one or more failed components on the system. Here, we present a generalized approach to tolerate any set of failure scenarios to the extent network users can still communicate with the remaining components, where a scenario is an arbitrary set of links in a non-operational state. We propose a joint solution to assess the survivability problem. The issues to be solve simultaneously are as follows: the set of primary routes, a collection of alternate routes associated with each failure scenario, and the capacity required on the network to allow communication between all users, in spite of any considered failure scenario, while satisfying for each user a specific predefined quality of service threshold, defined in the Service Level Agreement (SLA). Numerical results show that the proposed approach not only enjoys the advantages of low complexity and ease of implementation, but it is also able to achieve significant resource savings compared to existing methods. The savings are higher than 30% on single link failures and more than 100% on two simultaneous link failures cases or in more complex failure scenarios. INDEX TERMS Network capacity, optical networks, quality of service, routing, survivability.

show abstract

Stochastic RWA and Lightpath Rerouting in WDM Networks

Daryalal

Bodur

2022

INFORMS Journal on Computing

View full text Add to dashboard Cite

In a telecommunication network, routing and wavelength assignment (RWA) is the problem of finding lightpaths for incoming connection requests. When facing a dynamic traffic, greedy assignment of lightpaths to incoming requests based on predefined deterministic policies leads to a fragmented network that cannot make use of its full capacity because of stranded bandwidth. At this point, service providers try to recover the capacity via a defragmentation process. We study this setting from two perspectives: (i) while granting the connection requests via the RWA problem and (ii) during the defragmentation process by lightpath rerouting. For both problems, we present the first two-stage stochastic integer programming model incorporating incoming request uncertainty to maximize the expected grade of service. We develop a decomposition-based solution approach, which uses various relaxations of the problem and a newly developed problem-specific cut family. Simulation of two-stage policies for a variety of instances in a rolling-horizon framework of 52 stages shows that our stochastic models provide high-quality solutions when compared with traditionally used deterministic ones. Specifically, the proposed provisioning policies yield improvements of up to 19% in overall grade of service and 20% in spectrum saving, while the stochastic lightpath rerouting policies grant up to 36% more requests, using up to just 4% more bandwidth spectrum. Summary of Contribution: For handling the intrinsic uncertainty of demand in the telecommunications industry, this paper proposes novel stochastic models and solution methodology for two fundamental problems in telecommunications at operational level: (i) routing and wavelength assignment (RWA) and (ii) lightpath rerouting problem. Despite the vast literature on the RWA problem, stochastic optimization has not been considered as a viable solution for resource allocation in optical networks. We propose two-stage stochastic programming models for both problems and design efficient decomposition-based solution methods that use various relaxations of the models and a new family of cutting planes. Our extensive and rigorous numerical experiments show the significant merit of incorporating uncertainty into decision making, as well as the effectiveness of the decomposition framework and our newly designed family of cuts in enhancing the solvability of both models. This work opens new avenues to explore where the powerful stochastic programming literature can be leveraged to make operational decisions in telecommunications problems, a field that currently relies mostly on deterministic and heuristic solution methods.

show abstract

How much the wavelength dimensioning methods and a tightened QoS provision impact on the dynamic WDM optical networks capacity?

Cited by 4 publications

References 33 publications

Joint routing, link capacity dimensioning, and switch port optimization for dynamic traffic in optical networks

Joint routing, link capacity dimensioning, and switch port optimization for dynamic traffic in optical networks

A Fault-Tolerance Solution to Any Set of Failure Scenarios on Dynamic WDM Optical Networks With Wavelength Continuity Constraints

Stochastic RWA and Lightpath Rerouting in WDM Networks

Contact Info

Product

Resources

About