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.
Big Data helps SDN to verify integrity of control/data planes, Page 1 of 2
< Previous page Next page > /docserver/preview/fulltext/books/pc/pbpc015e/PBPC015E_ch20-1.gif /docserver/preview/fulltext/books/pc/pbpc015e/PBPC015E_ch20-2.gif