Scipediacontent: Scipediacontent moved page Draft Content 178260680 to Chowdhury et al 2019a

2021-01-28T20:16:15Z

Scipediacontent moved page Draft Content 178260680 to Chowdhury et al 2019a

Scipediacontent: Created page with " == Abstract == International audience; Existing shortest path-based routing in wide area networks or equal cost multi-path routing in data center networks do not consider th..."

2021-01-28T20:16:10Z

Created page with " == Abstract == International audience; Existing shortest path-based routing in wide area networks or equal cost multi-path routing in data center networks do not consider th..."

New page

== Abstract ==

International audience; Existing shortest path-based routing in wide area networks or equal cost multi-path routing in data center networks do not consider the load on the links while taking routing decisions. As a consequence, an influx of network traffic stemming from events such as distributed link flooding attacks and data shuffle during large scale analytics can congest network links despite the network having sufficient capacity on alternate paths to absorb the traffic. This can have several negative consequences, service unavailability, delayed flow completion, packet losses, among others. In this regard, we propose SPONGE, a traffic engineering mechanism for handling sudden influx of network traffic. SPONGE models the network as a stochastic process, takes the switch queue occupancy and traffic rate as inputs, and leverages the multiple available paths in the network to route traffic in a way that minimizes the overall packet loss in the network. We demonstrate the practicality of SPONGE through an OpenFlow based implementation, where we periodically and pro-actively reroute network traffic to the routes computed by SPONGE. Mininet emulations using real network topologies show that SPONGE is capable of reducing packet drops by 20% on average even when the network is highly loaded because of an ongoing link flooding attack.

== Original document ==

The different versions of the original document can be found in:

* [https://hal.archives-ouvertes.fr/hal-02403616/file/sponge_lcn_19.pdf https://hal.archives-ouvertes.fr/hal-02403616/file/sponge_lcn_19.pdf]

* [http://xplorestaging.ieee.org/ielx7/8970147/8990670/08990676.pdf?arnumber=8990676 http://xplorestaging.ieee.org/ielx7/8970147/8990670/08990676.pdf?arnumber=8990676],
: [http://dx.doi.org/10.1109/lcn44214.2019.8990676 http://dx.doi.org/10.1109/lcn44214.2019.8990676]

* [https://dblp.uni-trier.de/db/conf/lcn/lcn2019.html#HenryCLAFB19 https://dblp.uni-trier.de/db/conf/lcn/lcn2019.html#HenryCLAFB19],
: [https://hal.archives-ouvertes.fr/hal-02403616 https://hal.archives-ouvertes.fr/hal-02403616],
: [https://hal.archives-ouvertes.fr/hal-02403616/document https://hal.archives-ouvertes.fr/hal-02403616/document],
: [https://academic.microsoft.com/#/detail/3006553290 https://academic.microsoft.com/#/detail/3006553290]

* [https://hal.archives-ouvertes.fr/hal-02403616 https://hal.archives-ouvertes.fr/hal-02403616],
: [https://hal.archives-ouvertes.fr/hal-02403616/document https://hal.archives-ouvertes.fr/hal-02403616/document],
: [https://hal.archives-ouvertes.fr/hal-02403616/file/sponge_lcn_19.pdf https://hal.archives-ouvertes.fr/hal-02403616/file/sponge_lcn_19.pdf]

← Older revision	Revision as of 20:16, 28 January 2021
(No difference)

Chowdhury et al 2019a - Revision history

Scipediacontent: Scipediacontent moved page Draft Content 178260680 to Chowdhury et al 2019a

Scipediacontent: Created page with " == Abstract == International audience; Existing shortest path-based routing in wide area networks or equal cost multi-path routing in data center networks do not consider th..."