Apparatus, method and system for improving application performance across a communications network by event routing

• US 8,782,131 B2
• Filed: 09/21/2012
• Issued: 07/15/2014
• Est. Priority Date: 03/26/2001
• Status: Expired due to Term

• Current Assignee: Cimpress Schweiz GmbH (Cimpress Plc)
• Original Assignee: Vistaprint Schweiz GmbH (Cimpress Plc)
• Inventors: Savarese, Daniel F., Walsh, Kevin Andrew, Pishevar, Shervin, Bloch, Lewis, Morris, Drew
• Primary Examiner(s): Maung, Zarni
• Application Number:
  US13/624,583
• Publication Number:
  US 20130031250A1
• Time in Patent Office: 662 Days
• Field of Search: 709/203, 709225-229, 709/230, 709/250
• US Class Current: 709/203
• CPC Class Codes: H04L 67/1001 for accessing one among a plurality of replicated servers
• CPC Class Codes: H04L 67/1008 based on parameters of servers, e.g. available memory or workload monitoring of computer activity G06F11/30
• CPC Class Codes: H04L 67/101 based on network conditions
• CPC Class Codes: H04L 67/1029 using data related to the state of servers by a load balancer
• CPC Class Codes: H04L 67/1031 Controlling of the operation of servers by a load balancer, e.g. adding or removing servers that serve requests
• CPC Class Codes: H04L 67/1095 Replication or mirroring of data, e.g. scheduling or transport for data synchronisation between network nodes
• CPC Class Codes: H04L 67/63 Routing a service request depending on the request content or context

Abstract

An apparatus, method and system to enable dynamic replication of Web servers across a wide area in response to access patterns by Web clients as well as in response to customer requests. The method for dynamically replicating one or more parent nodes on a network in response to a user request by a policy manager. The policy manager transmits the user request to an event module. The event module transmits the user request to a data consistency module, wherein the data consistency module maintains integrity of the data on the parent node. The event system communicates with a resource management module to ensure proper utilization of network resources, and transmits the routing request to a request routing module for appropriately balancing the network load. The request routing module is capable of providing optimal routing based on the network resources.

Claims

1. A system for event routing in a network comprising more than one node, comprising:

a server coupled to the computer network and including a processor operative for executing machine-readable instructions;

a memory storing machine-readable instructions; and

an event routing module comprising machine-readable instructions stored in the memory that, when executed by the processor, perform the method of;

assigning a node to a user;

storing user data only on the node assigned to the user;

receiving a request from the user;

parsing the request to obtain values therefrom;

determining whether the node can handle an event corresponding to the request based on the values, and when the node can not handle the event;

identifying a plurality of nodes capable of handling the event based on the values;

determining node usage of the plurality of nodes;

selecting an appropriate node from the plurality of nodes for handling the event, based on the node usage; and

copying applications and the user data from the node assigned to the user to the appropriate node, after which the appropriate node handles the request.

2. The system of claim 1, wherein the plurality of nodes capable of handling the event are identified by comparing a module type value in the request to a node lookup table located on the network.

3. The system of claim 2, wherein the node usage is determined by ranking the plurality of nodes in accordance with usage statistics in a resource usage list.

4. The system of claim 3, wherein the appropriate node for performing the event thereon is selected based on a least-used node algorithm.

5. The system of claim 3, wherein the appropriate node for performing the event thereon is selected based on an algorithm for determining a least-used node for an anticipated time of use.

6. The system of claim 3, wherein the appropriate node for performing the event thereon is selected based on an algorithm for determining a node most capable of performing the event.

7. The system of claim 6, wherein the request is parsed to obtain values of a plurality of fields for making comparison to data stored in the node lookup table and the resource usage list.

8. A computer-readable storage device having computer-executable instructions, the computer-executable instructions, when executed on a computer processor coupled to a network comprising more than one node, perform steps for event routing in the network, comprising:

assigning a node to a user;

storing user data only on the node assigned to the user;

receiving a request from the user;

parsing the request to obtain values therefrom;

determining whether the node can handle an event corresponding to the request based on the values, and when the node can not handle the event;

identifying a plurality of nodes capable of handling the event based on the values;

determining node usage of the plurality of nodes;

selecting an appropriate node from the plurality of nodes for handling the event, based on the node usage; and

copying applications and the user data from the node assigned to the user to the appropriate node, after which the appropriate node handles the request.

9. The computer-readable storage device of claim 8, wherein the plurality of nodes capable of handling the event are identified by comparing a module type value in the request to a node lookup table located on the network.

10. The computer-readable storage device of claim 9, wherein the node usage is determined by ranking the plurality of nodes in accordance with usage statistics in a resource usage list.

11. The computer-readable storage device of claim 10, wherein the appropriate node for performing the event thereon is selected based on a least-used node algorithm.

12. The computer-readable storage device of claim 10, wherein the appropriate node for performing the event thereon is selected based on an algorithm for determining a least-used node for an anticipated time of use.

13. The computer-readable storage device of claim 10, wherein the appropriate node for performing the event thereon is selected based on an algorithm for determining a node most capable of performing the event.

14. The computer-readable storage device of claim 13, wherein the request is parsed to obtain values of a plurality of fields for making comparison to data stored in the node lookup table and the resource usage list.