METHOD FOR PREVENTING CIRCULAR ROUTING IN A TELECOMMUNICATION NETWORK

Abstract: The invention relates to a method for preventing circular routing in a telecommunication network, particularly in a common channel signalling network. In the method the availability of a particular route is notified by sending particular management messages from a node to another (A through D). In this case, e.g. a node acting as a signal transfer point, sends to its adjacent nodes particular transfer-prohibited messages (TFP) notifying said adjacent nodes that they must no longer route messages destined to the nodes mentioned in the TFP messages via said node that sent the TFP messages. In order to prevent circular routing without unnecessarily making nodes inaccessible, (a) transfer-prohibited messages (TFPp) used only for preventing circular routing are made distinguishable from said transfer-prohibited messages (TFP), (b) when receiving a preventive transfer-prohibited message (TFPp) relating to a particular destination node, a node sends a corresponding message to the adjacent nodes via which it routes messages to said destination node, and (c) each node stores route-specific information on the type of the last transfer-prohibited message (TFP or TFPp) received.

Description: Method for preventing circular routing in a telecommunication network The invention relates to a method according to the preamble of the attached claim 1 for preventing circular routing in a telecommunication network. In principle the solution of the invention is applicable to any communication network, but is, how¬ ever, primarily intended to improve the management of routing in a common channel signalling system. This signalling system is described in detail in the CCITT blue book Specifications of Signalling System No. 7 (Melbourne 1988). In common channel signalling, the method of the invention is limited particularly to the message trans¬ fer part (MTP) acting as the transmission system of this network. MTP transfers signalling messages between loca¬ tions of user functions. Circular routing refers to a situation where messages sent in a network start to circle in a loop and never reach the destination node. The messages may then even return to the originating node for onward routing towards the same destination. Point 13 in the CCITT recommendation Q.704 proposes that particular management messages be used for notifying of the unavailability, restriction and avail¬ ability of a signalling route. These messages include e.g: - transfer-prohibited messages whereby the node acting as a signalling transfer point notifies adjacent signalling points that they must no longer route signal¬ ling messages via that transfer point, - transfer-allowed messages whereby the node acting as a signalling transfer point notifies adjacent signalling points that they may route signalling mess¬ ages via that transfer point, - transfer-restricted messages whereby the node acting as a signalling transfer point notifies adjacent signalling points that they should, if possible, no longer route signalling messages via that transfer point. According to the recommendation, transfer- restricted messages are a national option. Below, transfer-prohibited messages are refer- red to as TFP messages, transfer-allowed messages as TFA messages and transfer-restricted messages as TFR mess¬ ages. As a signalling network is concerned, the nodes are also referred to as signalling points. For a more detailed description of the messages, reference is made to said recommendation. The problem of the procedures described in the CCITT recommendation is that the TFP messages prevent a loop between two points but are unable to prevent loops involving three or more signalling points. This is illustrated by an exemplary network of Figures la through Id comprising four signalling points A through D. A primary route, denoted by reference I, and a sec¬ ondary (standby) route, denoted by reference II, origin¬ ates from each signalling point. (This example where standby routes form a loop, cf Figure la, is quite clas¬ sical. ) Following notations are used in the description: A: B AV-EX a route originating from point A passing subsequently via a channel system leading to point B is in status AV-EX. The statuses of the routes are as follows: AV-EX a route transmitting traffic, AV-SP an available standby route, UA-link an unavailable route because of channel system failure. With all channel systems leading to point D available (Figure la), routing information of the sig¬ nalling network to point D is as follows: (i) A: D AV-EX B: D AV-EX C: D AV-EX B AV-SP C AV-SP A AV-SP. Should channel system C → D fail (Figure lb), signalling point C switches to channel system A and sends a TFP message (A→C→D) (a TFP message prohibiting message transmission from point A to point D via point C). Said route is unavailable to signalling point A, and the routing status remains as: (ii) A: D AV-EX B: D AV-EX C: D UA-link B AV-SP C AV-SP A AV-EX. Should channel system B → D fail subsequently (Figure lc), signalling point B switches to channel system C and sends a TFP message (C→B→D). Signalling point C does not process the TFP message because said route is unavailable to it, and the current routing status is: (iii) A: D AV-EX B: D UA-link C: D UA-link B AV-SP C AV-EX A AV-EX. Should channel system A → D fail subsequently (Figure Id), the present CCITT standards lead to circu¬ lar routing. Now signalling point A switches to channel system B and sends a TFP message (B→A→D). Signalling point B does not process the TFP message because said route is unavailable to it, and the final routing is: (iv) A: D UA-link B: D UA-link C: D UA-link B AV-EX C AV-EX A AV-EX. The above results in the messages addressed to signalling point D circulating in a loop between points A, B and C until overload causes intra-nodal restarts. These are of no help, and routing always returns to the status (iv). The above problem has been recognized and some methods have been realized for preventing the above cir¬ cular routing. An improved method (presented by British Telecom) is based on the signalling point sending more frequent TFP messages; having started to direct signal¬ ling traffic destined to point X to a standby route, the signalling point (node) sends a TFP message concerning destination point X to all adjacent nodes. When switch¬ ing onto a standby route, the node in fact prohibits its adjacent nodes from using itself as a transfer point. This prevents circular routing unless a loop is formed from primary routes, but often results in the signalling points being unnecessarily inaccessible. The problems of the latter method are disclosed in a very simple and realistic network presented in Fig¬ ures 2a and 2b, where no circular routing could even occur. Signalling point A (i.e. node A), located fur¬ thermost from signalling point D, routes signalling messages destined to point D via point B. Point B may convey the messages to point D either direct or, in an emergency, via point C. With all channel systems leading to point D available (Figure 2a), the routing information of the signalling network to point D is (using the above notations): (i) A: B AV-EX B: D AV-EX C: D AV-EX. C AV-SP Should channel system B → D fail (Figure 2b), signalling point B switches to channel system C and no- tifies all adjacent points of switching onto a standby route by sending messages TFP(A→B→D) and TFP(C→B→D). Having received the message TFP(A→B→D), signalling point A recognizes that point D is no longer accessible and sends in turn a message TFP(B→A→D) (the latter trans- mission is based on the transfer-prohibited transmission method of the CCITT specification Q.704 point 13.2.2 ii). The final routing status is thus: (ii) A: D UA-TFP B: D UA-link C: D AV-EX. C AV-EX where UA-TFP indicates that the route is unavailable because of a TFP message. In the above method, wherein a TFP message is always sent when switching onto a standby route, a signalling point (point D above) is unnecessarily made inaccessible. The object of the present invention is to elim¬ inate the above disadvantage and to provide a method wherein the signalling point is not unnecessarily made permanently inaccessible, but by means of which circular rerouting may, however, be reliably prevented. This is achieved with the method of the invention, which is characterized by what is set forth in the characterizing part of the attached claim 1. The idea of the invention is to distinguish the TFP messages sent in a network for preventing circular routing from other TFP messages and to send said mess¬ ages concerning a certain destination node to the adja¬ cent nodes via which the node itself routes messages to said destination node, and to store in a node route- specific information on the type of the last TFP message received. By means of the method the network is automat¬ ically able to recover from the circumstances which led to circular routing and to find a non-circular routing provided the routing information of the network allows this. The method sets no equipment requirements on the nodes of a network; they may be realized completely similar as in cases where they comply with the method described in the CCITT. (The minor changes required by the method of the invention, described below, may be realized by node software. ) In accordance with a highly preferable embodi¬ ment of the invention the nodes using the method send a new type of test message, different from the known test message, in order for the node receiving the test message to distinguish the nodes using the method from the other network nodes. A major additional advantage of this embodiment is that the nodes using the method are at all times compatible with the nodes not recog¬ nizing this method but acting completely in accordance with the CCITT recommendations. Hence all network nodes do not have to be similar, although efficient utiliza¬ tion of the method is subject to several nodes support- ing it. In the following the invention and its prefer¬ red embodiments will be described in greater detail with reference to examples in accordance with the accompany¬ ing drawings, in which Figures la through Id show an example of a network in different situations, Figures 2a and 2b show another example of a network in two different situations, Figure 3a shows the structure of a transfer- prohibited message, Figure 3b shows the structure of a test message used in testing the availability of a signalling route, and Figures 4a and 4b show two different situations involving a network where a node has been added to the network of Figure 1. The method of the present invention is also based on more frequent transmission of TFP messages than presented in the CCITT recommendation Q.704. In accord- ance with the invention a part of TFP messages, i.e. the messages used only for preventing circular routing, are coded differently from other TFP messages. These mess¬ ages, also called preventive TFP messages, comply with the CCITT specification Q.704 point 13.2.2 i. According to the recommendation, signalling transfer point Y sends preventive TFP messages concerning destination point X when it starts to route signalling destined to point X via a transfer point Z not currently used by transfer point Y for this traffic. In this case the message is sent to transfer point Z. Figure 3a shows the structure of a TFP message in the form presented by the CCITT recommendation Q.704. The message comprises first (transmission is from right to left) a 32-bit label field 31 containing information on the transmitter and receiver of the message. The label field is succeeded by a first 4-bit heading code HO, a second 4-bit heading code HI and a 14-bit destina¬ tion field 34 indicating to which signalling point the message relates. The message ends in two spare bits 35, coded with the value 00 in all TFP messages in accord¬ ance with the recommendations. In accordance with the invention, the coding of the above preventive TFP messages is changed so that they may be distinguished from the other TFP messages at a receiving signalling point. This may be accomplish¬ ed by e.g. coding the spare bits of said TFP messages with a deviating value, e.g. 01. As these preventive TFP messages (denoted by TFPp below) are distinguishable from other TFP messages, they may be utilized for revealing a loop of at least 3 signalling points. This means that node A receiving a message TFPp(A→B→C) (read: transfer of messages from point A to point C via point B is prohibited because of a loop) must send a corresponding message to all the adjacent signalling points (e.g. D and E) through which it routes signalling messages to point C. Node A must thus change the address point codes to D and E, and send forward the preventive TFP messages otherwise unchanged. In this particular case it would send the messages TFPp(D→B→C) and TFPp(E→B→C). The same criteria are used when these TFPp messages are sent forward from the sub¬ sequent signalling points (sent to the subsequent sig¬ nalling points through which the signalling point itself routes messages to said destination point). In this way the message transfer part (MTP) of a signalling system detects a loop one node before it would close. A signalling point (i.e. a network node) re¬ ceiving a TFPp message concerning a route it considers available, notes the unavailability of the route and performs rerouting, if possible. In this respect the signalling point processes these messages like any other TFP messages. Additionally, the signalling point stores route-specific information on the type of the last TFP message received. If a signalling point becomes inac- cessible and if using the route leading to it is pro¬ hibited by a TFPp message, the message transfer part (MTP) may notify the user that prevention of circular routing is causing the inaccessibility of said signal¬ ling point. If the situation persists for more than a few seconds, the message transfer part may generate an alarm signal. The operator may thus check if errors have been made in planning the signalling network. The mess¬ age transfer part could also ask the OMAP user part de¬ fined in the CCITT recommendation Q.795 to check the routing. When recovery from a situation leading towards circular routing is required, the control procedures of a signalling network must be changed to allow this. The object of the present invention is to limit the changes as far as possible to a state in which using a route is prohibited because of a loop (i.e. a route status caused by a TFPp message received by the signalling point in question). This route status is denoted below by the reference UA-TFPp (route unavailable because of a TFPp message). The method could also be realized e.g. so that when taking into use a route made unavailable by an ordinary TFP message, the procedure would always be the same as when its status is UA-TFPp, but this is not recommendable as it would affect excessively the action of the message transfer part even when the danger of circular routing is nonexistent. A route in an UA-TFPp status is tested in ac¬ cordance with the CCITT recommendation Q.704 point 13.5 by sending a test message to an adjacent signalling point for testing if messages to a certain destination point may be routed via said adjacent signalling point. In principle, the testing is effected in the same way as when the route is unavailable because of an ordinary TFP message. The test message is sent (when necessary) for the first time immediately after a TFP or TFPp message. In accordance with a preferred embodiment of the invention, the coding of the route set test (RST) message is changed so that the receiving signalling point may detect if the transmitting signalling point "knows" the method according to the present invention for preventing circular routing. This may be accom¬ plished by a similar change as with the TFP messages, i.e. by coding the spare bits of an RST messages in a different manner. Figure 3b shows the structure of an RST message. As the structure corresponds to that of a TFP message (Figure 3a), corresponding fields are denoted by the same reference numbers, but in Figure 3b primed numbers are used for denoting that two different messages are involved. (The heading codes HO and HI indicate if a message is a TFP or an RST message. ) The change in coding RST messages may be effected e.g. by coding the end part 35, comprising two spare bits, in a different manner, e.g. with the value 01 (in accord- ance with the CCITT recommendations the end part of all RST messages is coded with the value 00). A test message coded in this new manner is denoted by the abbreviation RSTp below (to distinguish it from the usual test mess¬ age RST coded in a known manner). Additionally, small changes have to be made in the response logic of the method as two different types of TFP messages are used therein (the transmission logic functions completely in accordance with the standard). In accordance with the invention, the route set test (RST or RSTp) message is always answered by an ordinary TFP message if said route set is unavailable (according to the CCITT recommendations, no response (TFP message) is given in this case as it is in a way useless because an RST message is meant to be sent when the last message received is a TFP message. However, as the method of the invention uses two types of TFP messages, a response is called for. ) Should the taking into use of a route to be tested result in a loop between two signalling points, a preventive TFP message, i.e. a TFPp message, is used in response. If nothing seems to prevent the use of the route to be tested, and the testing signalling point uses the new route set test message (RSTp) in accordance with the preferred embodiment of the inven¬ tion, an above-described TFA or TFR message is sent at first in response. Immediately thereafter TFPp messages are sent to the transfer points via which the messages of the route set to be tested are routed, to avoid any kind of oscillation. (According to the CCITT specifica¬ tions, only a TFA or TFR message is sent in response. ) If e.g. node A tests route A→B→D, and messages pass from node B to node D via route B→C→D, node B should send to node C a preventive transfer-prohibited message concern¬ ing route C→B→D (TFPp(C→B→D) ). If, however, a testing signalling point uses a conventional type of test mess- age (RST), it may thus be assumed (as the testing sig¬ nalling point uses a new test message RSTp) that it does not "know" the new method for preventing circular rout¬ ing of the invention, and thus TFPp messages should not be sent as they could cause oscillation (RST-TFA-TFP- RST-TFA-TFP ). After a TFA or TFR message nothing is thus sent. It should be observed that the coding of the RST message does not necessarily have to be changed if it is certain that all network nodes function otherwise in the manner of the invention (i.e. "know" the method for preventing circular routing). It is, however, pre¬ ferable to change the coding as the above oscillation is thus prevented in all cases (new and old types of nodes are mixed in the network). If the status of a route is UA-TFPp, which route according to the CCITT recommendation Q.704 would become available after reception of a TFA or TFR mess¬ age, the route waits, in accordance with the preferred embodiment of the invention, for a certain guard time, in practice about a second, before becoming available. A preventive TFP message (i.e. a TFPp message) concern¬ ing said route may arrive after a while e.g. as a result of the above test, and a guard time is needed to prevent a ping-pong occurrence. When receiving a TFPp message during the guard time, a node may not send a new route set test message, but it is repeated only until a con¬ trol period T10 of the CCITT recommendation Q.704 has expired. This limitation is used only when the guard time of the invention is effective. Once the node re¬ ceives a TFA or TFR message in response to an RST mess- age (in practice not later than a second after the transmission of a RST message), the node waits for said guard time, also in the UA-TFP status, before making said route available. Additionally, when an unavailable route set becomes available (having been unavailable for any reason), transmission of TFA and TFR messages to all adjacent nodes must be delayed for a waiting period of the same length. First TFPp messages must be sent to the points through which messages are routed to the route set that has become available. After a certain waiting period, e.g. about a second, TFA and TFR messages are sent first and the same TFPp messages thereafter. This again prevents a ping pong occurrence (cf point (vii) in the next example). The waiting period ensures that the TFPp messages sent first reach their destination be¬ fore the TFA and TFR messages. TFPp messages are sent first in order for the receiving end, which has been in an UA-TFP status, to shift to an UA-TFPp status so that it does not immediately react to a TFA or TFR message (as it would in a TFP status), but instead waits for the above second, and thus a ping pong occurrence is prevented. In the following the method of the invention will be described by means of an example in accordance with Figures la through Id, wherein the standby routes form a loop in the basic situation. The example uses the same notations as above, but here the routes have dif¬ ferent statuses according to which type of TFP message has caused the route to become unavailable: UA-TFPp unavailable because of a TFPp message UA-TFP unavailable because of an ordinary TFP message. With all channel systems to point D available (Figure la), the routing information of the signalling network to point D is: (i) A: D AV-EX B: D AV-EX C: D AV-EX B AV-SP C AV-SP A AV-SP. In case of failure in channel system C → D (Figure lb), point C switches to channel system A and sends a TFPp(A→C→D) message (to point A). Signalling point A does not send this message forward, as it does not route messages to point D via the transfer point. The routing situation will remain as: (ii) A: D AV-EX B: D AV-EX C: D UA-link B AV-SP C AV-SP A AV-EX. In case of failure in channel system B → D (Figure lc), point B switches to channel system C and sends a TFPp(C→B→D) message. Point C sends the message forward in the form TFPp(A→B→D), as it routes messages destined to point D via point A. Signalling point A will take this message into consideration in its routing tables, but does not send it forward, as in the network it does not route messages to point D via a transfer point. The current routing situation is: (ϋi) A: D AV-EX B: D UA-link C: D UA-link B UA-TFPp C AV-EX A AV-EX. In case of failure in channel system A → D (Figure Id), circular routing, which would otherwise be generated (when acting according to the present CCITT standards), may be prevented by means of the method of the invention. If the channel systems fails, signalling point A notices that point D is no longer accessible to it. This is because point A has previously received a TFPρ(A→B→D) message, and after the failure both routes are thus unavailable. As a result point A notifies all adjacent points of the situation, in accordance with the transmission-prohibited method, by messages TFP(B→A→D) and TFP(C→A→D). Similarly, having received said TFP message, signalling point C notices that point D is no longer accessible to it. Point C sends corresponding messages TFP(A→C→D) and TFP(B→C→D). Hereby point B also detects the inaccessibility of point D and sends messa¬ ges TFP(A→B→D) and TFP(C→B→D). Lastly, point A updates the status of the route passing via point B to its rout- ing table, whereat the final routing is: (iv) A: D UA-link B: D UA-link C: D UA-link B UA-TFP C UA-TFP A UA-TFP. The above results in a situation where messages may no longer be sent, but circular routing has also been prevented. If a route existed from point B to point D via point UR in accordance with Figure 4a, and signalling traffic were not transferred to said route until the two other routes were unavailable, routing tables would look in phase (iii) as follows: (v) A: D AV-EX B: D UA-link C: D UA-link UR: D AV-EX. B UA-TFPp C AV-EX A AV-EX UR AV-SP If channel system A → D fails at this point (Figure 4b), signalling point A notices, as in the cor¬ responding situation above, that point D is no longer accessible to it and notifies, in accordance with the transfer-prohibited method, all adjacent points by mess¬ ages TFP(B→A→D) and TFP(C→A→D). After receipt of said TFP message, signalling point C also notices that point D is inaccessible. Consequently point C sends messages TFP(A→C→D) and TFP(B→C→D), as above. Signalling point B has to reroute traffic to point D via point UR. In association with the rerouting it sends messages TFA(C→B→D) (this message is a TFA message according to said CCITT specification point 13.3.2 i, allowing point B to route messages destined to point D via point C, which is now allowed) and TFPp(UR→B→D). These messages cause no further action, and for a while routing remains in the status: (vi) A: D UA-link B: D UA-link C: D UA-link UR:D AV-EX. B UA-TFPp C AV-TFP A UA-TFP UR AV-EX As the route in an UA-TFPp status is tested in the same manner as the route in an UA-TFP status (cf point 13.5 in the above specifications), signalling point A sends no later than after approx. half a minute a route set test message RST(A→B→D) (i.e. point A in¬ quires of point B if routing is allowed from point A to point D via point B). Point B answers as described above by messages TFA(A→B→D) and TFPp(UR→B→D). Having received a TFA message, point A waits for the above guard time for potential re-sent TFPp messages. These do not, how¬ ever, arrive, as point UR does not send forward the TFPp message it received. Thus point A starts routing traffic to point D via point B, and the route status is: (vii) A: D UA-link B: D UA-link C: D UA-link UR:D AV-EX. B AV-EX C UA-TFP A UA-TFP UR AV-EX Signalling point A notifies its adjacent points that point D is again accessible to it by first sending a message TFPp(B→A→D) and, after a waiting period of approx. one second, messages TFA(C→A→D) and TFPp(B→A→D). Point B sends forward messages TFPp(UR→A→D) but point UR does not react as it does not route messages to point D via a transfer point. Instead, on reception of a TFA message, point C notices that point D is again access¬ ible to it and sends first a TFPp(A→C→D) message. This TFPp message is conveyed from point A to point B in the form TFPp(B→C→D). The status has become: (viii)A: D UA-link B: D UA-link C: D UA-link UR:D AV-EX. B AV-EX C UA-TFPp A AV-EX UR AV-EX Having waited for approx. a second, point C sends a message TFA(B→C→D) and re-sends the message TFPp(A→C→D). When receiving a TFA message, point B starts to wait for a TFPp(B→C→D) message. Point A sends this message to point B having received a TFPp(A→C→D) message. Thus point B does not perform rerouting, and the status (viii) prevails. At a proper time, when point B sends a route set test message RST(B→C→D), the same occurs. The status (viii) prevails until a route set directed to point D is again available (or until failure in the route set between points UR and D). As is evident from the above, the method of the invention is completely compatible with nodes unfamiliar with this method functioning purely in accordance with the CCITT recommendations. Such nodes interpret TFPp messages as regular TFP messages and act accordingly. Even though the invention has been explained in the above with reference to examples in accordance with the accompanying drawings, it is obvious that the invention is not restricted to them but can be modified within the scope of the inventive idea disclosed in the above and in the attached claims. E.g. buffering realized with delays is not necessary, but without it the risk of oscillation increases (the above ping pong occurrence).

