US20040185867A1

US20040185867A1 - Method for protecting against overload of a packet switching network node of a communication network

Info

Publication number: US20040185867A1
Application number: US10/477,849
Authority: US
Inventors: Alexander Wassew; Maik Bollmann
Original assignee: Individual
Current assignee: Telefonaktiebolaget LM Ericsson AB
Priority date: 2001-05-14
Filing date: 2002-05-14
Publication date: 2004-09-23
Also published as: WO2003003753A3; WO2002093958A1; EP1388265A2; US20040208126A1; JP2004531964A; EP1388266B1; EP1388265B1; EP1388266A1; JP4472985B2; AU2002325213A1; US7324543B2; JP2004534460A; WO2003003753A2

Abstract

Method for protecting against overload of a packet switching network node of a communication network, said packet switching network node being provided with resources for processing of requests and with an overload protection task (OPT) for protection of said resources from overload, said resources comprising at least one input queue (Q1, . . . , Q4) for requests to be processed, a processor (CPU) for request processing and a memory (M) for storing data related to request processing, said resources for processing being limited, wherein said network node, in particular said overload protection task (OPT), performs the steps of: monitoring a load status of said resources, detecting, by means of the load status, any overload situation arising at the monitored resources, and determining, in the case of a detected overload situation, dependent on predetermined rules, an overload dissolving measure.

Description

The invention addresses the field of mobile telecommunications. The invention relates to a method for protecting against overload of a packet switching network node of a communication network. Furthermore, the invention relates to a network node element of a communication network and to a communication network. Finally, the invention relates to a computer program for a network node element of a communication network.

The above stated method, network node element, communication network and computer program are known from a communication network conforming to the Packet Personal Digital Cellular (PPDC) standard (sometimes called Packet Pacific Digital Cellular standard), also called RCR STD 27 standard, current release version I. A system according to the PPDC standard is usually an extension of a mobile telephone system for circuit switched communication. The additional service enables end-users to access specific internet-like content offered on an application server of a content provider using a packet data mobile station as a connecting device. Data transfer from the application server to the mobile station can be based on the internet protocol.

A known Packet Personal Digital Cellular system comprises at least one packet switching network node called packet mobile services switching center (PMSC). The packet mobile services switching center handles a packet data switching functionality between the application server and the mobile station. The packet mobile services switching center assigns an internet protocol address to the mobile station requesting a registration for an end-to-end packet data session to the application server and routes and forwards incoming and outgoing internet protocol packets addressed to/from the registered mobile station. Functions provided by the packet mobile services switching center include registration and deregistration of the mobile station, authentication of mobile users, control of channel reselection procedures, and update of routing information.

The node comprises CPU boards (PowerPC based interface board), to run a real time operating system, i.e. without virtual memory, and telecommunication related software. The CPU boards handle signaling functionality and user traffic, i.e., routing of payload. Users file requests for processing to the node in input queues.

The packet mobile services switching center is exposed to at least two types of load: control signaling such as registrations/deregistrations and user data packets (internet protocol packets). The capacity of the node to process the requests is limited by the given hardware such as CPU, memory and the size of the input queues where all received requests are filed. Each load type files its requests in separate input queues. Both or any single load type can cause overload of the node. Overload can occur in case the node's load exceeds the node's limited resources' capacity to handle load during a given time period such that the node fails to function. In particular, overload can have two different adverse effects: crash of the node due to lack of memory, or congested queues where time critical requests cannot be fulfilled.

The packet mobile services switching center must be protected against dynamic overload to guarantee in-service performance to the users. Dynamic overload is generated by too many requests to the system on a per time base, i.e., the number of requests cannot be handled during a provided time period. This may result in a decreased service to the customer or a loss of service at all.

A wide-spread method to protect telecommunication systems against dynamic overload is to control the traffic rate by attenuating bursts of input requests. A common solution is the so-called gaping method. The gaping method restricts the amount of traffic so that the system has to cope with at most a defined number of requests per time. A gaping gate stores the departure time of the last accepted request (see e.g. U.S. Pat. No. 4,224,479) or a time gap calculated from several, previously accepted requests (see e.g. WO publication 96/19070). If the next request arrives in a time smaller than the stored time gap it is rejected, otherwise it is served. If the request is accepted the time gap has to be updated.

There are several problems with the existing technology. One point is the limitation of the incoming request flow to a fixed value. This value has to be safe, i.e., it has to be adapted to the worst case. Such a worst case may be reached when the system has not only to handle the user traffic but also has to handle some operation and/or maintenance tasks. The prior art procedure slows down the traffic flow irrespective of a possible availability of resources that the worst case scenario considers used for operation and/or maintenance tasks.

