ROUTE AWARE NETWORK LINK ACCELERATION
First Claim
1. A method for implementing functionality within a network on behalf of first and second devices communicating with each other through the network comprising:
- specifying an ordered list of routing events, wherein the ordered list comprises a list of all routing events received after a routing information context was constructed, wherein the routing information context represents a starting topology and a routing state of a routing domain;
providing the routing information context;
constructing path information between a starting address and a destination address within the network using the routing information context;
updating the routing information context in accordance with a next routing event in the ordered list of routing events;
repeating the constructing and updating steps above until reaching a last routing event in the ordered list of routing events; and
based on the path information between the starting address and the destination address, implementing functionality within the network on behalf of the first and second devices to reduce a number of hops between the first and second devices relative to a number of hops in the path information between the starting address and the destination address by;
providing a front-end device within the network having an interface for communicating data traffic with the first device;
providing a back-end device within the network having an interface for communicating data traffic with the second device;
providing a communication channel coupling the front-end device and the back-end device;
encoding data traffic over the communication channel in a first process in the front-end device;
encoding data traffic over the communication channel in a second process in the back-end device, decoding the encoded data traffic from the front-end device in a third process in the back-end device; and
decoding the encoded data traffic from the back-end device in a fourth process in the front-end device, wherein the first, second, third, and fourth processes implement preselected compatible semantics to perform the encoding and the decoding on the data traffic wherein the preselected compatible semantics comprise processes for sharing operational information for the front-end and back-end computers.
10 Assignments
0 Petitions
Accused Products
Abstract
A method and apparatus for route aware network link acceleration provides a managed communication channel for accelerated and reliable network communication between a client and other network devices as needed. The communication channel may comprise one or more segments having increased speed, reliability, security, or other improved characteristics as compared to traditional communication links. Network traffic may be routed through one or more of the segments based on various criteria to improve communication of the traffic. In one embodiment, the segments may be arranged in a daisy chain configuration and be provided by one or more chaining nodes.
91 Citations
21 Claims
-
1. A method for implementing functionality within a network on behalf of first and second devices communicating with each other through the network comprising:
-
specifying an ordered list of routing events, wherein the ordered list comprises a list of all routing events received after a routing information context was constructed, wherein the routing information context represents a starting topology and a routing state of a routing domain; providing the routing information context; constructing path information between a starting address and a destination address within the network using the routing information context; updating the routing information context in accordance with a next routing event in the ordered list of routing events; repeating the constructing and updating steps above until reaching a last routing event in the ordered list of routing events; and based on the path information between the starting address and the destination address, implementing functionality within the network on behalf of the first and second devices to reduce a number of hops between the first and second devices relative to a number of hops in the path information between the starting address and the destination address by; providing a front-end device within the network having an interface for communicating data traffic with the first device; providing a back-end device within the network having an interface for communicating data traffic with the second device; providing a communication channel coupling the front-end device and the back-end device; encoding data traffic over the communication channel in a first process in the front-end device; encoding data traffic over the communication channel in a second process in the back-end device, decoding the encoded data traffic from the front-end device in a third process in the back-end device; and decoding the encoded data traffic from the back-end device in a fourth process in the front-end device, wherein the first, second, third, and fourth processes implement preselected compatible semantics to perform the encoding and the decoding on the data traffic wherein the preselected compatible semantics comprise processes for sharing operational information for the front-end and back-end computers. - View Dependent Claims (2, 3, 4, 5, 6)
-
-
7. A method for transporting data through a communication network between a first device and a second device comprising:
-
identifying a path of travel from an origin to a destination for a packet in a multi-area domain operated according to a link state routing protocol by; receiving first topology information pertaining to at least one non-local area; identifying a source for the current area, wherein if the current area includes the origin, the source for the current area is the origin, wherein if the current area does not include the origin, the source for the current area corresponds to an exit point for a previous area along the path of travel; identifying one or more exit points from the current area through which the destination is reachable; determining second topology information based on the source and the one or more exit points; selecting an exit point from the one or more exit points, wherein the selected exit point represents a least cost path to the destination based on the first topology information pertaining to a most recently updated topology between the exit point and the destination and the second topology information; constructing a least cost path segment for the area from the source to the exit point; and concatenating each least cost path segment to form an end-to-end path; providing a front-end device within the network having an interface for communicating data traffic with the first device; providing a back-end device within the network having an interface for communicating data traffic with the second device; and providing a communication channel coupling the front-end device and the back-end device to transport data between the first and second devices with a reduced number of hops relative to the end-to-end path. - View Dependent Claims (8, 9, 10, 11, 12, 13, 14, 15, 19)
-
-
16. A system for transporting data through a communication network comprising:
-
at least one front-end comprising an interface to communicate data traffic in accordance with a first protocol with one or more clients; at least one back-end comprising an interface to communicate the data traffic in accordance with the first protocol with one or more servers; at least one route monitoring system configured to provide end-to-end path information for one or more network paths through the network from the one or more clients to the one or more servers; and at least one enhanced communication channel between the at least one front-end and the at least one back-end, the at least one enhanced communication channel configured to transport the data traffic of the first protocol in an enhanced second protocol, wherein the at least one enhanced communication channel is implemented to reduce a number of hops between the one or more clients and the one or more servers relative to a number of hops in the one or more network paths. - View Dependent Claims (17, 18, 20, 21)
-
Specification