On robust FSO network dimensioning

D’Andreagiovanni, Fabio; Nace, Dritan; Pióro, Michał; Foss, Michael; Shehaj, Marinela; Tomaszewski, Artur

doi:10.1109/rndm.2017.8093027

Cited by 10 publications

(9 citation statements)

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This can be done for each of the Constraints (11a)-(11c) separately, by formulating a corresponding binary program of maximizing the left hand of the appropriate inequality in (11) over (N), where (e, u) = 1 − (e, u), and (e, u) and h(d, u) expressed with u as follows (cf. (7) and (10)):…”

Section: Feasibility Tests and State Generation Algorithmmentioning

confidence: 99%

“…Numerical results show that the optimization procedure introduced in Section 5.3 is computationally efficient, despite the binary pricing problems required in the path generation step. In fact, an analogous optimization model can be found in [7] and in its journal version [11]. However, that model uses a simplified, less practical state polytope description, and assumes an impractical GR mechanism (characterized in Section 8.3) which is much simpler to deal with than AFT/QFT, as it does not require path generation and posses a compact LP formulation (and hence does not require path generation) and a simpler state generation algorithm.…”

Section: Final Remarksmentioning

confidence: 99%

“…• The concept of state polytope introduced in [15] was used in an optimization model for the so called global rerouting (GR) (a benchmark routing mechanism assuming unrestricted reconfiguration of flows in case of a network failure) presented in paper [7] (and in its extended version [11]). The solution algorithm is iterative and based on Benders' decomposition [2] with dual feasibility tests involving binary variables.…”

mentioning

confidence: 99%

See 2 more Smart Citations

A robust optimization model for affine/quadratic flow thinning: A traffic protection mechanism for networks with variable link capacity

et al. 2020

Self Cite

View full text Add to dashboard Cite

Flow thinning (FT) is a traffic protection mechanism for communication networks with variable link capacities, for example wireless networks. With FT, end-to-end traffic demands use dedicated logical tunnels, for example MPLS tunnels, whose nominal capacity is subject to thinning in order to follow fluctuations in link capacities availability. Moreover, instantaneous traffic of each demand is throttled at its originating node accordingly to the current total capacity available on the demand's dedicated tunnels so that the network is always capable of carrying the admitted traffic. In this paper, we deal with efficient, implementable versions of FT, referred to as affine FT (AFT) and quadratic FT (QFT). By deriving appropriate link availability state and path generation algorithms, we show how real-life network dimensioning problems for AFT/QFT can be efficiently treated using a proper characterization of the network link availability states. Results of a numerical study illustrate tractability of the cost minimization problems, and assess efficiency of AFT/QFT as compared with other protection mechanisms. KEYWORDSaffine and quadratic routing, FSO, multicommodity flows, robust optimization, traffic protection, uncertainty polytopes, variable link capacity INTRODUCTIONFlow thinning (FT), a concept introduced in [15], is a traffic protection mechanism designed for communication networks with variable capacity of links. In a typical state of such a network, only a subset of links is fully available while on the remaining links only a fraction of their nominal (i.e., maximum) capacity is usable. Each end-to-end traffic demand is assigned a set of logical tunnels whose total capacity is dedicated to carry the demand's traffic. The nominal (i.e., maximum) capacity of the tunnels supported by the nominal (maximum) link capacity is subject to state-dependent thinning in order to consider variable capacity of the links, fluctuating below the maximum. In effect, the capacity available on the tunnels is also fluctuating below their nominal capacity levels. Thus, since the instantaneous traffic sent between the demand's end nodes is adapted to the current total capacity available on its dedicated tunnels, the network is always capable of carrying the admitted traffic.FT is relevant, among other applications, for free space optics (FSO) wireless mesh networks utilizing MPLS tunnels. FSO communication is undoubtedly a promising solution to provide connectivity in areas where deployment of a wired infrastructure is hardly feasible. However, it often faces the problem of time-varying link capacity due to weather disruptions (such as a heavy rainfall) leading to a substantial or even a complete degradation of the capacity available on wireless optical links. Therefore, one of the major issues in the design of FSO architectures is to assure network resilience defined as the ability of the network to guarantee an acceptable level of service in the face of various faults and challenges for normal operation [21].Networks. 2020;75:420-...

show abstract

Section: Feasibility Tests and State Generation Algorithmmentioning

confidence: 99%

Section: Final Remarksmentioning

confidence: 99%

mentioning

confidence: 99%

See 1 more Smart Citation

A robust optimization model for affine/quadratic flow thinning: A traffic protection mechanism for networks with variable link capacity

et al. 2020

Self Cite

View full text Add to dashboard Cite

show abstract

“…In order to test the performance of our model, described in Section III, we conducted a numerical study using the network topology shown in Figure 1. This network instance is based on that used in [10] and [11], but adapted to suit a radio network instead of a free-space optical (FSO) network as in that work. By using this network, we could also make use of the accompanying partial link failure state data, which was based on real weather data collected for the Paris metropolitan area.…”

Section: A Test Data and Parametersmentioning

confidence: 99%

“…To adapt the network instance to be suitable for a radio network, we reduced the link distances by a factor of 50 (so, for example, a 10 km FSO link would become a 200 m radio . We also adjusted the data rates to use the modulation and coding schemes available in 802.11ac, but kept the same relative traffic demands between each pair of nodes as in [10], [11], which were based on real population data. Each demand was thus scaled by 10 −4 , e.g.…”

Section: A Test Data and Parametersmentioning

confidence: 99%

Protecting Wireless Mesh Networks Against Adverse Weather Conditions

Fitzgerald

Pióro

Tomaszewski

2018

2018 10th International Workshop on Resilient Networks Design and Modeling (RNDM)

Self Cite

View full text Add to dashboard Cite

Adverse weather conditions can cause deterioration of wireless channels, leading to reduced link capacities. Unlike in other types of networks, in radio-based wireless mesh networks, the link capacities depend not only on the prevailing conditions, but also on interfering transmissions, as well as the transmission power and modulation and coding schemes used. This leads to increased difficulty in modelling and mitigating partial link failures, such as those caused by unfavourable weather. In this paper we present optimisation models for reconfiguration of routing and traffic demand volumes in wireless mesh networks, taking into account transmission power and modulation and coding schemes. We consider both a network planning application and online optimisation in response to failure states as they occur. We conduct a numerical study on a realistic network topology, showing the feasibility of our models for practical implementation.

show abstract

A Fast Metaheuristic for the Design of DVB-T2 Networks

D’Andreagiovanni

Nardin

2018

Applications of Evolutionary Computation

View full text Add to dashboard Cite

On robust FSO network dimensioning

Cited by 10 publications

References 22 publications

A robust optimization model for affine/quadratic flow thinning: A traffic protection mechanism for networks with variable link capacity

A robust optimization model for affine/quadratic flow thinning: A traffic protection mechanism for networks with variable link capacity

Protecting Wireless Mesh Networks Against Adverse Weather Conditions

A Fast Metaheuristic for the Design of DVB-T2 Networks

Contact Info

Product

Resources

About