# US 2003/0076840 A1 · Multi-path analysis for managing machine communications in a network

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2003/0076840 A1
- Document ID: US20030076840A1
- Status: Published application
- Kind: A1
- Application number: 10/029,356
- Filed: 2001-10-18
- Published: 2003-04-24
- Earliest claimed: 2001-10-18
- Assignees: Intel Corporation
- Inventors: Priya Rajagopal; Gerhard W. Gross
- Web page: https://patentgrep.com/patent/US20030076840A1

## CPC

- H04L 45/24: Multipath
- H04L 41/0213: Standardised network management protocols, e.g. simple network management protocol [SNMP]
- H04L 41/12: Discovery or management of network topologies
- H04L 43/00: Arrangements for monitoring or testing data switching networks
- H04L 45/02: Topology update or discovery
- H04L 45/22: {Alternate routing}
- H04L 45/28: using route fault recovery
- H04L 45/302: Route determination based on requested QoS
- H04L 43/0852: Delays
- H04L 43/087: Jitter
- H04L 43/106: using time related information in packets, e.g. by adding timestamps
- H04L 43/12: Network monitoring probes
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)

## Abstract

Multiple traffic management nodes may be coupled with separate networks and with a connecting network. The traffic management nodes monitor and classify traffic passing through the connecting network. Current paths through the connecting network are identified and used to build detour paths through the connecting network using traffic management nodes as detour nodes. The detour paths may be shortened, thereby excluding the detour nodes from each detour path. The traffic management nodes and the detour paths may be used to create a traffic engineered system for traffic passing through the connecting network.

## Claims

### Claim 1

A machine-implemented method of managing communications, the method comprising:
identifying a current path comprising current segments in a packet-switched network for traffic traveling from a source node to a destination node;
identifying a detour path comprising a first path from the source node to a detour node and a second path from the detour node to the destination node; and
converting the detour path into an alternate path comprising alternate segments for sending traffic from the source node to the destination node if the current path includes at least one current segment that will be different from the alternate segments.

### Claim 2 (depends on 1)

The method of claim 1, wherein converting the detour path into the alternate path comprises:
comparing the current segments with a list of detour segments for the detour path;
determining whether the first path is a sub-path of the current path; and
determining whether the current path is a sub-path of the first path.

### Claim 3 (depends on 2)

The method of claim 2, wherein converting the detour path into the alternate path further comprises concatenating the first path and the second path.

### Claim 4 (depends on 1)

The method of claim 1, further comprising:
storing values for one or more attributes for the current path;
storing values for the one or more attributes for the alternate path;
receiving a service specification for a network communication; and
selectively using either the current path or the alternate path for the network communication based on the service specification and one or more of the stored values.

### Claim 5 (depends on 4)

The method of claim 4, wherein the one or more attributes include jitter, latency and bandwidth.

### Claim 6 (depends on 5)

The method of claim 5, wherein selectively using either the current path or the alternate path further comprises using a configurable algorithm to compare the service specification with jitter and latency characteristics for the current path and the alternate path.

### Claim 7 (depends on 4)

The method of claim 4, further comprising:
identifying failure of a segment; and
rerouting one or more flows affected by an identified segment failure.

### Claim 8 (depends on 4)

The method of claim 4, further comprising:
identifying when occupancy of a segment becomes greater than a predefined percentage of bandwidth capacity for the segment; and
rerouting one or more flows, which currently use the segment.

### Claim 9 (depends on 8)

The method of claim 8, wherein the rerouting one or more flows comprises dividing a flow between two or more paths.

### Claim 10

A method of managing machine communications in a virtual private network having three or more network nodes coupled with a larger network, the method comprising:
identifying current paths used by the larger network for traffic sent among the three or more network nodes;
combining the current paths using at least one detour node to derive alternate paths through the larger network;
storing values relating to one or more path attributes for each of the current paths and for each of the alternate paths;
receiving a service specification for a network communication; and
selecting one of the alternate paths for the network communication if the stored value for a current path indicates that the current path is unsuitable for the network communication.

### Claim 11 (depends on 10)

The method of claim 10, wherein the one or more path attributes comprise bandwidth capacity, the method further comprising storing values for a segment attribute for each of a plurality of segments making up the current paths and the alternate paths.

### Claim 12 (depends on 11)

The method of claim 11, further comprising:
identifying when occupancy of a segment becomes greater than a predefined percentage of bandwidth capacity for the segment; and
rerouting one or more flows, which currently use the segment.

### Claim 13 (depends on 10)

The method of claim 10, wherein the one or more path attributes comprise jitter and latency.

### Claim 14 (depends on 13)

The method of claim 13, wherein selecting one of the alternate paths for the network communication further comprises comparing the service specification with exponential averages of jitter and latency for the one of the current paths.

### Claim 15 (depends on 14)

The method of claim 14, wherein the exponential averages vary with an indication of length for the network communication included in the service specification.

### Claim 16 (depends on 10)

The method of claim 10, wherein combining the current paths to derive alternate paths comprises:
identifying a detour path comprising a first path from a source node of the three or more network nodes, to a detour node of the three or more network nodes, and a second path from the detour node to a destination node of the three or more network nodes; and
converting the detour path into an alternate path if the current path includes at least one segment that would not be included in the alternate path after conversion.

### Claim 17

A machine-accessible medium that when accessed results in a machine performing operations comprising:
identifying a current path in a packet-switched network for traffic from a source node to a destination node;
identifying a detour path comprising a first path from the source node to a detour node and a second path from the detour node to the destination node; and
validating the detour path for the source-destination pair if the current path includes at least one segment not in the detour path.

### Claim 18 (depends on 17)

The machine-accessible medium of claim 17, wherein the operations further comprise:
storing values relating to one or more attributes for the current path;
storing values relating to the one or more attributes for the detour path;
receiving a service specification for a network communication; and
selectively using either the current path or the detour path for the network communication based on the service specification and one or more of the stored values.

### Claim 19

A network system comprising:
three or more separate networks;
three or more nodes each respectively coupled with the three or more separate networks, and with a connecting network, which enables machine communications to pass among the three or more separate networks via the three or more nodes;
means for identifying current paths for the machine communications passing through the connecting network;
means for combining the current paths to derive alternate paths through the connecting network;
means for storing values for one or more path attributes for each of the current paths and for each of the alternate paths;
means for receiving a service specification for a machine communication; and
means for selecting one of the alternate paths for the machine communication if the stored value for one of the current paths is insufficient for the service specification.

### Claim 20 (depends on 19)

The system of claim 19, further comprising:
means for identifying when occupancy of a segment in one of the current paths becomes greater than a predefined percentage of bandwidth capacity for the segment; and
means for rerouting one or more flows, which currently use the segment.

### Claim 21

A network system comprising:
three or more separate networks;
three or more nodes coupled with the three or more separate networks respectively, and with a connecting network, which enables machine communications to pass among the three or more separate networks via the three or more nodes;
a traffic management server coupled with a network and in machine communication with the three or more nodes, the traffic management server configured to combine current paths for the machine communications to derive alternate paths through the connecting network, and maintain a data structure to store values for one or more path attributes for each of the current paths and for each of the alternate paths to be used in selectively routing machine communications among the three or more nodes.

### Claim 22 (depends on 21)

The system of claim 21, wherein the three or more nodes are each configured to track path occupancy per flow, and wherein the traffic management server is further configured to identify when occupancy of a segment in one of the current paths becomes greater than a predefined percentage of bandwidth capacity for the segment to allow rerouting one or more flows, which currently use the segment.
