UWB
Equal Cost Multipath Routing in FOKUS OpenSDNCore
Hai Dinh Tuan
Next Generation Networks & Future Internet Technologies Projects
The separation of
control plane (routing
functionalities) and
data plane (forwarding
functionalities)
Introduction - SDN
Source: SDNCentral
Shortest path first (SPF) algorithm calculates the single shortest path
from a source node to a destination is used in Link-state protocols
such as OSPF and IS-IS.
Equal Cost Multipath is a Traffic Engineering technique that enables
using several equal cost paths in IP routing
Introduction - ECMP
Routing
Problems in this project
IMPLEMENT ECMP IN OPENSDNCORE
Controller-switch communication
Forwarding
How to calculate all possible paths
How to implement all paths in switches
How to choose path for packet forwarding
Controller Switch
“Set each link’s cost along the shortest path to infinite, and run the
shortest path calculation again each time”
Arc cutting method
What type of messsages to be transfered between controller
and swiches?
• FlowMod message
• GroupMod message
How to implement all posible paths?
• FlowMod “Add Flow Entry” message
• GroupMod “Add Bucket”message
Message types
Comparison
Random ECMP Hashed based ECMP
Advantages
Simple, implement only on the Controller
Deterministic behavior
Work well with any switchProvides control over
path selection
Disadvantages
Possible congestionRequire more
computing resources
Possible congestion
Remark
Expected outcomes Results
Successful implementation of ECMP in OpenSDNCore
Detailed documentation
Efficient communication between supervisor and student
Gather experiences
Remark
Expected outcomes Results
Successful implementation of ECMP in OpenSDNCore
Detailed documentation (to be submitted)
Efficient communication between supervisor and student
Gather experiences
Top Related