Virtual Network Functions Placement for Defense Against Distributed Denial of Service Attacks

Haddad-Vanier, Sonia; Gicquel, Céline; Boukhatem, Lila; Lazri, Kahina; Chaignon, Paul

doi:10.5220/0007397601420150

Cited by 2 publications

(4 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Multi-commodity flow models are developed for several network optimization problems since they enable modeling complex technical constraints [3,8,10,24,38,57]. In particular, multi-commodity flow models may include unsplittable routing or resource sharing constraints [5,35,30]. Another advantage of arc-path formulations is that they are solved efficiently by decomposition and column generation methods [25,30,47,56].…”

Section: Energy Optimization In Multi-hop Wsnsmentioning

confidence: 99%

See 1 more Smart Citation

Optimization in Wireless Networks

Oustry

Haddad-Vanier

et al. 2022

Encyclopedia of Optimization

Self Cite

View full text Add to dashboard Cite

Section: Energy Optimization In Multi-hop Wsnsmentioning

confidence: 99%

“…In particular, multi-commodity flow models may include unsplittable routing or resource sharing constraints [5,35,30]. Another advantage of arc-path formulations is that they are solved efficiently by decomposition and column generation methods [25,30,47,56].…”

Section: Energy Optimization In Multi-hop Wsnsmentioning

confidence: 99%

Optimization in Wireless Networks

Oustry

Haddad-Vanier

et al. 2022

Encyclopedia of Optimization

Self Cite

View full text Add to dashboard Cite

“…Multi-commodity flow models are developed for several network optimization problems since they lead to modeling complex technical constraints [4,13,15,27,39,55]. The technical constraints can be the unsplittable routing or resource sharing constraints [6,33,37]. Another advantage of the multi-commodity flow formulations is that they can be solved efficiently by decomposition and column generation methods [12,28,33,42,49,54].…”

Section: Introductionmentioning

confidence: 99%

“…The technical constraints can be the unsplittable routing or resource sharing constraints [6,33,37]. Another advantage of the multi-commodity flow formulations is that they can be solved efficiently by decomposition and column generation methods [12,28,33,42,49,54].…”

Section: Introductionmentioning

confidence: 99%

Branch‐and‐price for energy optimization in multi‐hop wireless sensor networks

Vanier

2021

Networks

View full text Add to dashboard Cite

Wireless sensor networks (WSNs) are widely deployed to support transmissions of the huge data emitted by heterogeneous connected devices. The quality of service (QoS) and energy requirements in WSNs are dramatically increasing and becoming challenging issues. Integrating network coding, in the data transmission process, leads to reduced energy consumption and improved QoS. In this work, we study the problem of energy efficiency in multi-hop WSNs, namely wireless unsplittable multi-commodity flow with network coding (wUMCFC). We propose mixed-integer programming formulations of the wUMCFC problem, and we implement an open source solver wUMCFC based on the branch-and-price algorithm. To the best of our knowledge, this work is the first study of the wUMCFC problem by mathematical programming tools. We perform a computational study on realistic instances with an analysis of the performance of the proposed algorithm. The computational results show the efficiency of the network coding and provide important information for strategic decisions on routing policies and network management https://github.com/ lidingxu/wUMCFC.

show abstract

Virtual Network Functions Placement for Defense Against Distributed Denial of Service Attacks

Cited by 2 publications

References 0 publications

Optimization in Wireless Networks

Optimization in Wireless Networks

Branch‐and‐price for energy optimization in multi‐hop wireless sensor networks

Contact Info

Product

Resources

About