Distributed Graph Processing for SDN Path Computation
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
The existing distributed SDN controller architecture faces high computational overhead and scalability issues due to the need for maintaining global network maps across different domains, which exposes network topology and leads to inefficient path computation and synchronization.
Innovation Solution
A network service computation system employing distributed graph processing among multiple network controllers, where each controller manages its domain and communicates with others using controller messages to determine the minimum path distance and parent vertex information, thereby avoiding the need for global network maps and promoting scalability and low latency.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Ease of operation
If each SDN controller maintains a global network map in local memory, then global path computation and provisioning can be enabled, but computational overhead for global synchronization increases and scalability decreases
Solution Approach 1:
The patent divides the global network map maintenance task into domain-level segments. Each SDN controller maintains only its local domain graph rather than a complete global network map. The system segments the computation process into distributed graph processing across multiple controllers, where each controller processes its local domain independently and contributes to global path computation through coordinated message exchange, thereby reducing individual controller complexity while maintaining global path computation capability.
Solution Approach 2:
The patent transitions from a centralized global network map approach to a distributed domain-level graph approach. Instead of maintaining one global map across all domains, the system creates multiple local domain graphs that exist in parallel. This dimensional change from centralized to distributed architecture allows path computation to occur across domain boundaries through controlled information exchange, reducing the computational burden on individual controllers.
2Ease of operation
If each SDN controller maintains a global network map in local memory, then global path computation can be performed, but scalability is reduced
Solution Approach 1:
The system segments the network management architecture into independent domain controllers, each handling its local domain. This segmentation allows new domains to be added to the network without requiring existing controllers to maintain updated global maps, enabling the system to scale horizontally by simply adding new domain controllers that operate independently but can participate in cross-domain path computation when needed.
Solution Approach 2:
The patent introduces a domain graph as an intermediary representation that enables global path computation without requiring direct access to complete global network maps. Each controller maintains a domain graph representing its local domain, and these domain graphs serve as intermediaries that facilitate coordinated path computation across domain boundaries through message exchange, allowing scalability while maintaining global path computation capability.
3Ease of operation
If global network maps are maintained at each controller, then path computation can be performed, but network topology exposure increases
Solution Approach 1:
The patent segments network topology information into domain-level graphs rather than maintaining complete global network maps at each controller. Each controller only stores and processes topology information relevant to its local domain, thereby limiting network topology exposure to the minimum necessary for path computation while still enabling global path finding through coordinated processing of these segmented domain graphs.
Data Source
AI summary
A method and system for implementing a network service computation system uses distributed graph processing at a plurality of network controllers corresponding to a plurality of network domains. Each network controller may manage and maintain a network graph for its respective network domain. Each network controller many communicate with nodes (or vertices) in its respective network domain, while the network controllers may communicate with each other for path discovery and computation purposes.