Routing-based proximity for communication networks
First Claim
Patent Images
1. A system comprising:
- at least one non-transitory computer readable storage medium storing data;
at least one processor configured to perform operations on the stored data;
a service gateway configured to;
receive node identifications of a plurality of nodes from a requesting node, the plurality of nodes being peers to the requesting node in an overlay network using infrastructure of a backbone network, the requesting node residing in a different specified network area than at least some of the plurality of nodes including a second node residing in a second network;
determine a topological distance between the requesting node and each of the plurality of nodes, wherein a shortest path first (SPF) proximity algorithm is used to determine the topological distance between the requesting node and at least one of the plurality of nodes and determining the topological distance between the requesting node and the second node includes using link state information of a second service gateway associated with the second area and received from the second service gateway over a tunnel-based adjacency established between the service gateway and the second service gateway;
generate a list of peers ranking the plurality of nodes, based at least in part on the respective topological distance of each node in the plurality of nodes to the requesting node; and
return the list of peers to the requesting node in response to a proximity request received from the requesting node, the proximity request including the node identifications.
1 Assignment
0 Petitions
Accused Products
Abstract
A node in an overlay network requests a ranked list of other nodes in multiple areas of the overlay network that can provide a desired piece of content or service to the requesting node. A separate node such as a router generates the ranked list using a routing algorithm, returning the list to the requesting node so that the requesting node may acquire the desired content or service from the nearest node in the overlay network.
-
Citations
20 Claims
-
1. A system comprising:
- at least one non-transitory computer readable storage medium storing data;
at least one processor configured to perform operations on the stored data;
a service gateway configured to;
receive node identifications of a plurality of nodes from a requesting node, the plurality of nodes being peers to the requesting node in an overlay network using infrastructure of a backbone network, the requesting node residing in a different specified network area than at least some of the plurality of nodes including a second node residing in a second network;
determine a topological distance between the requesting node and each of the plurality of nodes, wherein a shortest path first (SPF) proximity algorithm is used to determine the topological distance between the requesting node and at least one of the plurality of nodes and determining the topological distance between the requesting node and the second node includes using link state information of a second service gateway associated with the second area and received from the second service gateway over a tunnel-based adjacency established between the service gateway and the second service gateway;
generate a list of peers ranking the plurality of nodes, based at least in part on the respective topological distance of each node in the plurality of nodes to the requesting node; and
return the list of peers to the requesting node in response to a proximity request received from the requesting node, the proximity request including the node identifications. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8)
- at least one non-transitory computer readable storage medium storing data;
-
9. An article comprising logic encoded in non-transitory media and operable, when executed by a processor, to perform operations comprising:
-
receiving from a requesting node in a communication network a proximity request including a list of a plurality of other nodes in a plurality of areas in the network that can provide a desired piece of content to the requesting node, the plurality of the other nodes including a particular node residing in a particular network area different from the area of the requesting node; determining a topological distance between the requesting node and each of the plurality of other nodes, wherein determining topological distance between the requesting node and the particular node includes using link state information of a service gateway associated with the particular area and received from the service gateway over a tunnel-based adjacency established with the service gateway; generating a ranked list of the plurality of other nodes ranking the plurality of other nodes, based at least in part on the respective topological distance of each of the plurality of other nodes to the requesting node; and returning the ranked list to the requesting node in response to the proximity request. - View Dependent Claims (10, 11, 12, 13)
-
-
14. A computer-implemented method comprising:
-
receiving, using at least one processing device, a proximity request from a requesting node, the proximity request including a list of at least two nodes, identified by the requesting node, at least one particular node of the at least two nodes residing in a particular area different from the requesting node; determining, using at least one processing device, a topological distance between the requesting node and each of the at least two nodes by executing a shortest path first (SPF) algorithm on each of the at least two nodes relative to the requesting node, wherein determining topological distance between the requesting node and the particular node includes using link state information of a service gateway associated with the particular area and received from the service gateway over a tunnel-based adjacency established with the service gateway; generating, using at least one processing device, an ordered list of the at least two nodes ranking the at least two nodes, based at least in part on the respective topological distance of each of the at least two nodes to the requesting node; and returning, using at least one processing device, the ordered list to the requesting node in response to the proximity request. - View Dependent Claims (15, 16, 17, 18, 19, 20)
-
Specification