Another problem is a concentration of the overload protection to one gate. Thus it is difficult to distinguish different overload situations that ought to be handled in different ways.

Furthermore, as, at the gaping gate, each input request is handled separately, a high overhead in terms of additional CPU load is produced.

Moreover, new values for the parameters must be determined each time the hardware is changed. For example, a faster CPU may allow a shorter time gap between incoming requests. However, this new time gap must first be calculated. Thus, the maintainability is cumbersome and (CPU-)time consuming.

The problem underlying the present invention is to provide a dynamic overload protection for the packet switched network node that allows to use the network node's resources with better efficiency.

According to a first aspect of the invention, a method for protecting against overload of a packet switching network node of a communication network is provided, the packet switching network node being provided with resources for processing of requests and with an overload protection task for protection of the resources from overload, the resources comprising at least one input queue for requests to be processed, a processor for request processing and a memory for storing data related to request processing, the resources for processing being limited, wherein said network node, in particular said overload protection task, performs the steps of:

monitoring a load status of said resources,

detecting, by means of the load status, any overload situation arising at the monitored resources, and

determining, in the case of a detected overload situation, dependent on predetermined rules, an overload dissolving measure.

The processor is, e.g., provided as a central processing unit. The memory is, e.g., provided as a random access memory unit. Data related to request processing may be data that need to be stored temporarily during processing. “Load” is defined in relation to node resources. Load is constituted by anything, for example a registration request or a deregistration request, whose handling on input to the node involves one or more node resources. For example, control signaling may require processing of a control signal; this processing is conducted by the central processing unit of the node. Thus, a node resource is used. For another example, processing of user data requests may require temporary storage; this storage is conducted in the memory unit of the node. Thereby, another node resource is used. The input queue is filled with processing requests and thus comprises load that is due for handling by the node. The input queue may be provided, for example, as a list comprising entries of control signaling requests and/or user data requests that await processing and/or storing. Monitoring the load status of the resources comprises monitoring the fill level of the input queue. For a given network node cormprising a given hardware, the network node's capacity to process said control signaling requests and/or user data requests is limited.

The invention is advantageous, because using the inventive method, the packet switching network node remains stable and reliable though it may run at its limits. Thus the node keeps a determined quality of service (QoS). The overload protection is triggered if a lack of system resources occurs. By adapting to the resource situation during runtime, the inventive overload protection enables an optimum use of system resources. As availability of the resources may change not only due to incoming requests but also due to other activities such as intermediate storage of charging data or operation and maintenance. By monitoring of all critical resources, it is possible to select appropriate actions in order to avert an imminent overload situation.

According to a preferred embodiment of the invention, the overload protection task is run cyclically. It has a very high priority such that it is prioritized over at least most other tasks. In every cycle, the overload protection task monitors the load status of the node resources and thus checks whether an overload situation occurs. The overload protection task detects the occurance of a critical load situation if, regarding the load status of the monitored node resource, a defined rule is violated. Preferably, the rule is defined prior to running the overload protection task, e.g., already at system start up. In one embodiment, the overload protection task is helped by at least one supervision task that enjoys a high priority. The supervision task may be provided as a subroutine comprised within the overload protection task. In one embodiment, overload task and supervision task enjoy equally high priority. In one embodiment, the overload task and/or the supervision task are provided as overload RTOS-tasks, where RTOS stands for Real Time Operating System.

In one embodiment, the resources comprise at least a second input queue for requests to be processed, the first input queue being dedicated to receiving control signaling requests such as registration/deregistration requests and the second input queue being dedicated to receiving user data requests, the user data requests being provided as user data packets, in particular user data internet protocol packets. This embodiment allows to separately monitor the load status with respect to incoming control signaling requests and with respect to incoming user data requests.

In one embodiment, the step of detecting an overload situation comprises detecting whether memory consumption exceeds a predetermined first threshold (hereafter also referred to as rule RA). Thus, an overload dissolving measure can be determined in case of memory shortage. In one embodiment, the step of detecting an overload situation comprises detecting whether memory consumption exceeds a predetermined second threshold (hereafter also referred to as rule RB), the second threshold being superior to the first threshold. This embodiment enables to determine a second overload dissolving measure that, e.g., may be more effective than the first overload dissolving measure, in case of the memory shortage having grown worse.

