Network Routing with Intransitivity Constraints
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current methods fail to compute optimum allowable paths in networks with subset intransitivity constraints, such as timeslot continuity in SONET rings and wavelength continuity in passive optical networks, leading to routing complexities and inefficiencies.
Innovation Solution
An abstracted network map is constructed as a directed graph, representing network elements and subnetwork elements with specific edge definitions to compensate for subset intransitivity, allowing for the computation of least cost routes using Dijkstra's algorithm.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Ease of operation
If an abstracted full-mesh network topology is presented to simplify routing decisions, then routing complexity for edge networks is reduced, but subset intransitivity constraints (such as timeslot continuity in SONET rings or wavelength continuity in passive optical networks) create new routing problems that cannot be solved by conventional algorithms
Solution Approach 1:
The patent segments the abstracted network representation by introducing virtual subnetworks that group together sequences of links subject to intransitivity constraints. Each virtual subnetwork is treated as a distinct routing unit with its own ingress and egress points, allowing routing algorithms to handle constrained link sequences as atomic units rather than individual links, thus resolving the contradiction between simplified topology and complex constraints
Solution Approach 2:
The patent introduces virtual subnetworks as intermediary constructs between the physical network topology and the routing algorithm. These virtual subnetworks act as mediators that encapsulate the complexity of intransitivity constraints, allowing the routing algorithm to operate on a simplified virtual topology while automatically satisfying the underlying physical constraints through the virtual subnetwork's ingress-egress structure
2Productivity
If conventional routing algorithms (Dijkstra's algorithm with weights, AI applications, linear programming) are applied to compute paths, then routing computation can be performed, but none of these methods can compute paths guaranteed to be optimum allowable paths subject to subset intransitivity constraints
Solution Approach 1:
The patent applies preliminary action by pre-structuring the network representation with virtual subnetworks that encode intransitivity constraints before the routing computation begins. The virtual subnetwork topology is constructed in advance with ingress and egress nodes that inherently enforce constraint satisfaction, so that when conventional algorithms like Dijkstra's are applied, they automatically produce optimal paths that satisfy constraints without requiring post-computation validation or modification
3Ease of operation
If edge network elements compute routes using abstracted network maps, then routing decisions are simplified, but failed requests due to intransitivity constraints result in loss of processor time and network control channel congestion
Solution Approach 1:
The patent eliminates re-computation by performing preliminary structuring of the network map with virtual subnetworks that encode all intransitivity constraints. This preliminary action ensures that routing computations performed by edge network elements always yield valid paths on the first attempt, eliminating failed requests and the associated processor time loss and control channel congestion
Data Source
AI summary
A method of computing allowable routes through a data network that includes a subnetwork that introduces a subnet intransitivity constraint on allowable paths through the network involves using an abstracted network map to construct a directed graph that compensates for the subset intransitivity constraint by removing all unallowable paths. The abstracted network map may be used to compute least cost allowable paths through the network. The directed graph represents the same network, and is constructed by representing bi-directional links between the subnetwork elements with two directed edges, and representing the subnetwork elements as paired ingress and egress nodes. A method for constructing the directed graph representing an abstracted map of a network that exhibits subset intransitivity is also described.