CA2336075C - Call routing data management - Google Patents
Call routing data management Download PDFInfo
- Publication number
- CA2336075C CA2336075C CA002336075A CA2336075A CA2336075C CA 2336075 C CA2336075 C CA 2336075C CA 002336075 A CA002336075 A CA 002336075A CA 2336075 A CA2336075 A CA 2336075A CA 2336075 C CA2336075 C CA 2336075C
- Authority
- CA
- Canada
- Prior art keywords
- carrier
- switch
- network
- routing
- operational performance
- 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 - Lifetime
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04Q—SELECTING
- H04Q3/00—Selecting arrangements
- H04Q3/0016—Arrangements providing connection between exchanges
- H04Q3/0062—Provisions for network management
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/12—Shortest path evaluation
- H04L45/124—Shortest path evaluation using a combination of metrics
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04Q—SELECTING
- H04Q3/00—Selecting arrangements
- H04Q3/64—Distributing or queueing
- H04Q3/66—Traffic distributors
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04Q—SELECTING
- H04Q2213/00—Indexing scheme relating to selecting arrangements in general and for multiplex systems
- H04Q2213/13103—Memory
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04Q—SELECTING
- H04Q2213/00—Indexing scheme relating to selecting arrangements in general and for multiplex systems
- H04Q2213/13141—Hunting for free outlet, circuit or channel
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04Q—SELECTING
- H04Q2213/00—Indexing scheme relating to selecting arrangements in general and for multiplex systems
- H04Q2213/13148—Maximum profit routing
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04Q—SELECTING
- H04Q2213/00—Indexing scheme relating to selecting arrangements in general and for multiplex systems
- H04Q2213/13164—Traffic (registration, measurement,...)
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04Q—SELECTING
- H04Q2213/00—Indexing scheme relating to selecting arrangements in general and for multiplex systems
- H04Q2213/13166—Fault prevention
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04Q—SELECTING
- H04Q2213/00—Indexing scheme relating to selecting arrangements in general and for multiplex systems
- H04Q2213/13332—Broadband, CATV, dynamic bandwidth allocation
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04Q—SELECTING
- H04Q2213/00—Indexing scheme relating to selecting arrangements in general and for multiplex systems
- H04Q2213/13335—Simulation, emulation
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04Q—SELECTING
- H04Q2213/00—Indexing scheme relating to selecting arrangements in general and for multiplex systems
- H04Q2213/13349—Network management
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04Q—SELECTING
- H04Q2213/00—Indexing scheme relating to selecting arrangements in general and for multiplex systems
- H04Q2213/13352—Self-routing networks, real-time routing
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04Q—SELECTING
- H04Q2213/00—Indexing scheme relating to selecting arrangements in general and for multiplex systems
- H04Q2213/1338—Inter-exchange connection
Abstract
A switched network (1) for use in a telecommunications network comprising a plurality of networks (15a..15n), comprises at least one switch (3, 5) for routing traffic to a required destination via another network (9, 11) according to a routing table. The switched network (1) has call routing data management means including: means for monitoring a plurality of parameters associated with the other networks in the telecommunications network; means for determining a routing table for each switch in said network based on the monitored parameters; and, means for controlling the switch or switches according to the determined routing table. The switched network enables the optimal route to be used, and the dynamic nature of the invention means that upon an event occuring in an operational environment, the central call routing data management unit provides a mechanism for quickly assessing the impact of the change and if necessary, rapidly reconfiguring the network to accommodate the change.
Description
CALL ROUTING DATA MANAGEMENT
FIELD OF THE INVENTION
The invention relates to the routing of traffic in a telephone network, and in particular to the management of switching network systems for telephony and data transmission. It is equally applicable to fixed network-s and mobile networks.
BACKGROUND
The invention is concerned with routing traffic through a network where a network operator has the choice between more than one carrier.
When a subscriber makes a call, the subscriber uses one operator, but the operator is free to route the call through other carriers'_networks. The operator will choose which other carrier to use based on the tariff charges, amount of traffic, time of day, destination, and so on.
This is particularly true in the case of international traffic where many operators are forced to make use of other carriers. These operators might not even own a network but lease part of another operator's network. This function is known as International Simple Resale (ISR).
As the number of these operators has grown dramatically, the need to support day-to-day processes, by providing fast accurate information that helps them make quality decisions, has become relevant.
Operators currently providing this service manage their networks manually. They calculate the optimal routing tables for their exchanges and input the data by use of man machine language (NIIKL) . Due to the interconnect agreements between the operators it is often profitable to change the routing tables often, e.g. several times a day, and the changes have to be Substitute sheet 2 applied to each evritching exchanga on locatiozs.
Calca.lating the optimal traffic routes and applying the changes to the network therefore requires a large amount of resouxce. This is due to the coaplexity or the calculations, the amount of calculativns and the fact that they have to input the new data on location. The ca2culations are ccxnislex because many dynamic parameters are involved. OThexf manual processes are used, the number of dynamic parameters used is reduced, thereby simplifyizis the complexity of the calculaticm. This aitrsation iner+eases the z=iak for making mistakes.
Anoth.er problem is that when managing the routing tables tnanually, it is difficult to separate the destinati.ons intd amall areas. For this reason, a whole country is usually defined as one area, and subscribers are charged the same amount of money no tnatter where in the eountry the call is destined_ Qperators might therefore prefer to divide their bu,sinese area into srnalxer areas and charge subscribers in a more refined way, but then it becomes too demanding to solve *+A^=+=lly.
Such a system is disclosed in D8 5,606,602, in which routing tables are updated manually.
The aim of the presant inventia,x is to pravide a call routing rnanageaieut IsystOn which avercomes the disadvantages caentianed above.
6=2aY Qg THE IMMMON
According to a first aspect of the invention, Uc#aoos CA 02336075 2000-12-27 =
AMENDED SHEET
SUBSTITUTE SHEET 2a there is provided a switched telecommunications network connected to a plurality of carrier networks, said switched network having at least one switch for routing a call to a desired destination via a selected carrier network according to a routing table in each switch, wherein said switched network has call routing data management means oomprising: means in the switched network for monitoring a plurality of operational performance parameters for each of the carrier networks; means in the switched network for automatically determining the routing table for each switch in the switched network based, at least in part, on the monitored operational performance parameters of the carrier networks; means in the switched network for determining that a monitored operational performance parameter for one of the carrier networks has changed; means in the switched network for automatically updating the routing table in each switch upon determining that a monitored operational performance parameter for one of the canier networks has changed; and means for selecting a carrier network and controlling each switch according to each switch's determined routing table to route the call to the selected carrier network based, at least in part, on the monitored operational perFormance parameters of the canier networks.
According to another aspect of the invention, there is also provided a method of routing calls in a switched telecommunications network connected to a plurality of carrier networks, wherein said switched network includes at least one switch for routing a call to a desired destination via a selected carrier network according to a routing table in each switch, comprising the steps of:
monitoring by a network manager in the switched network, a plurality of operational performance parameters for each of the carrier networks; automatically determining by the network manager, the routing table for each switch in the switched network based, at least in part, on the monitored operational performance parameters of the carrier networks; determining by the call routing data manager, that a monitored operational performance parameter for one of the carrier networks has changed; automatically updating by the call routing data manager, the routing table in each respective switch in accordance with a loading schedule;
and controlling each switch according to each switch's determined routing table to route the call to a selected carrier network based, at least in part, on the monitored operational performance parameters of the can-ier networks.
... r v. = cr n m~r:w~rtc!~ v t _ : d5 _ y- U_c _17 : 54 +44 ] 17 910 3201_) +49 89 23994465 : q 6 BAISF DFSCR2P?'ION QF THE DRAWIIQ!GS
For a better understanding of the present tnvention, and to show more clearly how it may be carried into effect, reference will now be made, by way of example, to the accompanying drawings, in which:-Figure i shows a simplified diagram of a typical network configuration;
Figure 2 shows a call routing system according to the first embodiment of the px.^esent invention;
Figure 3 shows in greater detail the carrier selection process of Figure 2;
Figurc 4 shows in greater detail the route i5 selecti on process of Figure 2;
Figure 5 shows in greater detail the Maza. Machine Language (ML) generation process of Figure 2;
Figure 6 showe a call routing system according to a second embodiment of the present invention;
Wlmsaoo3 AMENDED SHEET
FIELD OF THE INVENTION
The invention relates to the routing of traffic in a telephone network, and in particular to the management of switching network systems for telephony and data transmission. It is equally applicable to fixed network-s and mobile networks.
BACKGROUND
The invention is concerned with routing traffic through a network where a network operator has the choice between more than one carrier.
When a subscriber makes a call, the subscriber uses one operator, but the operator is free to route the call through other carriers'_networks. The operator will choose which other carrier to use based on the tariff charges, amount of traffic, time of day, destination, and so on.
This is particularly true in the case of international traffic where many operators are forced to make use of other carriers. These operators might not even own a network but lease part of another operator's network. This function is known as International Simple Resale (ISR).
As the number of these operators has grown dramatically, the need to support day-to-day processes, by providing fast accurate information that helps them make quality decisions, has become relevant.
Operators currently providing this service manage their networks manually. They calculate the optimal routing tables for their exchanges and input the data by use of man machine language (NIIKL) . Due to the interconnect agreements between the operators it is often profitable to change the routing tables often, e.g. several times a day, and the changes have to be Substitute sheet 2 applied to each evritching exchanga on locatiozs.
Calca.lating the optimal traffic routes and applying the changes to the network therefore requires a large amount of resouxce. This is due to the coaplexity or the calculations, the amount of calculativns and the fact that they have to input the new data on location. The ca2culations are ccxnislex because many dynamic parameters are involved. OThexf manual processes are used, the number of dynamic parameters used is reduced, thereby simplifyizis the complexity of the calculaticm. This aitrsation iner+eases the z=iak for making mistakes.
Anoth.er problem is that when managing the routing tables tnanually, it is difficult to separate the destinati.ons intd amall areas. For this reason, a whole country is usually defined as one area, and subscribers are charged the same amount of money no tnatter where in the eountry the call is destined_ Qperators might therefore prefer to divide their bu,sinese area into srnalxer areas and charge subscribers in a more refined way, but then it becomes too demanding to solve *+A^=+=lly.
Such a system is disclosed in D8 5,606,602, in which routing tables are updated manually.
The aim of the presant inventia,x is to pravide a call routing rnanageaieut IsystOn which avercomes the disadvantages caentianed above.
6=2aY Qg THE IMMMON
According to a first aspect of the invention, Uc#aoos CA 02336075 2000-12-27 =
AMENDED SHEET
SUBSTITUTE SHEET 2a there is provided a switched telecommunications network connected to a plurality of carrier networks, said switched network having at least one switch for routing a call to a desired destination via a selected carrier network according to a routing table in each switch, wherein said switched network has call routing data management means oomprising: means in the switched network for monitoring a plurality of operational performance parameters for each of the carrier networks; means in the switched network for automatically determining the routing table for each switch in the switched network based, at least in part, on the monitored operational performance parameters of the carrier networks; means in the switched network for determining that a monitored operational performance parameter for one of the carrier networks has changed; means in the switched network for automatically updating the routing table in each switch upon determining that a monitored operational performance parameter for one of the canier networks has changed; and means for selecting a carrier network and controlling each switch according to each switch's determined routing table to route the call to the selected carrier network based, at least in part, on the monitored operational perFormance parameters of the canier networks.
According to another aspect of the invention, there is also provided a method of routing calls in a switched telecommunications network connected to a plurality of carrier networks, wherein said switched network includes at least one switch for routing a call to a desired destination via a selected carrier network according to a routing table in each switch, comprising the steps of:
monitoring by a network manager in the switched network, a plurality of operational performance parameters for each of the carrier networks; automatically determining by the network manager, the routing table for each switch in the switched network based, at least in part, on the monitored operational performance parameters of the carrier networks; determining by the call routing data manager, that a monitored operational performance parameter for one of the carrier networks has changed; automatically updating by the call routing data manager, the routing table in each respective switch in accordance with a loading schedule;
and controlling each switch according to each switch's determined routing table to route the call to a selected carrier network based, at least in part, on the monitored operational performance parameters of the can-ier networks.
... r v. = cr n m~r:w~rtc!~ v t _ : d5 _ y- U_c _17 : 54 +44 ] 17 910 3201_) +49 89 23994465 : q 6 BAISF DFSCR2P?'ION QF THE DRAWIIQ!GS
For a better understanding of the present tnvention, and to show more clearly how it may be carried into effect, reference will now be made, by way of example, to the accompanying drawings, in which:-Figure i shows a simplified diagram of a typical network configuration;
Figure 2 shows a call routing system according to the first embodiment of the px.^esent invention;
Figure 3 shows in greater detail the carrier selection process of Figure 2;
Figurc 4 shows in greater detail the route i5 selecti on process of Figure 2;
Figure 5 shows in greater detail the Maza. Machine Language (ML) generation process of Figure 2;
Figure 6 showe a call routing system according to a second embodiment of the present invention;
Wlmsaoo3 AMENDED SHEET
Figure 7 shows in more detail the steps involved in updating the switch routing tables in figure 6.
DETAILED DESCRIPTION OF A PREFERRED EMBODIMENT OF THE
PRESENT INVENTION.
Figure 1 shows a simplified network. It comprises an operator's network 1 containing switches 3 and 5.
Within the operator's network, the switches are connected by tie routes 7. Although only two switches and one tie route are shown, the operator's network can comprise any number of switches, and can be configured using various tie arrangements. The operator's network is connected to other carriers or network operators 9 and 11 by external routes 13. Each carrier or operator 9/11 may have switches of its own, and conriects to .15 various destinations 15a to 15, via Remote Virtual Paths (RVPs) 17. The switches 3 and 5 route calls according to their individual routing tables. These routing tables are updated from a central call routing data management unit 19, as will be described later.
Each carrier or network operator 9/11 will have its own pricing structure for the destinations it supports, which can vary by time-of-day and day-of-week. Each carrier will also.provide different quality of service levels to different destinations.
Figure 2 shows a functional overview of the operation of the invention according to a first embodiment. In the call routing data management unit 19, the optimal carrier selection for each destination is determined in step S1 based on the environmental parameters that prevail at a particular time, e.g.
carrier cost, carrier quality, time of day, amount of traffic, foreign currencies, and so on. A route is then selected in step 82, to pass traffic to the selected carriers from each switch. In step S3, the call routing data management unit 19 creates a generic route case description for each destination on each switch. According to the operation of this first embodiment, a network manager, (being a person responsible for the operator's network), can then use the generic routing case description as work orders for = implementing a routing case on a switch which is not supported by the system. The network manager is also able to manually schedule and download the routing case files to each switch in the operator's network, as shown in step S4. The system also has the capability of comparing the actual switch configuration with data in the call routing data management unit 19, as shown in step S5, and identifying any discrepancies between the two.
Each of the elements making up the above embodiment are carried out in the central call routing data management unit 19 (as shown in Figure 1). A more detailed description of the processes involved in each of these elements is given below.
Figure 3 expands on the carrier selection process of figure 2. "Carrier selection" lists in a defined order the carriers that are to be used to carry traffic to a specific destination area during a specific period of a defined day. The purpose of the carrier selection process is to determine whether there has been a.change to one or more of the parameters being monitored by the Dynamic Environmental Parameters unit 22 (eg.
Interconnect charges, quality status, carries class, etc). If any of these have changed, the carrier selection process determines whether the carrier selection should be changed for a specific destination.
According to the first embodiment, the network manager is able to evaluate the impact of the change before approving a new carrier selection.
The configuration of the telecommunications network is defined in a network model 24. This specifies how the constituent elements (ie. switches, carriers, other networks, etc) are all arranged. The call routing data management unit 19 provides the network manager with a list of all carriers that are connected via a Remote Virtual Path (RVP) to each destination area. The list is subdivided into various rate bands, and sorted by the interconnection charge recorded for each carrier. The list is known as the "Carrier List".
For each carrier listed, the system provides the following information:
- The Carrier Class as defined by the network manager.
- The active status of the carrier or the Remote Virtual Path. If either one or both of these network objects is marked "Offline"
then the status shows "Offline"
- The quality status of the external route or the Remote Virtual Path. The system displays the lowest ranked status associated with both of these network objects.
- The Loop-back Risk Status - the system determines whether there is a risk of loop-back for this carrier due to the existence of a reciprocal agreement to pass traffic to the specific destination area.
- The total capacity of all external routes to the carrier.
- The average occupancy of all external routes to the carrier.
- The forecast estimate of the occupancy of all external routes if the carrier was selected as the primary choice carrier in the carrier selection.
DETAILED DESCRIPTION OF A PREFERRED EMBODIMENT OF THE
PRESENT INVENTION.
Figure 1 shows a simplified network. It comprises an operator's network 1 containing switches 3 and 5.
Within the operator's network, the switches are connected by tie routes 7. Although only two switches and one tie route are shown, the operator's network can comprise any number of switches, and can be configured using various tie arrangements. The operator's network is connected to other carriers or network operators 9 and 11 by external routes 13. Each carrier or operator 9/11 may have switches of its own, and conriects to .15 various destinations 15a to 15, via Remote Virtual Paths (RVPs) 17. The switches 3 and 5 route calls according to their individual routing tables. These routing tables are updated from a central call routing data management unit 19, as will be described later.
Each carrier or network operator 9/11 will have its own pricing structure for the destinations it supports, which can vary by time-of-day and day-of-week. Each carrier will also.provide different quality of service levels to different destinations.
Figure 2 shows a functional overview of the operation of the invention according to a first embodiment. In the call routing data management unit 19, the optimal carrier selection for each destination is determined in step S1 based on the environmental parameters that prevail at a particular time, e.g.
carrier cost, carrier quality, time of day, amount of traffic, foreign currencies, and so on. A route is then selected in step 82, to pass traffic to the selected carriers from each switch. In step S3, the call routing data management unit 19 creates a generic route case description for each destination on each switch. According to the operation of this first embodiment, a network manager, (being a person responsible for the operator's network), can then use the generic routing case description as work orders for = implementing a routing case on a switch which is not supported by the system. The network manager is also able to manually schedule and download the routing case files to each switch in the operator's network, as shown in step S4. The system also has the capability of comparing the actual switch configuration with data in the call routing data management unit 19, as shown in step S5, and identifying any discrepancies between the two.
Each of the elements making up the above embodiment are carried out in the central call routing data management unit 19 (as shown in Figure 1). A more detailed description of the processes involved in each of these elements is given below.
Figure 3 expands on the carrier selection process of figure 2. "Carrier selection" lists in a defined order the carriers that are to be used to carry traffic to a specific destination area during a specific period of a defined day. The purpose of the carrier selection process is to determine whether there has been a.change to one or more of the parameters being monitored by the Dynamic Environmental Parameters unit 22 (eg.
Interconnect charges, quality status, carries class, etc). If any of these have changed, the carrier selection process determines whether the carrier selection should be changed for a specific destination.
According to the first embodiment, the network manager is able to evaluate the impact of the change before approving a new carrier selection.
The configuration of the telecommunications network is defined in a network model 24. This specifies how the constituent elements (ie. switches, carriers, other networks, etc) are all arranged. The call routing data management unit 19 provides the network manager with a list of all carriers that are connected via a Remote Virtual Path (RVP) to each destination area. The list is subdivided into various rate bands, and sorted by the interconnection charge recorded for each carrier. The list is known as the "Carrier List".
For each carrier listed, the system provides the following information:
- The Carrier Class as defined by the network manager.
- The active status of the carrier or the Remote Virtual Path. If either one or both of these network objects is marked "Offline"
then the status shows "Offline"
- The quality status of the external route or the Remote Virtual Path. The system displays the lowest ranked status associated with both of these network objects.
- The Loop-back Risk Status - the system determines whether there is a risk of loop-back for this carrier due to the existence of a reciprocal agreement to pass traffic to the specific destination area.
- The total capacity of all external routes to the carrier.
- The average occupancy of all external routes to the carrier.
- The forecast estimate of the occupancy of all external routes if the carrier was selected as the primary choice carrier in the carrier selection.
- A list of the operator switches that are directly connected via an external route to the carrier.
In figure 3, the "carrier selection criteria"
process 21 is used to generate and recommend to the network manager a carrier selection. The selection is determined by applying a defined set of criteria to the carrier list. The system supports a default carrier selection criteria, but, if desired, the network manager can also define a carrier selection criteria for a specific destination area.
For example, the network manager can define the following information for each level in the carrier selection criteria:
- Aii acceptable level of carrier class e.g.
minimum of "High".
- An acceptable level of quality as defined by the quality status measure e.g. greater than "Poor".
2.0 - An acceptable level of total route occupancy e.g. less than 70% utilised.
- The valid set of switch combinations e.g. the 2nd choice Carrier.must be on the same switch as the lst choice Carrier.
The system has implicit criteria to determine whether the carrier selection has changed as a result of the optimisation process 23 (see below). This is carried out in the change analysis criteria 25.
The network manager can activate the optimisation process 23 at any time. This process performs the following tasks:
- Creates an updated Carrier List - Creates a recommended Carrier Selection based on the Carrier Selection Criteria 21.
- Determines whether the Carrier Selection has changed since it was last evaluated by applying the Change Analysis Criteria 25.
- Updates the Change Manager 27 accordingly.
The order in which the system performs this process is prioritised so that it will firstly optimise the routes to destinations that are likely to receive the most traffic, and which are likely to provide the highest profit margin.
Using the above, the network manager is able to define the Carrier Selection that he intends to implement on all the operator's switches. The network manager is able to use the Carrier Selection recommended by the call routing data management unit 19, or create a new Carrier Selection. Whichever option is chosen, the result is a Carrier Selection 37 for each destination 15X.
Figure 4 shows in greater detail the Route Selection Process of figure 2. The purpose of the route selection process is to convert the approved carrier selection for a destination area 15x into a definition of the tie and external routes to be used to physically carry the traffic from each operator switch to each carrier selected. A generic routing plan 29 allows the network manager to define the route alternatives (a list of tie and external routes in order of preference) to be used to carry traffic from a specific operator switch to a.specific carrier.
For each combination of operator switch and carrier, the network manager can define different route alternatives for the following:
Destination area - This allows the network manager to specify different route alternatives to one or a group of destination areas. For example, the operator may wish to define one set of route alternatives for Europe and another for the rest of the world.
In figure 3, the "carrier selection criteria"
process 21 is used to generate and recommend to the network manager a carrier selection. The selection is determined by applying a defined set of criteria to the carrier list. The system supports a default carrier selection criteria, but, if desired, the network manager can also define a carrier selection criteria for a specific destination area.
For example, the network manager can define the following information for each level in the carrier selection criteria:
- Aii acceptable level of carrier class e.g.
minimum of "High".
- An acceptable level of quality as defined by the quality status measure e.g. greater than "Poor".
2.0 - An acceptable level of total route occupancy e.g. less than 70% utilised.
- The valid set of switch combinations e.g. the 2nd choice Carrier.must be on the same switch as the lst choice Carrier.
The system has implicit criteria to determine whether the carrier selection has changed as a result of the optimisation process 23 (see below). This is carried out in the change analysis criteria 25.
The network manager can activate the optimisation process 23 at any time. This process performs the following tasks:
- Creates an updated Carrier List - Creates a recommended Carrier Selection based on the Carrier Selection Criteria 21.
- Determines whether the Carrier Selection has changed since it was last evaluated by applying the Change Analysis Criteria 25.
- Updates the Change Manager 27 accordingly.
The order in which the system performs this process is prioritised so that it will firstly optimise the routes to destinations that are likely to receive the most traffic, and which are likely to provide the highest profit margin.
Using the above, the network manager is able to define the Carrier Selection that he intends to implement on all the operator's switches. The network manager is able to use the Carrier Selection recommended by the call routing data management unit 19, or create a new Carrier Selection. Whichever option is chosen, the result is a Carrier Selection 37 for each destination 15X.
Figure 4 shows in greater detail the Route Selection Process of figure 2. The purpose of the route selection process is to convert the approved carrier selection for a destination area 15x into a definition of the tie and external routes to be used to physically carry the traffic from each operator switch to each carrier selected. A generic routing plan 29 allows the network manager to define the route alternatives (a list of tie and external routes in order of preference) to be used to carry traffic from a specific operator switch to a.specific carrier.
For each combination of operator switch and carrier, the network manager can define different route alternatives for the following:
Destination area - This allows the network manager to specify different route alternatives to one or a group of destination areas. For example, the operator may wish to define one set of route alternatives for Europe and another for the rest of the world.
Route Origin - This allows the network manager to specify different route alternatives depending on one or more incoming routes to an operator switch. This allows the operator to differentiate the routing depending on the source of the traffic.
Random Selection (load sharing) - This allows the network,manager to specify different route alternatives for defined percentages of the total traffic volume to a specific destination area. For example, if an operator had two routes to the same carrier, then the network manager could define one route as the primary choice and the other as the secondary choice for 60t of the traffic, and reverse the order for the other 40t.
Auto-routing Process 31 - The network manager can activate the Auto-routing Process 31 at any time for a specific destination area or apply it to all destination areas using a specific approved carrier selection 37 which is awaiting processing.
For each destination area 15, affected, this process will raise the relevant route alternatives for each carrier in the carrier selection as stated in the Generic Routing Plan 29, and place them in the correct order into the route selection. At the end of the process there will exist a route selection 351..35n for each of the n operator switches for each of the destination areas analyzed.
The network manager can view each route selection 351..35, and recommend it for submission to the Man Machine Language (MML) Generation Process via the change manager 27.
If desired, the system can be set-up to allow a different network manager to approve each new Route Selection.
Figure 5 shows in greater detail the Man Machine Language MML Generation Process of figure 2. The purpose of the MML Generation Process 43 is to create a generic routing case description to be used as work orders. These are created from the approved route selections 351..35n, in the form of a routing case file 391..39n for each switch. The dynamic MML variables 41 include routing case number, routing case parameters and route parameters. For the routing case number, the network manager can specify a default routing case reference number for each destination area or, if preferred, define a specific reference number for each operator switch and destination area combination. If the default is maintained then the system will generate routing case files with the same reference number to the same destination area for each operator switch.
For each route alternative the system can add a range of route parameters. For example:
- Sending Program - B-Number Type - Echo Selection The network manager can define a default value for each of these parameters and also an alternative value for specific cases.
The network manager can activate the MML
Generation Process 43 at any time for a specific destination or apply it to all destination areas.with an approved route selection awaiting processing.
As mentioned above, the inputs to this process are the route selections 351..35n. The process 43 then generates generic routing case de::,cription, in the form of'routing case files 391..39n, for each associated switch. A generic routing case description means that the Man Machine Language may not contain all the MML
elements required by the operator's switches.
Consequently, the routing case descriptions should be reviewed and, if necessary, edited by the network manager prior to being downloaded onto the operator's switches.
The network manager can view and edit each routing case file as required via the Change Manager 27.
Therefore, in response to one of the monitored parameters changing, the embodiment described above firstly selects the appropriate carrier for each destination, and then determines the routing table that will allow traffic to pass from each switch to the chosen carrier. Generic routing case descriptions for realising the routing paths are then generated, checked by a network manager, and then downloaded onto each respective switch.
A functional overview of the operation of the invention according to a second embodiment is shown in figure 6. Steps one and two are identical to those in the first embodiment described above. The parameters relating to each carrier or network operator are continually monitored. Based on these monitored parameters, the optimal carrier selection for each destination is determined in step Si based on the environmental factors that prevail at a particular time. A route is then selected in step S2, to pass traffic to the selected carriers from each switch.
According to the second embodiment, however, the system automatically generates in step S3 the switch MML in the form of a routing case file for each destination on each switch. In addition, the schedizling and downloading of the routing tables is automatically controlled to each switch in the operator's network, step S4. This updating of the switches may also handle all login security issues, that is, preventing unauthorised changes to the switch routing. The system also has the capability of comparing the actual switch configuration with data in the management system, as shown in step S5, and identifying any discrepancies.
Figure 7 shows in greater detail the steps involved in automatically downloading the routing case files to the operators's switches. Having produced the routing case files from the steps discussed above, the central call routing management unit then determines a network loading schedule 45 which identifies.the sequence in which routing case files should be downloaded to the switches. The switches 3 and 5 are then updated 47 by downloading the associated routing case files for each switch into the network. The sequence is important and ensures that the routing case for a specific destination is made operative at the furthest point in the operator's network first (or at least at the same time as all other switches). Once the routing case has been downloaded, the central call routing management unit 19 may interpret the responses provided by the switch to ensure the process was successful. Once confirmed, the central call routing management unit can then update its database with the new operative carrier selection.
The invention as described in the embodiments above enables operators to optimise their routing tables. Furthermore, management of the routing tables is much more efficient since they are handled centrally, and the operators are able to optimise their routing tables at any given time.
The dynamic nature of the invention means that upon an event occurring in an operational environment (eg. a carrier provider reducing a tariff, or the quality of a carrier changes), the central call routing data management unit provides a mechanism for quickly assessing the impact of the change and if necessary, rapidly reconfiguring the network to accommodate the change.
On-line receival of routing optimisation data means that the system can respond faster to changes in operating parameters. It also allows a greater number of destinations to be used, for example, by dividing destination areas into towns rather than countries.
Random Selection (load sharing) - This allows the network,manager to specify different route alternatives for defined percentages of the total traffic volume to a specific destination area. For example, if an operator had two routes to the same carrier, then the network manager could define one route as the primary choice and the other as the secondary choice for 60t of the traffic, and reverse the order for the other 40t.
Auto-routing Process 31 - The network manager can activate the Auto-routing Process 31 at any time for a specific destination area or apply it to all destination areas using a specific approved carrier selection 37 which is awaiting processing.
For each destination area 15, affected, this process will raise the relevant route alternatives for each carrier in the carrier selection as stated in the Generic Routing Plan 29, and place them in the correct order into the route selection. At the end of the process there will exist a route selection 351..35n for each of the n operator switches for each of the destination areas analyzed.
The network manager can view each route selection 351..35, and recommend it for submission to the Man Machine Language (MML) Generation Process via the change manager 27.
If desired, the system can be set-up to allow a different network manager to approve each new Route Selection.
Figure 5 shows in greater detail the Man Machine Language MML Generation Process of figure 2. The purpose of the MML Generation Process 43 is to create a generic routing case description to be used as work orders. These are created from the approved route selections 351..35n, in the form of a routing case file 391..39n for each switch. The dynamic MML variables 41 include routing case number, routing case parameters and route parameters. For the routing case number, the network manager can specify a default routing case reference number for each destination area or, if preferred, define a specific reference number for each operator switch and destination area combination. If the default is maintained then the system will generate routing case files with the same reference number to the same destination area for each operator switch.
For each route alternative the system can add a range of route parameters. For example:
- Sending Program - B-Number Type - Echo Selection The network manager can define a default value for each of these parameters and also an alternative value for specific cases.
The network manager can activate the MML
Generation Process 43 at any time for a specific destination or apply it to all destination areas.with an approved route selection awaiting processing.
As mentioned above, the inputs to this process are the route selections 351..35n. The process 43 then generates generic routing case de::,cription, in the form of'routing case files 391..39n, for each associated switch. A generic routing case description means that the Man Machine Language may not contain all the MML
elements required by the operator's switches.
Consequently, the routing case descriptions should be reviewed and, if necessary, edited by the network manager prior to being downloaded onto the operator's switches.
The network manager can view and edit each routing case file as required via the Change Manager 27.
Therefore, in response to one of the monitored parameters changing, the embodiment described above firstly selects the appropriate carrier for each destination, and then determines the routing table that will allow traffic to pass from each switch to the chosen carrier. Generic routing case descriptions for realising the routing paths are then generated, checked by a network manager, and then downloaded onto each respective switch.
A functional overview of the operation of the invention according to a second embodiment is shown in figure 6. Steps one and two are identical to those in the first embodiment described above. The parameters relating to each carrier or network operator are continually monitored. Based on these monitored parameters, the optimal carrier selection for each destination is determined in step Si based on the environmental factors that prevail at a particular time. A route is then selected in step S2, to pass traffic to the selected carriers from each switch.
According to the second embodiment, however, the system automatically generates in step S3 the switch MML in the form of a routing case file for each destination on each switch. In addition, the schedizling and downloading of the routing tables is automatically controlled to each switch in the operator's network, step S4. This updating of the switches may also handle all login security issues, that is, preventing unauthorised changes to the switch routing. The system also has the capability of comparing the actual switch configuration with data in the management system, as shown in step S5, and identifying any discrepancies.
Figure 7 shows in greater detail the steps involved in automatically downloading the routing case files to the operators's switches. Having produced the routing case files from the steps discussed above, the central call routing management unit then determines a network loading schedule 45 which identifies.the sequence in which routing case files should be downloaded to the switches. The switches 3 and 5 are then updated 47 by downloading the associated routing case files for each switch into the network. The sequence is important and ensures that the routing case for a specific destination is made operative at the furthest point in the operator's network first (or at least at the same time as all other switches). Once the routing case has been downloaded, the central call routing management unit 19 may interpret the responses provided by the switch to ensure the process was successful. Once confirmed, the central call routing management unit can then update its database with the new operative carrier selection.
The invention as described in the embodiments above enables operators to optimise their routing tables. Furthermore, management of the routing tables is much more efficient since they are handled centrally, and the operators are able to optimise their routing tables at any given time.
The dynamic nature of the invention means that upon an event occurring in an operational environment (eg. a carrier provider reducing a tariff, or the quality of a carrier changes), the central call routing data management unit provides a mechanism for quickly assessing the impact of the change and if necessary, rapidly reconfiguring the network to accommodate the change.
On-line receival of routing optimisation data means that the system can respond faster to changes in operating parameters. It also allows a greater number of destinations to be used, for example, by dividing destination areas into towns rather than countries.
Claims (15)
1. A switched telecommunications network connected to a plurality of carrier networks, said switched network having at least one switch for routing a call to a desired destination via a selected carrier network according to a routing table in each switch, wherein said switched network has call routing data management means comprising: means in the switched network for monitoring a plurality of operational performance parameters for each of the carrier networks; means in the switched network for automatically determining the routing table for each switch in the switched network based, at least in part, on the monitored operational performance parameters of the carrier networks; means in the switched network for determining that a monitored operational performance parameter for one of the carrier networks has changed; means in the switched network for automatically updating the routing table in each switch upon determining that a monitored operational performance parameter for one of the carrier networks has changed; and means for selecting a carrier network and controlling each switch according to each switch's determined routing table to route the call to the selected carrier network based, at least in part, on the monitored operational performance parameters of the carrier networks.
2. The switched network as claimed in claim 1, wherein the means in the switched network for monitoring a plurality of operational performance parameters for each of the carrier networks includes means for also monitoring cost parameters associated with the carrier networks.
3. The switched network as claimed in claim 1, wherein the operational performance parameters include quality of service (QoS) parameters.
4. The switched network as claimed in claim 2, wherein the means for automatically determining the routing table for each switch comprises: means for automatically selecting from the carrier networks being monitored, an optimal carrier for each destination based on the operational performance parameters and cost parameters being monitored; and means for automatically determining which route to use to pass traffic from each switch to the selected carrier.
5. The switched network as claimed in claim 2, wherein the operational performance parameters and cost parameters are monitored online.
6. The switched network as claimed in claim 4, further comprising a network manager that defines a set of carrier-selection criteria, and wherein the means for automatically selecting an optimal carrier utilizes the defined set of carrier-selection criteria to select the optimal carrier.
7. The switched network as claimed in claim 2, further comprising means for creating a generic routing case description for each destination to assist in determining the routing table for each switch.
8. The switched network as claimed in claim 6, wherein the defined set of carrier-selection criteria is applied to each monitored carrier, and is selected from a group consisting of: carrier class; quality of service guaranteed; measured level of total route occupancy before being selected; expected level of total route occupancy after being selected;
interconnect charges;
and availability of a valid set of switch combinations.
interconnect charges;
and availability of a valid set of switch combinations.
9. A method of routing calls in a switched telecommunications network connected to a plurality of carrier networks, wherein said switched network includes at least one switch for routing a call to a desired destination via a selected carrier network according to a routing table in each switch, comprising the steps of: monitoring by a network manager in the switched network, a plurality of operational performance parameters for each of the carrier networks; automatically determining by the network manager, the routing table for each switch in the switched network based, at least in part, on the monitored operational performance parameters of the carrier networks; determining by the call routing data manager, that a monitored operational performance parameter for one of the carrier networks has changed;
automatically updating by the call routing data manager, the routing table in each respective switch in accordance with a loading schedule; and controlling each switch according to each switch's determined routing table to route the call to a selected carrier network based, at least in part, on the monitored operational performance parameters of the carrier networks.
automatically updating by the call routing data manager, the routing table in each respective switch in accordance with a loading schedule; and controlling each switch according to each switch's determined routing table to route the call to a selected carrier network based, at least in part, on the monitored operational performance parameters of the carrier networks.
10. The method as claimed in claim 9, wherein the step of monitoring a plurality of operational performance parameters for each of the carrier networks also includes monitoring cost parameters associated with the carrier networks.
11. The method as claimed in claim 10, wherein the step of automatically determining the routing table includes: automatically selecting from the carrier networks being monitored, an optimal carrier for each destination based on the operational performance parameters and cost parameters being monitored; and automatically determining which route to use to pass traffic from each switch to the selected carrier.
12. The method as claimed in claim 10, wherein the step of monitoring the operational performance parameters and cost parameters includes monitoring the parameters online.
13. The method as claimed in claim 11, wherein the steps of automatically updating the routing table in each switch and automatically selecting an optimal carrier are triggered in response to one of the monitored operational performance parameters and cost parameters changing.
14. The method as claimed in claim 11, wherein the step of automatically selecting an optimal carrier includes utilizing a set of carrier-selection criteria defined by the network manager to select the optimal carrier.
15. The method as claimed in claim 11, further comprising the step of creating by a call routing data management unit, a generic routing case description for each destination to assist the network manager in creating the routing table for each switch.
Applications Claiming Priority (3)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| GB9814311A GB2339108A (en) | 1998-07-01 | 1998-07-01 | Call routing data management |
| GB9814311.8 | 1998-07-01 | ||
| PCT/EP1999/004284 WO2000002400A1 (en) | 1998-07-01 | 1999-06-21 | Call routing data management |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CA2336075A1 CA2336075A1 (en) | 2000-01-13 |
| CA2336075C true CA2336075C (en) | 2009-02-10 |
Family
ID=10834799
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CA002336075A Expired - Lifetime CA2336075C (en) | 1998-07-01 | 1999-06-21 | Call routing data management |
Country Status (9)
| Country | Link |
|---|---|
| US (1) | US6584189B1 (en) |
| EP (1) | EP1092326B1 (en) |
| CN (1) | CN1132441C (en) |
| AT (1) | ATE458359T1 (en) |
| AU (1) | AU4899799A (en) |
| CA (1) | CA2336075C (en) |
| DE (1) | DE69942026D1 (en) |
| GB (1) | GB2339108A (en) |
| WO (1) | WO2000002400A1 (en) |
Families Citing this family (14)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2003526278A (en) * | 2000-03-03 | 2003-09-02 | ルミナス ネットワークス インコーポレイテッド | Routing switch for dynamically rerouting traffic due to failed link detection |
| US6973075B1 (en) * | 2000-10-03 | 2005-12-06 | Sprint Spectrum L.P. | Computer program and method for modifying data tables in a telecommunications switch |
| EP1338121A2 (en) * | 2000-11-17 | 2003-08-27 | Koninklijke Philips Electronics N.V. | System and method for efficiently communicating data over multiple networks using various transmission schemes |
| US6704406B1 (en) | 2001-05-29 | 2004-03-09 | Cisco Technology, Inc. | Automated route plan generation |
| US6950509B2 (en) * | 2001-10-22 | 2005-09-27 | Siemens Aktiengesellschaft | Method for determining a free connecting line in a switching center having a number of subscriber access units |
| DE60210574T2 (en) | 2002-01-08 | 2007-01-25 | Telefonaktiebolaget Lm Ericsson (Publ) | Network selection for a connection |
| WO2003058886A1 (en) * | 2002-01-08 | 2003-07-17 | Telefonaktiebolaget Lm Ericsson (Publ) | Network selection for connectivity |
| GB0207505D0 (en) | 2002-03-28 | 2002-05-08 | Marconi Corp Plc | A communications system |
| JP4186776B2 (en) * | 2003-10-01 | 2008-11-26 | 日本電気株式会社 | Flow control method and flow control method |
| US7657622B1 (en) * | 2003-12-23 | 2010-02-02 | At&T Intellectual Property Ii, L.P. | Unified web hosting and content distribution system and method for assuring predetermined performance levels |
| JP4616785B2 (en) * | 2006-03-28 | 2011-01-19 | 富士通株式会社 | Service quality management apparatus and service quality management method |
| US9178805B2 (en) * | 2010-12-28 | 2015-11-03 | Citrix Systems, Inc. | Systems and methods for policy based routing for multiple next hops |
| JP6277487B2 (en) * | 2014-04-07 | 2018-02-14 | パナソニックＩｐマネジメント株式会社 | Communication apparatus and communication system |
| FR3036239B1 (en) * | 2015-05-13 | 2018-07-06 | Bull Sas | NETWORK OF EQUIPMENTS INTERCONNECTED BY SWITCHES INTEGRATING ROUTING TABLES |
Family Cites Families (35)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US4797915A (en) * | 1986-10-09 | 1989-01-10 | American Telephone And Telegraph Company | Communication system having automatic call route selection |
| JPH02117236A (en) | 1988-10-27 | 1990-05-01 | Toshiba Corp | Route deciding system |
| US5072379A (en) | 1989-05-26 | 1991-12-10 | The United States Of America As Represented By The Adminstrator Of The National Aeronautics And Space Administration | Network of dedicated processors for finding lowest-cost map path |
| US5404451A (en) | 1990-02-06 | 1995-04-04 | Nemirovsky; Paul | System for identifying candidate link, determining underutilized link, evaluating addition of candidate link and removing of underutilized link to reduce network cost |
| US5508999A (en) | 1990-05-08 | 1996-04-16 | U S West Advanced Technologies, Inc. | Method and system for designing least cost local access networks |
| JP2770592B2 (en) | 1991-03-20 | 1998-07-02 | 日本電気株式会社 | switch |
| DE69127198T2 (en) * | 1991-10-14 | 1998-02-12 | Ibm | Routing of messages in a network consisting of local network segments connected by bridges |
| US5452350A (en) * | 1992-03-09 | 1995-09-19 | Advantis | Subscriber call routing processing system |
| US5311585A (en) * | 1992-04-14 | 1994-05-10 | At&T Bell Laboratories | Carrier proportioned routing |
| JP2826416B2 (en) * | 1992-06-05 | 1998-11-18 | 日本電気株式会社 | Connection router between local area networks |
| US5515425A (en) * | 1993-01-19 | 1996-05-07 | At&T Corp. | Telecommunications system with active database |
| TW284946B (en) | 1993-01-19 | 1996-09-01 | At & T Corp | |
| FR2702859A1 (en) | 1993-03-17 | 1994-09-23 | Philips Electronique Lab | Device for finding a shorter path in a network. |
| EP0637152A1 (en) | 1993-07-30 | 1995-02-01 | International Business Machines Corporation | Method and apparatus to speed up the path selection in a packet switching network |
| US5317566A (en) | 1993-08-18 | 1994-05-31 | Ascom Timeplex Trading Ag | Least cost route selection in distributed digital communication networks |
| US5638433A (en) | 1993-11-18 | 1997-06-10 | Best Rate, Inc. | Best rate telecommunication access code and data transceiver/facilitator (BRTF) |
| US5406620A (en) * | 1993-12-14 | 1995-04-11 | At&T Bell Laboratories | Method of allocating international transit traffic among a plurality of carriers in a terminating country |
| US5425085C1 (en) | 1994-03-18 | 2001-10-09 | Rates Technology Inc | Least control routing device for separate connection into phone line |
| US5526414A (en) * | 1994-10-26 | 1996-06-11 | Northern Telecom Limited | Dynamically controlled routing using virtual nodes |
| US5570417A (en) | 1995-03-28 | 1996-10-29 | Lucent Technologies Inc. | System for automatically providing customer access to alternative telephony service providers |
| US5583862A (en) * | 1995-03-28 | 1996-12-10 | Bay Networks, Inc. | Method and apparatus for routing for virtual networks |
| US5615254A (en) * | 1995-04-04 | 1997-03-25 | U S West Technologies, Inc. | Methods and systems for dynamic routing in a switched comunication network |
| GB2300089A (en) | 1995-04-21 | 1996-10-23 | Eurotel Telecom Limited | Least cost router in a telecommunications system |
| US5790642A (en) * | 1995-04-28 | 1998-08-04 | Dialogic Corporation | Competitively bidding service centers |
| US5903638A (en) * | 1995-05-12 | 1999-05-11 | Mci Communications Corporation | Telecommunications system for international call routing using traffic allocation |
| US5799072A (en) * | 1995-07-21 | 1998-08-25 | Callmanage | Telecommunications call management system |
| US5606602A (en) * | 1995-11-06 | 1997-02-25 | Summit Telecom Systems, Inc. | Bidding for telecommunications traffic |
| US5917897A (en) * | 1997-02-24 | 1999-06-29 | Summit Telecom System, Inc. | System and method for controlling a telecommunication network in accordance with economic incentives |
| DE19614926A1 (en) | 1996-04-16 | 1997-10-23 | Philips Patentverwaltung | Private telecommunications network |
| US5862339A (en) | 1996-07-09 | 1999-01-19 | Webtv Networks, Inc. | Client connects to an internet access provider using algorithm downloaded from a central server based upon client's desired criteria after disconnected from the server |
| CO4771167A1 (en) * | 1996-11-13 | 1999-04-30 | Concert Man Services Inc | METHOD OF AND SYSTEM FOR ROUTING CALLS THAT MEET THE REQUIREMENTS OF ROUTING REGULATIONS |
| US6178235B1 (en) * | 1996-12-13 | 2001-01-23 | Telefonaktiebolaget Lm Ericsson | Dynamic traffic distribution |
| US6021191A (en) * | 1997-03-05 | 2000-02-01 | At&T Corp. | Automatic routing technique |
| US5881138A (en) * | 1997-04-27 | 1999-03-09 | Ameritech Corporation | Method and system for detecting a change in at least one telecommunication service rate plan |
| US6208719B1 (en) * | 1998-06-09 | 2001-03-27 | Hewlett-Packard Company | Method and apparatus for telecommunications having automatic network adaptations and silent mode operations |
-
1998
- 1998-07-01 GB GB9814311A patent/GB2339108A/en not_active Withdrawn
- 1998-12-28 US US09/221,164 patent/US6584189B1/en not_active Expired - Lifetime
-
1999
- 1999-06-21 AU AU48997/99A patent/AU4899799A/en not_active Abandoned
- 1999-06-21 AT AT99932706T patent/ATE458359T1/en not_active IP Right Cessation
- 1999-06-21 EP EP99932706A patent/EP1092326B1/en not_active Expired - Lifetime
- 1999-06-21 CA CA002336075A patent/CA2336075C/en not_active Expired - Lifetime
- 1999-06-21 WO PCT/EP1999/004284 patent/WO2000002400A1/en active Application Filing
- 1999-06-21 CN CN998105678A patent/CN1132441C/en not_active Expired - Fee Related
- 1999-06-21 DE DE69942026T patent/DE69942026D1/en not_active Expired - Fee Related
Also Published As
| Publication number | Publication date |
|---|---|
| ATE458359T1 (en) | 2010-03-15 |
| EP1092326B1 (en) | 2010-02-17 |
| WO2000002400A1 (en) | 2000-01-13 |
| EP1092326A1 (en) | 2001-04-18 |
| AU4899799A (en) | 2000-01-24 |
| US6584189B1 (en) | 2003-06-24 |
| CN1317209A (en) | 2001-10-10 |
| GB9814311D0 (en) | 1998-09-02 |
| DE69942026D1 (en) | 2010-04-01 |
| CA2336075A1 (en) | 2000-01-13 |
| CN1132441C (en) | 2003-12-24 |
| GB2339108A (en) | 2000-01-12 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CA2336075C (en) | Call routing data management | |
| US5917898A (en) | Telecommunications network traffic management system | |
| JP2971580B2 (en) | Communication network management | |
| US6314092B1 (en) | Routing in a communications network | |
| CN100477589C (en) | Virtual personal network service management system and service supervisor and service agent device | |
| US5357564A (en) | Intelligent call screening in a virtual communications network | |
| CA2504003C (en) | Systems and methods for optimizing access provisioning and capacity planning in ip networks | |
| US6990525B1 (en) | System for selecting data communications service | |
| WO2016157194A2 (en) | Systems and methods for managing multi-layer communication networks | |
| CN110430590A (en) | Network is sliced matching process and device | |
| EP0726018B1 (en) | Telecommunications network traffic management system | |
| Mase et al. | Advanced traffic control methods for network management | |
| US7660402B1 (en) | System and method for managing telecommunication trunk groups | |
| US6850611B1 (en) | System and method for code routing in a telephony network | |
| WO1995012291A1 (en) | Telecommunications network traffic management system | |
| CA2346182A1 (en) | Management of path selection in a communications network | |
| Jere et al. | Operational Support Systems for Mobile Networks | |
| AU5010801A (en) | A method of managing a telecommunication network and a network management unit for implementing the method | |
| GB2338144A (en) | Predictive capacity management | |
| EP0726017B1 (en) | Telecommunications network traffic management system | |
| US6687349B1 (en) | System and method for defining a local communication space | |
| Callegati et al. | Engineering Circuit-Switched Networks | |
| Huisken et al. | Cooperation Models for Public-Private Partnerships in Traffic Management | |
| MXPA97003934A (en) | Route in a communication network | |
| Abdelaziz et al. | Optimizing cost and quality of international calls routing using multi-objective optimization techniques |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| EEER | Examination request | ||
| MKEX | Expiry |
Effective date: 20190621 |