ESPRES: Transparent SDN Update Scheduling
Peter Perešíni @ EPFL
Maciej Kuzniar @ EPFL Marco Canini @ UCLouvain Dejan Kostić @ KTH
Transparent SDN Update Scheduling Peter Pereni @ EPFL Maciej - - PowerPoint PPT Presentation
ESPRES: Transparent SDN Update Scheduling Peter Pereni @ EPFL Maciej Kuzniar @ EPFL Marco Canini @ UCLouvain Dejan Kosti @ KTH Network events trigger big updates Topology changes Network events trigger big updates Topology changes
Peter Perešíni @ EPFL
Maciej Kuzniar @ EPFL Marco Canini @ UCLouvain Dejan Kostić @ KTH
Topology changes
Topology changes
Topology changes
Topology changes
Topology changes Traffic Engineering Policy changes
Topology changes Traffic Engineering Policy changes
Many rule modifications ⇨ updates take time
Update touching two (independent) flows
Update touching two (independent) flows
Update touching two (independent) flows
Update touching two (independent) flows
Update touching two (independent) flows
Scheduling sounds easy but
(See paper for more details)
ESPRES
Already illustrated:
See paper:
1000 new flows; 18 switches
1000 new flows; 18 switches
➢ No scheduling (send rule when dependencies are met)
1000 new flows; 18 switches
➢ Espres A ➢ Espres B ➢ Optimal (Offline) ➢ No scheduling (send rule when dependencies are met)
1000 new flows; 18 switches
➢ Espres A ➢ Espres B ➢ Optimal (Offline)
We reduce completion time by ≥40% for half of flows
➢ No scheduling (send rule when dependencies are met)
achieve different goals ESPRES ➢Maintain backlog of rule installations at the controller ➢Schedule their order on-the-fly