OVERLOAD PREVENTION IN A TELECOMMUNICATIONS NETWORK NODE

Abstract: The invention relates to a method of preventing an overload in a telecommunications network node. The network comprises at least one service node (CN; SCP) and at least one other node (PN; SSP) from which the service node receives service requests. According to the method, the service node transmits restriction requests (CG) to a node connected thereto, so that said node would restrict the number of service requests it transmits towards the service node. The restriction request comprises a group of parameters that indicates how the node should perform restriction. A restriction request is transmitted at least whenever said group of parameters changes. In order to provide a simple and reliable method, (a) the service node adds to the restriction request it transmits information identifying the aforementioned group of parameters on the basis of which the node should perform restriction, (b) the node copies said information into its memory and transmits the data identifying the groups of parameters it uses back to the service node, and (c) the service node compares said data with the data it has transmitted, and decides on the basis of the comparison whether a restriction request is transmitted to the node which transmitted the data.

Description: Overload prevention in a telecommunications network node Field of the Invention The invention relates generally to traffic control in telecommunication networks. More specifically, the invention relates to a method and an arrangement for preventing an overload in a te1ecommunica ion network. The invention is intended especially for so- called Intelligent Networks (IN) that are being developed at present, but the same principle can be applied in any network wherein two or more nodes are interconnected in such a way that at least one of the nodes can be loaded by one or several other nodes. Background of the Invention An Intelligent Network usually refers to a network comprising more intelligence (i.e. a better ability to utilize information stored in the network) than the present public (switched) networks. Another characteristic of the Intelligent Network is that the network architecture somehow draws a distinction between, on the one hand, the operations concerning the switching itself and, on the other hand, the stored data and its processing. Such a division makes it possible that, in principle, the organization providing network services can be different from the organization managing the physical network in which the services are provided. Conceptually, an Intelligent Network can be divided into three parts. The first part comprises the nodes switching traffic (performing connections), the second part contains the services provided by the network, and the third part consists of the internodal communication protocol, i.e. the "language" the machines use to communicate with one another. Since all services must be presented as a sequence of messages conforming with the protocol, the protocol defines the "intelligence" of the network. In order to facilitate the understanding of the present invention, reference is first made to a simple basic situation illustrated in Figure 1, wherein two machines (or network nodes) 1 and 2 are shown, the machines being interconnected by means of a signalling link 3. Machine 1 comprises a database DB, and machine 2 is a client asking questions from machine 1 by transmitting messages to machine 1 over the link 3. When machine 1 receives a question, it initiates a transaction resulting in an answer after a certain processing period. When the answer is ready, machine 1 transmits it to machine 2 over the link 3. Each answer costs machine 2 a certain sum. A theoretical omnipotent machine 1 would answer each question immediately so that the correlation between the questions rate (questions per time unit) and the answering rate (answers per time unit) would look like the description in Figure 2a. However, there is in practice a limit to how fast machine 1 can provide answers. Taking this into account, the response curve of the omnipotent machine 1 becomes like the one shown in Figure 2b. When the questions rate exceeds a certain threshold Amax corresponding to the highest possible answering rate, the latter remains constant, i.e. some of the questions will not be answered. However, this situation does not correspond to a real situation, either. In practice, the situation is such that as the questions rate exceeds a certain threshold value for a long period of time, machine 1 becomes overloaded so that the increasing questions rate further reduces the answering rate. This situation is illustrated in Figure 2c. The decreasing answering rate is due to the fact that the ma. .ine starts wasting its resources, for example in such a way that it reserves more and more free memory for storing the questions, so there will be correspondingly less and less memory available for computing the answers. The threshold value of the questions rate at which an overload situation occurs is not constant, but it depends on how much of the capacity of machine 1 is dedicated to answering. For example, the threshold value is lower than usual when the database DB of machine 1 is being updated. The purpose of any overload prevention method is to make the curve (Figure 2c) describing a real situation resemble as closely as possible the curve (Figure 2b) describing an ideal situation. On the other hand, it is reasonable to provide the overload prevention of machine 1 partly in machine 2, so that machine 2 would not have to load the transmission connection between the machines by transmitting messages that would be discarded by machine 1. Suppose that in order to protect itself, the overloaded machine 1 transmits to machine 2 a restriction or filtering request with which it requests machine 2 to reduce the number of questions to be transmitted. Such a request typically contains two restriction parameters: the upper limit of the questions rate U (i.e. the upper limit of the number of questions performed per time unit) and the duration of the filtration T (i.e. of the restriction). When machine 2 receives such a request, it begins to filter (restrict) the questions traffic so that the questions rate will be at most U, so that part of the questions will fail (they will not even reach machine 1). Machine 2 continues this restriction operation for the period of time T indicated in the restriction request. If machine 2 receives a new request during this period, the upper limit of the questions rate and the interval will be updated to correspond to the new values. Instead of the upper limit of the questions rate, the parameter U may also indicate the percentage of all service request messages machine 2 should transmit to machine 1. For the sake of clarity, only the former meaning (upper limit of the questions rate) will be used hereinafter for the parameter U. When machine 2 uses the above-described overload prevention mechanism, it has two problems. The first problem is how to select the aforementioned parameters U and T. A long filtration time T and a low value of the parameter U diminish the overload, but they also entail a clearly lower revenue for machine 1. On the other hand, a short filtration time and a higher value for the parameter U do not necessarily reduce the number of questions sufficiently for the overloading situation to be cleared up, and an overloading situation also means a lower revenue. A simple way of eliminating this problem is to divide the response characteristic into consecutive overload regions Ln (n=0,l,2..) according to Figure 3, each of the regions having its own values for the parameters U and T. If, at all times, machine 1 is able to determine its own load level, then the restriction parameters can be stored in the machine in a format (Ln: T, U), so that the machine can retrieve the required values of the parameters T and U on the basis of the load level Ln. However, this does not quite eliminate the aforementioned problem, but shifts the trouble of selecting the parameters to the operator. There are also methods by means of which the parameters can be selected automatically, based on the utilization ratio of the machine. The other problem relates to when to send and when not to send restriction requests. Machine 1 should transmit the first restriction request when it is close to becoming overloaded. It should then send a restriction request either when the restriction period T expires (if the overload condition is still on) or when the restriction parameters change. Machine 1 should not transmit new restriction requests if machine 2 restricts the questions correctly (with the right threshold value for the questions rate and the right filtration time T). However, since there is no feedback, machine 1 cannot know if and how machine 2 restricts the questions. If machine 2 is the only source of questions, then machine 1 can solve the problem by monitoring the questions rate and by transmitting a new restriction request when the rate of the incoming questions exceeds the allowed threshold value U. If there are several machines transmitting questions, then efficient book¬ keeping is required to monitor the traffic and this makes the arrangement complicated. This second problem is thus of the synchronization type, since machine 1 must keep up to date (i.e. synchronize) the restriction entity that is in a remote machine according to the loading situation of machine 1 at each moment. The overload prevention in the Intelligent Network operates in a manner that is very similar to the above-described example. The Intelligent Network architecture is based on service switching points (SSP) and service control points (SCP) that make decisions concerning for example the routing and the charging of the calls. The Service Control Points, which are typically clearly fewer in number than the SSPs, contain knowledge of what the different services do and how to access the data that the services need. In an Intelligent Network, a Service Control Point is like the machine 1 of the above-described example, containing a database, and the SSP is like the machine 2 that asks questions. The above-described synchronization is also a problem in the Intelligent Network since the communication protocol between the nodes is not reliable in this respect. The above-described example concerned a network that was as simple as possible with respect to its topology. For example an Intelligent Network is a network with a (typically) star topology. A star network basically comprises two kinds of nodes: central nodes and peripheral nodes. Peripheral nodes generate traffic that flows towards the central node. When the Intelligent Network comprises more than one SCP, the architecture corresponds to several superimposed star networks sharing peripheral nodes. Figures 4a to 4c illustrate the above-described alternatives with reference CN (in the IN: SCP) denoting a central node and reference PN (in the IN: SSP) denoting a peripheral node. Figure 4a shows a star network having one central node CN and three peripheral nodes PN. Figure 4b shows a star network in its simplest form corresponding to the example of Figure 1 (one central node and one peripheral node), and Figure 4c shows two star networks sharing peripheral nodes PN. In addition to the Intelligent Network, many other networks have a star topology. Examples of such networks include a network formed of a satellite and earth stations, wherein the satellite switches traffic generated by the earth stations, or a network consisting of a base station controller and base stations of a cellular network. In some known (intelligent) networks, the above-described synchronization is implemented with a broadcasting method, wherein the central node transmits a common restriction request to all the peripheral nodes connected thereto whenever its load level changes (or the restriction parameters change for some other reason, for example when the operator changes them) and the peripheral nodes respond to each restriction request they receive with an acknowledgment. The central node keeps a record of the acknowledgement messages, and if some nodes have not transmitted an acknowledgement message within a certain control period, the central node retransmits the restriction request to these nodes. The broadcast is repeated again to all the nodes as the restriction period (T) expires if the overload condition is still on. However, it is difficult to implement such a method in a typical network comprising several nodes, and in addition the method is not reliable, since a peripheral node may be damaged for example immediately after it has transmitted the acknowledgement message, in which case the central node will not be informed of the situation. Another drawback of such a method is that the central node also transmits a restriction request in vain to nodes which cause an insignificant loading on the central node (this could only be avoided by monitoring separately the traffic from each peripheral node, which, however, is a complicated and therefore undesirable solution). The latter problem has been solved in some known Intelligent Networks in such a way that as the restriction parameters change, a restriction request is always transmitted in response to a service request message (which may be for example the question of the example provided in the beginning) sent by a peripheral node. Therefore, the peripheral nodes with light traffic will correspondingly receive fewer restriction requests. The drawback of this method is, however, that it causes a great deal of traffic over the signalling link between the central node and a peripheral node. It also causes a large number of updates in the peripheral node. Summary of the Invention The purpose of the present invention is to provide a new kind of arrangement by means of which the above-described drawbacks can be eliminated and synchronization can be implemented in a simple and sufficiently reliable manner (i.e. that the loading machine operates as well as possible in accordance with the current load level of the loaded machine). That purpose is achieved with the method according to the invention that is characterized in that the service node adds to the restriction request it transmits information identifying the group of parameters, on the basis of which the node should perform restriction, the node copies said information into its memory and transmits the data identifying the groups of parameters it uses back to the service node, and the service node compares said data with the data it has transmitted, and decides on the basis of the comparison whether a restriction request is transmitted to the node which transmitted the data. The arrangement according to the invention is in turn characterized in that the network service node comprises comparing means for comparing the data stored in the node and identifying the group of parameters to corresponding data received from another network node, the comparing means being operationally connected to control the transmission of the restriction request from the service node. The idea of the invention is to maintain, in a node providing services, information identifying the restriction parameters currently utilized and to transmit this data together with the restriction request first to another node to be stored there, and to transmit then the data identifying the restriction parameters used by this other node back to the node providing services, so that the latter can conclude on the basis of the received data whether the other node restricts the traffic and if it restricts it in the correct manner. In an individual overloading situation, the first restriction request that contains the data identifying the new restriction parameters can be transmitted from the node providing services either automatically (without an incoming service request) or in response to an incoming service request. Furthermore, the restriction request may either be an individual message or it may be contained in a message that would in any case be provided in response to the service request message. Due to the arrangement according to the invention, synchronization can be implemented very reliably in a simple manner. Brief Description of the Drawings The invention and 1 £ . μrtrrn : ir.bodiments will be described in greater deta;: t «-•. •» -.-trs reference to the examples according to the (U orj-jtiying drawings, in which Figure 1 illustrates the questions traffic between two machines, Figure 2a illustrates a response of a hypothetical machine to service requests, Figure 2b illustrates a response of an omnipotent machine to service requests, Figure 2c illustrates a response of a real machine to service requests, Figure 3 illustrates the division into different load levels, performed in a node, Figure 4a shows a star network comprising four nodes, Figure 4b shows a star network in its simplest form, Figure 4c shows a star network comprising two superimposed star networks sharing peripheral nodes, Figure 5 shows an intelligent network comprising two central nodes and three peripheral nodes, Figure 6 illustrates the communication between the nodes in an intelligent network, Figure 7a illustrates an intelligent network and the formation of its central node from functional blocks situated at different hierarchical levels, Figure 7b shows the division of one block shown in Figure 7a with respect to the call restriction function. Figure 8 illustrates the operation of a known traffic restriction method, Figures 9 and 10 illustrate the operation of an intelligent network in a loading situation, Figure 11 illustrates the operation according to the invention in a service control point (central node of the network) of the intelligent network, Figure 12a is a flow chart illustrating the transmission of a restriction request from a service control point, Figure 12b shows schematically the means of the network central node performing the operation according to the invention, Figure 13 illustrates the addition of the stamp according to the invention to a restriction request message to be transmitted from a service control point in the intelligent network, Figure 14 illustrates the addition of the stamp array according to the invention to the initial message transmitted from an peripheral node in the intelligent network, and Figure 15 is a flow chart illustrating the transmission of a restriction request from a service control point, according to a preferred embodiment of the invention. Detailed Description of the Invention In the following, the invention will be described in greater detail by using as an example a (star) Intelligent Network wherein calls are transmitted. As described above, the architecture of the Intelligent Network is based on service switching points (SSP) and service control points (SCP). These nodes are interconnected by means of a network SN according to the signalling system number 7 (SS7; described in greater detail in the CCITT Blue Book Specifications of Signalling System No. 7, Melbourne 1988), in the manner shown in Figure 5. In mutual communication the SSP and the SCP utilize the Intelligent Network application protocol (INAP) described in the ETSI (European Telecommunications Standard Institute) standard ETSI IN CS1 INAP Part 1: Protocol Specification, Draft prETS 300 374-1, November 1993. In the SS7 protocol stack illustrated in Figure 6, the INAP is the upmost layer situated on top of the Transaction Capabilities Application Part (TCAP), the Signalling Connection Control Part (SCCP) and the Message Transfer Part (MTP). The SSP is generally a commercial telephone exchange with a modified call control software, and the SCP comprises the service control logic and has access to the services database. Call traffic passes through the SSPs. The Service Control Points make some of the decisions concerning the routing and the charging of the calls. During a call in the Intelligent Network, there may be one or more INAP dialogues between the SSP and the SCP. Each of these dialogues begins with a predetermined message (initial detection point message) hereinafter referred to as an initial message. When the network traffic is heavy, the SCP may become overloaded. In order to prevent this, the Intelligent Network has a decentralized load control system that uses a so-called call gapping method to restrict messages arriving towards the SCP (the term "call gapping" is used in several international standards, for example in the CCITT Blue Book, Recommendation E.412, §3.1.1.2 and Recommendation Q.542, §5.4.4.3). The call gapping method is a known traffic control method that is based on the frequency of call occurrence (rate of arrival ), in which method the number of calls is limited in such a way that at most a certain maximum number of calls per time unit are allowed to pass. In addition to the aforementioned standards, such a method is also described for exarrpie in US Patent 4,224,479. The SCP monitors the loadir. ; ituation and the SSPs restrict the traffic : '. r.«-. «>ssary, by rejecting some of the calls before * r.v rcated dialogue is started. Assume that the network comprises, in the manner shown in Figure 7a, two nodes SSP1 and SSP2, and one SCP. The SCP can be considered to contain a hierarchy of functional blocks A to E. Each block can be considered to comprise, according to Figure 7b, a gapping gate 70 operating according to the call gapping method, and a subsystem SS located behind the gapping gate. All telecommunication with the subsystem passes through the gapping gate, and the gapping gate gathers statistics about the traffic, the condition of the subsystem, and the condition of the other parts of the SCP. From this data the gapping gate calculates the load level of the subsystem in question. The normal load level of the subsystem is LO (cf. Figure 3). When the load level changes from LO to LI, the gapping gate will try to limit the traffic by sending a call gapping request to both SSPs. Such a request typically comprises the following groups of parameters: (1) gap criteria, (2) gap indicators, and (3) gap treatment. The gap criteria identify the portion of the traffic that is the object of the call gapping operation, for example, only calls starting with 800 can be limited. Gap indicators define the maximum number of initial messages (calls) U allowed in a time unit (in fact the gap indicators define the shortest allowable interval I = 1/U between two successive initial messages, which, in principle, amounts to the same thing) and the duration of the restriction T, whereupon the rate of initial messages between the arrival of the call gapping request and the end of the duration can be at most the aforementioned maximum. The operation of this call gapping method is illustrated in Figure 8. When the traffic rate (shown on the horizontal axis) offered by the network is less than the aforementioned maximum U, there is no call gapping. When the offered traffic rate exceeds this value, the SSP rejects some of the calls so that the rate of the transmitted traffic (shown on the vertical axis) will be U. An ideal case is described by a broken line, and a real situation by a continuous line. In practice, the characteristic is a continuous approximation of the piecewise linear characteristic of the ideal case. This is due to the fact that the offered traffic is not divided evenly on the time axis. The gap treatment parameters determine what to do with rejected calls. For example, the speech channel of a rejected call can be connected to a voice announcement or to a busy tone. In addition, the call gapping request contains a control field which indicates whether the call gapping request comes from an automatic overload prevention mechanism or from an SCP operator. The above-described groups of parameters are disclosed in the aforementioned standard ETSI IN CS1 INAP Part 1: Protocol Specification, Draft prETS 300374-1, November 1993, Item 7.3.6, which is referred to for a more detailed description. When a call gapping request arrives at an SSP, the SSP creates, based on the information it has received, an image of the sending gapping gate (i.e. the subsystem controlled by the gapping gate). This is illustrated in Figure 9, wherein the overloaded block (C) is denoted by hatching and the call gapping request transmitted by the SCP by the reference CG. By means of the gap criteria and this image, the SSP identifies the traffic that is directed to the overloaded subsystem and restricts the rate of this traffic. When the period of time indicated in the call gapping request expires, the SSP destroys the image of the subsystem from its memory. The gapping gate in the SCP is "static", i.e. it exists all the time. The image of the gapping gate (or the corresponding subsystem) in the SSP is temporary; the SSP creates the image when it receives a call gapping request and destroys it when the duration T specified in the call gapping request has expired. When the SSP receives a call gapping request containing the same gap criteria as an already existing image, the other parameters of that image will be updated to correspond to the new ones. Another approach is to view the images (copies) in the SSP as objects with two states: active and passive. When an image receives a call gapping request, it turns active and starts to restrict traffic. When the image is in the active state it can receive several call gapping requests from the SCP. When the duration specified in the last call gapping request expires, the image turns passive again. When two of the subsystems in the SCP are simultaneously overloaded, there is correspondingly an image (copy) of each gate in the SSP. As more and more subsystems become overloaded, the logical structure of the images in the SSP starts to resemble the hierarchy of the gapping gates in the SCP. This process is illustrated in Figure 10. The aforementioned ETSI standard (Item 7.3.19.1.1) also defines a special "call gap encountered" indicator, which the SSP adds to the initial message if the call has passed through the gapping gate. This indicator thus informs the SCP that the concerned SSP performs call gapping. However, the SCP cannot be certain that the SSP performs the call gapping with the correct parameters, wherefore the SCP cannot trust this indicator in making decisions about whether to send a call gapping request or not. An example of this is a network which comprises one SCP and several SSPs, and in which network one of the SCP subsystems is on the load level Ll having a corresponding upper limit U, to be indicated to the SSP, of e.g. 10 initial messages (10 calls) per second. If the load level now changes from Ll to L2, having a corresponding upper limit of e.g. 5 initial messages (5 calls) per second, the SCP transmits a call gapping request CG containing a new upper limit to each SSP. In this situation, if the data of some SSPs will not be updated, for example due to faults, then these SSPs continue restricting the traffic with the old (higher) value of U until the duration indicated in the call gapping request expires. Due to this, the concerned subsystem may move further to the next load level L3. The SCP cannot distinguish between updated and non- updated SSPs, since the same indicator is received from all SSPs. There have been efforts to solve the problem in the manner described in the beginning, so that the same call gapping request is repeated after each initial message arriving from the SSP. However, this arrangement produces (a) more traffic over the signalling link between the SCP and the SSP, and (b) repeated updating of the information (subsystem images), concerning the SCP, in the SSP. According to the present invention, the operation proceeds in such a way that the central node SCP maintains in its memory, by means of e.g. a counter, an integer which is called in this connection a "global stamp". Initially the value of the stamp is zero. When the load level of any subsystem of the central node changes (i.e. the restriction parameters change), the corresponding gapping gate increments the value of the global stamp by one, reads the value of the new stamp and stores it in its internal data. The stored stamp is called in this connection a "local stamp". The value of the local stamp identifies, at any moment of time, the restriction parameters used by that gapping gate (and the concerned subsystem). The principle is illustrated in Figure 11, wherein the counter is denoted by reference numeral 110 and the local stamp is shown only for the subsystem E, for the sake of clarity. When a gapping gate transmits a call gapping request, it adds this local stamp to the call gapping request message CG transmitted to a peripheral node. When the peripheral node SSP receives this call gapping request message, it stores the value of the stamp in the message to the data of the corresponding image (copy). After this, if a call from a peripheral node passes through the call gap control, the initial message to be transmitted contains this stamp identifying the restriction parameters used by the peripheral node. In the central node, the gapping gate decides, in the manner shown in Figure 12a, on the transmission of a call gapping request. A received initial message is first examined to see if it contains a stamp (phase 112). If the received initial message contains no stamp, it means that the peripheral node SSP does not have the image of the central node gapping gate (i.e. the peripheral node does not restrict the calls) . A call gapping request is then transmitted (phase 114). If the received initial message contains a stamp, its value RS is either equal to or different from the value of the local stamp LS. If the examination performed in phase 113 shows that the values are equal, then the image of the gapping gate is correctly updated and no call gapping request will be transmitted. If the values are different, a call gapping request will be transmitted to the concerned peripheral node (phase 114). The transmission of the call gapping request can also be described in the following manner: transmit a call gapping request if there is no stamp in the initial message or if the stamp of the service request message ≠ local stamp. At least one pair of comparing means 122 have thus been added to the central node, as shown in Figure 12b, the comparing means comparing the stamp received from the receiver means 121 with the local stamp LS, and controlling the node transmitting means 123 to transmit a call gapping request CG according to the result of the comparison. The aforementioned ETSI standard (Item 7.3.6.11) defines four different gap criteria, one of which is the called address. As it was already described above, the SCP can be seen as a hierarchial structure of subsystems, wherein the traffic of each subsystem is controlled by a gapping gate. Such a subsystem is the part of the SCP having its own unique gap criteria. This also means that the less precisely the gap criteria are determined, the greater the portion of the traffic they relate to, and the higher the position of the corresponding subsystem in the hierarchy. For example a subsystem having the criteria "called address starts with number 3" is higher up in the hierarchy than a subsystem having the criteria "called address starts with numbers 314". When the SSP contains at least two active images (copies) which are located one after another in the above-described hierarchy, for example subsystems A, B and C in Figure 11, it must be decided how to restrict calls to these subsystems. The SSP can contain for example two images in such a way that in the first image the criterion is "called address starts with numbers 800" and the maximum rate U is 10 initial messages/s, and in the second image the criterion is "called address starts with numbers 80012" and the maximum rate U is 5 initial messages/s. When a subscriber dials for example the number "800123", it is possible in principle to filter that call according to the parameters of either image. However, using the parameters of the first image is incorrect, since then the gate which created the image located at a lower level in the hierarchy may receive as many as 10 initial messages/s, even though only 5 initial messages/s are allowed. Neither is it right to use the parameters of the second image only, whereas using the parameters of both images in the call gapping provides the correct result in all cases. When the call data matches the gap criteria of several active images, the call must pass through the call gap control of all these images. If the call cannot pass through all the images (gates), it will be rejected. The principle described in the previous paragraph has the following effect on the present invention. The initial message must contain an array of stamps; that array contains the stamps (stamp values) of all the active images the call has passed. The array may thereby be empty (no stamps) or there may be one or several stamps. The gapping gate of the subsystem of the central node SCP examines whether the array contains the value of its own local stamp. If the value is absent, the gate transmits a call gapping request to the SSP. According to the invention, additional data, a stamp or a stamp value identifying the restriction parameters used in the SCP is added to the data field concerning call gapping in the message to be transmitted from the SCP. The data field, referred to in the standards as "CallGapArgument", to be transmitted in the call gapping request message is shown in Figure 13. For the sake of clarity, the figure shows the fields with the same names they are disclosed with in the standard. Gap criteria, gap indicators, control type, gap treatment and extension are in succession within the data field. Control type and gap treatment are optional. The extensions form a free space that the manufacturers can utilize in several ways. According to the invention, the stamp is either added between some of the aforementioned fields as a separate field, or it may be placed inside the extensions. The advantage of the latter alternative is that such a call gapping request message complies fully to the present standard. It is also possible that the stamps of two or more simultaneously overloaded subsystems are placed in the same call gapping request message. The message then contains two or more CallGapArgument data fields and correspondingly at least two stamps. The aforementioned array of stamps is added to the initial message transmitted from the SSP. Figure 14 shows the data field of the initial message (referred to in the standard as the InitialDPArg). The data field of the initial request message contains the service key, called party number, calling party's number, calling party category, the aforementioned call gap -encountered indicator and the extensions. According to the invention, the stamp array (containing one or several stamps if the SSP performs call gapping, or no stamps if the SSP does not perform call gapping) is added either between some fields as a separate field or the stamp array is placed within the extensions. The advantage of the latter is again that this kind of initial message complies fully with the present standard. Since the size of the global stamp is in practice limited, it cannot be incremented forever. If the size of the variable is, for example, one octet (8 bits), its maximum value is 2 Θ -1 = 255. When a gapping gate tries to increment a stamp that is at its maximum, the value will not increase, but it will jump back to zero (roll-over of the counter). After this, it is possible that two or more gapping gates have the same local stamp value. The frequency of occurrence of such an event depends on the relative speed with which the gates update their restriction parameters and on the maximum value of the counter. The problem resulting from the roll-over of the counter can be completely ignored, however, especially if it is certain that it does not occur too often. If it is not certain, the problem can be avoided in such a way that the roll-over provides a new value for the stamp of each gate, even if the restriction parameters of the gate have not changed. The call gapping requests transmitted after this provide new stamp values for the images of gates in the peripheral nodes. Instead of a counter to be incremented, the global stamp can naturally also be maintained with a counter that is decremented. Instead of an integer maintained by the counter, the global stamp may in principle consist of any data that uniquely identifies the restriction parameters, for example of the current value of the central node clock. While a call gapping request is on its way to the central node, the peripheral node may transmit some initial messages with the old stamp value. Each of these initial messages brings about the transmission of a call gapping request with a new stamp value from the central node. Thus due to the network delays, the call gapping request might have to be repeated several times. According to a preferred embodiment of the invention, the above-described basic principle can be modified in such a way that the central node only examines a predetermined proportion of the total number of initial messages it has received. In the following, this predetermined proportion will be described with p (0 < p ≤ 1). For a source (peripheral node) transmitting at a rate exceeding the threshold U (initial messages/ second) this guarantees a call gapping request on average within at least l/(pU) seconds. The advantage of this embodiment is that in the central node the amount of work due to comparison is reduced by l/(l-p). This kind of operation is preferably implemented in such a way that for each incoming initial message, a random number R, for which 0 ≤ R ≤ 1 holds, is generated in the central node SCP. If this number is smaller than the parameter p, the array of stamps is examined. The decision-making can thus be described in the following manner: examine the received stamp array, if R < p, where 0 ≤ R ≤ 1, and 0 < p ≤ 1. The operation is also illustrated in the flow chart of Figure 15, which corresponds to the basic principle shown in Figure 12, except that in this case the comparison of the random number R with the parameter p (phase 111b) is performed before the examination of the stamp (phase 112). If R < p, the operation continues in the above-described manner, but if R > p, then the array of stamps is not examined at all (i.e. the operation proceeds to phase 115). The invention is described above with reference to the Intelligent Network. This means that the node providing services comprises several subsystems in the above-described manner. However, the irethod according to the invention is applicable ιr. ar-. network with a similar basic situation. This means that there might be only one subsystem in the node providing services, whereupon it is sufficient to transmit the value of a maximum of one stamp in the messages. Even though the invention is described above with reference to the examples according to the accompanying drawings, it is clear that the invention is not restricted thereto, but it may be modified within the scope of the inventive idea disclosed above and in the appended claims. The method according to the invention can be applied for example in a certain part of the traffic. The number of the parameters used in the call gapping operation may also vary, wherefore a group of parameters must be understood as a group containing one or several parameters. Since the arrangement according to the invention can in principle be applied in any telecommunications network having the basic situation according to Figure 1, the central node is referred to in the appended claims as a service node (not restricted to an Intelligent Network) and the peripheral node in turn as a node (not restricted to a star network). The service requests must also be understood to relate generally to any services the performance of which loads the service node.

Claims: Claims: 1. A method of preventing an overload in a telecommunications network node, the network comprising at least one service node (CN; SCP) and at least one other node (PN; SSP) from which the service node receives service requests, according to which method the service node transmits restriction requests (CG) to a node connected thereto, so that said node would restrict the number of service requests it transmits towards the service node, the restriction request comprising a group of parameters indicating how the node should perform restriction, a restriction request being transmitted at least whenever said group of parameters changes, c h a r a c t e r i z e d in that - the service node adds to the restriction request it transmits information identifying the aforementioned group of parameters, on the basis of which the node should perform restriction, - the node copies said information into its memory and transmits the data identifying the groups of parameters it uses back to the service node, and - the service node compares said data with the data it has transmitted, and decides on the basis of the comparison whether a restriction request is transmitted to the node which transmitted the data. 2. A method according to claim 1, c h a r a c¬ t e r i z e d in that the node transmits the data identifying the groups of parameters it uses back to the service node together with a service request. 3. A method according to claim 1, c h a r a c¬ t e r i z e d in that the data identifying the group of parameters is maintained in the service node by means of a counter (110). 4. A method according to claim 3, c h a r a c- t e r i z e d in that whenever the counter rolls over, all data identifying the groups of parameters used in the service node are changed in the service node. 5. A method according to claim 2, c h a r a c¬ t e r i z e d in that the service node performs the comparison only to a predetermined proportion (p) of the total number of service request messages it has received. 6. A method according to claim 1, c h a r a c¬ t e r i z e d in that the service requests transmitted towards the service node are restricted by restricting the number of service requests transmitted per time unit. 7. A method according to claim 1, c h a r a c¬ t e r i z e d in that the service requests transmitted towards the service node are restricted by restricting the number of service requests transmitted towards the service node to a certain percentage of the total number of service requests. 8. An arrangement in a telecommunications network node, the network comprising at least one service node (CN; SCP) and at least one other node (PN; SSP) from which the service node receives service requests, according to which arrangement the service node transmits restriction requests (CG) to a node connected thereto, so that said node would restrict the number of service requests it transmits towards the service node, the restriction request comprising a group of parameters indicating how the node should perform restriction, a restriction request being transmitted at least whenever said group of parameters changes, c h a r a c t e r i z e d in that the network service node comprises comparing means (122) for comparing the data (LS) stored in the node and identifying the group of parameters to corresponding data received from another network node, the comparing means being operationally connected to control the transmission of the restriction request (CG) from the service node.

Inventors: GINZBOORG PHILIP, GINZBOORG, PHILIP
Applicants: GINZBOORG PHILIP, NOKIA TELECOMMUNICATIONS OY, GINZBOORG, PHILIP
Application year: 1995
Main classification: H04Q3
IPC codes: H04Q3