Responsibility-based peering

• US 9,722,883 B2
• Filed: 03/13/2013
• Issued: 08/01/2017
• Est. Priority Date: 12/13/2012
• Status: Active Grant

• Current Assignee: Level 3 Communications LLC (Lumen Technologies, Inc.)
• Original Assignee: Level 3 Communications LLC (Lumen Technologies, Inc.)
• Inventors: Lipstone, Laurence R., Crowder, William, Varney, Lewis Robert, Swart, Andrew, Newton, Christopher
• Primary Examiner(s): Lazaro, David
• Assistant Examiner(s): Ye, Zi
• Application Number:
  US13/802,335
• Publication Number:
  US 20140173115A1
• Time in Patent Office: 1,602 Days
• Field of Search: 709240, 709226, 709224, 726 13
• CPC Class Codes: G06F 12/0808 with cache invalidating means G06F12/0815 takes precedence
• CPC Class Codes: G06F 15/173 using an interconnection network, e.g. matrix, shuffle, pyramid, star, snowflake
• CPC Class Codes: G06F 15/177 Initialisation or configuration control processor initialisation G06F9/4405
• CPC Class Codes: G06F 9/5055 considering software capabilities, i.e. software resources associated or available to the machine
• CPC Class Codes: G06F 9/5083 Techniques for rebalancing the load in a distributed system
• CPC Class Codes: H04L 41/0813 characterised by the conditions triggering a change of settings
• CPC Class Codes: H04L 41/0816 the condition being an adaptation, e.g. in response to network events
• CPC Class Codes: H04L 41/0823 characterised by the purposes of a change of settings, e.g. optimising configuration for enhancing reliability for optimising operational conditions of wireless networks H04W24/02
• CPC Class Codes: H04L 41/0869 Validating the configuration within one network element
• CPC Class Codes: H04L 41/0893 Assignment of logical groups to network elements
• CPC Class Codes: H04L 41/12 Discovery or management of network topologies
• CPC Class Codes: H04L 41/50 Network service management, e.g. ensuring proper service fulfilment according to agreements
• CPC Class Codes: H04L 41/5041 characterised by the time relationship between creation and deployment of a service
• CPC Class Codes: H04L 41/509 wherein the managed service relates to media content delivery, e.g. audio, video or TV
• CPC Class Codes: H04L 43/04 Processing captured monitoring data, e.g. for logfile generation
• CPC Class Codes: H04L 43/08 Monitoring or testing based on specific metrics, e.g. QoS, energy consumption or environmental parameters
• CPC Class Codes: H04L 43/10 Active monitoring, e.g. heartbeat, ping or trace-route
• CPC Class Codes: H04L 47/70 Admission control; Resource allocation
• CPC Class Codes: H04L 47/83 based on usage prediction
• CPC Class Codes: H04L 61/10 of different types
• CPC Class Codes: H04L 61/2503 : Translation of Internet protocol [IP] addresses
• CPC Class Codes: H04L 61/4511 : using domain name system [DNS]
• CPC Class Codes: H04L 61/4535 : using an address exchange platform which sets up a session between two nodes, e.g. rendezvous servers, session initiation protocols [SIP] registrars or H.323 gatekeepers
• CPC Class Codes: H04L 61/58 : Caching of addresses or names
• CPC Class Codes: H04L 65/403 : Arrangements for multi-party communication, e.g. for conferences data switching systems for conference H04L12/18; arrangements for connecting several subscribers to a common circuit, i.e. affording conference facilities H04M3/56; television conferencing systems H04N7/15
• CPC Class Codes: H04L 65/60 : Network streaming of media packets
• CPC Class Codes: H04L 67/01 : Protocols
• CPC Class Codes: H04L 67/06 : specially adapted for file transfer, e.g. file transfer protocol [FTP]
• CPC Class Codes: H04L 67/10 : in which an application is distributed across nodes in the network software deployment G06F8/60; multiprogramming arrangements G06F9/46
• CPC Class Codes: H04L 67/1078 : Resource delivery mechanisms
• CPC Class Codes: H04L 67/2885 : Hierarchically arranged intermediate devices, e.g. for hierarchical caching
• CPC Class Codes: H04L 67/289 : Intermediate processing functionally located close to the data consumer application, e.g. in same machine, in same home or in same sub-network
• CPC Class Codes: H04L 67/51 : Discovery or management thereof, e.g. service location protocol [SLP] or web services
• CPC Class Codes: H04L 67/55 : Push-based network services
• CPC Class Codes: H04L 67/568 : Storing data temporarily at an intermediate stage, e.g. caching
• CPC Class Codes: H04L 67/5682 : Policies or rules for updating, deleting or replacing the stored data
• CPC Class Codes: H04L 67/60 : Scheduling or organising the servicing of application requests, e.g. requests for application data transmissions using the analysis and optimisation of the required network resources admission control or resource allocation H04L47/70
• CPC Class Codes: H04L 69/03 : Protocol definition or specification protocol conformance testing H04L1/244

Abstract

A method is operable in a network comprising multiple service endpoints running on a plurality of devices, A node in a group of the multiple service endpoints receives a request relating to a particular resource. The node determines what kind of responsibility it has for the request based on at least one kind responsibility assigned to the node for requests relating to the particular resource; and based on the determining, the node attempts to process the request in accordance with the type of the particular resource and the kind of responsibility the node has for the resource.

Claims

1. A computer-implemented method, operable in a network comprising multiple service endpoints running on a plurality of devices, the method operable on a device comprising hardware including memory and at least one processor, the method comprising, by a node in a group of said multiple service endpoints, wherein each node in the group assumes one or more discrete responsibilities involved in collaborative processing of a request across the group, and wherein a configurable policy defines a mapping from a number of discrete resource types to a request peering type with a capacity allocation for each responsibility in the request peering type:

