Self-routed layer 4 packet network system and method
View Patent ↗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.
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.
2. The method of claim 1 where the path right-of-way is subject to specified constraints, and where said constraints had been provided to nodes under consideration for said right-of-way prior to the connection routing request by the transmitting computer.
3. The method of claim 1 where the label switched path is a bidirectional label switched path.
4. The method according to any one of claims 1 - 3 where tokens are used to limit processing of connection requests.
5. The method of claim 2 where the specified constraints include a policy constraint.
6. The method of claim 2 where the specified constraints include a quality of service constraint.
7. The method of claim 2 where the specified constraints include a maximum latency constraint.
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.
9. The method of claim 8 where the path right-of-way is subject to specified constraints, and where said constraints had been provided to nodes under consideration for said right-of-way prior to the connection request by the transmitting computer.
10. The method of claim 8 where the label switched path is a bidirectional label switched path.
11. The method according to any one of claims 8 - 10 where tokens are used to limit processing of connection requests.
12. The method of claim 9 where the specified constraints include a policy constraint.
13. The method of claim 9 where the specified constraints include a quality of service constraint.
14. The method of claim 9 where the specified constraints include a maximum latency constraint.
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.
16. The method of claim 15 where the right-of-way is subject to specified constraints, and where said constraints had been provided to nodes under consideration for said right-of-way prior to the routing request by the transmitting computer.
17. The method of claim 16 where the specified constraints include a maximum latency constraint.
18. The method of claim 16 where the specified constraints include a policy constraint.
19. The method of claim 16 where the specified constraints include a quality of service constraint.
20. The method according to any one of claims 15 - 17 where tokens are used to limit processing of routing requests.