PROCESSING INCOMING TRANSACTIONS BASED ON RESOURCE UTILIZATION STATUS OF BACKEND SYSTEMS IN AN APPLIANCE CLUSTER

• US 20180084033A1
• Filed: 11/30/2017
• Published: 03/22/2018
• Est. Priority Date: 09/30/2013
• Status: Active Grant

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: CHANG, CHUN-FEI, LIU, JEFFREY CH, TSENG, JOEY HY, SHIH, HAO-TING
• Granted Patent: US 10,320,889 B2
• Time in Patent Office: Days
• CPC Class Codes: G06F 11/00 Error detection; Error correction; Monitoring error detection, correction or monitoring in information storage based on relative movement between record carrier and transducer G11B20/18; monitoring, i.e. supervising the progress of recording or reproducing G11B27/36; in static stores G11C29/00
• CPC Class Codes: G06F 11/3433 for load management allocation of a server based on load conditions G06F9/505; load rebalancing G06F9/5083; redistributing the load in a network by a load balancer H04L67/1029
• CPC Class Codes: G06F 2201/81 Threshold
• CPC Class Codes: G06F 2201/87 Monitoring of transactions
• CPC Class Codes: G06F 2201/88 Monitoring involving counting
• CPC Class Codes: G06F 9/00 Arrangements for program control, e.g. control units program control for peripheral devices G06F13/10
• CPC Class Codes: G06F 9/466 Transaction processing
• CPC Class Codes: G06F 9/50 Allocation of resources, e.g. of the central processing unit [CPU]
• CPC Class Codes: G06F 9/505 considering the load
• CPC Class Codes: H04L 12/4641 Virtual LANs, VLANs, e.g. virtual private networks [VPN] LAN interconnection over a bridge based backbone H04L12/462; encapsulation techniques H04L12/4633; routing of packets H04L45/00; packet switches H04L49/00; virtual private networks for security H04L63/0272
• CPC Class Codes: H04L 63/0209 Architectural arrangements, e.g. perimeter networks or demilitarized zones
• 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

Abstract

A first reverse proxy appliance of the plurality of reverse proxy appliances receives an incoming transaction. A machine logic determines that the incoming transaction cannot be directly processed by the first reverse proxy appliance based, at least in part, upon the current threshold level of the first reverse proxy appliance and the current transaction count of the first reverse proxy appliance. Responsive to the determination that the incoming transaction cannot be directly processed by the first reverse proxy appliance, a second reverse proxy appliance of the plurality of reverse proxy appliances and a third reverse proxy appliance of the plurality of reverse proxy appliances negotiate in order to determine that the third reverse proxy appliance will process the incoming transaction. Responsive to the negotiating, the incoming transaction is sent to the third reverse proxy appliance.

Claims

1. A method for use with a distributed computer system including a plurality of reverse proxy appliances that share a common backend sub-system, with each given reverse proxy appliance of the plurality of reverse proxy appliances being:

(i) configured to perform service level monitoring (SLM) to prevent the common backend system from being overwhelmed by unanticipated burst messages, (ii) characterized by a current threshold level which is a sum of a quantity of transactions that can be directly processed by the given reverse proxy appliance and a quantity of transactions that can be processed by other reverse proxy appliance(s) on behalf of the given reverse proxy appliance, and (iii) further characterized by a current transaction count, the method comprising;

receiving, by a first reverse proxy appliance of the plurality of reverse proxy appliances, an incoming transaction;

determining, by machine logic, that the incoming transaction cannot be directly processed by the first reverse proxy appliance based, at least in part, upon the current threshold level of the first reverse proxy appliance and the current transaction count of the first reverse proxy appliance;

responsive to the determination that the incoming transaction cannot be directly processed by the first reverse proxy appliance, negotiating, by a second reverse proxy appliance of the plurality of reverse proxy appliances as a negotiation device and a third reverse proxy appliance of the plurality of reverse proxy appliances, to determine that the third reverse proxy appliance will process the incoming transaction; and

responsive to the negotiating, sending the incoming transaction to the third reverse proxy appliance.

2. The method of claim 1 further comprising:

determining, by machine logic, that the third reverse proxy appliance has a largest current threshold level of the reverse proxy appliances of the plurality of reverse proxy appliances; and

responsive to the determining that the third reverse proxy appliance has the largest current threshold level of the reverse proxy appliances of the plurality of reverse proxy appliances, selecting the third reverse proxy appliance for negotiation with the second reverse proxy appliance.

3. A method for use with a distributed computer system including a plurality of application level firewalls (ALFs) that share a common backend sub-system, with each given ALF of the plurality of reverse proxy appliances being:

(i) characterized by a current threshold level which is a sum of a quantity of transactions that can be directly processed by the given reverse proxy appliance and a quantity of transactions that can be processed by other reverse proxy appliance(s) on behalf of the given reverse proxy appliance, and (ii) further characterized by a current transaction count, the method comprising;

receiving, by a first ALF of the plurality of ALFs, an incoming transaction;

determining, by machine logic, that the incoming transaction cannot be directly processed by the first ALF based, at least in part, upon the current threshold level of the first ALF and the current transaction count of the first ALF;

responsive to the determination that the incoming transaction cannot be directly processed by the first ALF, negotiating, by a second ALF of the plurality of ALFs as a negotiation device and a third ALF of the plurality of ALFs, to determine that the third ALF will process the incoming transaction; and

sending responsive to the negotiation, sending the incoming transaction to the third ALF.

4. The method of claim 3 further comprising:

determining, by machine logic, that the third ALF has a largest current threshold level of the ALFs of the plurality of ALFs; and

responsive to the determination that the third ALF has the largest current threshold level of the ALFs of the plurality of ALFs, selecting the third ALF for negotiation with the second. ALF.

5. A method for use with a distributed computer system including a plurality of reverse proxy appliances (RPAs), with each given RPA of the plurality of RPAs being:

(i) configured to perform service level monitoring (SLM) to prevent a common backend sub-system from being overwhelmed by unanticipated burst messages, (ii) characterized by a current threshold level which is a sum of a quantity of transactions that can be directly processed by the given reverse proxy appliance and a quantity of transactions that can be processed by other reverse proxy appliance(s) on behalf of the given reverse proxy appliance, and (iii) further characterized by a current transaction count, the method comprising;

receiving global current threshold level data including information indicative of current threshold levels for each RPA of the plurality of RPAs;

receiving backend load data including information indicative of backend load(s) on a set of backend sub-system(s) served by the plurality of RPAs; and

adjusting the current threshold level of a first RPA of the plurality of RPAs based, at least in part, upon both of the following;

(i) the global current threshold level data, and (ii) the backend load data.