A METHOD AND ARRANGEMENT FOR NETWORK LOAD REGULATION

Abstract: The present invention relates to a method in communication networks comprising an automatic load regulation method for the network nodes. A load regulation of a controlled node to a desired load is achieved by means of a comparison of the number of call setup attempts per second during a regulation period for a given load and the allowable number of calls for a desired load. Preventive or regular call restriction measures and measures that release said restrictions are initiated depending on the deviation of the number of calls for the desired load from said number of call setup attempts for the given load. Call regulations for terminating calls are distributed to adjacent nodes by means of call gap arguments that specify minimum time intervals between consecutive call attempts from an adjacent node. Call regulations for originating calls are distributed amongst the various MS-groups and Location Areas of the controlled node.

Description: A Method and Arrangement for Network Load Regulation FIELD OF THE INVENTION The present invention relates to a method in communication networks, in particular to a mobile telephone system, comprising an automatic load regulation method for the network nodes . BACKGROUND OF THE INVENTION Communication networks are designed to be capable to handle a certain traffic load which is caused on the one hand by user-related traffic, e.g. on communication connections for voice and various types of data transmission, and on the other hand for control and signalling traffic in the network. There is however always a risk for network overload in one or more network nodes due to unexpected or temporary increases of the network traffic . The negative effects of such an overload can be reduced by help of various network management functions including certain means for overload control . When a switching node in a communication network experiences an overload it may signal to its adjacent node that there is a high processor load or a processor overload. The adjacent node may react on this information by initiating a response program to reduce the traffic density towards the affected node. One possible regulation and control method is 'call gapping' as disclosed, e.g., in US 5,060,258. 'Call gapping' implies that a controlled node requires certain predefined minimum time gaps between successive call attempts from each of its adjacent nodes. If the time gap is longer than the average time between two incoming call accesses, e.g. from the PLMN or PSTN to said node, this insertion will decrease the average call intensity by means of rejecting or delaying incoming call requests that follow too close in time on a previous call request to the same destination. The 'call gapping' method allows thus that a network node has full control of the maximum traffic intensity level that is sent to it such that a processor overload followed by call rejects will not appear. In order to be able to efficiently regulate the call intensity the nodes must provide information about the minimum length of a 'call gap' that will result in an acceptable processor load for said node. Today, there are only two types of indications sent back to the adjacent node: One indication refers to a high processor load and the other refers to a processor overload. When receiving such an indication a predefined response program is started by the adjacent node where the 'call gap' length is pre-set by a network operator command. SUK-MΑRY OF THE INVENTION A shortcoming of the prior-art solution as presented above results from the fact that the pre-set call gap lengths are statically defined and, thus, not optimal for all nodes and at each point in time. It is, however, not possible to dimension the call gap length in advance in order to be efficient for various processor load situations: Regarding, e.g., the case that the offered call intensity from the adjacent nodes is far beyond the acceptable load that a node can process or in case of higher prioritised traffic, a longer call gap length than the predefined one would be desirable. On the other hand, as long as the offered call intensity from the adjacent nodes is below the capacity limit of the node a shorter call gap length would already be sufficient and the predicted call gap length decreases the load more than necessary. Therefore, it is an object of the present invention to achieve a method and an arrangement that allow a dynamic load control of network nodes while at the same time maintaining the network performance as experienced by the majority of user equipments in said network. Briefly, these objects are accomplished by the method according to the present invention providing the steps of introducing regulation periods within which a load regulation of a controlled node to a desired load is achieved by means of a comparison of the number of call setup attempts per second during the regulation period for a given load and the allowable number of calls for a desired load. Preventive or regular call restriction measures and, accordingly, measures that release said restrictions are initiated depending on the deviation of said allowed number of calls for the desired load from said number of call setup attempts for the given load. Call regulations for terminating calls are distributed to adjacent nodes by means of call gap arguments that specify minimum time intervals between consecutive call attempts from an adjacent node. Call regulations for originating calls are distributed amongst the various MS-groups and Location Areas of the controlled node. It is a first advantage of the present invention that an overload in a controlled node can be avoided already before the overload situation occurs. It is another advantage of the present invention that call restrictions due to a load reduction are distributed in a predefined and controlled way amongst terminating and originating calls to and from the controlled node. It is yet another advantage of the present invention that the node capacity is efficiently used on successful call attempts and not wasted by rejecting large amounts of call attempts . It is still another advantage of the present invention that the load of nodes in a network can be dynamically controlled. Other objects, advantages and novel features of the invention will become apparent from the following detailed description of the invention when considered in conjunction with the accompanying drawings and claims . BRIEF DESCRIPTION OF THE DRAWINGS For a better understanding, reference is made to the following drawings and preferred embodiments of the invention. Figure 1 shows a part of a radio communication network within which the method according to the present invention could be applied. Figures 2a and 2b show an overview of the various steps that are performed by the method according to the present invention. Figures 2c and 2d show in greater detail the method steps for initiating call restriction measures and call admission measures respectively. Figure 2e shows the method steps for maintaining present restriction measures. Figures 2f and 2g show in greater detail the method steps that are performed to achieve regular and preventive call restrictions in a controlled node respectively. Figure 2h show the method steps for a phlegm control that can be included to control the sensitivity of the load regulation part of the method according to the present invention. Figure 3 shows a node in a communication network comprising means to perform the method according to the present invention. DETAILED DESCRIPTION Figure 1 shows a part of a radio communication network 10 within which the method according to the present invention can be performed. Said network is represented by four nodes lla-llc,12 providing communication connections between each others and possibly connections 13a-13c to external networks, e.g. a Public Land Mobile Network or a Public Switched Telephone Network. A node 12 provides communication services to the user equipments 14a-14c in a number of Location Areas 15a-15c. For these purposes, a node 12 handles terminating calls from an adjacent node that are destined to a user equipment 14a-14c that is served by said node 12 and handles originating calls that are originated by one of said user equipments 14a-14c that are served by the node 12. The present invention addresses the processor load in a node 12 that is caused by these calls and call attempts to and from node 12. Said user equipments 14a-14c exchange information with the network via Radio Base Stations 16a-16c that are connected to a dedicated network node 12. The method according to the present invention as described in the following will by means of example refer to one of the nodes 12 as the controlled node M0 while the other nodes lla-llc are regarded as adjacent nodes. However, the load regulation method according to the present invention is not restricted to, e.g., any kind of radio communication system but could also be applied in other types of networks consisting of interconnected nodes comprising connected user equipments that generate communication traffic and receive communication traffic from other nodes. The following method focuses on restriction measures for cases where the desired processor load L* in a node is less than the actual load L and measures to release such restrictions if L* is larger than L. The following figures 2a-2h will now describe the method according to the present invention. Said method steps are performed for at least some of a number of controlled nodes, e.g. Mo, in a communication system as presented in figure 1. The method is performed during so called regulation periods Ti of an operator-definable length tn, which is chosen, e.g., from a range of some seconds, block 21. The sensitivity for load regulation measures that may be initiated for each regulation period can be controlled by help of a threshold value D of a phlegm counter c that controls after how many times a detected overload leads to restriction measures. Said threshold value D can be defined as a common value for all regulation periods, e.g. D=3, but this value can be reconsidered at each period, block 21. At the very start of the algorithm the counter i for the regulation period and the counter c for the phlegm, if applied, are set to zero, block 20. The following description of the inventive method will now refer to a node Mo as the controlled node. It is the object of said method to keep the load of a controlled node at a certain desirable level L* . This is achieved on the one hand by means of providing information to the adjacent nodes on call gap times between successive calls, which implies a regulation of terminated calls to the controlled node and, on the other hand, by means of restricting the number of calls amongst the Location Areas and MS-groups of the controlled node, which implies a regulation of originated calls from the controlled node. At the start of a new regulation period a timer ti, which is valid for a time interval [0;tR] is set to zero, block 21. Then, block 22, during said regulation period the method determines the actual load conditions of the node by means of determining the average number No of calls per second during tR for the controlled node, which is composed of a number No,term of terminating calls and a number No,org of originating calls. When defining ajt as the number of incoming terminating call attempts per second from the adjacent nodes Mj (j=l..J) and bt as the number of originated call attempts per second by the controlled node Mo said total number can be calculated as 1 '" No = N^ tenn + N^ org = —∑ ∑a fi +b, *R 1=0 H The corresponding average processor load Lo for this number of calls can be expressed in terms of a share of the processor load Lterm that is caused by the terminating calls and a share Lorg that is caused by the originating calls, block 23. Starting from these conditions the following steps will calculate possibly necessary adjustments of the number of terminating and originating calls in order to achieve a desired load level L* for the controlled node Mo. Regarding said adjustments it is possible to introduce a priority factor p, e.g., from a range between [0;1], block 24, which offers the possibility to perform said adjustments either in such a way that the current traffic mix relation for originating and terminating calls is maintained or in such a way that, e.g., a network operator can apply certain regulations in favour to one of said call types. If the current traffic mix shall be maintained said priority factor p is defined to p = rs L org + 1 term However, the priority factor p could also be set manually. For instance, a value p=0.75 would imply that 75% of all processed calls should be originating and 25% should be terminating calls . Another possible approach would be to set p in such a way that originating and terminating calls use the same amount of the available processor capacity. The next step, block 25, calculates the total number No* of call attempts that can be handled by the controlled node Mo for a desired load L* . In the following, Lorg,ι is defined as the load that is caused by one single originating call and, correspondingly, Lterm,ι as the load that is caused by one single terminating call. It is a first possibility to perform the calculation of No* with respect to the percentages of the desired processor load L* that shall be used for terminating and originating calls respectively. Then, No* corresponds to the sum of the numbers No,org* and No,term* of terminating and originating calls, which can be handled for the assigned load shares, i.e. = Kor g + Kte, m = P + (1 - P) " org,X term,\ Another possibility, which is the preferred embodiment of the present invention, is to perform the calculation of No* with respect to the percentages for the number of terminating and originating calls that can be handled for the desired load L*, i.e. No * = N or , + N , em , = K + - )No • In this case L* can be expressed as a weighted sum of the share of No* for originating calls No*-Lorg,ι and the share of No* for terminating calls No*-Lterm,ι, i.e., and, apparently, the total number No* of calls that can be handled for a desired load L* corresponds to No = P L or s ,X + - - P) L ,enn,X A need for load restrictions in the controlled node Mo in order to achieve a certain desired load L* is revealed by a comparison of the number of calls that are handled for the actual load L and the number of calls that could be handled for a desired load L* . Therefore, the relative deviation of the adjusted number of calls for a desired load L* from the measured number of calls for the actual load L can be applied as the criterion that initiates various grades of call restriction measures for said node . There are two options to define said deviation: In the preferred embodiment of the method according to the present invention, the relative deviation ΔN is calculated from the difference between the total number No of terminating and originating calls and the number No* of calls that could be handled for the desired load L*, i.e. Alternatively, in order to be able to consider, e.g., various behaviours of the terminating and originating calls it would be possible to define a restriction criterion that applies both the deviation ΔNterm for terminating calls and the deviation ΔNorg for originating calls with regard to the desired load L*, i.e. A Λτ N 0 term — 0 term N 0 - 0 ΔN, eπ „ = and AN org = . i Ojerm " 0,ørg For this alternative the following steps referring to Δ must be performed for both ΔNterm and ΔNorg. Apparently, as a value ΔN>0, block 27 Yes, implies that the number No* of calls for the desired load L* is less than the determined average number No of calls per second during tn, it is necessary to restrict the number of calls. A value ΔN<0, block 27 No, on the other hand implies that the controlled node could handle a number No* of calls that exceeds the determined number No, i.e. it is possible to admit additional calls for this node, e.g., by means of releasing present restriction measures . In case of very narrow deviations |ΔN|<δ, block 26 Yes, it is not recommendable to initiate any kind of load regulation measures for the present regulation period due to the insignificance of such a deviation. The threshold value δ>0, which denotes the size of such an optional tolerance interval can be defined, e.g., as N - N * δ = "° ' V ° =0.05. ^ 0 However, it is in this case nevertheless necessary to maintain the restriction measures that have been valid during the preceding regulation period, block 30. This is illustrated by means of figure 2e. If there has been valid restriction measures during the preceding regulation period, block 301 Yes, the inventive method will retransmit these restrictions. The determination of these restrictions will be explained in more detail in connection with figures 2f and 2g. Regarding terminating calls the call gap arguments τj, which have been determined during the preceding regulation period, are retransmitted to the adjacent nodes Mj block 302. This is done both for ordered measures, e.g., due to regular restriction measures, block 282, or in consequence of a gradual release of restrictions, block 293, and for desired restrictions, e.g. in connection with preventive restriction measures, block 283. Regarding originating calls it is necessary to retransmit the distribution of reductions for these calls amongst Location Areas and MS-groups. If there are no valid regulation measures, block 301 No, e.g. because all restriction measures have been released, block 292, the method will not initiate any actions at that stage. For I ΔN 1 >δ, i.e. values of ΔN outside said tolerance interval, block 26 No, the inventive method may provide different alternatives of call restriction measures, block 28, if the relative deviation ΔN exceeds the threshold value +δ, block 27 Yes, or call admission measures, block 29, if the relative deviation is below the threshold value -δ, block 27 No. Finally, block 31, the counter i for the regulation period Ti is incremented and the load regulation mechanism can start again. Figure 2c will now describe the method steps for initiating call restriction measures, block 28. The grade of said restriction measures can be determined from said relative deviation ΔN compared to a threshold value ηi≥O, which is defined, e.g., as For minor deviations, i.e. δ<ΔΝ<ηι, block 281 No, it might be optionally possible to initiate preventive call restriction measures, block 283, as explained in figure 2g. These measures can be applied, e.g., to achieve a reduction of the number of processed calls, which, however, might become effective not until several restriction periods later. For larger deviations, i.e. ΔN>τμ, block 281 Yes, the inventive method will initiate regular call restriction measures, block 28, that achieve a reduction of the total number of calls during the next regulation period. Optionally, it is possible to introduce a phlegm control 2841,2842,2843, which delays the consequences that result from the fact that a restriction criterion has been fulfilled. This will be explained later. Figure 2f describes in more detail the method steps to implement regular call restrictions, block 282, for terminating and originating calls. The total number of calls must be reduced by an amount (No-No*) , which is composed of a number Nterm of terminating calls from all adjacent nodes and a number Norg of calls that originate from the controlled node. The calculation of the number Nterm of terminating calls by which No must be reduced starts from the total number of terminating calls that have been received from all adjacent nodes during a regulation period including the number of terminating calls that are bound for the controlled node but not sent due to restriction measures . Nterm corresponds to this number reduced by the number No,term* of terminating calls that the controlled node can handle, block 2821, i.e. Nterm=No,term-No,term* . As explained above, No,term* can be calculated with respect to a share of the desired load L*, which shall be reserved for terminating calls, or simply as a share of the number No* reserved for terminating calls. In order to avoid that the regulation restricts a too large number of the terminating calls, it is optionally possible to introduce an upper threshold for the number Nterm by which the terminating calls are allowed to be restricted. This could be expressed, e.g., in terms of a share of the average number of terminating calls per second during tR: Nterm<βterm-No,term. An appropriate value for βterm could be selected, e.g., from an interval [0.8,-0.9], i.e. Nterm should not lead to a restriction of terminating calls that exceeds, e.g., 80% of the average number of terminating calls per second during tR. Nterm can also be expressed as a sum of shares Nterm(j ) =αj*Nterm, which describe the distribution of said reductions of terminating calls amongst each of the adjacent nodes Mj, block 2822. Here, α 3 denotes the ratio between the average number of incoming terminating calls from a specific adjacent node M 3 during a regulation period and the sum of the average numbers of incoming calls from all adjacent nodes, i.e. The reduction of the number of terminating calls from an adjacent node Mj is achieved by means of determining and transmitting a call gap argument τ 3 , which is interpreted by the receiving node Mj as the minimum time interval between two successive calls from this node, block 2823. - a j N l e n If the distance in time between successive terminating calls from an adjacent node is not less than τ 3 the number of calls from the adjacent node will remain within the prescribed range of calls that can be accepted by the controlled node Mo. The number Norg of originating calls by which No must be reduced is calculated from the difference between the number of originating calls for the controlled node Mo during a regulation period and the number No.org* of originating calls that the controlled node can handle, block 2824, i.e. Norg=No,org-No,org* . As already mentioned for the terminating calls, the regulation should not restrict a too large number of the calls. Therefore, in analogy to the restriction of terminating calls, it should be possible to introduce an upper threshold for the number Norg by which the originating calls are allowed to be restricted, which could be expressed, e.g., in terms of a share of the number of originating calls: Norg<βorg-No,org. An appropriate value for βorg could be selected, e.g., from an interval [0.8;0.9]. Norg is thus limited to a restriction of originating calls that does not exceed, e.g., 80% of the number of originating calls. In order to spread the restrictions for originating calls such that the effects do not become too evident for certain groups of user equipments that are served by said node, call restrictions are distributed with regard to certain groups of user equipments and Location Areas, block 2825. User equipments can be gathered into certain numbers of MS-groups or MS-classes such that it is possible to achieve that specific measures only become effective for selected ones of these groups/classes. The number G of such groups varies depending on the radio network type, e.g. G=8 for PDC- networks or G=16 for GSM-networks . Norg can also be expressed as N org = ∑^-MS k . N k (MS k ) . k=o <J The number of originating calls that must be restricted is distributed on the various Location Areas. MS denotes the number of mobile stations in a Location Area and Nk(MSk) is the average number of calls per mobile station and second in the k:th Location Area. These average numbers are known from the statistics. For each Location Area it is possible to restrict a number gke[0;G] of MS-groups. Each mobile station is located in a certain Location Area and can belong to one of the MS-groups. Restrictions can be performed per MS-group and Location Area. It is thus necessary to find an appropriate number of Location Areas and for each of these Location Areas an appropriate number gk of MS-groups such that the sum term for Norg corresponds as good as possible to the number of originating calls that must be restricted. Figure 2g describes in more detail the method steps for initiating preventive call restriction measures, block 283. These measures need not to lead to immediate actions but keep track on detected deviations and try to reduce the number of processed calls by means of requesting the adjacent nodes to reduce voluntarily the number of terminating calls to the controlled node. This will probably not lead to an immediate load reduction for the controlled node Mo but rather a successive reduction after some regulation periods. As already described above, the number Nterm of terminating calls by which No must be reduced can be calculated as the difference between the total number of terminating calls that have been received from all adjacent nodes during the regulation period including the number of terminating calls that are bound for the controlled node but not sent due to preventive call restriction measures and the maximum number of terminating calls that the controlled node can handle for the desired load L*, block 2831. This can also be expressed as a share Nterm (j ) =αj*Nterm of reductions of terminating calls for each of the adjacent nodes Mj , block 2832. Information about these shares are provided to each adjacent node Mj , which are by this means requested to reduce voluntarily the number of calls that terminate in the controlled node Mo by a number Nterm(j) of calls, block 2833. As done for regular restriction measures it is optionally possible to determine and transmit call gap arguments τj to the adjacent nodes Mj but on a voluntary base. Figure 2d will now describe the method steps for initiating call admission measures, block 29. These steps are performed in analogy to the corresponding method steps for call restriction measures. Call admission means that presently valid restrictions are released, completely or gradually, if it turns out that the number No* of calls that could be handled for a desired load L* exceeds the determined average number No of calls per second during the regulation period tR, i.e. ΔN<0. Also this case provides the option to distinguish between various grades of call admission measures by help of a threshold value η 2 >0, which is defined in the same way as ηi . The value of | η 2 1 can be selected, e.g., slightly larger than |τμ| if call admission measures must be handled more careful than call restriction measures. For minor deviations, i.e. -η 2 <ΔN<-δ, block 291 No, the present restriction level can be gradually released, block 293. This could be done, e.g., by means of releasing the present restriction level by a certain percentage, e.g. 20%. Another possibility is that the percentage by which the present restriction level is released corresponds to the ratio δ-AN . For deviations δ-η 2 ΔN<-τμ call regulations are completely released, block 292. Optionally, it is possible also in this case to introduce a phlegm control 2941,2942,2943, which delays the consequences that result from the fact that an admission criterion has been fulfilled. This will be explained in the following. In order to avoid too frequent changes of the permitted total number of terminating and originating calls with regard to a desired load L*, it might be an important option to control the sensitivity of the restriction algorithm, e.g., in order to secure that a prior regulation has fully come into effect before the next regulation is initiated. The sensitivity of the load regulation may be influenced by an appropriate choice of the threshold values δ for the tolerance interval and ηi, η 2 , which denote the threshold values that distinguish the various grades for call restriction measures and call admission measures. The choice of a value for δ depends, e.g., on the decision which deviations from a desired load still are acceptable for a network operator. The choice of a value for ηi or η 2 depends on a decision how fast the load regulation should be performed, i.e. for ηi how fast call restriction measures should be initiated and for how fast such restrictions should be released. The exact selection of values for δ, ηi and Ύ\2 is a decision that is based on the network topology and experience from the behaviour of calls in an operators network . Another option to control said sensitivity relates to the introduction of a phlegm as explained in more detail in figure 2h. A phlegm provides the possibility to delay appropriate restriction measures until the criterion that requires said measures has been fulfilled certain times. Within the scope of the present invention such a phlegm could be introduced at three places : When introducing the phlegm control in connection with the check whether any call restriction measures or call admission measures should be initiated, block 2841 or block 2941, a phlegm counter c is increased each time the corresponding regulation criterion is violated, i.e. ΔN>δ for call restriction measures and ΔN<δ for call admission measures. Instead of this, the phlegm control can also be introduced in connection with the check which of several grades of call restriction or call admission measures must be initiated. This implies for call restriction measures that a phlegm control is introduced for ΔN>ηι, block 2842, in order to delay regular call restriction measures and, optionally, for δ<ΔN<ηι, block 2843, in order to delay preventive call restriction measures. Correspondingly, for call admission measures a phlegm control is introduced for ΔN<-η 2 , block 2942, in order to delay a complete release of call restriction measures and, optionally, for -η 2 <ΔN<-δ, block 2943, in order to delay a gradual release of call restriction measures. The corresponding measures are not performed until the phlegm counter corresponds to the phlegm threshold value . In case of a phlegm delay, the phlegm control will nevertheless initiate that the presently valid restriction measures are maintained, block 30, i.e. retransmit the regulation orders from the previous regulation period for terminating and originating calls as already explained above. It might be a conceivable option in this situation to reset the phlegm counter to zero if there is no need for regulation measures during a regulation period, block 26 Yes. By this means it is possible to avoid that the number of occasional violations of the restriction criterion, which normally would be suppressed by the phlegm control, is summed up and restriction measures are initiated in connection with the violation for which the phlegm counter happens to correspond to the phlegm threshold value. If a phlegm shall be applied, block 321 Yes, a phlegm counter c, which initially has been set to zero, block 20, is incremented, block 322, and compared to a delay threshold value D, block 323, each time the respective restriction criterion for the phlegm control has been violated. However, call restriction measures, block 282, or preventive call restriction measures, block 283, are not enforced until said restriction criterion has been violated the number of times that corresponds to the phlegm threshold value D, i.e. c=D, block 323 Yes. An appropriate value for D could be D=3. For this case the counter c is reset to zero, block 324, to start a new phlegm phase. Otherwise, the phlegm control will initiate measures to maintain the present restriction measures, block 30, or not initiate any call restriction measures. Figure 3 shows a node 33 comprising means to perform the method according to the present invention as described above. The node 33 comprises means 331 for determining during periodic regulation periods the average number No of calls that are handled by said controlled node 33 for the actual load L and the number No* of calls that could be handled for the desired load L* . Starting from these numbers and depending on the determined relative deviation ΔN of No* from No as described above decision means 332 select the appropriate means for performing the regulation measures: Means 333 initiate regular or preventive call restriction measures and means 334 initiate measures to release present restrictions completely or gradually. If no measures should be performed for the present regulation period, means 335 will retransmit the regulation orders from the previous regulation period for terminating and originating calls. Regarding terminating calls from adjacent nodes means 336 are responsible to inform said adjacent nodes about call regulations by means of transmitting the calculated call gap arguments. Correspondingly, means 337 inform the MS-groups and Location Areas on regulations for originating calls . The node 33 also comprises means 338 for implementing received call regulation requests from adjacent nodes, i.e. calls that are experienced as terminating calls by an adjacent node.

