Self-routed layer 4 packet network system and method

• US 7,796,511 B2
• Filed: 04/03/2007
• Issued: 09/14/2010
• Est. Priority Date: 04/06/2006
• Status: Active Grant

• Current Assignee: Samuel F. Wood
• Original Assignee: Samuel F. Wood
• Inventors: Wood, Samuel F.
• Primary Examiner(s): Trost, IV; William
• Assistant Examiner(s): MAGLO, EMMANUEL K
• Application Number:
  US11/696,077
• Publication Number:
  US 20070237150A1
• Time in Patent Office: 1,260 Days
• Field of Search: 370/389, 370/392, 370/397, 370/401, 370/352, 370/467, 370/452, 370/230, 370/230.1, 370/231, 370/252
• US Class Current: 370/230
• CPC Class Codes: H04L 45/04 Interdomain routing, e.g. hierarchical routing
• CPC Class Codes: H04L 45/50 using label swapping, e.g. multi-protocol label switch [MPLS]

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

1. In a label-switched packet network having at least four nodes with at least two possible paths between a calling party and a called party, a method of exposing a path right-of-way comprising:

a calling party causing to be transmitted a hunting packet into said network at an ingress port;

receiving said hunting packet at a first node

automatically storing in a memory associated with the received port, at said first node a portion of said hunting packet sufficient to mark the path right-of-way;

automatically copying said hunting packet at said first node and transmitting at least two copies through at least two ports without relying on knowledge of the network;

receiving said hunting packet at a second node;

automatically storing in a memory associated with the received port at said second node to a portion of said hunting packet sufficient to mark the path right-of-way;

automatically copying said hunting packet at said second node and transmitting at least two copies through at least two ports;

receiving said hunting packet by a called party at an egress port; and

using a portion of said hunting packet to identify a path right-of-way to the calling party;

said method further comprising;

causing a setup packet to be transmitted into the network at said egress port on said path right-of-way in response to the acceptance of said hunting packet by said called party;

said setup packet containing data sufficient to associate it with said hunting packet;

receiving a setup packet at said second node on said path right-of-way;

using a portion of the data stored in said setup packet to identify a port on the second node;

automatically modifying a portion of said data stored in the setup packet at said second node to identify a path on said right-of-way;

transmitting said modified packet through said port on said path right-of-way;

receiving a setup packet at said first node on said path right-of-way;

using a portion of the data stored in said setup packet to identify a port on the first node;

automatically modifying a portion of the data stored in said setup packet at said first node to identify a path on said right-of-way;

transmitting said modified packet through said port on said path right-of-way;

receiving a setup packet by said calling party at the ingress port;

said calling party using a portion of data stored in said setup packet to identify a path on said path right-of-way to said called party; and

transmitting data from said calling party to said called party on said path.

2. In a packet network of claim 1, said method further including:

receiving said hunting packet by said called party;

said hunting packet containing a binary representation of a maximum latency requirement; and

not accepting said hunting packet by said called party when said maximum latency requirement is not met.

3. In a connection oriented packet network, a method of transporting data between an originating computer and a terminating computer comprising:

said originating computer requesting said network for a connection to said terminating computer for the purpose of transporting data to said terminating computer;

said terminating computer receiving said connection request from said network;

said terminating computer accepting said request;

said network informing the originating computer of said connection; and

said originating computer transporting data over said connection using a portion of said hunting packet to identify a path right-of-way to the calling party;

said method further comprising;

causing a setup packet to be transmitted into the network at said egress port on said path right-of-way in response to the acceptance of said hunting packet by said called party;

said setup packet containing data sufficient to associate it with said hunting packet;

receiving a setup packet at said second node on said path right-of-way;

using a portion of the data stored in said setup packet to identify a port on the second node;

automatically modifying a portion of said data stored in the setup packet at said second node to identify a path on said right-of-way;

transmitting said modified packet through said port on said path right-of-way;

receiving a setup packet at said first node on said path right-of-way;

using a portion of the data stored in said setup packet to identify a port on the first node;

automatically modifying a portion of the data stored in said setup packet at said first node to identify a path on said right-of-way;

transmitting said modified packet through said port on said path right-of-way;

receiving a setup packet by said calling party at the ingress port;

said calling party using a portion of data stored in said setup packet to identify a path on said path right-of-way to said called party; and

transmitting data from said calling party to said called party on said path.

4. In a connection oriented packet network, a method of transporting data between a calling party and a called party comprising:

said calling party requesting said network for a connection to said called party for the purpose of transporting data to said called party;

said called party receiving said connection request from said network, without knowledge of the network;

said called party accepting said request;

said network informing calling party of said connection; and

said calling party transporting data over said connection;

said method further comprising;

causing a setup packet to be transmitted into the network at said egress port on said path right-of-way in response to the acceptance of said hunting packet by said called party;

said setup packet containing data sufficient to associate it with said hunting packet;

receiving a setup packet at said second node on said path right-of-way;

using a portion of the data stored in said setup packet to identify a port on the second node;

automatically modifying a portion of said data stored in the setup packet at said second node to identify a path on said right-of-way;

transmitting said modified packet through said port on said path right-of-way;

receiving a setup packet at said first node on said path right-of-way;

using a portion of the data stored in said setup packet to identify a port on the first node;

automatically modifying a portion of the data stored in said setup packet at said first node to identify a path on said right-of-way;

transmitting said modified packet through said port on said path right-of-way;

receiving a setup packet by said calling party at the ingress port;

said calling party using a portion of data stored in said setup packet to identify a path on said path right-of-way to said called party; and

transmitting data from said calling party to said called party on said path.

5. In a connection oriented packet data network comprised of data switches not capable of executing link state routing protocols, a method of transporting data between an originating computer and a terminating computer comprising:

an originating computer causing hunting packet means to transmit a request to expose an optimized path right-of-way to a terminating computer;

said terminating computer accepting the request by transmitting setup packet means along said path right-of-way to the originating computer;

said originating computer using information stored in setup packet means to transmit data to said terminating computer;

said method further comprising;

causing a setup packet to be transmitted into the network at said egress port on said path right-of-way in response to the acceptance of said hunting packet by said called party;

said setup packet containing data sufficient to associate it with said hunting packet;

receiving a setup packet at said second node on said path right-of-way;

using a portion of the data stored in said setup packet to identify a port on the second node;

automatically modifying a portion of said data stored in the setup packet at said second node to identify a path on said right-of-way;

transmitting said modified packet through said port on said path right-of-way;

receiving a setup packet at said first node on said path right-of-way;

using a portion of the data stored in said setup packet to identify a port on the first node;

automatically modifying a portion of the data stored in said setup packet at said first node to identify a path on said right-of-way;

transmitting said modified packet through said port on said path right-of-way;

receiving a setup packet by said calling party at the ingress port;

said calling party using a portion of data stored in said setup packet to identify a path on said path right-of-way to said called party; and

transmitting data from said calling party to said called party on said path.