(A) receiving, at said node, a request relating to a particular resource;

(B) determining what kind of responsibility said node has for said request based on at least one kind of responsibility assigned to said node for requests relating to said particular resource, and (ii) said mapping; and

(C) based on said determining in (B), attempting to process said request in accordance with the type of said particular resource and the kind of responsibility said node has for said particular resource.

2. The method of claim 1 wherein the group of said multiple service endpoints comprise a peer group.

3. The method of claim 2 wherein the peer group comprises a super-cluster of a plurality of nodes of said multiple service endpoints.

4. The method of claim 1 wherein the group comprises a super-cluster of a plurality of nodes of said multiple service endpoints.

5. The method of claim 1 wherein each resource has a resource type selected from a discrete set of resource types.

6. The method of claim 1 wherein each node of said group is assigned at least one kind of responsibility for certain resources.

7. The method of claim 6 wherein the at least one kind of responsibility is selected from a discrete set of kinds of responsibilities.

8. The method of claim 6 wherein at least one kind of responsibility is dynamically assigned to each node of the group.

9. The method of claim 6 wherein there is a responsibility set corresponding to each kind of responsibility, and wherein each node in the group is assigned to at least one responsibility set.

10. The method of claim 9 wherein each responsibility set has a corresponding size, and wherein a policy determines the size of each responsibility set based on the size of the group.

11. The method of claim 9 wherein each responsibility set has a corresponding size, and wherein a policy determines the size of each responsibility set based on a measured load on at least a part of the group.

12. The method of claim 1 wherein each of said service endpoints has a corresponding service type, and wherein said group comprises service endpoints of the same service type.

13. The method of claim 1 wherein the service endpoints in the group are functionally equivalent.

14. The method of claim 1 wherein attempting to process said request in (C) comprises:

(C)(1) attempting to pass at least some processing of the request to another node in the group.

15. The method of claim 14, wherein said attempting to pass in (C)(1) comprises at least one of:

(i) attempting to transfer at least some processing of the request to said other node in the group;

(ii) attempting to proxy at least some processing of the request to said other node in the group;

(iii) attempting to redirect at least some processing of the request to said other node in the group.

16. The method of claim 14 wherein said node attempts to pass said at least some of said processing to said other node when said node determines, in (B), that said node is not responsible for said request.

17. The method of claim 14 wherein said other node in the group is a node with responsibility for the request.

18. The method of claim 14 wherein processing of said request requires a certain kind of responsibility, and wherein the other node has said certain kind of responsibility.

19. The method of claim 18 wherein there is a responsibility set corresponding to each kind of responsibility, and wherein each node in the group is assigned to at least one responsibility set, and wherein said other node is in the set of nodes having said certain kind of responsibility.

20. The method of claim 14 further comprising:

(C)(2) in response to said attempting to pass, when said other node does not respond, attempting to pass said at least some processing of the request to at least one second other node having the kind of responsibility to process the request.

21. The method of claim 20 further comprising:

(C)(3) repeating act (C)(2) until either

(i) another node accepts responsibility for said request, or

(ii) the attempting to pass in(C)(1) has been tried for all other nodes having the kind of responsibility to process the request.

22. The method of claim 21 further comprising:

(C)(4) when no other node accepts responsibility for processing the request, said node taking responsibility for processing the request.

23. The method of claim 14 wherein, in (C)(1), said node attempts to pass all processing of the request to another node in the group.

24. The method of claim 1 wherein attempting to process the request by the node in (C) comprises:

(C)(1) passing at least some responsibility for processing of the request to at least one other node in the group.

25. The method of claim 24 wherein said passing in (C)(1) comprises:

obtaining at least some information relating to said request from another node in the group.

26. A device, operable in a network comprising multiple service endpoints running on a plurality of devices, comprising:

(a) hardware including memory and at least one processor, and

(b) a service running on said hardware, wherein said service is in a group of multiple services, and wherein each service in the group assumes one or more discrete responsibilities involved in collaborative processing of a request across the group, and wherein a configurable policy defines a mapping from a number of discrete resource types to a request peering type with a capacity allocation for each responsibility in the request peering type, and wherein said service is configured to;

(A) receive a request relating to a particular resource;

(B) determine what kind of responsibility said service has for said request based on (i) at least one kind responsibility assigned to said node for requests relating to said particular resource, and (ii) said mapping; and

(C) based on said determining in (B), attempt to process said request in accordance with the type of said particular resource and the kind of responsibility said service has for said resource.

27. A system comprising two or more devices according to claim 26.

28. A computer program product having computer readable instructions stored on non-transitory computer readable media, the computer readable instructions including instructions for implementing a computer-implemented method, the method operable in a network comprising multiple service endpoints running on a plurality of devices, and said method operable on a device comprising hardware including memory and at least one processor and running a service on said hardware, wherein said service is in a group of multiple services, and wherein each service in the group assumes one or more discrete responsibilities involved in collaborative processing of a request across the group, and wherein a configurable policy defines a mapping from a number of discrete resource types to a request peering type with a capacity allocation for each responsibility in the request peering type,

said method comprising:

(A) receiving, at a node, a request relating to a particular resource;

(B) determining what kind of responsibility said node has for said request based on (i) at least one kind responsibility assigned to said node for requests relating to said particular resource, and (ii) said mapping; and

(C) based on said determining in (B), attempting to process said request in accordance with the type of said particular resource and the kind of responsibility said node has for said particular resource.