In one embodiment, the step of detecting an overload situation comprises detecting whether the processor load exceeds a predetermined processor load limit (hereafter also referred to as rule RC). This embodiment allows to determine an overload dissolving measure that is specifically adapted to deal with processor overload. In one embodiment, the overload situation is detected if the processor load exceeds a certain limit for a certain interval of time, measured, e.g., by counting ticks of a processor clock for several ticks.

In one embodiment, the step of detecting an overload situation comprises detecting whether the fill level of the input queue exceeds a predetermined fill level. Preferably, the step of detecting an overload situation comprises detecting whether the fill level of control signaling requests in the first input queue exceeds a predetermined control signaling request fill level (hereafter also referred to as rule RD). This embodiment allows to determine an overload dissolving measure that is specifically adapted to deal with overload due to control signaling requests. Particularly preferably, the step of detecting the overload situation comprises detecting whether the fill level of user data requests in the second input queue exceeds a predetermined user data request fill level (hereafter also referred to as rule RE). This embodiment allows to determine an overload dissolving measure that is specifically adapted to deal with overload due to user data requests. Thus, depending on the cause of the detected overload situation (control signaling requests or user data requests), a suitable measure to dissolve the detected overload can be determined.

In one embodiment, if the memory consumption exceeds the predetermined first threshold (Rule RA), the determined overload dissolving measure comprises rejecting a predetermined ratio of control signaling requests received in the first input queue (hereafter also referred to as measure MA) and dropping the user data requests, i.e., the internet protocol packets from the second input queue (hereafter also referred to as measure MC). Thereby, the number of new registration requests that are processed is restricted in accordance with the predetermined ratio of user requests. For example, measure MA may be defined to drop twenty per cent of the new requests received in the first input queue; thus, when executed, on average, every fifth new request is dropped, i.e., only four out of five requests are queued for processing, and thus the overload is dissolved.

In one embodiment, if the memory consumption exceeds the predetermined second threshold (RB), the determined overload dissolving measure comprises rejecting all control signaling requests received in said first input queue (hereafter referred to as measure MB) and dropping all user data requests, i.e., all internet protocol packets from the second input queue (hereafter referred to as measure MD). Thus, one hundred per cent of the new requests are dropped. In one embodiment, the input queue is flushed, i.e., all queued request are removed from the queue. Preferably, at least the second input queue is flushed such that all queued user data requests are removed from this queue. Flushing the second input queue results in a particularly effective relief from overload.

In one embodiment, if the processor load exceeds the predetermined processor load limit (RC), the determined overload dissolving measure comprises rejecting the predetermined ratio of control signaling requests received in the first input queue (MA) and dropping the user data requests, i.e., the internet protocol packets from the second input queue (MC). In one embodiment, the measures MA and MC are determined only if the processor load exceeds the predetermined processor load limit for a certain interval of time, measured, e.g., by counting ticks of the processor clock for several ticks.

In one embodiment, if the fill level of control signaling requests in the first input queue exceeds the predetermined control signaling request fill level (rule RD), the determined overload dissolving measure comprises rejecting a predetermined ratio of control signaling requests received in the first input queue (measure MA).

In one embodiment, if the fill level of user data requests in the second input queue exceeds the predetermined user data request fill level (rule RE), said determined overload dissolving measure comprises dropping of user data requests, i.e., internet protocol packets from said second input queue (measure MC). Preferably, the determined measure requires the second input queue to be flushed.

Preferably, the inventive overload protection method comprises the step of dissolving the detected overload situation by execution of the determined at least one overload dissolving measure. In one embodiment, execution of the determined overload dissolving measure is suspended if the determined overload situation is dissolved.

According to a second aspect of the invention, a network node element of a communication network is provided, the network node element being provided with resources for processing of requests and with an overload protection task for protection of the resources from overload, the resources comprising at least one input queue for requests to be processed, a processor for request processing and a memory for storing data related to request processing, wherein the network node's capacity for processing is limited. Preferably, the network node element is adapted to perform the inventive method for protecting against overload of a packet switching network node (PMSC). Thus, particularly the packet switching network node that the network node element belongs to can be protected. However, the network node element may also be provided for a mobile switching center (MSC) in general, a base station (BS), a base station controller (BSC), a radio network controller (RNC), a serving GPRS (General Packet Radio Service) support node (SGSN) etc. In one embodiment, the network node element comprises a request handling means for controlling the input queue.

