Responsibility-based request processing

• US 9,787,551 B2
• Filed: 03/13/2013
• Issued: 10/10/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: Newton, Christopher, Varney, Lewis Robert, Lipstone, Laurence R., Crowder, William, Swart, Andrew
• Primary Examiner(s): Lazaro, David
• Assistant Examiner(s): Ye, Zi
• Application Number:
  US13/802,291
• Publication Number:
  US 20140173131A1
• Time in Patent Office: 1,672 Days
• Field of Search: 709240, 709223, 709226, 709209, 717 44
• 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, the service endpoints running on a plurality of devices, wherein the multiple service endpoints form one or more sub-clusters. The method includes defining a group from an arbitrary set of nodes comprising service instances across the machines of the one or more sub-clusters, wherein each node in the group assumes one or more discrete responsibilities involved in processing of a request across the group. In response to a request made at a node the group, the service type of the request is dynamically determined; and, based on the type of the request, one or more nodes in the group are selected to be responsible for processing the request.

Claims

1. A computer-implemented method, operable in a in a content delivery (CD) network comprising multiple service endpoints, said service endpoints running on a plurality of devices, wherein said multiple service endpoints form multiple sub-clusters, wherein two or more of said sub-clusters form a super-cluster, and wherein the content delivery network (CDN) delivers content on behalf of one or more subscribers to the CDN, the method operable on a device comprising hardware including memory and at least one processor, the method comprising:

(A) defining a group from an arbitrary set of nodes comprising CD service instances across the machines of said multiple sub-clusters, wherein said group comprises a peer group, and wherein the nodes in each sub-cluster share a corresponding internal network address space, and wherein each sub-cluster is addressable by a single external address, and wherein each node in the group has a set of capabilities and a corresponding capacity for each capability the node'"'"'s set of capabilities, and wherein each node in the group assumes one or more discrete responsibilities involved in processing of a request across the group, wherein said discrete responsibilities are taken from the list comprising;

non-responsible, cache-responsible, and fill-responsible, and wherein defining of the group is according to a peering policy at least based on capabilities and capacities of nodes in the group, wherein said peering policy maps different request types to different responsibility chains, and wherein, for at least one particular responsibility of said discrete responsibilities, multiple nodes in said group are capable of assuming said particular responsibility, and wherein the capacity of each particular node in the group represents said particular node'"'"'s relative capacity to fulfill said one or more discrete responsibilities compared to other nodes with the same one or more discrete responsibilities;

(B) in response to a request made at a node the group, said request being associated with content of a subscriber to the CDN,

(B)(1) dynamically determining a CD service type of the request, said determining being based on whether said content is rejectable, redirectable, or servable; and

(B)(2) based on the CD service type of the request, selecting one or more nodes in said group to be responsible for processing said request; and

(C) automatically redefining the group defined in (A) based on a change in capability or capacity of one or more nodes in the group, wherein the group as redefined in (C) is distinct from the group as defined in (A).

2. The method of claim 1 further comprising:

(B)(3) processing the request using the selected one or more nodes in the group.

3. The method of claim 1 wherein the processing of the request comprises execution of a chain of responsibilities by at least one of the selected one or more nodes in the group.

4. The method of claim 1 wherein the one or more nodes in said group selected to be responsible for processing said request are selected based on (i) a policy in effect, and (ii) a capacity of nodes in the group.

5. The method of claim 1 wherein each node in the group assumes one or more discrete responsibilities involved in collaborative processing of a request across the group.

6. The method of claim 1 wherein each node in each sub-cluster shares a corresponding local heartbeat signal with each other node in the same sub-cluster, said local heartbeat signal in each particular sub-cluster providing an indication to each node in said particular sub-cluster of a state of other nodes in said particular sub-cluster.

7. The method of claim 6 wherein each of the sub-clusters in the super-cluster shares a super heartbeat signal with each other sub-cluster in the super-cluster, said super heartbeat signal providing each sub-cluster in said super-cluster an indication of a state of each other sub-cluster in said super-cluster.

8. The method of claim 7 wherein said super heartbeat signal has a first granularity, and wherein each local heartbeat signal has a corresponding granularity, and wherein said first granularity is distinct from the granularity of each of said local heartbeat signals.

9. The method of claim 7 wherein said super heartbeat signal is obtained by said sub-clusters using a network of collector services.

10. The method of claim 9 wherein said super heartbeat signal is obtained by said sub-clusters using a network of collector services and a network of reducer services.

11. The method of claim 1 wherein the capacity of each node in the group is a metric on an arbitrary scale.

12. The method of claim 1 wherein, when it is determined that said content is servable, further determining whether said content is cacheable or non-cacheable.

13. A system, operable in a content delivery (CD) network comprising multiple CD service endpoints, said CD service endpoints running on a plurality of devices, wherein said multiple CD service endpoints form multiple sub-clusters, wherein two or more of said sub-clusters form a super-cluster, and wherein the content delivery network (CDN) delivers content on behalf of one or more subscribers to the CDN, the system comprising:

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

