# US 2003/0217141 A1 · Loop compensation for a network topology

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

- Number: US 2003/0217141 A1
- Document ID: US20030217141A1
- Status: Published application
- Kind: A1
- Application number: 10/143,801
- Filed: 2002-05-14
- Published: 2003-11-20
- Earliest claimed: 2002-05-14
- Inventors: Shiro Suzuki; Ravendra Gorijala; Manoj K. Wadekar
- Web page: https://patentgrep.com/patent/US20030217141A1

## CPC

- H04L 45/18: Loop-free operations
- H04L 45/02: Topology update or discovery
- H04L 45/66: {Layer 2 routing, e.g. in Ethernet based MAN's}
- H04L 49/352: {Gigabit ethernet switching [GBPS]}
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)

## Abstract

A network includes a plurality of edge switches, one or more core switches, and a plurality of core links that couple the edge switches to the core switches. The core links at each of the edge switches are link aggregated together in order to compensate for any loops in the network.

## Claims

### Claim 1

A network comprising:
a plurality of edge switches;
one or more core switches; and
a plurality of core links that couple said edge switches to said core switches;
wherein said core links at each of said edge switches are link aggregated together.

### Claim 2 (depends on 1)

The network of claim 1, wherein said edge switches, said core switches and said core links form a Star-Wired-Matrix topology.

### Claim 3 (depends on 1)

The network of claim 1, wherein said plurality of core links are Ethernet links.

### Claim 4 (depends on 1)

The network of claim 1, wherein said plurality of core links are bidirectional.

### Claim 5 (depends on 1)

The network of claim 1, wherein each of said core switches form a core tree.

### Claim 6 (depends on 1)

The network of claim 1, wherein each of said edge switches form an edge tree.

### Claim 7 (depends on 5)

The network of claim 5, wherein said core trees are parallel.

### Claim 8

A method of analyzing a network that comprises a plurality of edge switches and a plurality of core switches, said method comprising:
identifying a plurality of core trees and a plurality of edge trees;
determining whether the plurality of core trees are parallel; and
verifying that at least one of the core trees includes no loops within the network.

### Claim 9 (depends on 8)

The method of claim 8, further comprising:
determining a topology of the network.

### Claim 10 (depends on 8)

The method of claim 8, further comprising:
verifying that all links between the core switches and the edge switches are bidirectional.

### Claim 11 (depends on 8)

The method of claim 8, further comprising:
identifying parallel local links between the core switches and the edge switches; and
classifying the parallel local links as a single link.

### Claim 12 (depends on 8)

The method of claim 8, wherein links at each of the edge switch that are coupled to one of the core switches are link aggregated together.

### Claim 13 (depends on 8)

The method of claim 8, wherein the network comprises a Star-Wired-Matrix topology.

### Claim 14

A network comprising:
a first edge switch;
a first core switch and a second core switch;
a first link coupled to said first edge switch and said first core switch; and
a second link coupled to said first edge switch and said second core switch;
wherein said first link and said second link are link aggregated together.

### Claim 15 (depends on 14)

The network of claim 14, wherein said network comprises a Star-Wired-Matrix topology.

### Claim 16 (depends on 1)

The network of claim 1, wherein said first link and said second link are Ethernet links.

### Claim 17 (depends on 14)

The network of claim 14, wherein said first core switch and said second core switch each form a core tree.

### Claim 18 (depends on 17)

The network of claim 17, wherein said core trees are parallel.

### Claim 19 (depends on 14)

The network of claim 14, wherein said edge switch forms an edge tree.

### Claim 20 (depends on 17)

The network of claim 17, further comprising a third link coupled to said first edge switch and said first core switch, wherein said first link and said third link are considered a single link.
