Dynamic Service Graph for Network Feature Peer Routing
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Traditional methods for managing packet/application flow services in networks, such as the star/flower arrangement and service header-based routing, are inefficient and costly due to sub-optimal performance, high latency, and complexity in configuring and maintaining feature topologies, especially when dealing with dynamic service graphs and feature peers.
Innovation Solution
The implementation of a system that determines a service graph for packet forwarding between feature peers using protocols like Openflow, allowing network devices to configure and dynamically change the service graph without altering the application flow, thereby optimizing packet routing and reducing unnecessary traversals.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Ease of operation
If a star/flower network arrangement is used to manage packet/application flow services, then traffic can be directed through feature peers by a feature switch, but the configuration complexity and cost increase due to requiring tunnels for each feature peer and traversing feature switch twice between feature peer and customer
Solution Approach 1:
The patent introduces dynamic service graphs that can be computed and updated in real-time based on network conditions, replacing static star/flower configurations. The service graph dynamically adapts to changing traffic patterns and failure conditions, eliminating the need for manual reconfiguration of tunnels and next hops for each feature peer.
Solution Approach 2:
The patent segments the service graph into multiple paths and uses flow-specific routing decisions. Instead of a single centralized star topology, the service graph is divided into modular segments that can be independently configured and optimized for different application flows, reducing the complexity of managing single centralized tunnels.
2Ease of operation
If a star/flower network arrangement is used, then traffic can be directed through feature peers, but latency increases when feature peers are not near the feature switch
Solution Approach 1:
The dynamic service graph computation considers the physical proximity and routing paths to select optimal feature peer sequences. The system dynamically determines the next feature peer based on current network state, selecting paths that minimize latency rather than following fixed star topology constraints.
Solution Approach 2:
The service graph acts as an intermediary layer between the customer and the feature peers. Instead of direct star topology connections, the service graph mediates traffic routing by computing optimal paths through multiple feature peers, reducing the impact of physical distance and network hops on latency.
3Reliability
If a star/flower arrangement with static configuration is used, then the network is resilient only if a dedicated replica of feature peers is provisioned, but reconfiguration is needed in response to failures
Solution Approach 1:
The service graph is dynamically updated in response to failure conditions without requiring manual reconfiguration. When a feature peer fails, the system automatically recomputes the service graph to select alternative paths and feature peers, maintaining network resilience while eliminating the need for dedicated replicas and manual reconfiguration.
Solution Approach 2:
The system continuously monitors network conditions and uses this feedback to dynamically adjust the service graph. Failure detection triggers automatic service graph recomputation, creating a closed-loop system that adapts to failures without requiring pre-provisioned replicas or manual intervention.
4Ease of operation
If service header-based routing is used, then packet forwarding can be controlled, but expensive changes to software and hardware of access/edge router are required
Solution Approach 1:
The service graph acts as an intermediary that abstracts the complexity of packet forwarding control from the access/edge router. Instead of requiring expensive hardware/software changes in the router, the service graph mediates by using standard routing protocols and existing router capabilities to forward packets through the dynamically computed feature peer sequence.
Data Source
AI summary
A device receives packets of a traffic flow, and inspects one or more of the packets of the traffic flow. The device determines, based on the inspection of the one or more packets, a service graph of feature peers for the packets of the traffic flow. The feature peers are associated with a network, and the service graph includes an ordered set of the feature peers. The device configures network devices of the network with the service graph, and the network devices forward the packets of the traffic flow to the feature peers based on the service graph and without changing the traffic flow.