Big Data helps SDN to verify integrity of control/data planes
Qingsong Wen, Ren Chen, Yinglong Xia, Zhou Li, Juan Deng, Jian Xu, Mingzhen Xia · Institution of Engineering and Technology eBooks · 2018
In this chapter, we apply the Big Data analytics from graph computing perspective to help traffic engineering in SDN networks. Specifically, we propose a high-speed top K shortest paths (KSP) algorithm to calculate routes, develop several efficient schemes for routing errors detection, and present a novel edge-set-based graph processing engine to deal with large-scale graph data from SDN. Compared to existing solutions, the experiments show that our proposed KSP algorithm brings 3-6× speedup, and our graph processing engine achieves 3-16× speedup.