CA2231785C - Dynamically controlled routing of calls in intelligent networks - Google Patents
Dynamically controlled routing of calls in intelligent networks Download PDFInfo
- Publication number
- CA2231785C CA2231785C CA002231785A CA2231785A CA2231785C CA 2231785 C CA2231785 C CA 2231785C CA 002231785 A CA002231785 A CA 002231785A CA 2231785 A CA2231785 A CA 2231785A CA 2231785 C CA2231785 C CA 2231785C
- Authority
- CA
- Canada
- Prior art keywords
- switching unit
- call
- tandem
- link
- direct link
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Expired - Fee Related
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04Q—SELECTING
- H04Q3/00—Selecting arrangements
- H04Q3/0016—Arrangements providing connection between exchanges
- H04Q3/0029—Provisions for intelligent networking
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04M—TELEPHONIC COMMUNICATION
- H04M7/00—Arrangements for interconnection between switching centres
- H04M7/12—Arrangements for interconnection between switching centres for working between exchanges having different types of switching equipment, e.g. power-driven and step by step or decimal and non-decimal
Abstract
An "Intelligent" telecommunications network comprises a plurality of switching units interconnected by links, and connected to a central computer unit by a data communication system. For dynamic routing of a call, a first switching unit responds to a destination address in a call to attempt a direct link to a neighbouring switching unit and, in the event that the attempt is unsuccessful, issues to the central computer unit a message containing the destination address. The central computer unit uses the destination address to identify the unsuccessful link; (ii) updates a routing database to identify the link as unavailable; (iii) determines an alternative route for the call using a tandem node and (iv) compiles a return message including a network address for a tandem switching unit and transmits it to the first switching unit. The latter attempts to route the call via a link to the tandem unit which attempts to complete the call by a direct link to the destination switching unit. The tandem node switching unit also queries the central computer if it cannot complete the call by a direct link to the destination switching unit, whereupon the central computer will set to zero the idleness of the direct link which the tandem unit attempted and then determine an alternate route from the tandem unit to the destination, i.e. with the idleness factors of both direct links set to zero, resulting in an alternate route having three links.
Description
TITLE: DYNAMICALLY CONTROLLED ROUTING OF CALLS IN
INTELLIGENT NETWORKS
DESCRIPTION
TECHNICAL FIELD:
The invention relates to a method and apparatus for dynamic routing of calls in telecommunications networks, particularly so-called "intelligent networks".
BACKGROUND ART:
1o For many years, telecommunications networks have used fixed hierarchical routing (FHR), which is still the most common form of call routing used by North American telephone companies. In 1981, however, Northern Telecom introduced Dynamically C'.ontrolled Routing (DCR) which makes use of the capabilities of modern stored program control switches with high-availability, real-time data processing abilities and the "intelligence" of a central computer, typically called the network processor (NP).
Periodically, say every ten seconds, the switches report to the network processor the status of their trunk groups, using a data communications system comprising X-25 links.
The network processor uses trunk group idleness information from the switches to update tables of alternate routing information kept by the switches. When a switch is unable 2 o to route a call because the selected direct link to the destination switch is blocked or unavailable, the switch attempts an alternative route obtained from its table of alternative routes.
For more information about dynamic routing, as compared with FHR, the reader is directed to articles entitled "Dynamically Controlled Routing" by Hugh Cameron and Serge Hurtubise, in Telesis, Vol 1, 1986, published by Bell-Northern Research and "State-Dependent Dynamic 7,raffic Management for Telephone Networks", by Jean Regnier and W. Hugh Cameron, IEEE Communications Magazine, October 1990, pp.
42-53. An early version of dynamically controlled routing is disclosed in US
patent number 4,284,852 issued August 1981 and refinements are described in US patent 3 o number 5,526,414 issued December 1994. The reader is directed to these documents for reference.
DCR has been follov~ed by other networks which employ dynamic routing, including Dynamic Alternate Routing (DAR) by British Telecom and Real-Time Network Routing (RTNR) by AT&T Bell Laboratories, while it is reported that France Telecom have conducted trials of a STAR (System for Testing Adaptive Routing) and Bell Communications Research has conducted trials of DRS (Dynamic Routing with 5 minute updates) .
Dynamic routing yields significant advantages in network control. It ensures the efficiency of switching equipment by preventing excessive traffic from reaching the machine; inhibits the spread of switching congestion; maintains circuit group efficiency by reducing the number of links per call when facilities are congested; and makes full use of available idle facilities. Despite these advantages, dynamic routing systems are not 1 o widely used. One reason is that presently-available dynamic routing systems are not compatihle with those of other manufacturers. Since most telephone companies use switching equipment from different manufacturers, dynamic routing cannot be deployed in their networks.
In recent years, so-called "intelligent networks" (IN) have been developed and are beginning to be implemented. Intelligent networks are intended to facilitate the development of a wide range of network-wide services. In an intelligent network, each switching element may interrupt call processing and exchange messages with a central computer to obtain instructions for completing the call. The messages are exchanged by way of a data communications system and must comply with existing and evolving 2 o standards and protocols, regardlEas of who made the switching equipment deployed in the network.
"Intelligent Networks" (IN) employ out-of band signalling systems such as Signalling System No. 7 (SS7), also known as Common Channel Signalling No. 7 (CCS7). Such signalling systems exchange Transaction Capability Application Part 2 5 (TCAP) messages or queries beaween network elements and the central computer to deploy selected services. In addition, the SS7 system carnes ISDN-User Part (ISUP) messages between network node switching units to set up and route calls.
Hence, the TCAP and ISUP messages are handled by a data communications system separate from the trunks which carry the calls 'themselves.
3 o Similarities between IntE:lligent Networks and centralized Dynamic Routing networks, such as the use of a remote computer database and associated communication facilities, have led to a proposal to implement dynamic routing in such intelligent networks. Such proposal, entitled "A Dynamic Routing System Based on the Intelligent Network: (IN) Architecture" by G. Fischer, J. Rammer and K. Hofmann was presented at ISS 'SOS. Limitations of this proposal by Fischer et al, however, appear to be that it requires the switching units to be modified and cannot readily be implemented in networks which use switching elements from different manufacturers. Moreover, the proposal does not satisfactorily address limitations of DR systems resulting from anti-looping measures to prevent routing of a call back to a node that it had visited previously.
In order to ensure that looping does not occur, Nortel's DCR, and other dynamic routing schemes, limit the altf:rnate route to a maximum of two links per call overflowing the direct link to the destination. At the tandem node, the dynamic routing scheme does not allow the call to obtain a second alternate route. If the second link of the alternate route is blocked or unavailable, the tandem node can only block the call or use exception routing to route it out of the DCR network. Such a limitation is undesirable since, with updates every ten seconds, there is a distinct possibility that the second link will be blocked. Reducing the update interval is not a satisfactory solution.
DISCLOSURE OF INVENTION:
An object of the present invention is to avoid, or at least mitigate the limitations of knovvn dynamic routing networks in providing a method and apparatus for 2 o implementing dynamic routing in intelligent networks, especially those which employ switching elements of different types and/or manufacture.
According to one aspect ~of the present invention there is provided a method of routing calls dynamically in a telecommunications network comprising a plurality of switching units and a central computer unit having access to a routing database, the 2 5 switching units being interconnected by links comprising trunk groups and connected to the centa-al computer unit by a data communication system, each switching unit having call processing software including triggers for initiating queries to the central computer unit during call processing, the method comprising the steps of:
at a first switching unit:
3 o responding to a destination address in a call to attempt to route a call to a destination switching unit via a direct link and, in the event th<ct the attempt is unsuccessful or there is no direct link, issuing to the central computer unit a query message containing the destination address;
at the central computer unit:
where the direct link exists but the attempt to use it was unsuccessful, responding to the query message by (i) identifying from the query message the link attempted unsuccessfully, (ii) updating the routing database to identify the link as unavailable for a predetermined period of time; whether the query resulted from a lack of a direct link or an 1o unsuccessful attempt to route via an existing direct link, (iii) determining at least one alternative route for the instant call using a tandem switching unit, (iv) compiling a return message including a network address for the tandem switching unit and (v) transmitting the return message to the first switching unit;
at the first switching unit:
routing the call via a direct link from the tirst switching unit to the tandem switching unit; and at the tandem switching unit:
attempting to complete the call by routing the call via a direct link from 2 o the tandem switching unit to the destination switching unit;
in the event that the tandem switching unit cannot complete the call via the third-direct link from the tandem switching unit to the destination switching unit, at the tandem switching unit:
sending to the central computer unit a second query message including said 2 5 destination address, at the central computer.
responding to the second query message by (vi) identifying from the query message the direct link that the tandem switching unit attempted unsuccessfully, (vii) updating the routing database to identify such direct 3 0 link as unavailable, while maintaining as unavailable the direct link first attempted by the first switching unit; (viii) determining at least one second alternative route for the instant call using a second tandem switching unit, (ix) compiling a return message including a network address for the tandem switching unit and (x) transmitting the return message to the first tandem switching unit;
at the first tandem switching unit:
routing the call via. a direct link from the first tandem switching unit to the 5 second xandem switching unit; and at the second tandem switching unit, attempting to roul:e the call via a direct link from the second tandem switching unit to the destination switching unit.
~~ccording to a second aspect of the invention, there is provided a method of to routing calls dynamically in a telecommunications network comprising a plurality of switching units and a central computer unit having access to a routing database, the switching units being interconnecaed by links comprising trunk groups and connected to the central computer unit by a data communication system, each switching unit having call processing software including triggers for initiating queries to the central computer unit during call processing, the method comprising the steps of:
at a first switching unit:
responding to a destination address in a call to attempt to route a call to a destination switching unit via a direct link and, in the event that the attempt is unsuccessful or there is no direct link, 2 o issuing to the central computer unit a query message containing the destination addres:>;
at the central computer unit:
where there is a direct link but the attempt to use it was unsuccessful, responding to the; query message by (i) identifying from the query 2 5 message the link attempted unsuccessfully, (ii) updating the routing database to identify the link as unavailable;
whether the query resulted from a lack of a direct link or an unsuccessful attempt to route via a direct link, (iii) determining at least one alternative route for the instant call using a tandem switching unit, (iv) compiling a 3 o return message including a network address for the tandem switching unit and (v) transmittirag the return message to the first switching unit;
at the first switching unit:
INTELLIGENT NETWORKS
DESCRIPTION
TECHNICAL FIELD:
The invention relates to a method and apparatus for dynamic routing of calls in telecommunications networks, particularly so-called "intelligent networks".
BACKGROUND ART:
1o For many years, telecommunications networks have used fixed hierarchical routing (FHR), which is still the most common form of call routing used by North American telephone companies. In 1981, however, Northern Telecom introduced Dynamically C'.ontrolled Routing (DCR) which makes use of the capabilities of modern stored program control switches with high-availability, real-time data processing abilities and the "intelligence" of a central computer, typically called the network processor (NP).
Periodically, say every ten seconds, the switches report to the network processor the status of their trunk groups, using a data communications system comprising X-25 links.
The network processor uses trunk group idleness information from the switches to update tables of alternate routing information kept by the switches. When a switch is unable 2 o to route a call because the selected direct link to the destination switch is blocked or unavailable, the switch attempts an alternative route obtained from its table of alternative routes.
For more information about dynamic routing, as compared with FHR, the reader is directed to articles entitled "Dynamically Controlled Routing" by Hugh Cameron and Serge Hurtubise, in Telesis, Vol 1, 1986, published by Bell-Northern Research and "State-Dependent Dynamic 7,raffic Management for Telephone Networks", by Jean Regnier and W. Hugh Cameron, IEEE Communications Magazine, October 1990, pp.
42-53. An early version of dynamically controlled routing is disclosed in US
patent number 4,284,852 issued August 1981 and refinements are described in US patent 3 o number 5,526,414 issued December 1994. The reader is directed to these documents for reference.
DCR has been follov~ed by other networks which employ dynamic routing, including Dynamic Alternate Routing (DAR) by British Telecom and Real-Time Network Routing (RTNR) by AT&T Bell Laboratories, while it is reported that France Telecom have conducted trials of a STAR (System for Testing Adaptive Routing) and Bell Communications Research has conducted trials of DRS (Dynamic Routing with 5 minute updates) .
Dynamic routing yields significant advantages in network control. It ensures the efficiency of switching equipment by preventing excessive traffic from reaching the machine; inhibits the spread of switching congestion; maintains circuit group efficiency by reducing the number of links per call when facilities are congested; and makes full use of available idle facilities. Despite these advantages, dynamic routing systems are not 1 o widely used. One reason is that presently-available dynamic routing systems are not compatihle with those of other manufacturers. Since most telephone companies use switching equipment from different manufacturers, dynamic routing cannot be deployed in their networks.
In recent years, so-called "intelligent networks" (IN) have been developed and are beginning to be implemented. Intelligent networks are intended to facilitate the development of a wide range of network-wide services. In an intelligent network, each switching element may interrupt call processing and exchange messages with a central computer to obtain instructions for completing the call. The messages are exchanged by way of a data communications system and must comply with existing and evolving 2 o standards and protocols, regardlEas of who made the switching equipment deployed in the network.
"Intelligent Networks" (IN) employ out-of band signalling systems such as Signalling System No. 7 (SS7), also known as Common Channel Signalling No. 7 (CCS7). Such signalling systems exchange Transaction Capability Application Part 2 5 (TCAP) messages or queries beaween network elements and the central computer to deploy selected services. In addition, the SS7 system carnes ISDN-User Part (ISUP) messages between network node switching units to set up and route calls.
Hence, the TCAP and ISUP messages are handled by a data communications system separate from the trunks which carry the calls 'themselves.
3 o Similarities between IntE:lligent Networks and centralized Dynamic Routing networks, such as the use of a remote computer database and associated communication facilities, have led to a proposal to implement dynamic routing in such intelligent networks. Such proposal, entitled "A Dynamic Routing System Based on the Intelligent Network: (IN) Architecture" by G. Fischer, J. Rammer and K. Hofmann was presented at ISS 'SOS. Limitations of this proposal by Fischer et al, however, appear to be that it requires the switching units to be modified and cannot readily be implemented in networks which use switching elements from different manufacturers. Moreover, the proposal does not satisfactorily address limitations of DR systems resulting from anti-looping measures to prevent routing of a call back to a node that it had visited previously.
In order to ensure that looping does not occur, Nortel's DCR, and other dynamic routing schemes, limit the altf:rnate route to a maximum of two links per call overflowing the direct link to the destination. At the tandem node, the dynamic routing scheme does not allow the call to obtain a second alternate route. If the second link of the alternate route is blocked or unavailable, the tandem node can only block the call or use exception routing to route it out of the DCR network. Such a limitation is undesirable since, with updates every ten seconds, there is a distinct possibility that the second link will be blocked. Reducing the update interval is not a satisfactory solution.
DISCLOSURE OF INVENTION:
An object of the present invention is to avoid, or at least mitigate the limitations of knovvn dynamic routing networks in providing a method and apparatus for 2 o implementing dynamic routing in intelligent networks, especially those which employ switching elements of different types and/or manufacture.
According to one aspect ~of the present invention there is provided a method of routing calls dynamically in a telecommunications network comprising a plurality of switching units and a central computer unit having access to a routing database, the 2 5 switching units being interconnected by links comprising trunk groups and connected to the centa-al computer unit by a data communication system, each switching unit having call processing software including triggers for initiating queries to the central computer unit during call processing, the method comprising the steps of:
at a first switching unit:
3 o responding to a destination address in a call to attempt to route a call to a destination switching unit via a direct link and, in the event th<ct the attempt is unsuccessful or there is no direct link, issuing to the central computer unit a query message containing the destination address;
at the central computer unit:
where the direct link exists but the attempt to use it was unsuccessful, responding to the query message by (i) identifying from the query message the link attempted unsuccessfully, (ii) updating the routing database to identify the link as unavailable for a predetermined period of time; whether the query resulted from a lack of a direct link or an 1o unsuccessful attempt to route via an existing direct link, (iii) determining at least one alternative route for the instant call using a tandem switching unit, (iv) compiling a return message including a network address for the tandem switching unit and (v) transmitting the return message to the first switching unit;
at the first switching unit:
routing the call via a direct link from the tirst switching unit to the tandem switching unit; and at the tandem switching unit:
attempting to complete the call by routing the call via a direct link from 2 o the tandem switching unit to the destination switching unit;
in the event that the tandem switching unit cannot complete the call via the third-direct link from the tandem switching unit to the destination switching unit, at the tandem switching unit:
sending to the central computer unit a second query message including said 2 5 destination address, at the central computer.
responding to the second query message by (vi) identifying from the query message the direct link that the tandem switching unit attempted unsuccessfully, (vii) updating the routing database to identify such direct 3 0 link as unavailable, while maintaining as unavailable the direct link first attempted by the first switching unit; (viii) determining at least one second alternative route for the instant call using a second tandem switching unit, (ix) compiling a return message including a network address for the tandem switching unit and (x) transmitting the return message to the first tandem switching unit;
at the first tandem switching unit:
routing the call via. a direct link from the first tandem switching unit to the 5 second xandem switching unit; and at the second tandem switching unit, attempting to roul:e the call via a direct link from the second tandem switching unit to the destination switching unit.
~~ccording to a second aspect of the invention, there is provided a method of to routing calls dynamically in a telecommunications network comprising a plurality of switching units and a central computer unit having access to a routing database, the switching units being interconnecaed by links comprising trunk groups and connected to the central computer unit by a data communication system, each switching unit having call processing software including triggers for initiating queries to the central computer unit during call processing, the method comprising the steps of:
at a first switching unit:
responding to a destination address in a call to attempt to route a call to a destination switching unit via a direct link and, in the event that the attempt is unsuccessful or there is no direct link, 2 o issuing to the central computer unit a query message containing the destination addres:>;
at the central computer unit:
where there is a direct link but the attempt to use it was unsuccessful, responding to the; query message by (i) identifying from the query 2 5 message the link attempted unsuccessfully, (ii) updating the routing database to identify the link as unavailable;
whether the query resulted from a lack of a direct link or an unsuccessful attempt to route via a direct link, (iii) determining at least one alternative route for the instant call using a tandem switching unit, (iv) compiling a 3 o return message including a network address for the tandem switching unit and (v) transmittirag the return message to the first switching unit;
at the first switching unit:
routing the call via a direct link from the first switching unit to the tandem switching unit; and at the tandem switching unit:
attempting to complete the call by routing the call via a direct link from the tandem switching unit to the destination switching unit;
further a.t the central computer:
monitoring continuously the number of queries generated by overflowing calls for each link and retaining these data;
at intervals (TTCycle), each of which is at least equal to a mean call holding time h, determining for each kink a measured rate Oe(~)/O of such messages during 1 o a preceding time interval O;
comparing each said measured rate Og(0)IO with a predetermined threshold overflow call rate b; and adjusting a previously-set Target Overflow value TTg for each link in dependence upon thE: degree to which the measured rate exceeds or is less than said threshold overflow call rate b;
and, upon receipt of a said query from said first switching unit, where the query resulted from an unsuccessful attempt to route a call via an existing direct link, determining the alternate route by the method steps of:
at the central computer unit:
2 o identifying the direct link that was an attempted unsuccessfully and setting to zero an idleness factor I8 for such direct link, v~rhether the query resulted from a lack of a direct link or an unsuccessful attempt to route via a direct link;
calculating for each link of every potential alternate route for said call an idleness 2 5 factor Ia by subtracting :from the current Target Overflow value TTg for the particular link the number of calls ACg alternate-routed via such link during the immediately-preceding mean call holding time interval h;
calculating Residual Capacity RC for each possible alternate route as the minimum idleness of links that could be used in one of said possible alternate 3 0 routes;
selecting the alternate route with the greatest Residual Capacity as the preferred alternate route;
attempting to complete the call by routing the call via a direct link from the tandem switching unit to the destination switching unit;
further a.t the central computer:
monitoring continuously the number of queries generated by overflowing calls for each link and retaining these data;
at intervals (TTCycle), each of which is at least equal to a mean call holding time h, determining for each kink a measured rate Oe(~)/O of such messages during 1 o a preceding time interval O;
comparing each said measured rate Og(0)IO with a predetermined threshold overflow call rate b; and adjusting a previously-set Target Overflow value TTg for each link in dependence upon thE: degree to which the measured rate exceeds or is less than said threshold overflow call rate b;
and, upon receipt of a said query from said first switching unit, where the query resulted from an unsuccessful attempt to route a call via an existing direct link, determining the alternate route by the method steps of:
at the central computer unit:
2 o identifying the direct link that was an attempted unsuccessfully and setting to zero an idleness factor I8 for such direct link, v~rhether the query resulted from a lack of a direct link or an unsuccessful attempt to route via a direct link;
calculating for each link of every potential alternate route for said call an idleness 2 5 factor Ia by subtracting :from the current Target Overflow value TTg for the particular link the number of calls ACg alternate-routed via such link during the immediately-preceding mean call holding time interval h;
calculating Residual Capacity RC for each possible alternate route as the minimum idleness of links that could be used in one of said possible alternate 3 0 routes;
selecting the alternate route with the greatest Residual Capacity as the preferred alternate route;
determining an address for a tandem node in the preferred alternate route and sending a message incorporating said address to said first switching unit.
In the event that the Residual Capacity is less than or equal to zero, instead of the step of selecting an alternate route with the greatest Residual capacity, and the step of determining an address for the tandem node and incorporating the address in a message to the fiirst switching unit, the method may comprise the step of returning a block recommendation, conveniently by means of a "Send-to-Resource" message from the central computer to the first switching unit.
~~ccording to a third aspect of the invention, there is provided telecommunications 1 o network apparatus comprising a plurality of switching units and a central computer unit having access to a routing database, the switching units being interconnected by links comprising trunk groups and connected to the central computer unit by a data communication system, each switching unit having call processing software including triggers for initiating queries to t:he central computer unit during call processing, first switching unit having means for responding to a destination address in a call to attempt to route a call to a destination switching unit via a direct link and, in the event that the attempt is unsuccessful or no direct link exists, issuing to the central computer unit a query message containing the 2 o destination address;
the central computer unit having means for responding to the query message where the direct link exists but the attempt to use it was unsuccessful, by (i) identifying from the query message the link attempted unsuccessfully, (ii) updating the routing database to identify the link as 2 5 unavailable;
whether the query resulted from a lack of a direct link or an unsuccessful attempt to use a direct link, (iii) determining at least one alternative route for the instant call using a tandem switching unit, (iv) compiling a return message including a network address for the tandem switching unit and 3 0 (v) transmitting the return message to the first switching unit;
the first switching unit further comprising means for responding to the return message by routing the call via a direct link from the first switching unit to the tandem switching unit;
In the event that the Residual Capacity is less than or equal to zero, instead of the step of selecting an alternate route with the greatest Residual capacity, and the step of determining an address for the tandem node and incorporating the address in a message to the fiirst switching unit, the method may comprise the step of returning a block recommendation, conveniently by means of a "Send-to-Resource" message from the central computer to the first switching unit.
~~ccording to a third aspect of the invention, there is provided telecommunications 1 o network apparatus comprising a plurality of switching units and a central computer unit having access to a routing database, the switching units being interconnected by links comprising trunk groups and connected to the central computer unit by a data communication system, each switching unit having call processing software including triggers for initiating queries to t:he central computer unit during call processing, first switching unit having means for responding to a destination address in a call to attempt to route a call to a destination switching unit via a direct link and, in the event that the attempt is unsuccessful or no direct link exists, issuing to the central computer unit a query message containing the 2 o destination address;
the central computer unit having means for responding to the query message where the direct link exists but the attempt to use it was unsuccessful, by (i) identifying from the query message the link attempted unsuccessfully, (ii) updating the routing database to identify the link as 2 5 unavailable;
whether the query resulted from a lack of a direct link or an unsuccessful attempt to use a direct link, (iii) determining at least one alternative route for the instant call using a tandem switching unit, (iv) compiling a return message including a network address for the tandem switching unit and 3 0 (v) transmitting the return message to the first switching unit;
the first switching unit further comprising means for responding to the return message by routing the call via a direct link from the first switching unit to the tandem switching unit;
the tandem switching unit comprising means for attempting to complete the call by routing the call via a direct link from the tandem switching unit to the destination switching unit; and in the event that the tandem switching unit cannot complete the call via such direct link, sending to the central computer unit a second query message including said destination address, the central computer further comprising means for responding to the second query message by (vi) identifying from the query message the direct link attempted unsuccessfully by the tandem switching link, (vii) io updating the routing database to identify the link as unavailable, while maintaining as unavailable the direct link attempted unsuccessfully by the first switching unit; (viii) determining at least one second alternative route for the instant call using a second tandem switching unit, (ix) compiling a return message including a network address for the second tandem switching unit and (x) transmitting the return message to the first tandem switching unit;
the first tandem switching unit further comprising means for responding to the return message to route the call via a direct link from the first tandem switching unit to the second tandem switching unit;
2 o the second tandenn switching unit comprising means for attempting to route the call via said direct link from the second tandem switching unit to the destination switching unit.
~~ccording to a fourth aspect of the invention, there is provided telecommunications network apparatus comprising a plurality of switching units and a 2 5 central computer unit having access to a routing database, the switching units being interconnected by links comprising trunk groups and connected to the central computer unit by a data communication system, each switching unit having call processing software including triggers for initiating queries to the central computer unit during call processing, 3 o a first switching unit comprising means for responding to a destination address in a call to attempt to route a call to a destination switching unit via a direct link a~~d, in the event that the attempt is unsuccessful or there is no direct link, issuing to the central computer unit an query message containing the destination address;
the central computer unit comprising means for responding to the query message, where there is a direct link but the attempt to use it was unsuccessful, by (i) identifying from the query message the link attempted unsuccessfully, (ii) updating the routing database to identify the link as unavailable; and, whether the query resulted from a lack of a direct link or an unsuccessful 1 o attempt to route via a direct link, (iii) determining at least one alternative route for the instant call using a tandem switching unit, (iv) compiling a return message including a network address for the tandem switching unit and (v) transmitting the return message to the first switching unit;
the first switching unit further comprising means responsive to the return for routing the call via a direct link from the first switching unit to the tandem switching unit;
the tandem switching unit further comprising means for attempting to complete the call by routing the call via said direct link from the first switching unit to the destination switching unit;
2 o wherein the central computer further comprises means for:
monitoring continuously the number of query messages generated by overflowing calls :for each link and retaining these data;
at intervals (TTCycle), each of which is at least equal to a mean holding time h, determining for each link a measured rate Og(O)/~ of such 2 5 messages during a preceding time interval D;
comparing each said measured rate Og(0)/D with a predetermined threshold overflow call rate b; and adjusting a previously-set Target Overflow value TTg for each link in dependence upon the degree to which the measured rate exceeds or is less 3 o than said threshold overflow call rate b;
the central computer yet further comprising means responsive to receipt of a said query from said first switching unit, where the query resulted from an unsuccessful attempt to route a call via an existing direct link, for determining the alternate route by identifying the direct link that was attempted unsuccessfully and setting to zero an idleness factor Ig for such direct link, whether the query resulted from a lack of a direct link or an unsuccessful attempt to route via an existing direct link, calculating for each link of 5 every potential alternate route for said call an idleness factor Ig by subtracting from the current Target Overflow value TTg for the particular link the number of calls ACg alternate-routed via such link during the immediately-preceding call holding time interval h;
calculating Residual Capacity RC for each possible alternate route as the 1o minimum idleness of links that could be used in one of said possible alternate routes;
selecting the alternate route with the greatest Residual Capacity as the preferred alternate. route;
determining an address for a tandem node in the preferred alternate route and sending a message incorporating said address to said first switching unit.
In the event that the Residual Capacity is less than or equal to zero, instead of selecting; an alternate route with the greatest Residual capacity, and determining an address for the tandem node and incorporating the address in a message to the first 2 o switching unit, the central computer may return a block recommendation, conveniently by means of a "Send to Resour<;e" message to the first switching unit.
In embodiments of the second and fourth aspects of the invention, the Residual Capacity RC may be determined for each possible two-link alternate route, i.e.
R(_od - mTn [Iot, Itd]
2 5 where I~,T and ITD are the idleness of link OT and link TD, respectively.
Prior to the accumulation of any overflow messages, the Target Overflow value TTg may be set initially to a predetermined value.
The tandem node switching unit may also issue a query message to the central 3 o computer in the event that it cannot complete the call by a direct link to the destination switching unit, and the central computer may then determine, using the similar steps as those in response to the first query from the first switching unit, an alternate route from the first tandem node to the destination node, but with the both the idleness factor for the direct link attempted by the first switching unit and the idleness factor for the second direct link attempted by the tandem switching unit set to zero.
BRIEF DESCRIPTION OF THF? DRAWINGS:
An embodiment of the invention will now be described by way of example only with refc;rence to the accompanying drawings, in which:
Figure 1 is a block schematic representation, much simplified, of a portion of a 1 o so-calledl "intelligent network" employing dynamic routing according to the present invention (INMDR);
Figure 2 illustrates alternate routing of a call in such network using one tandem node;
Figure 3 illustrates datafill at a Service Control Point/Network Processor (SCP/Nl') within the network;
Figure 4 illustrates an Originating Call Model for processing such a call;
Figure 5 illustrates alternate routing using two tandem nodes;
Figure 6 illustrates alternate routing at a gateway to another network when a route advance feature at an originating switch is active; and 2 o Figures 7, 8 and 9 illustrate operation of the SCP/NP in determining preferred alternate routes.
BEST NfODES FOR CARRYING OUT THE INVENTION:
For convenience, the terminology used in the following description for triggers, 2 5 and so on, generally is that used in North America, perhaps as specified in Bellcore standards. It should be appreciated that in other countries similar items are identified by different names, perhaps as specified in International Telecommunications Union (ITU) standards.
F;eferring to Figure 1, the illustrated portion of an Intelligent Network 10 3 o comprisEa five Service Switching Points (SSPs) 11, 12, 13, 14 and 15, respectively, are interconnected by links L1 - L8" which comprise trunk groups between the respective switching units. The SSPs 11 - l.5 are coupled to a Signalling System Number 7 (SS7) communications network 16 by messaging/signalling links 17 - 21, respectively, for communication with a central computer in the form of a Service Control Point/Network Processor (SCP/NP) 22 which has, or has access to, a routing database 23. Each SSP
is a netvvork node normally associated with a central office switching unit having SS7 messaging capability. For simplicity, only five Service Switching Points (SSPs) are shown. In a typical system, there would be many more SSPs and they would usually communicate with the SCP/NP :Z2 by way of Signal Transfer Points (STP) which are signalling hubs or concentrators which also are not shown for clarity. The Service Control :Point/Network Processor (SCP/NP) 22 is an "intelligence centre", i.e.
a central computer with access to application databases enabling it to deliver various combinations to of features, such as 1-800 number service and call redirection. The SCP/NP
22 could be a sep~~rate computer connected to the Intelligent Network (e.g. a Network Processor), or it could be a standard telephone company SCP.
1=;ach SSP has standard Intelligent Network call processing software including "Point-in-Call triggers" which can be provisioned or set to interrupt call processing momenti~rily and initiate a TCAP query to the SCP/NP 22 for instructions on how to complete: the call processing.
The SCP/NP 22 is programmed to enable it to determine alternate routes based solely upon Network Busy TCAI' message received from switching units throughout the network.. In contrast to a network processor in a DCR system, which updates the routing 2 o recommendations every 10 seconds based upon link idleness information sent to it by all of the svvitching units, and then downloads recommendations to the switching units; the SCP/NP 22 computes an individual routing recommendation every time it receives a Network: Busy query from a switching unit. Also, the SCP/NP 22 does not download alternate routing recommendations every 10 seconds for storage at the switching units.
2 5 Instead, it merely gives the individual switching unit the alternate routes) as and when requested.
The switching units do not need special INMDR application software to report link idleness to the SCP/NP 22. Consequently, any switching unit capable of IN
operation can be used, providing; the required triggers are implemented and active.
3 o C~eration of the intelligent network of Figure 1 will now be described with reference also to Figure 2, which depicts message exchange during the setting up of an alternate route using one tandem node.
Referring to Figures 1 and 2, a Calling Party 24, identified by a telephone set associated with SSP 11, seeks to place a call to a Called Party 25, identified by a second telephone set associated with !iSP 13.
(1) The switching unit of SSP 11 processes the dialled digits in the usual way, identifies SSP 13 as the destination node, and attempts to route the call via a circuit group in direct link 1.3.
(2) Link L3 has no circuit groups available. Consequently, when the originating switching unit at S!iP 11 has exhausted its list of circuit groups, it encounters an Automatic Flexible Routing (AFR) trigger (providing the Calling Party has subscribed to to this service). The AFR trigger occurs after the "Selecting Route" point in the call processing, as shown in the Originating Call Model shown in Figure 4. The originating switching unit SSP 11 checks that there are no gapping controls in effect for the call and then sends a Network Busy TCAP message to the SCP/NP 22. It should be noted that the switching unit might have: several groups of AFR triggers for different purposes.
The group associated with dynamic alternate routing would have a distinct address at the SCP/NP 22. Contents of Network-Busy and other messages are given in GR-1298-CORE AIN 0.2 Generic requirements, Dec. 1994, or in GR-1284-CORE AIN 0.1, Aug.
'92. The reader is directed to~ these documents for reference.
(3) Upon receipt of the Network_Busy TCAP message, the SCP/NP 22 2o determines from it that the originating node is SSP 11 and the destination node is SSP
13 and infers therefrom that link L3 is not available. In its routing database 23, SCP/NP
22 sets the idleness index of link L3 to zero for a preset period of, say, 10 seconds.
During that 10 second period, link L3 will be unavailable for recommendation in an alternate route. Using the newly-updated routing data, the SCP/NP 22 determines the preferred alternate route(s). As will be described in more detail later, for each possible alternate route of two links OT and TD between originating node O, tandem node T and destination node D, the SCP/NP 22 calculates the Residual Capacity as RC~d - mTn [Ipt, ltd]
where IoT and ITS are the idleness of links OT and TD, respectively. The 3 o then returns one of two TCAP messages to the SSP 11, namely (i) Analyze Route or (ii) Send To-Resource. Assuming that the SCP/NP 22 determines that links L1 and L4 and tandem node SSP 12 are available and preferred as an alternative route, it issues an Analyze-Route TCAP message to SSP 11. The Analyze Route message contents are as set out in Section 5.2.2.1 of TR-NWT-001285, AIN 0.1 SCP interface, Aug. 1992, and section 5.2.2.2 of GR-1299-CORE Issue 3, July 1996, INGR: Switch-SCP/Adjunct interface. The reader is directed to these documents for reference. For the purposes of dynamic routing, the SCP/NP 22 includes in the Analyze_Route message the appropriate trunk group index to redirect the call to tandem SSP 12. The SCP/NP 22 may include in the Analyze Route message up to three alternate routes namely (i) Primary Trunk Group, (ii) Alternate Trunk Group, and (iii) Second Alternate Trunk Group. In this io case, the SCP/NP 22 might identify links L2 and L8 and tandem node SSP 15 as a second alternate route and so include the route index of a trunk group in link L2 as a Second Alternate Trunk Group.
(4) Upon receipt ~of the Analyze_Route message, SSP 11 resumes call processing at the Select Route Point in Call and routes the call to SSP 12 using the recommended trunk in link L1.
(5) SSP 12 completes the call to destination node SSP 13 by way of link L4 in the normal way.
In the event that the SCP/NP 22, when queried by SSP 11, cannot recommend an alternative route with a. suitably high probability of completion, it may return a 2 o Send To Resource message to the SSP 11, requesting it to play a terminating announcement. In essence, the SCP/NP 22 issues a "BLOCK" recommendation.
Figure 3 illustrates, as an example, datafill for the routing tables at the SCP/NP
22, enabling it to identify the destination switching unit when the querying switching unit supplies only the called destination number. The first table lists the destination nodes/switching units for different groups of NPA-NNX numbers. The second table lists preferred tandem nodes for each pair of an origin node and a destination node.
The third table, i.e. the "Tandem to Route Index" table, maintains a list of route indices for all of the switching units in the network. (Unless the switch translations are such that the same index is valid in every switch.) 3 o It is envisaged that, in order to simplify the datafill in the SCP, a Bellcore equivalent of the parameter "RouteList", in the Route Select Failure message of the ITU
standard, could be used. This parameter contains the list of routes tried by the Service Switching Function (SSF) when trying to route the call before the trigger.
This information could possibly be used to eliminate the first SCP table, used to determine the destination switch. This would also simplify the maintenance of the SCP
datafill from a TelCo perspective as this table would not have to be maintained.
As previously mentioned, in order to avoid looping, known dynamic routing 5 systems do not allow the tandem node to request an alternate route if it cannot complete the call by the direct second link. Embodiments of the present invention, however, may allow "multiple tandeming" by allowing a tandems node to request an alternate route, in which case the alternate route might comprise more than one tandem and three or even more links. It was demonstrated by modelling that, depending upon the configuration 1 o of the network, there might be an improvement in call completion rates if alternate routes of three or more links are permitted. It was also found that a novel algorithm at the SCP/NP 22, to be described later, ensured that, if there is already a high traffic loading in the network, three link alternate routes would be less likely to be given out by the SCP/NP 22.
15 Such multiple-tandem alternate routing will now be described with reference also to Figure 5, which illustrates a sequence of messages subsequent to those depicted in Figure 2. It is assumed, therefore, that the switching unit at SSP 11 attempted to route the new call via a trunk group in link L3. Because there were no trunk groups available, the switching unit sent a Network Busy TCAP message to SCPINP 22 and received an 2 o Analyze Route message recommending SSP 12 as the tandem node. The switching unit at SSP 11 routed the call to SSP 12 via a trunk group in link L1. This is similar to the sequence described with reference to Figure 2. This time, however, by the time attempts to route the call via link L4 to SSP 13, link L4 also is unavailable.
The switching unit at SSP 12 will attempt the circuit groups in turn, as usual.
When it has 2 5 exhausted its circuit group list, the SSP 12 switching unit will encounter an AFR trigger causing it to interrupt the call processing and send a Network Busy TCAP
message to SCP/NP 22. As before, SCP/NP 22 will use the information in the Network Busy message to infer that link L4 also is unavailable and set its idleness index to zero for the same preset period of, say, 10 seconds. SCP/NP 22 will then compute the preferred 3 o alternate route from SSP 12 to SSP 13 and, in doing so, will treat both link L3 and link L4 as unavailable since it is still within 10 seconds from the point at which the SCP/NP
22 set the idleness index of link L3 to zero. Consequently, the SCP/NP 22 cannot use link L3 and node SSP 11 is the second alternate route. Assuming that the determines links LS and L7 and tandem node SSP 14 as the preferred alternate route, it will send to SSP 12 an Analyze Route message including the trunk group index of a trunk group in link L5. Upon receipt of the Analyze Route message, SSP 12 will route the call to second tandem SSP 14 which will complete the call to destination SSP 13 via a circuit group in link L7.
If, when second tandem SSP 14 attempted to complete the call to SSP 13 it could not because, by that time, link L7 also was not available, it could also query the SCP/NP
22 for a third alternate route. It is more likely that this time, however, the call would then be blocked or directed to an exception route.
to Typically, the exception route might be identified in each Analyze Route TCAP
message from the SCP/NP 22, for example as the last of three possible alternate routes, and would cause the querying SSP to route the call outside the network, for example to another carrier, for completion using other facilities, if available.
Where facilities in an adjacent network are not available, and a call i s blocked at a gateway node of the INMDR network, embodiments of the present invention may route the call to another gateway, if available, using Route Advance Interworking as illustrated in Figure 6. As before, SSP nodes 11, 12, 13 and 15 are within the Intelligent Network with Multi-vendor Dynamic Routing. Another node 26 is in an adjacent network operated by, for example, a different operating company and identified 2 o as "Other Network" and is linked to SSPs 13 and 15 by links L9 and L10, respectively, as shown in broken lines in Figure 1. SSPs 13 and 15 are gateways to the Other Network. So far as the INMDR network is concerned, for calls to node 26, the destination is SSP node 13, the gateway to the network containing node 26.
When a call from origin SSP 11 arrives at SSP 13 via the direct link L3, and no facilities are available within the Other network to complete the call to node 26, i.e link L9 is blocked, SSP 13 sends a Release with Cause message back to the switching unit at origin node SSP 11. Assuming "route advance" is activated at the switch of SSP
11, it will send a Network Busy TCAP query to the SCP/NP 22. A parameter in the Network Busy TCAP message could be provided so as to inform the SCP/NP 22 that 3 o the congestion occurred outside the INMDR network. Such a "FAILURECAUSE"
parameter already has been proposed in the International Telecommunications Union (ITU) standard Q.1214 ITU-T Distributed Functional Planes for INCS-1.
The SCP/NP 22 determines a new gateway destination node for the call which avoids using SSP 13, i.e. not via link L1, SSP 12 and link L4, but rather routes the call via link L2 to SSP 15 which also is a gateway to the Other Network and so can complete the call to node 26 via link L10.
As mentioned above, in contrast to known dynamic routing networks, such as DCR, where the network processor computes the alternate routes using information from the switches about the status of their trunk groups, the SCPINP 22 of the INMDR
network does not receive such periodic information. Instead, it computes the alternate routes based solely upon overflow information as represented by the Network Busy to TCAP messages it receives from the switches of the SSPs.
As illustrated in Figure 7, the trunk group in each link can carry direct and overflow traffic. In INMDR networks, each link is assigned a target overflow TTg. In normal operation, the link will carry a certain amount of Alternate Routing overflow traffic ACg, leaving idle capacity Ig. Thus, in normal operation, the link idleness Ig =
TTg - ACg. If the link has overflowed within the last 10 seconds, Ig = 0.
In DCR, the trunk group idleness is known by the network processor because it is reported by the switches. The SCP/NP 22 does not have this information and so must infer idleness Ig from the TCAP queries. The sequence is as follows:
2 0 1. Initially, the Target overflow TTg is set to a predetermined value, for example 10, to allow the system to initiate its operation.
2. The SCP/NP 22 continuously monitors the Network Busy messages to determine the number of overflows for each link and, during each successive time interval TTCycle 2 5 of, say, 3 minutes, the SCP/NP 22 counts the Network Busy messages for each link to obtain a measured rate Og(0)I~ of such messages. Preferably, O is equal to mean call holding time h, in which case the measured rate Og(h)/h, which will be used subsequently in this description of the algorithm.
3 0 3. The SCP/NP 22 compares the number of Network Busy messages per interval with a predetermined threshold rate b.
4. If measured rate O8(h)Ih > > b, the SCP/NP 22 reduces TTg by 2, reducing the number of calls alternate-routed sent via the instant link.
If measured rate 08(h)I h > b, TTg is reduced by 1.
If measured rate Og(h)/h = b, TTg is not changed.
If measured rate O8(h)Ih < b, TTg is increased by 1, increasing the number of calls alternate-routed sent via the instant link.
If measured rate O8(h)Ih < < b, i.e. virtually no overflows, TTg is increased by 2.
This sequence is repeated after every interval TTCycle.
The SCP/NP 22 monitors continuously the number of overflows on each link and retains these data for a predetermined time period t. Referring to Figure 8, assuming that at time To a Network Busy TCAP message is received, with TTg = 10 and, if the mean holding time, for example, is three minutes, the SCP/NP assumes that the calls at T-7 minutes and T-10 minutes have terminated, but the calls at T-1 minutes and minutes persist. If TTg = 10, idleness Ig = 10 - 2 = 8. The SCP/NP 22 calculates Ig in this way for each link.
5. As shown in Figure 9, for each possible two link alternate route, the calculates Residual Capacity RC as RCad - mTn [Iot, Itd]
2 o where Iar and I,~ are the idleness of links OT and TD, respectively.
In the first alternate route illustrated in Figure 9, RC = min [8,3]. Eight trunks are free in the first link OT,, but only three links are free in the second link T,D.
Consequently, five free trunks cannot be used for tandeming a call between O
and D and RC = 3.
2 5 6. The SCP/NP 22 chooses the alternate route with the greatest Residual Capacity as the preferred alternate route.
It should be noted that throughout this computation, the idleness Ig for the blocked links) which prompted the Network Busy query is(are) set to zero.
The preferred algorithm used by the SCP/NP 22 will now be described in more 3 o detail.
2.0 INMDR
The algorithm assumes - knowledge of the topology of the network - knowledge of the size of all trunk groups in the network and - that all trunk groups in the network are bidirectional.
2.1 Variables For trunk group g=ij between switches i and j O8(0): number of calls that overflowed g over the last D seconds (either side) 1 o ACg(~): number of calls alternate-routed on trunk group g over the last O
seconds TTg: target level for the number of alternate-routed calls on trunk group g Ig: Idleness on trunk group g as of the last update SIg: safe idleness on trunk group g as of the last update BUSYg: interval of time over which trunk group g is expected to be busy (Initial modelling has been carried out with BUSYg set to 30 seconds for all trunk groups g. A possible refinement would define group-specific values based on the trunk group size and an estimation of the traffic offered to it. ) 2 o Ng: number of circuits on trunk group g bgk: bounds on overflow rate for direct calls between i and j k=1, 2, 3, 4 (bg' C bg2 C bg3 C bg°) h: mean circuit/call holding time 2 5 TTCycle: update cycle of TTg values (TTCycle >_ h) 2.2 Initialization of global variables For each trunk group g in the network 3 o Og(.) = 0 ACg(.) = 0 TTg = 10 (This initial value of TTg could be a percentage of the trunk group size instead) bgl= 0.01' where ErIB(A'h,N~) = 0.01 bgz= 0.03' where ErIB(A'h,Nq) = 0.03 5 bg3= 0.05*~ where ErIB(A'h,Nq) = 0.05 bg4 = 0.07' where ErIB(~'h, N~) = 0.07 (The values 0.01,0.03,0.05,0.07 are parameters of the algorithm. These parameters can be set to a different set of values) 10 2.3 Target overflow update The following computation is performed for each switch s in the network. The computation is distributed in time. For example if there are 10 switches, the loops will be launched at times 0 (first switch), 0.1'TTCycle (second switch) 0.2'TTCycle (third switch), ..., 0.9'TTCycle (tenth switch) In the following loop, for bidirectional trunk groups, a group g will be considered twice over the window of TTCycle seconds, once for each switch on which g terminates.
LOOP
WAIT DURATION TTCycle 2 o FOR each trunk group g connected to switch s IF Og(h)/h<bg' TTg=min {TTg+2,Ng}
ELSE IF Og(h)/h<bg2 TTg=min {TTg+l,Ng}
ELSE IF Og(h)/h < bg3 TTg =TTg ELSE IF Og(h)/h<be' TTg=max {O,TTg-1}
ELSE TTg=max {O,TTg-2}
END IF
END FOR
END WAIT
END LOOP
2.4 Route computation The following procedure is executed by the SCP/NP 22 each time it receives an overflow (Network Busy) message from one of the network switches, i.e.
whenever a call overflows the direct route either because the direct route is full (HO
calls) or because the direct route does not exist (H1 calls;).
From the Network Busy message received at the NP, - the identity of the switch o that issued the message, and - the identity of the destination d of the call are known.
The route computation may be divided into three phases which are - initialization of local variables for route computation, - identification of the two best tandem switches.
- definition of the recommendation.
These phases are described below.
Initialize local variables used for route computation IF od pair is HO
Update O~(*) MaxResCap 1=0 MaxResCap2=0 ELSE {od pair is H 1 }
2 o MaxResCap, _ - ~
MaxResCap2= - ~
END IF
Tandems = NULL
2 5 Tandemz = NULL
Determine the two best tandem switches FOR each possible tandem t between o and d 3 0 log = TT« - AC«(h) I,~ = TT,~ - AC~(h) IF od pair is HO
IF O~ (B USYo~ > 0 Slog = 0 ELSE Slog = MAX {O,Io~}
END IF
IF O~(BUSY~ > 0 Sl,~ = 0 ELSE Sly, = max ~0,1~
END IF
ResidualCapacity = min ~SIo~,Sl~
ELSE {od pair is H1}
IF O~ (f * B USY~ > 0 log _ - 00 1 o IF O~ (f * B USY~J > 0 l~ _ - ~
(The parameter O <_ f <_ 1 is used to reduce the likeliness of a tandem where one of the legs of the alternate route through this tandem has overflowed in the recent past. Note that setting f = 0 corresponds to disabling of this condition.) ResidualCapacity = min ~lo~,l~
END IF
IF ResidualCapacity > MaxResCapl MaxResCap2 = MaxResG'ap, Tandem2 = Tandems MaxResCapl = ResidualCapacity 2 o Tandems = t ELSE IF ResidualCapacity > MaxResCap2 MaxResCap2 = ResidualCapacity Tandem2 = t END IF
Determine the recommendation tobe returned IF Tandems = NULL
Recommendation is BLOCK
3o ELSE
Update ACS(*) where t is Tandems Update ACS(*) where t is Tandems j' IF Tandem2 = NULL
Recommendation is Tandem,) ELSE
Recommendation is list ~Tandeml,Tandem2}
END IF
END IF
j' (When Tandem2 ~ NULL the algorithm may be refined to update also ACot(*) and AC~,(*) for t equal to Tandem2) 2.5 INMDR algorithm (at the N~
1 o Perform initialization (section 2.2) Launch target overflow update procedure (section 2.3) LOOP
WAIT FOR Overflow message (Network Busy from one of the SSPs) Compute route recommendation (section 2.4) Return Recommendation END WAIT
END LOOP
INDUSTRIAL APPLICABILITY
2 o Embodiments of the invention, with the ability to use multiple tandems and/or the above-described procedure for using overflow messages to infer idleness, are expected to lead to improved call completion rates in so-called "intelligent networks"
.
the first tandem switching unit further comprising means for responding to the return message to route the call via a direct link from the first tandem switching unit to the second tandem switching unit;
2 o the second tandenn switching unit comprising means for attempting to route the call via said direct link from the second tandem switching unit to the destination switching unit.
~~ccording to a fourth aspect of the invention, there is provided telecommunications network apparatus comprising a plurality of switching units and a 2 5 central computer unit having access to a routing database, the switching units being interconnected by links comprising trunk groups and connected to the central computer unit by a data communication system, each switching unit having call processing software including triggers for initiating queries to the central computer unit during call processing, 3 o a first switching unit comprising means for responding to a destination address in a call to attempt to route a call to a destination switching unit via a direct link a~~d, in the event that the attempt is unsuccessful or there is no direct link, issuing to the central computer unit an query message containing the destination address;
the central computer unit comprising means for responding to the query message, where there is a direct link but the attempt to use it was unsuccessful, by (i) identifying from the query message the link attempted unsuccessfully, (ii) updating the routing database to identify the link as unavailable; and, whether the query resulted from a lack of a direct link or an unsuccessful 1 o attempt to route via a direct link, (iii) determining at least one alternative route for the instant call using a tandem switching unit, (iv) compiling a return message including a network address for the tandem switching unit and (v) transmitting the return message to the first switching unit;
the first switching unit further comprising means responsive to the return for routing the call via a direct link from the first switching unit to the tandem switching unit;
the tandem switching unit further comprising means for attempting to complete the call by routing the call via said direct link from the first switching unit to the destination switching unit;
2 o wherein the central computer further comprises means for:
monitoring continuously the number of query messages generated by overflowing calls :for each link and retaining these data;
at intervals (TTCycle), each of which is at least equal to a mean holding time h, determining for each link a measured rate Og(O)/~ of such 2 5 messages during a preceding time interval D;
comparing each said measured rate Og(0)/D with a predetermined threshold overflow call rate b; and adjusting a previously-set Target Overflow value TTg for each link in dependence upon the degree to which the measured rate exceeds or is less 3 o than said threshold overflow call rate b;
the central computer yet further comprising means responsive to receipt of a said query from said first switching unit, where the query resulted from an unsuccessful attempt to route a call via an existing direct link, for determining the alternate route by identifying the direct link that was attempted unsuccessfully and setting to zero an idleness factor Ig for such direct link, whether the query resulted from a lack of a direct link or an unsuccessful attempt to route via an existing direct link, calculating for each link of 5 every potential alternate route for said call an idleness factor Ig by subtracting from the current Target Overflow value TTg for the particular link the number of calls ACg alternate-routed via such link during the immediately-preceding call holding time interval h;
calculating Residual Capacity RC for each possible alternate route as the 1o minimum idleness of links that could be used in one of said possible alternate routes;
selecting the alternate route with the greatest Residual Capacity as the preferred alternate. route;
determining an address for a tandem node in the preferred alternate route and sending a message incorporating said address to said first switching unit.
In the event that the Residual Capacity is less than or equal to zero, instead of selecting; an alternate route with the greatest Residual capacity, and determining an address for the tandem node and incorporating the address in a message to the first 2 o switching unit, the central computer may return a block recommendation, conveniently by means of a "Send to Resour<;e" message to the first switching unit.
In embodiments of the second and fourth aspects of the invention, the Residual Capacity RC may be determined for each possible two-link alternate route, i.e.
R(_od - mTn [Iot, Itd]
2 5 where I~,T and ITD are the idleness of link OT and link TD, respectively.
Prior to the accumulation of any overflow messages, the Target Overflow value TTg may be set initially to a predetermined value.
The tandem node switching unit may also issue a query message to the central 3 o computer in the event that it cannot complete the call by a direct link to the destination switching unit, and the central computer may then determine, using the similar steps as those in response to the first query from the first switching unit, an alternate route from the first tandem node to the destination node, but with the both the idleness factor for the direct link attempted by the first switching unit and the idleness factor for the second direct link attempted by the tandem switching unit set to zero.
BRIEF DESCRIPTION OF THF? DRAWINGS:
An embodiment of the invention will now be described by way of example only with refc;rence to the accompanying drawings, in which:
Figure 1 is a block schematic representation, much simplified, of a portion of a 1 o so-calledl "intelligent network" employing dynamic routing according to the present invention (INMDR);
Figure 2 illustrates alternate routing of a call in such network using one tandem node;
Figure 3 illustrates datafill at a Service Control Point/Network Processor (SCP/Nl') within the network;
Figure 4 illustrates an Originating Call Model for processing such a call;
Figure 5 illustrates alternate routing using two tandem nodes;
Figure 6 illustrates alternate routing at a gateway to another network when a route advance feature at an originating switch is active; and 2 o Figures 7, 8 and 9 illustrate operation of the SCP/NP in determining preferred alternate routes.
BEST NfODES FOR CARRYING OUT THE INVENTION:
For convenience, the terminology used in the following description for triggers, 2 5 and so on, generally is that used in North America, perhaps as specified in Bellcore standards. It should be appreciated that in other countries similar items are identified by different names, perhaps as specified in International Telecommunications Union (ITU) standards.
F;eferring to Figure 1, the illustrated portion of an Intelligent Network 10 3 o comprisEa five Service Switching Points (SSPs) 11, 12, 13, 14 and 15, respectively, are interconnected by links L1 - L8" which comprise trunk groups between the respective switching units. The SSPs 11 - l.5 are coupled to a Signalling System Number 7 (SS7) communications network 16 by messaging/signalling links 17 - 21, respectively, for communication with a central computer in the form of a Service Control Point/Network Processor (SCP/NP) 22 which has, or has access to, a routing database 23. Each SSP
is a netvvork node normally associated with a central office switching unit having SS7 messaging capability. For simplicity, only five Service Switching Points (SSPs) are shown. In a typical system, there would be many more SSPs and they would usually communicate with the SCP/NP :Z2 by way of Signal Transfer Points (STP) which are signalling hubs or concentrators which also are not shown for clarity. The Service Control :Point/Network Processor (SCP/NP) 22 is an "intelligence centre", i.e.
a central computer with access to application databases enabling it to deliver various combinations to of features, such as 1-800 number service and call redirection. The SCP/NP
22 could be a sep~~rate computer connected to the Intelligent Network (e.g. a Network Processor), or it could be a standard telephone company SCP.
1=;ach SSP has standard Intelligent Network call processing software including "Point-in-Call triggers" which can be provisioned or set to interrupt call processing momenti~rily and initiate a TCAP query to the SCP/NP 22 for instructions on how to complete: the call processing.
The SCP/NP 22 is programmed to enable it to determine alternate routes based solely upon Network Busy TCAI' message received from switching units throughout the network.. In contrast to a network processor in a DCR system, which updates the routing 2 o recommendations every 10 seconds based upon link idleness information sent to it by all of the svvitching units, and then downloads recommendations to the switching units; the SCP/NP 22 computes an individual routing recommendation every time it receives a Network: Busy query from a switching unit. Also, the SCP/NP 22 does not download alternate routing recommendations every 10 seconds for storage at the switching units.
2 5 Instead, it merely gives the individual switching unit the alternate routes) as and when requested.
The switching units do not need special INMDR application software to report link idleness to the SCP/NP 22. Consequently, any switching unit capable of IN
operation can be used, providing; the required triggers are implemented and active.
3 o C~eration of the intelligent network of Figure 1 will now be described with reference also to Figure 2, which depicts message exchange during the setting up of an alternate route using one tandem node.
Referring to Figures 1 and 2, a Calling Party 24, identified by a telephone set associated with SSP 11, seeks to place a call to a Called Party 25, identified by a second telephone set associated with !iSP 13.
(1) The switching unit of SSP 11 processes the dialled digits in the usual way, identifies SSP 13 as the destination node, and attempts to route the call via a circuit group in direct link 1.3.
(2) Link L3 has no circuit groups available. Consequently, when the originating switching unit at S!iP 11 has exhausted its list of circuit groups, it encounters an Automatic Flexible Routing (AFR) trigger (providing the Calling Party has subscribed to to this service). The AFR trigger occurs after the "Selecting Route" point in the call processing, as shown in the Originating Call Model shown in Figure 4. The originating switching unit SSP 11 checks that there are no gapping controls in effect for the call and then sends a Network Busy TCAP message to the SCP/NP 22. It should be noted that the switching unit might have: several groups of AFR triggers for different purposes.
The group associated with dynamic alternate routing would have a distinct address at the SCP/NP 22. Contents of Network-Busy and other messages are given in GR-1298-CORE AIN 0.2 Generic requirements, Dec. 1994, or in GR-1284-CORE AIN 0.1, Aug.
'92. The reader is directed to~ these documents for reference.
(3) Upon receipt of the Network_Busy TCAP message, the SCP/NP 22 2o determines from it that the originating node is SSP 11 and the destination node is SSP
13 and infers therefrom that link L3 is not available. In its routing database 23, SCP/NP
22 sets the idleness index of link L3 to zero for a preset period of, say, 10 seconds.
During that 10 second period, link L3 will be unavailable for recommendation in an alternate route. Using the newly-updated routing data, the SCP/NP 22 determines the preferred alternate route(s). As will be described in more detail later, for each possible alternate route of two links OT and TD between originating node O, tandem node T and destination node D, the SCP/NP 22 calculates the Residual Capacity as RC~d - mTn [Ipt, ltd]
where IoT and ITS are the idleness of links OT and TD, respectively. The 3 o then returns one of two TCAP messages to the SSP 11, namely (i) Analyze Route or (ii) Send To-Resource. Assuming that the SCP/NP 22 determines that links L1 and L4 and tandem node SSP 12 are available and preferred as an alternative route, it issues an Analyze-Route TCAP message to SSP 11. The Analyze Route message contents are as set out in Section 5.2.2.1 of TR-NWT-001285, AIN 0.1 SCP interface, Aug. 1992, and section 5.2.2.2 of GR-1299-CORE Issue 3, July 1996, INGR: Switch-SCP/Adjunct interface. The reader is directed to these documents for reference. For the purposes of dynamic routing, the SCP/NP 22 includes in the Analyze_Route message the appropriate trunk group index to redirect the call to tandem SSP 12. The SCP/NP 22 may include in the Analyze Route message up to three alternate routes namely (i) Primary Trunk Group, (ii) Alternate Trunk Group, and (iii) Second Alternate Trunk Group. In this io case, the SCP/NP 22 might identify links L2 and L8 and tandem node SSP 15 as a second alternate route and so include the route index of a trunk group in link L2 as a Second Alternate Trunk Group.
(4) Upon receipt ~of the Analyze_Route message, SSP 11 resumes call processing at the Select Route Point in Call and routes the call to SSP 12 using the recommended trunk in link L1.
(5) SSP 12 completes the call to destination node SSP 13 by way of link L4 in the normal way.
In the event that the SCP/NP 22, when queried by SSP 11, cannot recommend an alternative route with a. suitably high probability of completion, it may return a 2 o Send To Resource message to the SSP 11, requesting it to play a terminating announcement. In essence, the SCP/NP 22 issues a "BLOCK" recommendation.
Figure 3 illustrates, as an example, datafill for the routing tables at the SCP/NP
22, enabling it to identify the destination switching unit when the querying switching unit supplies only the called destination number. The first table lists the destination nodes/switching units for different groups of NPA-NNX numbers. The second table lists preferred tandem nodes for each pair of an origin node and a destination node.
The third table, i.e. the "Tandem to Route Index" table, maintains a list of route indices for all of the switching units in the network. (Unless the switch translations are such that the same index is valid in every switch.) 3 o It is envisaged that, in order to simplify the datafill in the SCP, a Bellcore equivalent of the parameter "RouteList", in the Route Select Failure message of the ITU
standard, could be used. This parameter contains the list of routes tried by the Service Switching Function (SSF) when trying to route the call before the trigger.
This information could possibly be used to eliminate the first SCP table, used to determine the destination switch. This would also simplify the maintenance of the SCP
datafill from a TelCo perspective as this table would not have to be maintained.
As previously mentioned, in order to avoid looping, known dynamic routing 5 systems do not allow the tandem node to request an alternate route if it cannot complete the call by the direct second link. Embodiments of the present invention, however, may allow "multiple tandeming" by allowing a tandems node to request an alternate route, in which case the alternate route might comprise more than one tandem and three or even more links. It was demonstrated by modelling that, depending upon the configuration 1 o of the network, there might be an improvement in call completion rates if alternate routes of three or more links are permitted. It was also found that a novel algorithm at the SCP/NP 22, to be described later, ensured that, if there is already a high traffic loading in the network, three link alternate routes would be less likely to be given out by the SCP/NP 22.
15 Such multiple-tandem alternate routing will now be described with reference also to Figure 5, which illustrates a sequence of messages subsequent to those depicted in Figure 2. It is assumed, therefore, that the switching unit at SSP 11 attempted to route the new call via a trunk group in link L3. Because there were no trunk groups available, the switching unit sent a Network Busy TCAP message to SCPINP 22 and received an 2 o Analyze Route message recommending SSP 12 as the tandem node. The switching unit at SSP 11 routed the call to SSP 12 via a trunk group in link L1. This is similar to the sequence described with reference to Figure 2. This time, however, by the time attempts to route the call via link L4 to SSP 13, link L4 also is unavailable.
The switching unit at SSP 12 will attempt the circuit groups in turn, as usual.
When it has 2 5 exhausted its circuit group list, the SSP 12 switching unit will encounter an AFR trigger causing it to interrupt the call processing and send a Network Busy TCAP
message to SCP/NP 22. As before, SCP/NP 22 will use the information in the Network Busy message to infer that link L4 also is unavailable and set its idleness index to zero for the same preset period of, say, 10 seconds. SCP/NP 22 will then compute the preferred 3 o alternate route from SSP 12 to SSP 13 and, in doing so, will treat both link L3 and link L4 as unavailable since it is still within 10 seconds from the point at which the SCP/NP
22 set the idleness index of link L3 to zero. Consequently, the SCP/NP 22 cannot use link L3 and node SSP 11 is the second alternate route. Assuming that the determines links LS and L7 and tandem node SSP 14 as the preferred alternate route, it will send to SSP 12 an Analyze Route message including the trunk group index of a trunk group in link L5. Upon receipt of the Analyze Route message, SSP 12 will route the call to second tandem SSP 14 which will complete the call to destination SSP 13 via a circuit group in link L7.
If, when second tandem SSP 14 attempted to complete the call to SSP 13 it could not because, by that time, link L7 also was not available, it could also query the SCP/NP
22 for a third alternate route. It is more likely that this time, however, the call would then be blocked or directed to an exception route.
to Typically, the exception route might be identified in each Analyze Route TCAP
message from the SCP/NP 22, for example as the last of three possible alternate routes, and would cause the querying SSP to route the call outside the network, for example to another carrier, for completion using other facilities, if available.
Where facilities in an adjacent network are not available, and a call i s blocked at a gateway node of the INMDR network, embodiments of the present invention may route the call to another gateway, if available, using Route Advance Interworking as illustrated in Figure 6. As before, SSP nodes 11, 12, 13 and 15 are within the Intelligent Network with Multi-vendor Dynamic Routing. Another node 26 is in an adjacent network operated by, for example, a different operating company and identified 2 o as "Other Network" and is linked to SSPs 13 and 15 by links L9 and L10, respectively, as shown in broken lines in Figure 1. SSPs 13 and 15 are gateways to the Other Network. So far as the INMDR network is concerned, for calls to node 26, the destination is SSP node 13, the gateway to the network containing node 26.
When a call from origin SSP 11 arrives at SSP 13 via the direct link L3, and no facilities are available within the Other network to complete the call to node 26, i.e link L9 is blocked, SSP 13 sends a Release with Cause message back to the switching unit at origin node SSP 11. Assuming "route advance" is activated at the switch of SSP
11, it will send a Network Busy TCAP query to the SCP/NP 22. A parameter in the Network Busy TCAP message could be provided so as to inform the SCP/NP 22 that 3 o the congestion occurred outside the INMDR network. Such a "FAILURECAUSE"
parameter already has been proposed in the International Telecommunications Union (ITU) standard Q.1214 ITU-T Distributed Functional Planes for INCS-1.
The SCP/NP 22 determines a new gateway destination node for the call which avoids using SSP 13, i.e. not via link L1, SSP 12 and link L4, but rather routes the call via link L2 to SSP 15 which also is a gateway to the Other Network and so can complete the call to node 26 via link L10.
As mentioned above, in contrast to known dynamic routing networks, such as DCR, where the network processor computes the alternate routes using information from the switches about the status of their trunk groups, the SCPINP 22 of the INMDR
network does not receive such periodic information. Instead, it computes the alternate routes based solely upon overflow information as represented by the Network Busy to TCAP messages it receives from the switches of the SSPs.
As illustrated in Figure 7, the trunk group in each link can carry direct and overflow traffic. In INMDR networks, each link is assigned a target overflow TTg. In normal operation, the link will carry a certain amount of Alternate Routing overflow traffic ACg, leaving idle capacity Ig. Thus, in normal operation, the link idleness Ig =
TTg - ACg. If the link has overflowed within the last 10 seconds, Ig = 0.
In DCR, the trunk group idleness is known by the network processor because it is reported by the switches. The SCP/NP 22 does not have this information and so must infer idleness Ig from the TCAP queries. The sequence is as follows:
2 0 1. Initially, the Target overflow TTg is set to a predetermined value, for example 10, to allow the system to initiate its operation.
2. The SCP/NP 22 continuously monitors the Network Busy messages to determine the number of overflows for each link and, during each successive time interval TTCycle 2 5 of, say, 3 minutes, the SCP/NP 22 counts the Network Busy messages for each link to obtain a measured rate Og(0)I~ of such messages. Preferably, O is equal to mean call holding time h, in which case the measured rate Og(h)/h, which will be used subsequently in this description of the algorithm.
3 0 3. The SCP/NP 22 compares the number of Network Busy messages per interval with a predetermined threshold rate b.
4. If measured rate O8(h)Ih > > b, the SCP/NP 22 reduces TTg by 2, reducing the number of calls alternate-routed sent via the instant link.
If measured rate 08(h)I h > b, TTg is reduced by 1.
If measured rate Og(h)/h = b, TTg is not changed.
If measured rate O8(h)Ih < b, TTg is increased by 1, increasing the number of calls alternate-routed sent via the instant link.
If measured rate O8(h)Ih < < b, i.e. virtually no overflows, TTg is increased by 2.
This sequence is repeated after every interval TTCycle.
The SCP/NP 22 monitors continuously the number of overflows on each link and retains these data for a predetermined time period t. Referring to Figure 8, assuming that at time To a Network Busy TCAP message is received, with TTg = 10 and, if the mean holding time, for example, is three minutes, the SCP/NP assumes that the calls at T-7 minutes and T-10 minutes have terminated, but the calls at T-1 minutes and minutes persist. If TTg = 10, idleness Ig = 10 - 2 = 8. The SCP/NP 22 calculates Ig in this way for each link.
5. As shown in Figure 9, for each possible two link alternate route, the calculates Residual Capacity RC as RCad - mTn [Iot, Itd]
2 o where Iar and I,~ are the idleness of links OT and TD, respectively.
In the first alternate route illustrated in Figure 9, RC = min [8,3]. Eight trunks are free in the first link OT,, but only three links are free in the second link T,D.
Consequently, five free trunks cannot be used for tandeming a call between O
and D and RC = 3.
2 5 6. The SCP/NP 22 chooses the alternate route with the greatest Residual Capacity as the preferred alternate route.
It should be noted that throughout this computation, the idleness Ig for the blocked links) which prompted the Network Busy query is(are) set to zero.
The preferred algorithm used by the SCP/NP 22 will now be described in more 3 o detail.
2.0 INMDR
The algorithm assumes - knowledge of the topology of the network - knowledge of the size of all trunk groups in the network and - that all trunk groups in the network are bidirectional.
2.1 Variables For trunk group g=ij between switches i and j O8(0): number of calls that overflowed g over the last D seconds (either side) 1 o ACg(~): number of calls alternate-routed on trunk group g over the last O
seconds TTg: target level for the number of alternate-routed calls on trunk group g Ig: Idleness on trunk group g as of the last update SIg: safe idleness on trunk group g as of the last update BUSYg: interval of time over which trunk group g is expected to be busy (Initial modelling has been carried out with BUSYg set to 30 seconds for all trunk groups g. A possible refinement would define group-specific values based on the trunk group size and an estimation of the traffic offered to it. ) 2 o Ng: number of circuits on trunk group g bgk: bounds on overflow rate for direct calls between i and j k=1, 2, 3, 4 (bg' C bg2 C bg3 C bg°) h: mean circuit/call holding time 2 5 TTCycle: update cycle of TTg values (TTCycle >_ h) 2.2 Initialization of global variables For each trunk group g in the network 3 o Og(.) = 0 ACg(.) = 0 TTg = 10 (This initial value of TTg could be a percentage of the trunk group size instead) bgl= 0.01' where ErIB(A'h,N~) = 0.01 bgz= 0.03' where ErIB(A'h,Nq) = 0.03 5 bg3= 0.05*~ where ErIB(A'h,Nq) = 0.05 bg4 = 0.07' where ErIB(~'h, N~) = 0.07 (The values 0.01,0.03,0.05,0.07 are parameters of the algorithm. These parameters can be set to a different set of values) 10 2.3 Target overflow update The following computation is performed for each switch s in the network. The computation is distributed in time. For example if there are 10 switches, the loops will be launched at times 0 (first switch), 0.1'TTCycle (second switch) 0.2'TTCycle (third switch), ..., 0.9'TTCycle (tenth switch) In the following loop, for bidirectional trunk groups, a group g will be considered twice over the window of TTCycle seconds, once for each switch on which g terminates.
LOOP
WAIT DURATION TTCycle 2 o FOR each trunk group g connected to switch s IF Og(h)/h<bg' TTg=min {TTg+2,Ng}
ELSE IF Og(h)/h<bg2 TTg=min {TTg+l,Ng}
ELSE IF Og(h)/h < bg3 TTg =TTg ELSE IF Og(h)/h<be' TTg=max {O,TTg-1}
ELSE TTg=max {O,TTg-2}
END IF
END FOR
END WAIT
END LOOP
2.4 Route computation The following procedure is executed by the SCP/NP 22 each time it receives an overflow (Network Busy) message from one of the network switches, i.e.
whenever a call overflows the direct route either because the direct route is full (HO
calls) or because the direct route does not exist (H1 calls;).
From the Network Busy message received at the NP, - the identity of the switch o that issued the message, and - the identity of the destination d of the call are known.
The route computation may be divided into three phases which are - initialization of local variables for route computation, - identification of the two best tandem switches.
- definition of the recommendation.
These phases are described below.
Initialize local variables used for route computation IF od pair is HO
Update O~(*) MaxResCap 1=0 MaxResCap2=0 ELSE {od pair is H 1 }
2 o MaxResCap, _ - ~
MaxResCap2= - ~
END IF
Tandems = NULL
2 5 Tandemz = NULL
Determine the two best tandem switches FOR each possible tandem t between o and d 3 0 log = TT« - AC«(h) I,~ = TT,~ - AC~(h) IF od pair is HO
IF O~ (B USYo~ > 0 Slog = 0 ELSE Slog = MAX {O,Io~}
END IF
IF O~(BUSY~ > 0 Sl,~ = 0 ELSE Sly, = max ~0,1~
END IF
ResidualCapacity = min ~SIo~,Sl~
ELSE {od pair is H1}
IF O~ (f * B USY~ > 0 log _ - 00 1 o IF O~ (f * B USY~J > 0 l~ _ - ~
(The parameter O <_ f <_ 1 is used to reduce the likeliness of a tandem where one of the legs of the alternate route through this tandem has overflowed in the recent past. Note that setting f = 0 corresponds to disabling of this condition.) ResidualCapacity = min ~lo~,l~
END IF
IF ResidualCapacity > MaxResCapl MaxResCap2 = MaxResG'ap, Tandem2 = Tandems MaxResCapl = ResidualCapacity 2 o Tandems = t ELSE IF ResidualCapacity > MaxResCap2 MaxResCap2 = ResidualCapacity Tandem2 = t END IF
Determine the recommendation tobe returned IF Tandems = NULL
Recommendation is BLOCK
3o ELSE
Update ACS(*) where t is Tandems Update ACS(*) where t is Tandems j' IF Tandem2 = NULL
Recommendation is Tandem,) ELSE
Recommendation is list ~Tandeml,Tandem2}
END IF
END IF
j' (When Tandem2 ~ NULL the algorithm may be refined to update also ACot(*) and AC~,(*) for t equal to Tandem2) 2.5 INMDR algorithm (at the N~
1 o Perform initialization (section 2.2) Launch target overflow update procedure (section 2.3) LOOP
WAIT FOR Overflow message (Network Busy from one of the SSPs) Compute route recommendation (section 2.4) Return Recommendation END WAIT
END LOOP
INDUSTRIAL APPLICABILITY
2 o Embodiments of the invention, with the ability to use multiple tandems and/or the above-described procedure for using overflow messages to infer idleness, are expected to lead to improved call completion rates in so-called "intelligent networks"
.
Claims (12)
1. A method of routing calls dynamically in a telecommunications network comprising a plurality of switching units and a central computer unit having access to a routing database, the switching units being interconnected by links comprising trunk groups and connected to the central computer unit by a data communication system, each switching unit having call processing software including triggers for initiating queries to the central computer unit during call processing, the method comprising the steps of:
at a first switching unit:
responding to a destination address in a call to attempt to route a call to a destination switching unit via a direct link and, in the event that the attempt is unsuccessful or there is no direct link, issuing to the central computer unit a query message containing the destination address;
at the central computer unit:
where the direct link exists but the attempt to use it was unsuccessful, responding to the query message by (i) identifying from the query message the link attempted unsuccessfully, (ii) updating the routing database to identify the link as unavailable for a predetermined period of time; whether the query resulted from a lack of a direct link or an unsuccessful attempt to route via an existing direct link, (iii) determining at least one alternative route for the instant call using a tandem switching unit, (iv) compiling a return message including a network address for the tandem switching unit and (v) transmitting the return message to the first switching unit;
at the first switching unit:
routing the call via a direct link from the first switching unit to the tandem switching unit; and at the tandem switching unit:
attempting to complete the call by routing the call via a direct link from the tandem switching unit to the destination switching unit;
in the event that the tandem switching unit cannot complete the call via the third-direct link from the tandem switching unit to the destination switching unit, at the tandem switching unit:
sending to the central computer unit a second query message including said destination address, at the central computer, responding to the second query message by (vi) identifying from the query message the direct link that the tandem switching unit attempted unsuccessfully, (vii) updating the routing database to identify such direct link as unavailable, while maintaining as unavailable the direct link first attempted by the first switching unit; (viii) determining at least one second alternative route for the instant call using a second tandem switching unit, (ix) compiling a return message including a network address for the tandem switching unit and (x) transmitting the return message to the first tandem switching unit;
at the first tandem switching unit:
routing the call via a direct link from the first tandem switching unit to the second tandem switching unit; and at the second tandem switching unit, attempting to route the call via a direct link from the second tandem switching unit to the destination switching unit.
at a first switching unit:
responding to a destination address in a call to attempt to route a call to a destination switching unit via a direct link and, in the event that the attempt is unsuccessful or there is no direct link, issuing to the central computer unit a query message containing the destination address;
at the central computer unit:
where the direct link exists but the attempt to use it was unsuccessful, responding to the query message by (i) identifying from the query message the link attempted unsuccessfully, (ii) updating the routing database to identify the link as unavailable for a predetermined period of time; whether the query resulted from a lack of a direct link or an unsuccessful attempt to route via an existing direct link, (iii) determining at least one alternative route for the instant call using a tandem switching unit, (iv) compiling a return message including a network address for the tandem switching unit and (v) transmitting the return message to the first switching unit;
at the first switching unit:
routing the call via a direct link from the first switching unit to the tandem switching unit; and at the tandem switching unit:
attempting to complete the call by routing the call via a direct link from the tandem switching unit to the destination switching unit;
in the event that the tandem switching unit cannot complete the call via the third-direct link from the tandem switching unit to the destination switching unit, at the tandem switching unit:
sending to the central computer unit a second query message including said destination address, at the central computer, responding to the second query message by (vi) identifying from the query message the direct link that the tandem switching unit attempted unsuccessfully, (vii) updating the routing database to identify such direct link as unavailable, while maintaining as unavailable the direct link first attempted by the first switching unit; (viii) determining at least one second alternative route for the instant call using a second tandem switching unit, (ix) compiling a return message including a network address for the tandem switching unit and (x) transmitting the return message to the first tandem switching unit;
at the first tandem switching unit:
routing the call via a direct link from the first tandem switching unit to the second tandem switching unit; and at the second tandem switching unit, attempting to route the call via a direct link from the second tandem switching unit to the destination switching unit.
2. A method of routing calls dynamically in a telecommunications network comprising a plurality of switching units and a central computer unit having access to a routing database, the switching units being interconnected by links comprising trunk groups and connected to the central computer unit by a data communication system, each switching unit having call processing software including triggers for initiating queries to the central computer unit during call processing, the method comprising the steps of:
at a first switching unit:
responding to a destination address in a call to attempt to route a call to a destination switching unit via a direct link and, in the event that the attempt is unsuccessful or there is no direct link, issuing to the central computer unit a query message containing the destination address;
at the central computer unit:
where there is a direct link but the attempt to use it was unsuccessful, responding to the query message by (i) identifying from the query message the link attempted unsuccessfully, (ii) updating the routing database to identify the link as unavailable;
whether the query resulted from a lack of a direct link or an unsuccessful attempt to route via a direct link, (iii) determining at least one alternative route for the instant call using a tandem switching unit, (iv) compiling a return message including a network address for the tandem switching unit and (v) transmitting the return message to the first switching unit;
at the first switching unit:
routing the call via a direct link from the first switching unit to the tandem switching unit; and at the tandem switching unit:
attempting to complete the call by routing the call via a direct link from the tandem switching unit to the destination switching unit;
further at the central computer:
monitoring continuously the number of queries generated by overflowing calls for each link and retaining these data;
at intervals (TTCycle), each of which is at least equal to a mean call holding time h, determining for each link a measured rate O g(.DELTA.)/.DELTA. of such messages during a preceding time interval .DELTA.;
comparing each said measured rate O g(.DELTA.)/.DELTA. with a predetermined threshold overflow call rate b; and adjusting a previously-set Target Overflow value TT g for each link in dependence upon the degree to which the measured rate exceeds or is less than said threshold overflow call rate b;
and, upon receipt of a said query from said first switching unit, where the query resulted from an unsuccessful attempt to route a call via an existing direct link, determining the alternate route by the method steps of:
at the central computer unit:
identifying the direct link that was an attempted unsuccessfully and setting to zero an idleness factor I g for such direct link, whether the query resulted from a lack of a direct link or an unsuccessful attempt to route via a direct link;
calculating for each link of every potential alternate route for said call an idleness factor I g by subtracting from the current Target Overflow value TT g for the particular link the number of calls AC g alternate-routed via such link during the immediately-preceding mean call holding time interval h;
calculating Residual Capacity RC for each possible alternate route as the minimum idleness of links that could be used in one of said possible alternate routes;
selecting the alternate route with the greatest Residual Capacity as the preferred alternate route;
determining an address for a tandem node in the preferred alternate route and sending a message incorporating said address to said first switching unit.
at a first switching unit:
responding to a destination address in a call to attempt to route a call to a destination switching unit via a direct link and, in the event that the attempt is unsuccessful or there is no direct link, issuing to the central computer unit a query message containing the destination address;
at the central computer unit:
where there is a direct link but the attempt to use it was unsuccessful, responding to the query message by (i) identifying from the query message the link attempted unsuccessfully, (ii) updating the routing database to identify the link as unavailable;
whether the query resulted from a lack of a direct link or an unsuccessful attempt to route via a direct link, (iii) determining at least one alternative route for the instant call using a tandem switching unit, (iv) compiling a return message including a network address for the tandem switching unit and (v) transmitting the return message to the first switching unit;
at the first switching unit:
routing the call via a direct link from the first switching unit to the tandem switching unit; and at the tandem switching unit:
attempting to complete the call by routing the call via a direct link from the tandem switching unit to the destination switching unit;
further at the central computer:
monitoring continuously the number of queries generated by overflowing calls for each link and retaining these data;
at intervals (TTCycle), each of which is at least equal to a mean call holding time h, determining for each link a measured rate O g(.DELTA.)/.DELTA. of such messages during a preceding time interval .DELTA.;
comparing each said measured rate O g(.DELTA.)/.DELTA. with a predetermined threshold overflow call rate b; and adjusting a previously-set Target Overflow value TT g for each link in dependence upon the degree to which the measured rate exceeds or is less than said threshold overflow call rate b;
and, upon receipt of a said query from said first switching unit, where the query resulted from an unsuccessful attempt to route a call via an existing direct link, determining the alternate route by the method steps of:
at the central computer unit:
identifying the direct link that was an attempted unsuccessfully and setting to zero an idleness factor I g for such direct link, whether the query resulted from a lack of a direct link or an unsuccessful attempt to route via a direct link;
calculating for each link of every potential alternate route for said call an idleness factor I g by subtracting from the current Target Overflow value TT g for the particular link the number of calls AC g alternate-routed via such link during the immediately-preceding mean call holding time interval h;
calculating Residual Capacity RC for each possible alternate route as the minimum idleness of links that could be used in one of said possible alternate routes;
selecting the alternate route with the greatest Residual Capacity as the preferred alternate route;
determining an address for a tandem node in the preferred alternate route and sending a message incorporating said address to said first switching unit.
3. A method as claimed in claim 2, wherein the Residual Capacity RC is calculated for each possible two-link alternate route as where I ot and I td are the idleness of link OT and link TD, respectively.
4. A method as claimed in claim 2, wherein, prior to the accumulation of any overflow messages, the Target Overflow value TT g for each link is set initially to a predetermined value.
5. A method as claimed in claim 2, wherein, in the event that the tandem node switching unit cannot complete the call via a direct link to the destination node, the tandem node switching unit issues a query message to the central computer for a further alternate route, the method further comprising the step of, at the central computer, setting an idleness factor for the second direct link to zero and, with the idleness factor for the first direct link still set to zero, calculating a second alternate route from the tandem node to the destination node using the same steps used to calculate the first alternate route, issuing to the first tandem node switching unit a recommendation for a second tandem node in the second alternate route, and, upon receipt of the recommendation, at the first tandem node switching unit attempting to route the call via a direct route to the second tandem node switching unit.
6. A method as claimed in claim 2, wherein, in the event that the Residual Capacity is less than or equal to zero, instead of the step of selecting an alternate route with the greatest Residual capacity, and the step of determining an address for the tandem node and incorporating the address in a message to the first switching unit, the method comprises the step of returning a block recommendation from the central computer to the first switching unit.
7. Telecommunications network apparatus comprising a plurality of switching units and a central computer unit having access to a routing database, the switching units being interconnected by links comprising trunk groups and connected to the central computer unit by a data communication system, each switching unit having call processing software including triggers for initiating queries to the central computer unit during call processing, first switching unit having means for responding to a destination address in a call to attempt to route a call to a destination switching unit via a direct link and, in the event that the attempt is unsuccessful or no direct link exists, issuing to the central computer unit a query message containing the destination address;
the central computer unit having means for responding to the query message where the direct link exists but the attempt to use it was unsuccessful, by (i) identifying from the query message the link attempted unsuccessfully, (ii) updating the routing database to identify the link as unavailable;
whether the query resulted from a lack of a direct link or an unsuccessful attempt to use a direct link, (iii) determining at least one alternative route for the instant call using a tandem switching unit, (iv) compiling a return message including a network address for the tandem switching unit and (v) transmitting the return message to the first switching unit;
the first switching unit further comprising means for responding to the return message by routing the call via a direct link from the first switching unit to the tandem switching unit;
the tandem switching unit comprising means for attempting to complete the call by routing the call via a direct link from the tandem switching unit to the destination switching unit; and in the event that the tandem switching unit cannot complete the call via such direct link, sending to the central computer unit a second query message including said destination address, the central computer further comprising means for responding to the second query message by (vi) identifying from the query message the direct link attempted unsuccessfully by the tandem switching link, (vii) updating the routing database to identify the link as unavailable, while maintaining as unavailable the direct link attempted unsuccessfully by the first switching unit; (viii) determining at least one second alternative route for the instant call using a second tandem switching unit, (ix) compiling a return message including a network address for the second tandem switching unit and (x) transmitting the return message to the first tandem switching unit;
the first tandem switching unit further comprising means for responding to the return message to route the call via a direct link from the first tandem switching unit to the second tandem switching unit;
the second tandem switching unit comprising means for attempting to route the call via said direct link from the second tandem switching unit to the destination switching unit.
the central computer unit having means for responding to the query message where the direct link exists but the attempt to use it was unsuccessful, by (i) identifying from the query message the link attempted unsuccessfully, (ii) updating the routing database to identify the link as unavailable;
whether the query resulted from a lack of a direct link or an unsuccessful attempt to use a direct link, (iii) determining at least one alternative route for the instant call using a tandem switching unit, (iv) compiling a return message including a network address for the tandem switching unit and (v) transmitting the return message to the first switching unit;
the first switching unit further comprising means for responding to the return message by routing the call via a direct link from the first switching unit to the tandem switching unit;
the tandem switching unit comprising means for attempting to complete the call by routing the call via a direct link from the tandem switching unit to the destination switching unit; and in the event that the tandem switching unit cannot complete the call via such direct link, sending to the central computer unit a second query message including said destination address, the central computer further comprising means for responding to the second query message by (vi) identifying from the query message the direct link attempted unsuccessfully by the tandem switching link, (vii) updating the routing database to identify the link as unavailable, while maintaining as unavailable the direct link attempted unsuccessfully by the first switching unit; (viii) determining at least one second alternative route for the instant call using a second tandem switching unit, (ix) compiling a return message including a network address for the second tandem switching unit and (x) transmitting the return message to the first tandem switching unit;
the first tandem switching unit further comprising means for responding to the return message to route the call via a direct link from the first tandem switching unit to the second tandem switching unit;
the second tandem switching unit comprising means for attempting to route the call via said direct link from the second tandem switching unit to the destination switching unit.
8. Telecommunications network apparatus comprising a plurality of switching units and a central computer unit having access to a routing database, the switching units being interconnected by links comprising trunk groups and connected to the central computer unit by a data communication system, each switching unit having call processing software including triggers for initiating queries to the central computer unit during call processing, a first switching unit comprising means for responding to a destination address in a call to attempt to route a call to a destination switching unit via a direct link: and, in the event that the attempt is unsuccessful or there is no direct link, issuing to the central computer unit a query message containing the destination address;
the central computer unit comprising means for responding to the query message, where there is a direct link but the attempt to use it was unsuccessful, by (i) identifying from the query message the link attempted unsuccessfully, (ii) updating the routing database to identify the link as unavailable; and, whether the query resulted from a lack of a direct link or an unsuccessful attempt to route via a direct link, (iii) determining at least one alternative route for the instant call using a tandem switching unit, (iv) compiling a return message including a network address for the tandem switching unit and (v) transmitting the return message to the first switching unit;
the first switching unit further comprising means responsive to the return for routing the call via a direct link from the first switching unit to the tandem switching unit;
the tandem switching unit further comprising means for attempting to complete the call by routing the call via said direct link from the first switching unit to the destination switching unit;
wherein the central computer further comprises means for:
monitoring continuously the number of query messages generated by overflowing calls for each link and retaining these data;
at intervals (TTCycle), each of which is at least equal to a mean holding time h, determining for each link a measured rate O g(.DELTA.)/.DELTA. of such messages during a preceding time interval .DELTA.;
comparing each said measured rate O g(.DELTA.)/.DELTA. with a predetermined threshold overflow call rate b; and adjusting a previously-set Target Overflow value TT g for each link in dependence upon the degree to which the measured rate exceeds or is less than said threshold overflow call rate b;
the central computer yet further comprising means responsive to receipt of a said query from said first switching unit, where the query resulted from an unsuccessful attempt to route a call via an existing direct link, for determining the alternate route by identifying the direct link that was attempted unsuccessfully and setting to zero an idleness factor I g for such direct link, whether the query resulted from a lack of a direct link or an unsuccessful attempt to route via an existing direct link, calculating for each link of every potential alternate route for said call an idleness factor I g by subtracting from the current Target Overflow value TT g for the particular link the number of calls AC g alternate-routed via such link during the immediately-preceding call holding time interval h;
calculating Residual Capacity RC for each possible alternate route as the minimum idleness of links that could be used in one of said possible alternate routes;
selecting the alternate route with the greatest Residual Capacity as the preferred alternate route;
determining an address for a tandem node in the preferred alternate route and sending a message incorporating said address to said first switching unit.
the central computer unit comprising means for responding to the query message, where there is a direct link but the attempt to use it was unsuccessful, by (i) identifying from the query message the link attempted unsuccessfully, (ii) updating the routing database to identify the link as unavailable; and, whether the query resulted from a lack of a direct link or an unsuccessful attempt to route via a direct link, (iii) determining at least one alternative route for the instant call using a tandem switching unit, (iv) compiling a return message including a network address for the tandem switching unit and (v) transmitting the return message to the first switching unit;
the first switching unit further comprising means responsive to the return for routing the call via a direct link from the first switching unit to the tandem switching unit;
the tandem switching unit further comprising means for attempting to complete the call by routing the call via said direct link from the first switching unit to the destination switching unit;
wherein the central computer further comprises means for:
monitoring continuously the number of query messages generated by overflowing calls for each link and retaining these data;
at intervals (TTCycle), each of which is at least equal to a mean holding time h, determining for each link a measured rate O g(.DELTA.)/.DELTA. of such messages during a preceding time interval .DELTA.;
comparing each said measured rate O g(.DELTA.)/.DELTA. with a predetermined threshold overflow call rate b; and adjusting a previously-set Target Overflow value TT g for each link in dependence upon the degree to which the measured rate exceeds or is less than said threshold overflow call rate b;
the central computer yet further comprising means responsive to receipt of a said query from said first switching unit, where the query resulted from an unsuccessful attempt to route a call via an existing direct link, for determining the alternate route by identifying the direct link that was attempted unsuccessfully and setting to zero an idleness factor I g for such direct link, whether the query resulted from a lack of a direct link or an unsuccessful attempt to route via an existing direct link, calculating for each link of every potential alternate route for said call an idleness factor I g by subtracting from the current Target Overflow value TT g for the particular link the number of calls AC g alternate-routed via such link during the immediately-preceding call holding time interval h;
calculating Residual Capacity RC for each possible alternate route as the minimum idleness of links that could be used in one of said possible alternate routes;
selecting the alternate route with the greatest Residual Capacity as the preferred alternate route;
determining an address for a tandem node in the preferred alternate route and sending a message incorporating said address to said first switching unit.
9. Apparatus as claimed in claim 8, wherein the means responsive to the query for calculating Residual Capacity RC calculates such Residual Capacity RC for each possible two-link alternate route as where I ot and I td are the idleness of link OT and link TD, respectively.
10. Apparatus as claimed in claim 8, wherein the central computer further comprises means operable, prior to the accumulation of any overflow messages, to set the Target Overflow value TT g for each link initially to a predetermined value.
11. Apparatus as claimed in claim 8, wherein the tandem node switching unit further comprises means operable, in the event that the tandem node switching unit cannot complete the call via a direct link to the destination node, to issue a query message to the central computer for a further alternate route, the central computer being operable to set an idleness factor for the second direct link to zero and, with the idleness factor for the first direct link still set to zero, calculate a second alternate route from the tandem node to the destination node using the same steps used to calculate the first alternate route, and issue to the first tandem node switching unit a recommendation for a second tandem node in the second alternate route, the first tandem node switching unit having means operable, upon receipt of the recommendation, for attempting to route the call via a direct route to the second tandem node switching unit.
12. Apparatus as claimed in claim 8, wherein the central computer unit comprises means operable, in the event that the Residual Capacity is less than or equal to zero, to return a block recommendation from the central computer to the first switching unit instead of said message incorporating said address for the tandem node.
Applications Claiming Priority (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| US08/822,618 | 1997-03-20 | ||
| US08/822,618 US5930348A (en) | 1997-03-20 | 1997-03-20 | Dynamically controlled routing of calls in intelligent networks |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CA2231785A1 CA2231785A1 (en) | 1998-09-20 |
| CA2231785C true CA2231785C (en) | 2001-09-25 |
Family
ID=25236521
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CA002231785A Expired - Fee Related CA2231785C (en) | 1997-03-20 | 1998-03-11 | Dynamically controlled routing of calls in intelligent networks |
Country Status (2)
| Country | Link |
|---|---|
| US (1) | US5930348A (en) |
| CA (1) | CA2231785C (en) |
Families Citing this family (65)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| GB9603582D0 (en) | 1996-02-20 | 1996-04-17 | Hewlett Packard Co | Method of accessing service resource items that are for use in a telecommunications system |
| EP0830039A1 (en) * | 1996-09-16 | 1998-03-18 | BRITISH TELECOMMUNICATIONS public limited company | Telecommunications intelligent network |
| KR100217719B1 (en) * | 1996-11-29 | 1999-09-01 | 윤종용 | Method for calculation communication path existence in lattice type communication network system |
| JPH10229444A (en) * | 1997-02-13 | 1998-08-25 | Nec Corp | Optimum call distribution method and system using intelligent network |
| US6351775B1 (en) * | 1997-05-30 | 2002-02-26 | International Business Machines Corporation | Loading balancing across servers in a computer network |
| US6002693A (en) * | 1997-06-04 | 1999-12-14 | Nortel Networks Corporation | Method and system for routing messages in a telecommunication network using an expanded signalling link selector field |
| US6330079B1 (en) * | 1997-09-08 | 2001-12-11 | Mci Communications Corporation | Integrated voicemail and faxmail platform for a communications system |
| SE512605C2 (en) * | 1997-10-20 | 2000-04-10 | Ericsson Telefon Ab L M | Method and apparatus of telecommunication systems |
| US6396905B2 (en) * | 1997-12-15 | 2002-05-28 | Siemens Information And Communication Networks, Inc. | Method and apparatus for routing blocked telephone calls |
| US6137806A (en) * | 1997-12-22 | 2000-10-24 | Northern Telecom Limited | Intelligent network with alternate routing of signalling messages, and method of operating such network |
| US6366658B1 (en) | 1998-05-07 | 2002-04-02 | Mci Communications Corporation | Telecommunications architecture for call center services using advanced interactive voice responsive service node |
| US6418205B2 (en) * | 1998-05-07 | 2002-07-09 | Mci Communications Corporation | Call and circuit state machine for a transaction control layer of a communications signaling gateway |
| US6493353B2 (en) | 1998-05-07 | 2002-12-10 | Mci Communications Corporation | Communications signaling gateway and system for an advanced service node |
| US6427002B2 (en) | 1998-05-07 | 2002-07-30 | Worldcom, Inc. | Advanced interactive voice response service node |
| US6647111B1 (en) | 1998-05-07 | 2003-11-11 | Mci Communications Corporation | System for executing advanced interactive voice response services using service-independent building blocks |
| US6496567B1 (en) | 1998-05-07 | 2002-12-17 | Mci Communications Corporation | Interactive voice response service node with advanced resource management |
| US6389126B1 (en) | 1998-05-07 | 2002-05-14 | Mci Communications Corporation | Service provisioning system for interactive voice response services |
| FR2782219B1 (en) * | 1998-08-06 | 2000-09-15 | Alsthom Cge Alcatel | ROUTING IN A PRIVATE NETWORK WITH COMPRESSION |
| US6377807B1 (en) * | 1998-10-20 | 2002-04-23 | Telefonaktiebolaget Lm Ericsson (Publ) | Hierarchical message addressing scheme |
| US6359979B1 (en) * | 1998-12-31 | 2002-03-19 | Nortel Networks Ltd | Enhanced call routing in competitive local telephone networks |
| JP2000244963A (en) * | 1999-02-19 | 2000-09-08 | Fujitsu Ltd | Mobile communication system |
| US6385172B1 (en) * | 1999-03-19 | 2002-05-07 | Lucent Technologies Inc. | Administrative weight assignment for enhanced network operation |
| KR100320907B1 (en) * | 1999-05-06 | 2002-02-04 | 서평원 | signal traffic routing method of NO.7 signaling |
| US6842447B1 (en) | 1999-06-14 | 2005-01-11 | Mci, Inc. | Internet protocol transport of PSTN-to-PSTN telephony services |
| US6735209B1 (en) | 1999-07-29 | 2004-05-11 | Worldcom, Inc. | Address definition for IP telephony services |
| US6453034B1 (en) | 1999-07-29 | 2002-09-17 | Mci Worldcom, Inc. | Method of and system for extending internet telephony over virtual private network direct access lines |
| US7136387B2 (en) * | 1999-08-09 | 2006-11-14 | Mci, Llc | Method of and system for providing quality of service in IP telephony |
| US7106756B1 (en) | 1999-10-12 | 2006-09-12 | Mci, Inc. | Customer resources policy control for IP traffic delivery |
| US7369536B2 (en) * | 1999-11-02 | 2008-05-06 | Verizon Business Global Llc | Method for providing IP telephony with QoS using end-to-end RSVP signaling |
| US6970930B1 (en) * | 1999-11-05 | 2005-11-29 | Mci, Inc. | Method and system of providing differentiated services |
| US7860114B1 (en) * | 1999-11-08 | 2010-12-28 | Verizon Business Global Llc | Method and system for dynamic gateway selection in an IP telephony network |
| US8743892B2 (en) * | 1999-11-08 | 2014-06-03 | Verizon Business Global Llc | Method and system for dynamic gateway selection in an IP telephony network |
| US6480588B1 (en) * | 1999-11-08 | 2002-11-12 | Worldcom, Inc. | Methods for providing prepaid telephony service via an internet protocol network system |
| US9281996B1 (en) * | 1999-11-08 | 2016-03-08 | Verizon Patent And Licensing Inc. | Method and system for dynamic gateway selection in an IP telephony network |
| US6434143B1 (en) * | 1999-11-08 | 2002-08-13 | Mci Worldcom, Inc. | Internet protocol telephony voice/video message deposit and retrieval |
| US6615236B2 (en) | 1999-11-08 | 2003-09-02 | Worldcom, Inc. | SIP-based feature control |
| TW522679B (en) * | 1999-11-18 | 2003-03-01 | Ericsson Telefon Ab L M | Selection of packet switch router routing method and bearer type within a system intranet |
| WO2001041461A2 (en) * | 1999-11-29 | 2001-06-07 | Siemens Aktiengesellschaft | Method for improving flow control in the message transfer part in asymmetric load generation |
| US6388991B1 (en) * | 1999-12-23 | 2002-05-14 | West Communications International Inc. | Method and system for interfacing between circuit network switches and ATM edge switches |
| US6453028B1 (en) * | 2000-02-28 | 2002-09-17 | Lucent Technologies Inc. | Dynamic traffic management in an intelligent network of a telephone system |
| GB0006292D0 (en) * | 2000-03-15 | 2000-05-03 | Pathfinder Tech Resources Ltd | Telephone call dialling |
| US6728782B1 (en) * | 2000-05-23 | 2004-04-27 | At&T Corp. | Method of verifying newly provisioned customer network route advertisements |
| US7123708B1 (en) * | 2001-03-01 | 2006-10-17 | Nt Investors, Inc. | Neutral tandem telecommunications network providing transiting, terminating, and advanced traffic routing services to public and private carrier networks |
| US7796608B2 (en) | 2001-03-20 | 2010-09-14 | Verizon Business Global Llc | Edge-based per-flow QoS admission control in a data network |
| US7209439B2 (en) * | 2001-03-20 | 2007-04-24 | Mci, Llc | Pool-based resource management in a data network |
| US7069337B2 (en) * | 2001-03-20 | 2006-06-27 | Mci, Inc. | Policy-based synchronization of per-class resources between routers in a data network |
| JP4095258B2 (en) * | 2001-04-03 | 2008-06-04 | 株式会社エヌ・ティ・ティ・ドコモ | Mobile communication system, gateway exchange selection server, and gateway exchange selection method |
| WO2003036889A1 (en) | 2001-10-25 | 2003-05-01 | Worldcom, Inc. | Communication session quality indicator |
| US6731743B2 (en) * | 2001-12-18 | 2004-05-04 | Sbc Properties, L.P. | AIN query redirection |
| US7397761B2 (en) * | 2002-06-10 | 2008-07-08 | Lucent Technologies Inc. | Routing restorable service-level-guaranteed connections using maximum 2-route flows |
| US8102988B2 (en) * | 2004-10-20 | 2012-01-24 | Neutral Tandem, Inc. | Method and system for dynamically terminating wireless and wireline calls between carriers |
| US20060282534A1 (en) * | 2005-06-09 | 2006-12-14 | International Business Machines Corporation | Application error dampening of dynamic request distribution |
| US8024455B2 (en) | 2006-10-26 | 2011-09-20 | Tango Networks, Inc. | System, method, and computer-readable medium for implementing intelligent network service functionality in a network |
| CN101115214B (en) * | 2007-08-15 | 2011-04-20 | 华为技术有限公司 | Method, equipment and system for intelligent call routing |
| US8401166B1 (en) | 2008-05-20 | 2013-03-19 | Peerless Network, Inc. | Systems and methods of mitigating phantom call traffic |
| CN101404674B (en) * | 2008-11-17 | 2011-09-21 | 杭州华三通信技术有限公司 | Call routing method, proxy server and relay device |
| US8238538B2 (en) | 2009-05-28 | 2012-08-07 | Comcast Cable Communications, Llc | Stateful home phone service |
| US11451475B2 (en) | 2019-12-19 | 2022-09-20 | Huawei Technologies Co., Ltd. | Packet forwarding based on geometric location |
| US11329717B2 (en) | 2020-05-26 | 2022-05-10 | Huawei Technologies Co., Ltd. | Packet forwarding incorporating partial sorting of path costs or utilities |
| US11374852B2 (en) * | 2020-05-29 | 2022-06-28 | Huawei Technologies Co., Ltd. | Piecewise shortest path first routing |
| US11438823B2 (en) | 2020-05-29 | 2022-09-06 | Huawei Technologies Co., Ltd. | Orthodromic routing |
| US11374652B1 (en) | 2020-12-10 | 2022-06-28 | Huawei Technologies Co., Ltd. | Method and apparatus for limited flooding and network routing region membership management |
| US11909627B2 (en) | 2021-01-04 | 2024-02-20 | Huawei Technologies Co., Ltd. | Method and apparatus for managing network status information using multiple degree of precision graph |
| US11601780B2 (en) | 2021-01-05 | 2023-03-07 | Huawei Technologies Co., Ltd. | Method and apparatus for propagating network status updates using directional tracking |
| US11476925B2 (en) | 2021-02-04 | 2022-10-18 | Huawei Technologies Co., Ltd. | Method and apparatus for limited flooding in networks using transit nodes |
Family Cites Families (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CA1118084A (en) * | 1979-06-22 | 1982-02-09 | Edmund Szybicki | Alternate routing for a telephone system |
| CA2002613C (en) * | 1988-12-05 | 1996-02-27 | Hisao Yamamoto | Adaptive routing control method |
| US4979118A (en) * | 1989-03-10 | 1990-12-18 | Gte Laboratories Incorporated | Predictive access-control and routing system for integrated services telecommunication networks |
| JP3071007B2 (en) * | 1991-10-22 | 2000-07-31 | 富士通株式会社 | Communication network control method |
| US5295183A (en) * | 1991-11-21 | 1994-03-15 | Northern Telecom Limited | Congestion control system for telecommunications |
| FR2690297B1 (en) * | 1992-04-17 | 1994-06-10 | Lebourges Marc | ROUTING OF INCOME-OPTIMIZED COMMUNICATIONS FOR TELECOMMUNICATIONS NETWORKS. |
| AT401702B (en) * | 1993-11-24 | 1996-11-25 | Siemens Ag Oesterreich | METHOD AND ARRANGEMENT FOR ROUTING CONNECTIONS IN A MEDIATING COMMUNICATION NETWORK |
| US5526414A (en) * | 1994-10-26 | 1996-06-11 | Northern Telecom Limited | Dynamically controlled routing using virtual nodes |
| US5844981A (en) * | 1995-11-27 | 1998-12-01 | Mci Communications Corporation | Method and system of improved routing to WATS |
| US5838769A (en) * | 1996-12-31 | 1998-11-17 | Mci Communications Corporation | Method of reducing risk that calls are blocked by egress switch or trunk failures |
-
1997
- 1997-03-20 US US08/822,618 patent/US5930348A/en not_active Expired - Lifetime
-
1998
- 1998-03-11 CA CA002231785A patent/CA2231785C/en not_active Expired - Fee Related
Also Published As
| Publication number | Publication date |
|---|---|
| US5930348A (en) | 1999-07-27 |
| CA2231785A1 (en) | 1998-09-20 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CA2231785C (en) | Dynamically controlled routing of calls in intelligent networks | |
| EP1005758B1 (en) | Management of calling name delivery in telephone networks providing for telephone number portability | |
| US5592672A (en) | System for load balancing between message processors by routing all queued messages to a particular processor selected by a deterministic rule | |
| US6137806A (en) | Intelligent network with alternate routing of signalling messages, and method of operating such network | |
| US5473630A (en) | Telecommunications rate data base accessing | |
| US5515425A (en) | Telecommunications system with active database | |
| US6108408A (en) | Apparatus and method for routing a dedicated number through alternate telephone carriers | |
| US5732130A (en) | System and method of providing enhanced subscriber services in a multi-node telecommunications network | |
| CA2278183C (en) | Communications network | |
| US20070019624A1 (en) | Trunk and switch architecture for providing switched-circuit connections to on-line data services | |
| CA2128295A1 (en) | System for providing enhanced subscriber services using isup call-setup protocol | |
| GB2305815A (en) | Telephone number portability | |
| AU663635B2 (en) | Telecommunications system with active database | |
| AU722752B2 (en) | Method for controlling an intelligent network call | |
| WO1997029579A1 (en) | Service control point congestion control method | |
| US6785378B2 (en) | Global title translation with load sharing | |
| US6747955B1 (en) | Method and system for congestion control in a telecommunications network | |
| US6341162B1 (en) | Telecommunications intelligent network | |
| JP2001507187A (en) | Communication network | |
| EP1131918A1 (en) | Triggering of intelligent network service | |
| US20040131052A1 (en) | Method and system for a dynamically assigned broadband network | |
| JP3317503B2 (en) | Communication links interconnecting service control points of load balancing groups for traffic management control | |
| WO2000065849A1 (en) | Enhancing an intelligent network service | |
| US7486668B2 (en) | Communicating an identification parameter of a network node | |
| EP1180310A1 (en) | Controlling intelligent network services |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| EEER | Examination request | ||
| MKLA | Lapsed |