According to a third aspect of the invention, a communication network is provided that comprises at least one inventive network node element. The communication network can be more stable and reliable than known communication networks since the packet switching network node comprising the inventive network node element remains stable and reliable though it may run at its limits. Thus the node keeps a determined quality of service (QoS) and the overall quality of service of the network is optimized. Preferably, all network node elements of the communication network are provided according to the invention such that the overall quality of service of the network is maximized. For example, the mobile communication network is provided as a Personal Digital Cellular (PDC) network or as a Packet Personal Digital Cellular (Packet PDC) network. In one embodiment, the communication network is provided such that it comprises at least one network node that is equipped with the inventive network node element.

According to a fourth aspect of the invention, a computer program is provided that is loadable into an internal memory of a digital processing unit and comprises software code portions adapted to control the steps according to the inventive method for protecting against overload of a packet switching network node, when the computer program is executed on the digital processing unit. Preferably, the computer program is stored on a machine-readable medium, in particular a computer-readable medium such as a compact disc read only memory (CD ROM), a floppy disc, an optical disc, or a hard disc. Thus a good physical portability of the control software is provided and upgrades can be performed in an easy way. The computer program is comprised in a machine-readable medium, in particular, in a computer readable medium.

The invention can be used preferably in all communication systems as defined by the Third Generation Partnership Project (3GPP) in the release of 1999 as well as in all future release thereof. In particular, this includes Personal Digital Cellular (PDC) and Packet Personal Digital Cellular (PPDC) as well as Universal Mobile Telecommunications System (UMTS) networks, core networks, Global Standard for Mobiles (GSM) networks, and the corresponding user equipment.

These and other aspects of the invention will be more fully understood by referring to the following detailed description and the accompanying drawings. [0034]
FIG. 1 is a schematic diagram illustrating one embodiment of the invention in which an overload protection task monitors a load status of several resources of a packet switching network node. [0035]
FIG. 2 is a table comprising rules for detecting overload and measures determined in response to each detected rule.[0036]
FIG. 1 schematically shows resources of a packet switching network node according to the invention and outlines the principle of the inventive overload protection. The packet switching network node (not shown) comprises at least the following resources: a central processing unit CPU, a memory unit M and four input queues Q[0037] 1, . . . , Q4 which collect incoming requests R. The node further comprises a request handler RH that deals with incoming requests R and distributes these requests R to the input queues Q1, . . . , Q4 as indicated in FIG. 1 by arrows 14, 12, 10 and 8, respectively. Different queues are for different incoming requests R. Queue Q1 receives control signalling requests R(CS) such as registration and deregistration requests. Queues Q2, Q3 and Q4 receive user data requests R(IP). The user data requests are provided as internet protocol packets IP.
Supervision tasks S(Q), S (CPU) and S(M) monitor the load status of the node resources, i.e., input queues Q[0038] 1, . . . , Q4, control processing unit CPU, and memory unit M, respectively.

A central overload protection task OPT is run cyclically on the central processing unit CPU. The central overload protection task OPT comprises the supervision task S(Q) to monitor the fill levels of the input queues Q 1, Q2, Q3 and Q4. This monitoring is indicated in FIG. 1 by

arrows

16, 20, 24 and 28, respectively. Furthermore, the supervision tasks S(CPU) and S(M) are run cyclically in the central processing unit CPU in order to monitor the load of the central processing unit CPU and the memory unit M and to detect an overload situation. Detection of the overload situation is accomplished in accordance with a set of predetermined rules RA, . . . , RE. The rules are defined as follows:



Reference	Rule

RA	Memory M is short, i.e., consumption of memory M exceeds
	a predetermined first threshold
RB	Memory M is very short, i.e., consumption of memory M
	exceeds a predetermined second threshold superior to the
	first threshold
RC	The processor CPU load exceeds the predetermined processor
	load limit for several ticks
RD	The fill level of control signaling requests R(CS) such as
	registration/ deregistration requests in the input queue Q1
	exceeds a predetermined control signaling request fill
	level of N1 requests
RE	The fill level of user data requests provided as user data
	packets in the input queues Q2, Q3, Q4 exceeds a
	predetermined user data request fill level of
	N2 = N3 = N4 requests

If any of the supervision tasks S(Q), S(CPU), S(M) detects an overload situation in one of the node resources Q 1, . . . , Q4, CPU, M, the detecting supervision task S(Q), S(CPU), and/or S(M) triggers the overload protection. The overload protection task possesses a set of measures MA, . . . , MD to react against overload. Overload protection is achieved by determining measures MA, MB, MC and/or MD for dissolving the overload situation and by enforcing the determined measure. The measures MA, MB, MC, MD are defined as follows:



Reference	Measure

MA	Reject a predetermined ratio of 20% of control signaling
	requests R(CS) received for input queue Q1
MB	Reject all control signaling requests R(CS) received for input
	queue Q1
MC	Drop user data requests R(IP), i.e., internet protocol packets
	received in input queues Q2, Q3, Q4
MD	Flush all user data requests R(IP), i.e., internet protocol
	packets from input queues Q2, Q3, Q4

Preferably, measures MA, MB, and MC are executed by the request handler RH, while measure MD is executed by the overload protection task itself. [0041]
FIG. 2 shows references to rules RA, . . . , RE for detecting an overload situation and measures MA, . . . , MD determined in correspondence to the rule that gave rise to the detection of the overload situation. The overload protection task selects a certain measure MA, MC (or a combination of two measures MA and MC, MB and MD) depending on the rule RA, . . . , RE that was violated. [0042]
In case the supervision task S(M) monitoring memory M detects memory shortage according to rule RA, i.e., memory consumption to exceed the first predetermined limit, a corresponding information [0043] 4 is provided to the overload protection task OPT. The overload protection task OPT reacts to this information 4 by sending a trigger 6 to the request handler RH to take measures MA and MC, i.e., to reject a predetermined ratio of control signaling requests R(CS) received in the input queue Q1 (in the present example the ratio is 20 %, however, any ratio from 0 to 1 can be predetermined), and to drop new user data requests R(IP), i.e. intemet protocol packets from the input queues Q2, Q3, Q4. Request handler RH dissolves the overload situation by executing the determined measures MA and MC.
If the supervision task S(M) monitoring memory M detects memory shortage according to rule RB, i.e., the memory consumption exceeding the second predetermined limit, the corresponding information [0044] 4′ is provided to the overload protection task OPT. The overload protection task OPT reacts to this information 4′ by sending a corresponding trigger 6′ to the request handler RH to take measure MB. i.e., to reject all control signaling requests R(CS) received in the input queue Q1. The request handler RH dissolves the overload protection by executing the determined measure MB. Moreover, the overload protection task flushes input queues Q2, Q3, Q4 from all user data requests R(IP), i.e. from all internet protocol packets, as indicated in FIG. 1 by arrows 22, 26, 30. Thus, the overload protection task itself dissolves the overload situation by executing the determined measure MD.
In case the supervision task S(CPU) monitoring the central processing unit CPU detects that the CPU load exceeds the predetermined processor load limit for several ticks according to rule RC, a corresponding information [0045] 2 is provided to the overload protection task OPT. The overload protection task OPT reacts to this information 4 by sending a trigger 6 to the request handler RH to take measures MA and MC, i.e., to reject a predetermined ratio of control signaling requests R(CS) received in the input queue Q1 (in the present example the ratio is 20%, however, any ratio between 0 and 1 can be predetermined), and to drop new user data requests R(IP), i.e. internet protocol packets from the input queues Q2, Q3, Q4. Request handler RH dissolves the overload situation by executing the determined measures MA and MC.
If the supervision task S(Q), comprised in the overload protection task and monitoring the input queues Q[0046] 1, . . . , Q4, detects that the fill level of control signaling requests R(CS) such as registration/deregistration requests in the input queue Q1 exceeds the predetermined control signaling request fill level of Ni requests according to rule RD, the overload protection task OPT reacts to this information by sending a trigger 6″ to the request handler RH to take measure MA, i.e., to reject a predetermined ratio of control signaling requests R(CS) received in the input queue Q1 (in the present example the ratio is 20%, however, any ratio from 0 to 1 can be predetermined). The request handler RH dissolves the overload situation by executing the determined measure MA.
If the supervision task S(Q), comprised in the overload protection task and monitoring the input queues Q[0047] 1, . . . , Q4, detects that the fill level of user data requests R(IP), i.e., internet packet data in any of input queues Q2, Q3, and/or Q3 to exceed the predetermined control signaling request fill level of N2=N3=N4 requests according to rule RE, the overload protection task OPT reacts to this information by sending a trigger 6″ to the request handler RH to take measure MC, i.e., to drop new user data requests R(IP), i.e. internet protocol packets from the input queues Q2, Q3, Q4. The request handler RH dissolves the overload situation by executing the determined measure MC.

Claims

