Segment Routing in Non-Packet Networks
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Non-packet transport networks, such as optical networks, face challenges with fully centralized control planes that are highly dependent on SDN controller availability and connectivity, leading to low scalability and resiliency, and fully distributed GMPLS control planes require complex configuration and periodic updates.
Innovation Solution
Implementing segment routing in non-packet data networks by computing and mapping segment routing paths using segment identifiers (SIDs) within a data communication network (DCN), allowing for efficient routing without relying on centralized controllers or complex signaling protocols, and enabling Traffic Engineering mechanisms.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Device complexity
If a fully centralized control plane is used, then network control is simplified, but scalability and resiliency deteriorate due to high dependency on SDN controller availability
Solution Approach 1:
The patent segments the control plane by introducing hierarchical arbitration mechanisms where controller nodes are divided into different levels (e.g., root controllers and leaf controllers). This segmentation allows the system to maintain simplified control while improving resiliency through distributed decision-making at different hierarchy levels, so that failure of one controller does not collapse the entire system.
Solution Approach 2:
The patent introduces intermediary components such as arbitration protocols and state synchronization mechanisms that mediate between centralized control objectives and distributed reliability requirements. These intermediaries enable controllers to autonomously make decisions while maintaining consistency with the centralized control plane, thereby improving resiliency without sacrificing control simplicity.
2Reliability
If a fully distributed GMPLS control plane is used, then network autonomy is improved, but configuration maintenance and management complexity increase
Solution Approach 1:
The patent applies preliminary action by pre-configuring arbitration rules, hierarchy structures, and state synchronization protocols during network deployment. This allows distributed controllers to autonomously operate without requiring complex real-time configuration management, as the arbitration framework is established in advance to handle dynamic routing decisions automatically.
Solution Approach 2:
The patent changes key control parameters by transitioning from traditional GMPLS stateful routing parameters to segment routing parameters that are simpler to manage. This includes using fixed arbitration rules and predetermined hierarchy levels instead of dynamic state negotiations, thereby reducing configuration management complexity while maintaining network autonomy.
3Reliability
If traditional control planes are used, then network control is established, but periodic updates and signaling protocols increase operational expenses
Solution Approach 1:
The patent implements self-service by enabling controllers to autonomously synchronize their states through the arbitration protocol without requiring periodic external updates or manual intervention. Controllers independently maintain their routing information and make decisions based on pre-established arbitration rules, eliminating the need for continuous signaling protocol exchanges and reducing operational expenses.
Solution Approach 2:
The patent ensures continuous useful action by maintaining persistent arbitration rules and hierarchy structures that enable uninterrupted routing decisions. Instead of periodic updates, the system continuously operates with established arbitration frameworks, allowing controllers to make real-time routing decisions without interruption, thereby improving operational efficiency while maintaining control stability.
Data Source
AI summary
A method in a controller node for performing segment routing in a non-packet data network comprising a plurality of nodes, comprises receiving information relating to the topology of the non-packet data network connecting the plurality of nodes, the non-packet data network forming a data plane network. The method comprises computing a segment routing path to be taken for non-packet traffic data through the data plane network, wherein the segment routing path is computed using segment identifiers, SIDs, relating to a data communication network, DCN, coupled to the plurality of nodes. The method comprises sending the computed segment routing path to an ingress node of the data plane network.