DEMO: A Quagga-Based OSPF Routing Protocol with QoS Guarantees
Yu Chen, Yifeng He, Zhengquan Zhao, Xuanhan Liang, Qimei Cui, Xiaofeng Tao · 2018
Open Shortest Path First (OSPF) is a widely used routing protocol, which uses cost to find the shortest path. In this paper, we develop an extension to OSPF to support QoS guarantees by replacing the cost metric with end-to-end (E2E) delay. Particulary, we propose a new stream-based Dijkstra's algorithm to find the minimum E2E delay path for any traffic stream and implement this algorithm in Quagga OSPF, a network routing software suite. Experimental results show that our proposed protocol reduces E2E delays compared with unmodified OSPF routing protocol.