Claims: CLAIMS 1. Method for load regulation to a desired load L* in a controlled node (12) of a communication network (10) comprising a plurality of interconnected nodes (11a, lib, lie, 12) providing communication services to units (14a, 14b, 14c) that are connected to said node (12), which is capable to handle incoming traffic from adjacent nodes (11a, lib, lie) and generated traffic from said units (14a, 14b, 14c) , c h a r a c t e r i s e d b y determining during periodic regulation periods the average number No of calls that are handled by said controlled node for the actual load L (22) and the number No* of calls that could be handled for the desired load L* (25) , applying the relative deviation ΔN of No* from No as the regulation criterion, initiating call restriction measures (28) if the desired load L* implies a positive value for ΔN, initiating call admission measures (29) if the desired load L* implies a negative value for ΔN. 2. The method according to claim 1, whereby load regulation measures are restrained or not initiated at all as long as the absolute value of the relative deviation |ΔN| remains below a tolerance value δ>0 (26 Yes) . 3. The method according to claim 1, providing preventive call restriction measures (283) if the desired load L* implies a positive value for the relative deviation ΔN that is less than or equal to a threshold value ηi (281 No) , which suggest a reduction of the number of terminating calls from said adjacent nodes, regular call restriction measures (282) if the desired load L* implies a positive value for the relative deviation ΔN that exceeds said threshold value ηi (281 Yes) , which demand a reduction of the number of terminating calls from said adjacent nodes and the number of originating calls from the controlled node. 4. The method according to claim 1 , providing gradual call admission measures (293) if the desired load L* implies a negative value for the relative deviation ΔN that exceeds a threshold value -η 2 (291 No) , which release the present regulation level to a certain percentage, call admission measures (292) if the desired load L* implies a negative value for the relative deviation ΔN that is less than or equal to said threshold value -Ύ\2 (291 Yes) , which stop the regulation. 5. The method according to claim 4, whereby the percentage by which the present regulation level is released corresponds to the ratio δ-AN δ-η 2 6. The method according to claim 4, whereby the percentage by which the present regulation level is released is manually defined. 7. The method according to claim 3 and 4, whereby the threshold value ηi for call restriction measures is less than the threshold value η 2 for call admission measures. 8. The method according to one of the preceding claims, whereby the number of terminating calls is regulated by means of call gap arguments that are transmitted to the adjacent nodes in order to denote allowable minimum time intervals between consecutive call attempts to achieve a desired load contribution from said adjacent nodes. 9. The method according to one of the preceding claims, whereby the number of originating calls is regulated for a selected number of Location Areas and MS-groups to achieve a desired load contribution from the originating calls . 10. The method according to one of the preceding claims, whereby a relative .deviation ΔN is determined separately for terminating calls and originating calls. 11. The method according to one of the preceding claims, whereby a priority factor can prioritise call restrictions in favour of terminating or originating calls (24) . 12. The method according to claim 11, whereby the priority factor is manually defined. 13. The method according to claim 11, whereby the priority factor is defined as to maintain the shares of terminated and originated calls after said load regulation measures. 14. The method according to one of the preceding claims, whereby a delay is introduced (2841) that restrains call restriction measures until the regulation criterion ΔN>0 has been valid (27 Yes) for a given number of times and within a number of regulation periods . 15. The method according to one of claims 1-13, whereby a first delay is introduced (2842) that restrains regular call restriction measures until the regulation criterion ΔN>ηι has been valid (281 Yes) for a given number of times and within a number of regulation periods and, optionally, whereby a second delay is introduced (2843) that restrains preventive call restriction measures until the regulation criterion 0<ΔN<ηι has been valid (281 No) for a given number of times and within a number of regulation periods . 16. The method according to one of the preceding claims, whereby a delay is introduced (2941) that restrains call admission measures until the regulation criterion ΔN<0 has been valid (27 Yes) for a given number of times and within a number of regulation periods . 17. The method according to one of claims 1-15, whereby a first delay is introduced (2942) that restrains a complete release of call restriction measures until the regulation criterion ΔN<-η2 has been valid (291 Yes) for a given number of times and within a number of regulation periods and, optionally, whereby a second delay is introduced (2943) that restrains a gradual release of call restriction measures until the regulation criterion -η 2 <ΔN<0 has been valid (291 No) for a given number of times and within a number of regulation periods . 18. The method according to one of the preceding claims, whereby the regulation orders from the previous regulation period for terminating and originating calls are retransmitted if load regulation measures are restrained. 19. A node (12,33) in a communication network (10) comprising a plurality of interconnected nodes (11a, lib, lie, 12 , 33 ) providing communication services to a plurality of units (14a, 14b, 14c) that are connected to said node (12,33), which is capable to handle incoming traffic from adjacent nodes (11a, lib, lie) and generated traffic from said units (14a, 14b, 14c) , c h a r a c t e r i s e d i n means (331) for determining during periodic regulation periods the average number No of calls that are handled by said controlled node for the actual load L and the number No* of calls that could be handled for the desired load L*, decision means (332) to select call regulation measures depending on the relative deviation ΔN of No* from No, means (333) for initiating call restriction measures, means (334) to release present restriction measures, means (335) to retransmit a present regulation level, means (336) for informing adjacent nodes about regulations for terminating calls that are bound for said node and means (337) for informing Location Areas and MS-groups about regulations for originating calls from said node, means (338) for implementing received call regulation requests from adjacent nodes. 20. The node (12,33) according to claim 19 comprising delay means that restrain call regulation measures until a regulation criterion has been violated for a given number of times and within a number of regulation periods. 21. A communication network (10) comprising a plurality of interconnected nodes (11a, lib, lie, 12 ) providing communication services to a plurality of units (14a, 14b, 14c) that are connected to said node (12) , which is capable to handle incoming traffic from adjacent nodes (11a, lib, lie) and generated traffic from said units (14a, 14b, 14c) and comprising more than one node (12) according to one of claims 18 or 19. 22. The communication network according to claim 21 consisting of a radio communication network. 23. The communication network according to claim 21 consisting of a fixed communication network. 24. A computer program product loadable on a memory unit c h a r a c t e r i s e d i n that it is capable of performing the method according to one of claims 1-18.

Inventors: GUSTAFSSON NIKLAS, KARLSSON BERNT, GUSTAFSSON, NIKLAS, KARLSSON, BERNT
Applicants: ERICSSON TELEFON AB L M, GUSTAFSSON NIKLAS, KARLSSON BERNT, GUSTAFSSON, NIKLAS, KARLSSON, BERNT, TELEFONAKTIEBOLAGET LM ERICSSON (PUBL)
Application year: 2001
Main classification: H04M3
IPC codes: H04M3, H04Q3