A deterministic network calculus enabled QoS routing on software defined network
Shuangyin Ren, Wenhua Dou, Yu Wang · 2017
In software defined networks, control plane is decoupled from data plane and is directly programmable. Network controller retrieves an integrated view of data plane and thus an End-to-End (E2E) QoS guarantee is easier to realize than classic network paradigms. Deterministic Network Calculus (DNC) is a network analysis tool to provide a deterministic delay or bandwidth bound. In this proposal, an E2E QoS routing algorithm based on DNC is realized in Mininet with Open vSwitch as forwarding switch and Ryu as remote controller. Output ports run Hierarchical Token Bucket queuing discipline to manage bandwidth resource. DNC model is realized for bandwidth sharing analysis. Ryu controller runs Constrained shortest path routing based on DNC model, distance graph and resource residual graph. Simulations are issued based on Mininet and Open vSwitch to test DNC analysis model and QoS routing algorithm.