Big Data helps SDN to verify integrity of control/data planes

Big Data helps SDN to verify integrity of control/data planes

For access to this article, please select a purchase option:

Buy chapter PDF
(plus tax if applicable)
Buy Knowledge Pack
10 chapters for £75.00
(plus taxes if applicable)

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Your details
Why are you recommending this title?
Select reason:
Big Data and Software Defined Networks — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

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.

Chapter Contents:

  • 20.1 Introduction
  • 20.2 Related work
  • 20.3 Finding top-K shortest simple paths
  • 20.3.1 MPS algorithm for top K shortest simple paths
  • 20.3.2 Improved MPS algorithm with efficient implementation
  • Pseudotree with pruning
  • Pseudotree with internal ID and reversed order
  • 20.4 Routing check and detection
  • 20.4.1 Subnet partition
  • 20.4.2 Loop detection
  • 20.4.3 Black hole detection
  • 20.4.4 Reachability detection
  • 20.5 Efficient graph engine
  • 20.5.1 Edge-set representation
  • 20.5.2 Consolidation
  • 20.5.3 Multimodal organization
  • 20.5.4 Scheduling and prefetching
  • 20.6 Experiments
  • 20.6.1 Performance evaluation of finding top-K shortest simple paths
  • 20.6.2 Performance evaluation of the efficient graph engines
  • 20.7 Open issues and challenges
  • 20.8 Conclusions
  • References

Inspec keywords: error detection; software defined networking; telecommunication network routing; Big Data; graph theory; telecommunication traffic; data analysis; set theory

Other keywords: routing errors detection; graph computing perspective; control planes; high-speed top K shortest paths algorithm; large-scale graph data; traffic engineering; KSP algorithm; Big Data analytics; SDN networks; edge-set-based graph processing engine; data planes

Subjects: Combinatorial mathematics; Communication network design, planning and routing; Data handling techniques; Computer communications; Computer networks and techniques; Combinatorial mathematics

Preview this chapter:
Zoom in

Big Data helps SDN to verify integrity of control/data planes, Page 1 of 2

| /docserver/preview/fulltext/books/pc/pbpc015e/PBPC015E_ch20-1.gif /docserver/preview/fulltext/books/pc/pbpc015e/PBPC015E_ch20-2.gif

Related content

This is a required field
Please enter a valid email address