Identifying a service node in a network
First Claim
Patent Images
1. A method of identifying at least one service node in a network to provide a desired service for a first node in the network, the method comprising:
- receiving a request from the first node for a service node configured to provide a desired service, wherein the first node identifies a node to receive the request using location information for the first node; and
identifying at least one service node configured to provide the desired service based at least on the location information for the first node,wherein identifying at least one service node configured to provide the desired service further includesdetermining whether the at least one service node includes a plurality of service nodes;
in response to the at least one service node including a plurality of service nodes, applying a clustering algorithm to identify one or more of the closest service nodes of the plurality service nodes;
ranking the plurality of service nodes based on the applying of the clustering algorithm; and
selecting one of the plurality of service nodes to provide the desired service based on available bandwidth for the one service node being greater than a minimum bandwidth required for providing the service and the one service node being one of the closest service nodes to the first node of the plurality of service nodes.
2 Assignments
0 Petitions
Accused Products
Abstract
A request is received from a first node in a network. The request includes a request for a service node operable to provide a desired service. At least one service node is identified that is operable to provide the desired service based at least on location information for the first node.
19 Citations
12 Claims
-
1. A method of identifying at least one service node in a network to provide a desired service for a first node in the network, the method comprising:
-
receiving a request from the first node for a service node configured to provide a desired service, wherein the first node identifies a node to receive the request using location information for the first node; and identifying at least one service node configured to provide the desired service based at least on the location information for the first node, wherein identifying at least one service node configured to provide the desired service further includes determining whether the at least one service node includes a plurality of service nodes; in response to the at least one service node including a plurality of service nodes, applying a clustering algorithm to identify one or more of the closest service nodes of the plurality service nodes; ranking the plurality of service nodes based on the applying of the clustering algorithm; and selecting one of the plurality of service nodes to provide the desired service based on available bandwidth for the one service node being greater than a minimum bandwidth required for providing the service and the one service node being one of the closest service nodes to the first node of the plurality of service nodes. - View Dependent Claims (2, 3, 4, 5, 6, 7)
-
-
8. A node in a network comprising:
-
means for receiving from a first node a request for a service node configured to provide a desired service, wherein the first node identifies a node to receive the request using location information for the first node; and means for identifying at least one service node configured to provide the desired service based at least on the location information for the first nodes, wherein the means for identifying identifies at least one service node configured to provide the desired service by determining whether the at least one service node includes a plurality of service nodes; in response to the at least one service node including a plurality of service nodes, applying a clustering algorithm to identify one or more of the closest service nodes of the plurality service nodes; ranking the plurality of service nodes based on the applying of the clustering algorithm; and selecting one of the plurality of service nodes to provide the desired service based on available bandwidth for the one service node being greater than a minimum bandwidth required for providing the service and the one service node being one of the closest service nodes to the first node of the plurality of service nodes. - View Dependent Claims (9)
-
-
10. A computer system configured to connect to a peer-to-peer network and configured to function as a distributed hash table (DHT) node in a DHT overlay network, the distributed hash table overlay network being a logical representation of the peer-to-peer network, wherein the computer system comprises:
-
a memory configured to store location information for a plurality of nodes in the peer-to-peer network that are physically close to a first node in the network; and a processor configured to identify at least one service node configured to provide a desired service for the first node by determining whether the at least one service node includes a plurality of service nodes; in response to the at least one service node including a plurality of service nodes, applying a clustering algorithm to identify one or more of the closest service nodes of the plurality service nodes; ranking the plurality of service nodes based on the applying of the clustering algorithm; and selecting one of the plurality of service nodes to provide the desired service based on available bandwidth for the one service node being greater than a minimum bandwidth required for providing the service and the one service node being one of the closest service nodes to the first node of the plurality of service nodes. - View Dependent Claims (11)
-
-
12. Computer software embedded on a tangible computer readable storage medium, the computer software comprising instructions performing:
-
receiving a request from a first node for a service node configured to provide a desired service, wherein the first node identifies a node to receive the request using location information for the first node; and identifying at least one service node configured to provide the desired service based at least on the location information for the first node, wherein identifying at least one service node configured to provide the desired service further includes determining whether the at least one service node includes a plurality of service nodes; in response to the at least one service node including a plurality of service nodes, applying a clustering algorithm to identify one or more of the closest service nodes of the plurality service nodes; ranking the plurality of service nodes based on the applying of the clustering algorithm; and selecting one of the plurality of service nodes to provide the desired service based on available bandwidth for the one service node being greater than a minimum bandwidth required for providing the service and the one service node being one of the closest service nodes to the first node of the plurality of service nodes.
-
Specification