# US 2010/0303082 A1 · Self-Routed Layer 4 Packet Network System and Method

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

- Number: US 2010/0303082 A1
- Document ID: US20100303082A1
- Status: Published application
- Kind: A1
- Application number: 12/856,564
- Filed: 2010-08-13
- Published: 2010-12-02
- Earliest claimed: 2006-04-06
- Inventors: Samuel F. Wood
- Web page: https://patentgrep.com/patent/US20100303082A1

## CPC

- H04L 45/50: using label swapping, e.g. multi-protocol label switch [MPLS]
- H04L 45/04: {Interdomain routing, e.g. hierarchical routing}
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)

## Abstract

The embodiment discloses a connection oriented packet network using an MPLS-type label switching technology. The network uses a very fast hardware-oriented self-routing protocol that can expose a path right-of-way and program a connection between a calling and called party at wire speed. The embodiment requires no provisioning and is well suited for mobile and ad-hoc networks. The system and method taught can be applied to other data networks where performance guarantees are important.

## Claims

### Claim 1

In a multi-node, connection oriented packet data network, a method of routing a label switched path on demand between a transmitting computer at a first node and a receiving computer at a second node comprising:
the exposing of a single, optimized path right-of-way from the first node to the second node in response to a request by the transmitting computer, where the right-of-way traverses at least one intermediate node;
the building of a label switched path along said right-of-way from the second node to the first node in response to the acceptance of the request by the receiving computer; and
the transmission of data along said label switched path.

### Claim 2 (depends on 1)

The method of claim 1 where the path right-of-way is subject to specified constraints.

### Claim 3 (depends on 2)

The method of claim 2 where the specified constraints include a policy constraint.

### Claim 4 (depends on 2)

The method of claim 2 where the specified constraints include a quality of service constraint.

### Claim 5 (depends on 2)

The method of claim 2 where the specified constraints include a maximum latency constraint.

### Claim 6 (depends on 1)

The method of claim 1 where the label switched path is a bidirectional label switched path.

### Claim 7

In a multi-node, connection oriented packet data network, a method of routing a multicast label switched path on demand between a transmitting computer at a first node and at least two receiving computers at a second and at least a third node comprising:
the exposing of a single optimized path right-of-way from the first node to the second node and at least the third node in response to a request by the transmitting computer, where the right-of-way traverses at least one intermediate node;
the building of a label switched path along said right-of-way from the second node and at least the third node to the first node in response to the acceptance of the request by the receiving computers; and
the transmission of data along said label switched path.

### Claim 8 (depends on 7)

The method of claim 7 where the path right-of-way is subject to specified constraints.

### Claim 9 (depends on 8)

The method of claim 8 where the specified constraints include a policy constraint.

### Claim 10 (depends on 8)

The method of claim 8 where the specified constraints include a quality of service constraint.

### Claim 11 (depends on 8)

The method of claim 8 where the specified constraints include a maximum latency constraint.

### Claim 12 (depends on 7)

The method of claim 7 where the label switched path is a bidirectional label switched path.

### Claim 13

In a multi-node packet data network, a method of routing a path on demand between a transmitting computer at a first node and a receiving computer at a second node comprising:
the exposing of a single, optimized path right-of-way from the first node to the second node in response to a request by the transmitting computer, where the right-of-way traverses at least one intermediate node;
the building of a path along said right-of-way from the second node to the first node in response to the acceptance of the request by the receiving computer; and
the transmission of data along said path.

### Claim 14 (depends on 13)

The method of claim 13 where the path right-of-way is subject to specified constraints.

### Claim 15 (depends on 14)

The method of claim 14 where the specified constraints include a policy constraint.

### Claim 16 (depends on 14)

The method of claim 14 where the specified constraints include a quality of service constraint.

### Claim 17 (depends on 14)

The method of claim 14 where the specified constraints include a maximum latency constraint.