(b) a service running on said hardware, wherein said service is configured to;

(A) define a group from an arbitrary set of nodes comprising CD service instances across the machines of said multiple sub-clusters, wherein said group comprises a peer group, and wherein the nodes in each sub-cluster share a corresponding internal network address space, and wherein each sub-cluster is addressable by a single external address, and wherein two or more of said sub-clusters form a super-cluster, and wherein each node in the group has a set of capabilities and a corresponding capacity for each capability the node'"'"'s set of capabilities, and wherein each node in the group assumes one or more discrete responsibilities involved in processing of a request across the group, wherein said discrete responsibilities are taken from the list comprising;

non-responsible, cache-responsible, and wherein the defining of the group is according to a peering policy at least based on capabilities and capacities of nodes in the group, wherein said peering policy maps different request types to different responsibility chains, and wherein, for at least one particular responsibility of said discrete responsibilities, multiple nodes in said group are capable of assuming said particular responsibility, and in said group are capable of assuming said particular responsibility, and wherein the capacity of each particular node in the group represents said particular node'"'"'s relative capacity to fulfill said one or more discrete responsibilities compared to other nodes with the same one or more discrete responsibilities;

(B) in response to a request made at a node the group, said request being associated with content of a subscriber to the CDN,

(B)(1) dynamically determine a CD service type of the request, said determining being based on whether said content is rejectable, redirectable, or servable; and

(B)(2) based on the service type of the request, select one or more nodes in said group to be responsible for processing said request; and

(C) automatically repeat the defining of the group in (A) based on a change in capability or capacity of one or more nodes in the group, wherein the group as redefined in (C) is distinct from the group as defined in (A).

14. The system of claim 13 wherein said service is further configured to:

(B)(3) process the request using the selected one or more nodes in the group.

15. The system of claim 13 wherein the capacity of each node in the group is a metric on an arbitrary scale.

16. The system of claim 13, when it is determined that said content is servable, further determining whether said content is cacheable or non-cacheable.

17. An article of manufacture, comprising non-transitory computer-readable media having computer readable instructions stored thereon, the computer readable instructions including instructions for implementing a computer-implemented method, said method operable on a device comprising hardware including memory and at least one processor and running a service on said hardware, said method operable in a content delivery (CD) network comprising multiple CD service endpoints, said CD service endpoints running on a plurality of devices, wherein said multiple CD service endpoints form multiple sub-clusters, wherein two or more of said sub-clusters form a super-cluster, and wherein the content delivery network (CDN) delivers content on behalf of one or more subscribers to the CDN, said method comprising:

(A) defining a group from an arbitrary set of nodes comprising CD service instances across the machines of said multiple sub-clusters, wherein said group comprises a peer group, and wherein the nodes in each sub-cluster share a corresponding internal network address space, and wherein each sub-cluster is addressable by a single external address, and wherein two or more of said sub-clusters form a super-cluster, and wherein each node in the group has a set of capabilities and a corresponding capacity for each capability the node'"'"'s set of capabilities, and wherein each node in the group assumes one or more discrete responsibilities involved in processing of a request across the group, wherein said discrete responsibilities are taken from the list comprising;

non-responsible, cache-responsible, and fill-responsible, and wherein the defining of the group is according to a peering policy at least based on capabilities and capacities of nodes in the group, wherein said peering policy maps different request types to different responsibility chains, and wherein, for at least one particular responsibility of said discrete responsibilities, multiple nodes in said group are capable of assuming said particular responsibility, and wherein the capacity of each particular node in the group represents said particular node'"'"'s relative capacity to fulfill said one or more discrete responsibilities compared to other nodes with the same one or more discrete responsibilities;

relative capacity to fulfill said one or more discrete responsibilities compared to other nodes with the same one or more discrete responsibilities;

(B) in response to a request made at a node the group, said request being associated with content of a subscriber to the CDN,

(B)(1) dynamically determining a service type of the request, said determining being based on whether said content is rejectable, redirectable, or servable; and

(B)(2) based on the service type of the request, selecting one or more nodes in said group to be responsible for processing said request; and

(C) automatically redefining the group in (A) in response to a change in capability or capacity of one or more nodes in the group, wherein the group as defined in (C) is distinct from the group as defined in (A).

18. The article of manufacture of claim 17 wherein the method implemented by the instructions further comprises:

(B)(3) processing the request using the selected one or more nodes in the group.

19. The article of manufacture of claim 17 wherein two or more of said sub-clusters form a super-cluster, and wherein each of the sub-clusters in the super-cluster shares a super heartbeat signal with each other sub-cluster in the super-cluster, said super heartbeat signal providing each sub-cluster in said super-cluster an indication of a state of each other sub-cluster in said super-cluster.

20. The article of manufacture of claim 19 wherein said super heartbeat signal has a first granularity, and wherein each local heartbeat signal has a corresponding granularity, and wherein said first granularity is distinct from the granularity of each of said local heartbeat signals.

21. The article of manufacture of claim 19 wherein, when it is determined that said content is servable, further determining whether said content is cacheable or non-cacheable.