Self-routed layer 4 packet network system and method
First Claim
Patent Images
1. In a multi-node, connection oriented packet data network, a method of building a label switched path on demand between a transmitting computer at a first node and a receiving computer at a second node comprising:
- automatically exposing a single, optimized path right-of-way, on demand from the first node to the second node in response to a connection request by the transmitting computer, where the right-of-way traverses at least one intermediate node, and where sufficient links exist to allow multiple possible right-of-ways;
limiting said right-of-way to links with available bandwidth introducing a time delay at one or more nodes as part of exposing the path right-of-way between the first node and the second node, where the amount of delay had been previously stored in a memory;
automatically building a label switched path along said right-of-way from the second node to the first node in response to the acceptance of the connection request by the receiving computer; and
transmitting of data along said label switched path.
0 Assignments
0 Petitions
Accused Products
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.
29 Citations
20 Claims
-
1. In a multi-node, connection oriented packet data network, a method of building a label switched path on demand between a transmitting computer at a first node and a receiving computer at a second node comprising:
-
automatically exposing a single, optimized path right-of-way, on demand from the first node to the second node in response to a connection request by the transmitting computer, where the right-of-way traverses at least one intermediate node, and where sufficient links exist to allow multiple possible right-of-ways; limiting said right-of-way to links with available bandwidth introducing a time delay at one or more nodes as part of exposing the path right-of-way between the first node and the second node, where the amount of delay had been previously stored in a memory; automatically building a label switched path along said right-of-way from the second node to the first node in response to the acceptance of the connection request by the receiving computer; and transmitting of data along said label switched path. - View Dependent Claims (2, 3, 4, 5, 6, 7)
-
-
8. In a multi-node, connection oriented packet data network, a method of building 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:
-
automatically exposing a single optimized path right-of-way, with a single attempt, on demand from the first node to the second node and at least the third node in response to a connection request by the transmitting computer, where the right-of-way traverses at least one intermediate node, and where sufficient links exist to allow multiple possible right-of-ways; limiting said right-of-way to links with available bandwidth introducing a time delay at one or more nodes as part of exposing the path right-of-way between the first node and the second node, where the amount of delay had been previously stored in a memory; automatically building 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 connection request by the receiving computers; and transmitting of data along said label switched path. - View Dependent Claims (9, 10, 11, 12, 13, 14)
-
-
15. In a multi-node packet data network, a method of routing a packet on demand between a transmitting computer at a first node and a receiving computer at a second node comprising:
-
automatically exposing a single, optimized right-of-way from the first node to the second node in response to a routing request by the transmitting computer, where the right-of-way traverses at least one intermediate node, and where sufficient links exist to allow multiple possible right-of-ways; limiting said right-of-way to links with available bandwidth introducing a time delay at one or more nodes as part of exposing the path right-of-way between the first node and the second node, where the amount of delay had been previously stored in a memory; automatically establishing a route along said right-of-way from the second node to the first node in response to the acceptance of the routing request by the receiving computer; and transmitting of data along said route. - View Dependent Claims (16, 17, 18, 19, 20)
-
Specification
-
- Resources
Litigation Campaign Assessment
Thank you for your request. You will receive a custom alert email when the Litigation Campaign Assessment is available.
×
-
Current AssigneeSamuel F. Wood
-
Original AssigneeSamuel F. Wood
-
InventorsWood, Samuel F.
-
Primary Examiner(s)Kizou, Hassan
-
Assistant Examiner(s)MAGLO, EMMANUEL K
-
Application NumberUS12/856,564Publication NumberTime in Patent Office1,145 DaysField of Search370/218, 370/230, 370/351, 370/389US Class Current370/400CPC Class CodesH04L 45/04 Interdomain routing, e.g. h...H04L 45/50 using label swapping, e.g. ...