Claims: Claims : 1. A method for preventing circular routing in a telecommunication network, especially in a common channel signalling network comprising several nodes (A through D), in accordance with which method - messages are routed from a particular source node to a particular destination node in the network, with the transmission of messages from a node to a par- ticular route leading to an adjacent node being based on a routing table maintained by the node, said table containing status information on the routes used by the node, - the availability of a particular route is notified by sending particular management messages from one node to another, whereat a network node acting as a signal transfer point, sends to its adjacent nodes special transfer-prohibited messages (TFP) notifying said adjacent nodes that they must no longer route mess- ages destined to the nodes referred to in the transfer- prohibited messages via said signalling transfer point which sent the transfer-prohibited messages, and - the availability of a particular route is tested so that a node sends to its adjacent node special test messages for testing if messages may be sent to a particular destination node via said adjacent node, c h a r a c t e r i z e d in that - transfer-prohibited messages (TFPp) used only for preventing circular routing are made distinguishable from said transfer-prohibited messages (TFP) in the net¬ work, so that a node sends said messages concerning a particular destination point when it starts to route messages addressed to said destination point via a node it is not at that moment using for such traffic, - when receiving a preventive transfer-pro¬ hibited message (TFPp) concerning a particular destina¬ tion node, a node sends a corresponding message to such adjacent nodes via which it routes messages to said des- tination node, and - each node stores route-specific information on the type of the last transfer-prohibited message (TFP or TFPp) received. 2. A method as claimed in claim 1, c h a r - a c t e r i z e d in that a node sends said test mess¬ ages (a) having received such a transfer-prohibited message (TFP) or such a preventive transfer-prohibited message (TFPp) that causes a route to shift into an unavailable status, or (b) as a result of expiration of a known time-out period in said status. 3. A method as claimed in claim 1, c h a r ¬ a c t e r i z e d in that distinction of transfer- prohibited messages is performed by coding the spare bits of the transfer-prohibited messages (TFPp) used for preventing circular routing in a different manner than the other transfer-prohibited messages (TFP). 4. A method as claimed in claim 2, c h a r ¬ a c t e r i z e d in that nodes applying the method send a different, new kind of test message (RSTp), com- pared with the known test message (RST), in order for the node receiving the test message to identify the nodes using the method from other network nodes. 5. A method as claimed in claim 2 or 4, c h a r a c t e r i z e d in that when a management message, denoting the availability of a route, is re¬ ceived in response to a test message, a route is not made available until a predetermined guard time has elapsed. 6. A method as claimed in claim 1, c h a r - a c t e r i z e d in that when an unavailable route set becomes available, a node delays transmission of corres¬ ponding management messages and sends first preventive transfer-prohibited messages (TFPp) for shifting the opposite end(s) first into said status. 7. A method as claimed in claim 4, c h a r ¬ a c t e r i z e d in that when receiving a test message of the new type (RSTp), a signalling point sends in re¬ sponse, in addition to a transfer-allowed message (TFA) known per se or a transfer-restricted message (TFR) known per se, preventive transfer-prohibited messages (TFPp) to the transfer points via which the signalling messages of the signalling point being tested are routed.

Inventors: HAVANSI KLAUS, HAVANSI, KLAUS
Applicants: HAVANSI KLAUS, NOKIA TELECOMMUNICATIONS OY, HAVANSI, KLAUS
Application year: 1995
Main classification: H04L12
IPC codes: H04L12, H04Q3