Background of the Invention
The present invention relates to a call process of a subscriber through a corresponding link when a link connecting each node (hereinafter referred to as a trunk link) is cut off in a switching network.
Assuming that subscribers A and B are talking over the telephone through a node 3 as shown in FIG. 1, if a trunk link connecting the node 3 to a node 4 is cut off, then a message of "link cut off" is transmitted to the subscribers A and B and a telephone call is disconnected. In this case, the disconnection of the trunk link can be caused by excessive errors, excessive loss of a message by the increase of load, etc. as well as the disconnection of a line. However, in FIG. 1, since there are another paths, for example, such as a path through a node 5 capable of speaking on the telephone between the subscribers A and B, it is undesirable to cut off a telephone call. In other words, since a decentralized switching network has various paths for connecting a specific node to another, even if a link between specific nodes is disconnected, a telephone call is possible without disconnecting a call.
Summary of the Invention
An object of the present invention to provide a call process method of a subscriber through a corresponding link when a trunk link is cut off, by re-establishing a call of the subscriber through a replaceable path.
In accordance with one aspect of the present invention, a method for managing a speech path link in a switching system, includes the steps of: renewing a routing table when a message of "link establish" is received; transmitting a message of "new information" to an adjacent node; renewing a routing table and transmitting a message of "new information" to an adjacent node when a message of "link cut off" is received, searching for a communicating subscriber through a corresponding link, transmitting a message of "path re-establish" when the subscriber is speaking on the telephone, and transmitting a message of "link cut off" to the subscriber when the subscriber is not speaking on the telephone; and renewing a routing table when a message of "new information" is received.
Brief Description of the Drawings
For a better understanding of the invention and to show how the same may be carried into effect, reference will now be made, by way of example, to the accompanying drawings, in which:
FIG. 1 is a diagram showing speech paths when subscribers are talking over the telephone;
FIG. 2 is a block diagram of a switching system applied to the present invention;
FIG. 3 is a diagram showing a routing table applied to the present invention; and
FIG. 4 is a flowchart showing a link management program according to the present invention; and
FIGS. 5A to 5E are flowcharts showing a call process program according to the present invention.
Detailed Description of the Preferred Embodiment
Referring to FIG. 2, a central processing unit 10 controls a switching system and a subscriber circuit 20 interfaces an extension subscriber. A switching circuit 30 implements switching of aural and signaling information through extension and office line interface under the control of the central processing unit 10. Ring and tone source circuits 40 and 50 generate ring and tone signals respectively. A trunk circuit 60 is interfaced with an official exchange system, and a trunk signaling circuit 70 performs signaling with an adjacent node in a network.
Referring to FIG. 3, a routing table includes links for proceeding to a specific node from the most preferable link to the worst link.
A link management program for managing a link state and the routing table, and a call process program for managing a call of a subscriber will now be described in conjunction with FIGS.4 and 5A-5E. The programs refer to each other and exchange a message.
Referring to FIG. 4, in step 131, if a message of "link establish" is received from the trunk signaling circuit 70 of FIG. 2 and a link control program is performed, a routing table as shown in FIG. 3 is renewed in step 132. Step 132 is followed by step 133 to transmit a message of "new information" to an adjacent node. If the message of "new information" is received in step 141, a routing table is also renewed in step 142. Meanwhile, in step 134, if a message of "link cut off" is received, a routing table is renewed in step 135. Step 135 proceeds to step 136 to transmit a message of "new information" to an adjacent node. Next, in step 137, a subscriber who is signaling or speaking on the telephone through a disconnected link is searched for. Following step 137, in step 138, a determination is made as to whether or not a subscriber is speaking on the telephone. If the subscriber is speaking on the telephone, step 138 proceeds to step 139 to transmit a message of "path re-establish" to a call processor and if the subscriber is signaling on the telephone, step 138 advances to step 140 to transmit a message of "link cut off" to the subscriber.
Referring to FIGS. 5A to 5E, a call processor checks, in step 150, whether a subscriber is speaking on the telephone or not and if the subscriber is not speaking on the telephone, step 150 is entered into a stand-by state. When the subscriber is speaking on the telephone, a determination judgement is made as to whether or not a message of "path re-establish" has been received in step 151. If the message is not received, program loops in step 151 until the message is received, and if the message is received, step 151 goes to step 152 to see if a corresponding node is a final destination of the message. When the corresponding node is not a final destination, that is, if it is an intermediate node, step 152 advances to step 153 where the message is transmitted to a next node. This is followed by step 154 to release a channel and resources relating to a previously established speech path. Next, program proceeds to a stand-by state.
On the other hand, if the corresponding node is a final destination of the message, step 152 is succeeded by step 155 to see if a presently performing call is an originating call. In this case, the originating call is determined by checking a call control block. Since the disconnection of a link is almost simultaneously sensed at two nodes connected thereto, a message of "path re-establish" is transmitted to originating and called party modules. In step 155, if the presently performing call is not an originating call, program advances to step 156 to release a channel between nodes and related resources and disconnect a speech path. In following step 157, a timer T1 for measuring a maximum standby time waiting for a message from the subscriber of the originating party is operated and program goes to a re-establish standby state. In step 155, if the presently performing call is an originating call, program is followed by step 158 to release a channel between nodes and related resources and disconnect a speech path. Subsequently, in step 159, a determination is made as to whether or not a replaceable path for proceeding to a destination node exists. If there is no a replaceable path, step 159 goes to step 160 to connect busy tone to a subscriber and advances to a busy state. If a replaceable path exists, step 159 advances to step 161 to search for a replaceable path except for a previously established path. This is followed by step 162 to search for a trunk channel and related information necessary for a call process between nodes. Next, a message of "path re-establishment request" is transmitted to a destination node, in step 163. In step 164 following step 163, a timer T2 for measuring a maximum standby time waiting for a message from the subscriber of the called party is operated. Thus, program goes to a re-establish request state.
Meanwhile, under the re-establish standby state of the subscriber of the called party, program checks, in step 165, whether a maximum standby time of the timer T1 is over or not. When the maximum standby time is over, step 165 is succeeded by step 166 where busy tone is connected to a subscriber since there is no a replaceable path with an originating party and entered into a busy state. If the maximum standby time is not over, step 165 is followed by step 167 to see if a message of "path re-establish request" has been received. If the message has been received, step 167 advances to step 168 to stop the timer T1, and otherwise, step 167 returns back to step 165. In step 169 following step 168, counterpart's information and channel information is renewed from a received message. In step 170, a trunk channel is occupied and related information is stored. Step 170 is succeeded by step 171 where a speech path is connected, and a message of "path re-establish response" is transmitted to a destination node, in step 172. Next, program proceeds to a call state.
Under the re-establish request state of the subscriber of the originating party waiting for counterpart's response, program checks, in step 173, whether a maximum standby time of the timer T2 is over or not. If the maximum standby time is over, since this is regraded as failure of a node of the called party, a telephone call is difficult even though there is a replaceable path. Thus, step 173 advances to step 174 where busy tone is connected to a subscriber and entered into a busy state. If the maximum standby time is not over, step 173 is followed by step 175 to see if a message of "path re-establish response" has been received. In step 175, if the message has been received from the subscriber of the called party, program advances to step 176 to stop the timer T2, and otherwise, step 175 returns back to step 173. In step 177 following step 176, counterpart's information and channel information is renewed from a received message. Following this, in step 178, a speech path is connected and program proceeds to a call state.
Under the signaling state, program checks, in step 179, whether or not a message of "link cut off" has been received. If the message has been received, step 179 is followed by step 180. Otherwise, program loops in step 179 until the message is received. In step 180, a determination is made as to whether or not a corresponding node is a final destination of the message. If the corresponding node is not a final destination, that is, if it is an intermediate node, step 180 advances to step 181 where the message is transmitted to a next node. This is followed by step 182 to release a channel and resources relating to a previously established speech path. Next, program proceeds to a standby state. On the other hand, in step 180, if the corresponding node is a final destination of the message, since the re-establishment of a signaling call is considerably complicate even though there is a replaceable path, program is succeeded by step 183 to release a channel between nodes and related resources and disconnect a speech path. In following step 184, a busy tone is connected to a subscriber. Subsequently, program advances to a busy state. Under the busy state, program proceeds to step 185 to see if the telephone of a subscriber is a hook-on state. If the telephone of the subscriber is a hook-on state, program proceeds to step 186 to release all resources and database necessary for call establishment, and otherwise, program loops in step 185. Step 186 is followed by a stand-by state.
As described above, when a link between nodes is cut off in a decentralized switching network, by re-establishing a call of a subscriber speaking on the telephone, the reliability of a system is improved and enhanced service is provided to the subscriber. That is, in most switching network, since a state of a link connecting a node is considerably unstable, and after a link is suddenly cut off, the re-connection is frequent, by applying the above-described example of a method of a call process to the switching network, a reliable system can be obtained.
While preferred embodiments of the present invention have been particularly shown and described, it will be understood by those skilled in the art that foregoing and other changes in form and details may be made without departing from the spirit and scope of the present invention.