DYNAMIC PROTECTION OF A RESOURCE DURING SUDDEN SURGES IN TRAFFIC

• US 20110282980A1
• Filed: 05/11/2010
• Published: 11/17/2011
• Est. Priority Date: 05/11/2010
• Status: Abandoned Application

• Current Assignee: Business Objects Incorporated (SAP SE)
• Original Assignee: Business Objects Incorporated (SAP SE)
• Inventors: KUMAR, UDAYA, Gargoum, Louay
• Application Number:
  US12/777,619
• Publication Number:
  US 20110282980A1
• Time in Patent Office: Days
• US Class Current: 709/223
• CPC Class Codes: G06F 9/505 considering the load
• CPC Class Codes: H04L 47/122 by diverting traffic away from congested entities
• CPC Class Codes: H04L 67/1001 for accessing one among a plurality of replicated servers
• CPC Class Codes: H04L 69/40 for recovering from a failure of a protocol instance or entity, e.g. service redundancy protocols, protocol state redundancy or protocol service redirection management of faults, events, alarms or notifications in data switching networks H04L41/06

Abstract

Various embodiments of systems and methods for dynamically protecting a server during sudden surges in traffic are described herein. A gatekeeper is triggered by an incoming system request. Based upon queue size associated with the server and expiration of the elements of the queue, the gatekeeper determines whether to forward the incoming system request to the server. The queue size comprises a maximum allowable load within a time window. The expired elements in the queue are removed by comparing the difference of current time and time-stamped time, with time window. If the queue is not full or even if the queue is full but one of the elements in the queue is expired, the incoming system request may be forwarded to the server. If the queue is full and there are no expired elements in the queue, the incoming system request may be dropped.

Claims

1. An article of manufacture including a tangible computer readable storage medium to store instructions, which when executed by a computer, cause the computer to:

receive an incoming system request for accessing an application in a server by a gatekeeper;

determine whether a queue in the gatekeeper is full;

if the queue is full, determine whether one or more elements in the queue are expired;

if the one or more elements in the queue are expired, remove the expired one or more elements from the queue; and

forward the incoming system request to the server upon stacking an element corresponding to the incoming system request in the queue.

2. The article of claim 1, further comprising:

if the queue is not full, forward the incoming system request to the server upon stacking the element corresponding to the incoming system request in the queue.

3. The article of claim 1, further comprising:

if none of the one or more elements in the queue are expired, drop the incoming system request.

4. A computerized method for dynamically protecting a server during sudden surges in traffic, the method comprising:

receiving an incoming system request for accessing an application in the server by a gatekeeper;

determining whether a queue in the gatekeeper is full;

if the queue is full, determining whether one or more elements in the queue are expired;

if the one or more elements in the queue are expired, removing the expired one or more elements in the queue; and

forwarding the incoming system request to the server upon stacking an element corresponding to the incoming system request in the queue.

5. The method of claim 4, further comprising:

if the queue is not full, forwarding the incoming system request to the server upon stacking the element corresponding to the incoming system request in the queue.

6. The method of claim 4, further comprising:

if one or more elements in the queue are not expired, dropping the incoming system request.

7. The method of claim 4, wherein the element in the queue comprises a time-stamp indicating an absolute time at which the incoming system request is forwarded to the server.

8. The method of claim 4, wherein a queue size comprises a maximum allowable load that the server is designated to handle within a time window.

9. The method of claim 8, wherein determining whether one or more elements in the queue are expired comprises:

selecting a first element in the queue based on first-in-first-out (FIFO) approach; and

determining whether the first element in the queue is expired by comparing a difference of current time and time-stamped time associated with first element, with the time window.

10. The method of claim 8, wherein determining whether one or more elements in the queue are expired comprises:

selecting a plurality of elements in the queue based on first-in-first-out (FIFO) approach; and

determining whether the plurality of elements in the queue are expired by comparing a difference of current time and time-stamped time associated with the plurality of elements, with the time window.

11. The method of claim 4, wherein determining whether the one or more elements in the queue are expired and removing the one or more expired elements from the queue are performed in parallel with determining whether the queue is full.

12. A computer system for dynamically protecting a server during sudden surges in traffic, comprising:

a memory to store program code;

a processor to execute the program code; and

a gatekeeper residing in the memory;

wherein the gatekeeper is configured to receive an incoming system request for accessing an application in the server, and wherein the gatekeeper comprises;

a queue processor configured to;

determine whether a queue is full;

determine whether one or more elements in the queue are expired, if the queue is full; and

remove the one or more expired elements in the queue, if the one or more elements in the queue are expired;

a time-stamp recorder to record a time-stamp of the incoming system request; and

a request forwarder to forward the incoming system request to the server upon stacking an element corresponding to the incoming system request on the queue.

13. The system of claim 12, wherein the request forwarder forwards the incoming system request to the server upon stacking the element corresponding to the incoming system request in the queue, if the queue is not full.

14. The system of claim 12, wherein the gatekeeper drops the incoming system request, if the one or more elements in the queue are not expired.

15. The system of claim 12, wherein the element in the queue comprises the time-stamp indicating an absolute time at which the incoming system request is forwarded to the server.

16. The system of claim 12, wherein a queue size comprises a maximum allowable load that the server is designated to handle within a time window.

17. The system of claim 16, wherein the queue processor selects a first element in the queue based on first-in-first-out (FIFO) approach, and determines whether the first element in the queue is expired by comparing a difference of current time and time-stamped time associated with the first element, with the time window.

18. The system of claim 16, wherein the queue processor selects a plurality of elements in the queue based on first-in-first-out (FIFO) approach, and determines whether the plurality of elements in the queue are expired by comparing a difference of current time and time-stamped time associated with the plurality of elements, with the time window.

19. The system of claim 12, wherein the queue processor determines whether one or more elements in the queue are expired in parallel with determining whether the queue is full.