1. Method for protecting against overload of a packet switching network node of a communication network, said packet switching network node being provided with resources for processing of requests and with an overload protection task (OPT) for protection of said resources from overload, said resources comprising at least one input queue (Q1, . . . , Q4) for requests to be processed, a processor (CPU) for request processing and a memory (M) for storing data related to request processing, said resources for processing being limited,

wherein said network node, in particular said overload protection task (OPT), performs the steps of:

monitoring a load status of said resources,

2. Method according to the preceding claim,

wherein said resources comprise at least a second input queue (Q2, Q3, Q4) for requests to be processed, the first input queue (Q1) being dedicated to receiving control signaling requests (R(CS)) and the second input queue (Q2, Q3, Q4) being dedicated to receiving user data requests (R(IP)), said user data requests (R(IP)) being provided as user data packets.

3. Method according to claims 1 or 2,

wherein the step of detecting an overload situation comprises detecting whether memory consumption exceeds a predetermined first threshold.

4. Method according to claim 3,

wherein the step of detecting an overload situation comprises detecting whether memory consumption exceeds a predetermined second threshold, the second threshold being superior to the first threshold.

5. Method according to any of the preceding claims,

wherein the step of detecting an overload situation comprises detecting whether the processor load exceeds a predetermined processor load limit.

6. Method according to any of the preceding claims,

wherein the step of detecting an overload situation comprises detecting whether the fill level of the input queue (Q1, . . . , Q4) exceeds a predetermined fill level.

7. Method according to any of claims 2 to 6,

wherein the step of detecting an overload situation comprises detecting whether the fill level of control signaling requests (R(CS)) in the first input queue (Q1) exceeds a predetermined control signaling request fill level.

8. Method according to any of claims 2 to 7,

wherein the step of detecting an overload situation comprises detecting whether the fill level of user data requests (R(IP)) in the second input queue (Q2, Q3, Q4) exceeds a predetermined user data request fill level.

9. Method according to any of claims 3 to 8,

wherein, if memory consumption exceeds the predetermined first threshold, said determined overload dissolving measure comprises the steps of:

rejecting a predetermined ratio of control signaling requests (R(CS)) received in said first input queue (Q1), and

dropping said user data packets from said second input queue (Q2, Q3, Q4).

10. Method according to any of claims 3 to 9,

wherein, if the memory consumption exceeds the predetermined second threshold, said determined overload dissolving measure comprises the steps of:

rejecting all control signaling requests (R(CS)) received in said first input queue (Q1), and

dropping all user data packets from said second input queue (Q2, Q3, Q4).

11. Method according to any of claims 3 to 10,

wherein, if the processor load exceeds the predetermined processor load limit, said determined overload dissolving measure comprises the steps of:

rejecting a predetermined ratio of control signaling requests (R(CS)) received in said first input queue (Q 1), and

dropping said user data packets from said second input queue (Q2, Q3, Q4).

12. Method according to any of claims 3 to 11,

wherein, if the fill level of control signaling requests (R(CS)) in the first input queue (Q1) exceeds the predetermined control signaling request fill level, said determined overload dissolving measure comprises the steps of:

rejecting a predetermined ratio of control signaling requests (R(CS)) received in said first input queue (Q1).

13. Method according to any of claims 3 to 12,

wherein, if said fill level of user data requests (R(IP)) in the second input queue (Q2, Q3, Q4) exceeds the predetermined user data request fill level, said determined overload dissolving measure comprises the steps of:

dropping said user data packets from said second input queue (Q2, Q3, Q4).

14. Method according to any of the preceding claims,

comprising the step:

dissolving the detected overload situation by executing the determined at least one overload dissolving measure.

15. Method according to claim 13,

wherein said overload dissolving measure is suspended if said determined overload situation is dissolved.

16. Network node element of a communication network, said network node element being provided with resources for processing of requests and with an overload protection task (OPT) for protection of said resources from overload, said resources comprising at least one input queue (Q 1, . . . , Q4) for requests to be processed, a processor (CPU) for request processing and a memory (M) for storing data related to request processing, wherein said network node's capacity for processing is limited.

17. Network node element according to claim 16,

comprising a request handling means (RH for controlling the input queue (Q1, . . . , Q4).

18. Communication network comprising at least one network node element according to claims 16 or 17.

19. Computer program, loadable into an internal memory (M) of a digital processing unit (CPU), comprising software code portions adapted to control the steps according to any of the preceding method claims, when the computer program is executed on the digital processing unit (CPU).

20. Computer program according to claim 19, wherein the computer program is stored on a machine-readable medium, in particular a computer-readable medium.