Name
Abstract | ||
|---|---|---|
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 such as 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 re-route 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. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1109/LCN44214.2019.8990676 | 2019 IEEE 44th Conference on Local Computer Networks (LCN) |
Keywords | Field | DocType |
SPONGE,software-defined traffic engineering,influx,shortest path-based routing,wide area networks,equal cost multipath routing,data center networks,routing decisions,distributed link flooding attacks,data shuffle,network links,traffic engineering mechanism,route traffic,re-route network traffic,network topologies,ongoing link flooding attack,stochastic process,switch queue occupancy | Shortest path problem,Computer science,Queue,Network packet,Computer network,Packet loss,Network topology,OpenFlow,Unavailability,Traffic engineering,Distributed computing | Conference |
ISSN | ISBN | Citations |
0742-1303 | 978-1-7281-1029-5 | 0 |
PageRank | References | Authors |
0.34 | 19 | 6 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Benoit Henry | 1 | 0 | 0.34 |
| Shihabur Rahman Chowdhury | 2 | 310 | 23.02 |
| Abdelkader Lahmadi | 3 | 0 | 0.34 |
| Romain Azaïs | 4 | 0 | 0.34 |
| Jérôme François | 5 | 170 | 21.81 |
| Raouf Boutaba | 6 | 6453 | 404.30 |