WO2002007331A2 - Reseau de commutation de telecommunications configurable automatiquement - Google Patents

Reseau de commutation de telecommunications configurable automatiquement Download PDF

Info

Publication number
WO2002007331A2
WO2002007331A2 PCT/US2001/022440 US0122440W WO0207331A2 WO 2002007331 A2 WO2002007331 A2 WO 2002007331A2 US 0122440 W US0122440 W US 0122440W WO 0207331 A2 WO0207331 A2 WO 0207331A2
Authority
WO
WIPO (PCT)
Prior art keywords
trunk
node
sub
tree
routing
Prior art date
Application number
PCT/US2001/022440
Other languages
English (en)
Other versions
WO2002007331A3 (fr
Inventor
Charles J. Breidenstein
Eugene H. Kohlmeer
Original Assignee
Redcom Laboratories, Inc.
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Redcom Laboratories, Inc. filed Critical Redcom Laboratories, Inc.
Priority to AU2002222972A priority Critical patent/AU2002222972A1/en
Priority to JP2002513111A priority patent/JP2004519872A/ja
Priority to EP01984284A priority patent/EP1314284A4/fr
Publication of WO2002007331A2 publication Critical patent/WO2002007331A2/fr
Publication of WO2002007331A3 publication Critical patent/WO2002007331A3/fr

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04Q—SELECTING
    • H04Q3/00—Selecting arrangements
    • H04Q3/0016—Arrangements providing connection between exchanges
    • H04Q3/0025—Provisions for signalling

Definitions

  • the present invention relates to telecommunications switching systems and particularly a switching network of switching units connected by trunks which is automatically self configuring for routing calls between ports connected to the units.
  • the invention is especially suitable for use with modular switching units described in "Gueldenpfennig et al.” US Patent 4,228,536 and “Breidenstein, et al.” US Patent 4,229,816.
  • These patents disclose a time-division digital communication system that is primarily used as a telephone switching system characterized by an especially attractive cost/port behavior at small port sizes due to its modular, distributed architecture.
  • This telephone switching system is known as the IGX (Integrated Services Digital Network Gateway eXchange).
  • IGX systems have been applied to many types of networks including fixed and mobile tactical military installations. Configuration of these military systems in particular presents several challenges to rapid "in-theatre" deployment.
  • the configuration process involves creating an extensive database within the switching system for routing of calls within the network (trunk routing). Only when this database is constructed at each site, or network node, can calls be properly routed through that node. Complicating this is the need for trained personnel at each node and the difficulty of doing this work "under fire” .
  • Tactical network topologies are also by nature very dynamic, with nodes disappearing and reappearing again, possibly at different locations within the network.
  • the present invention provides a system (method and apparatus) for making such networks essentially self-configuring so that minimal on-site configuration (ADMINistration) is needed to make the node capable of routing calls through the network.
  • the invention permits each individual node of a network to determine its location within the network automatically; building trunk routing tables to permit network- wide call routing. This is implemented through software algorithms that reside within the switching system control software in addition to the control software already provided in such systems for processing of calls.
  • a system sends information out periodically from each node on every one of its trunks (circuits which interconnect nodes), giving information about the local node and any nodes it has learned about. This information is likewise received periodically by each node and used to update its local information about the network. This updated information will then be sent out when the next generation of updates takes place. Eventually each node will have learned the entire network topology and routing of calls to all parts of the network will be possible. Since the updating process continues, any changes in network topology will be picked up automatically, resulting in a "self-healing" network.
  • the invention is implemented in software algorithms or programs which process the data effecting a self-configuring of the network.
  • FIG. 1 is a block diagram of a switching unit used in each node of a telecommunications network embodying the invention
  • FIG. 2 is a more detailed block diagram of the memories of the unit shown in FIG. 1 ;
  • FIG. 3 is an exemplary network of nodes each of which may be a unit of the type shown in FIGs. 1 & 2.
  • FIG. 4 shows a modification of the network of FIG. 3.
  • FIG. 3 shows individual nodes 1 to 7 of an IGX network.
  • the system enables each node to determine its location within the network automatically, building trunk routing tables to permit network-wide call routing. The goal is to minimize, if not eliminate all trunk ADMIN related to network routing.
  • Each IGX node (separate switch) needs to acquire a unique node number.
  • the node number uniquely identifies the node within the network and may act as an office code for the purposes of network routing.
  • an IGX node For each of its ATRC (Automatic Trunk Route Configuration) trunks, an IGX node must be able to determine the node number sub-tree of the IGX network segment to which that trunk is connected. In order to avoid the complications which trunk group splitting and grooming would introduce, each trunk will be considered alone; in effect there are no predetermined trunk groups in this scheme. Furthermore, the trunk line and register signaling must be channel-associated so that the destination of a trunk can be determined unambiguously by digits received over that trunk. This does not preclude the use of alternate signaling systems, such as a Primary Rate (PRI) ISDN signaling system if the facility is treated atomically.
  • PRI Primary Rate
  • a node number sub-tree Once a node number sub-tree has been determined for a trunk, that trunk must be added to a dynamically created trunk group whose members share identical node number subtrees.
  • the destination node numbers comprising a trunk group's sub-tree permit selection of a trunk in that group by the IGX when routing calls to those nodes.
  • a node can obtain a unique node number.
  • One method is to derive the node number from the shelf zero's system controller board serial number (this is a circuit board containing a serial number which can be read by system software, and is always present in an IGX node), and somehow reduce it to a "small" unique number.
  • the node number should be small since it is used for routing and forms the initial address digits of station numbers.
  • Determining the node number sub-trees requires each node of a network to perform three tasks simultaneously and continuously.
  • each local ATRC trunk must periodically send the local node number sub-tree to its remote peer. When received by the remote node this becomes the remote node number subtree for this ATRC trunk, replacing any existing one stored for that trunk. Initially the local node number sub-tree sent is just the local node number itself.
  • each node must merge the remote node number sub-trees received from all ATRC trunks and append the result to the node number of this node. This then becomes the single local node number sub-tree for this node. This process must include pruning to eliminate any sub-trees that include the local node to prevent circular ("ring-around-the-rosy") patterns.
  • each local ATRC trunk must periodically receive a remote node number sub-tree from its remote peer, store it, and associate it with the trunk.
  • a node number subtree can be formally defined as either a single node number, or as a single node number followed by a list of one or more node number sub-trees separated by commas and enclosed in (). This recursive definition in Bachus-Naur Form (BNF) can be given as:
  • nnst ⁇ nodej ⁇ umber
  • ATRC trunks determine its local node number (say 5), which becomes the initial value of that node's local node number sub-tree.
  • the local node number sub-tree is sent out on all ATRC trunks. 3) The remote nodes associated with these trunks receive and store this node number sub-tree, associating it with the respective trunk on which it was received. The following value will be stored:
  • local node 5 will be receiving node number sub-trees from its ATRC trunks, and storing them as described in (3). Assume local node 5 receives the following node number sub-trees on its (say 3) ATRC trunks:
  • Trunk A 4 Trunk B: 7 Trunk C: 8
  • Routing of calls can begin immediately based upon the current node number sub-trees. After this process has iterated a number of times (dependent on the network size and topology), the local node sub-trees will have stabilized, and then can be used to route to any portion of the network. Trunks whose stored node number sub-trees are identical are placed into a dynamic group, and any node whose number appears in the node number sub-tree associated with that group is known to be reachable from a trunk in this group. Furthermore, the number of "(" traversed before finding a node number when scanning left to right within the node number sub-tree, indicates the number of hops to that node. This hops count can be used to judge the relative cost of a particular route in order to choose the optimal route when alternatives exist.
  • pruning of the local node number sub-tree is required in order to prevent creation of circular ("ring-around-the-rosy") patterns. This is accomplished by not including in the local node number sub-tree any sub-trees that begin with the local node number.
  • Generation 0 is the initial condition in which the local node number sub-tree is set to the local node number.
  • Trunk 6F Trunk Sub-tree 4 Trunk 6G Trunk Sub-tree: 7
  • Trunk 1C Trunk Sub-tree 3(1,5)
  • Trunk 2A Trunk Sub-tree 1(2,4,3)
  • Trunk 3C Trunk Sub-tree 1(2,4,3)
  • Trunk 4B Trunk Sub-tree 1(2,4,3)
  • Trunk 5D Trunk Sub-tree 3(1,5)
  • Trunk 5E Trunk Sub-tree: 4(1,5,6)
  • Trunk 1A Trunk Sub-tree 2(1(4(5,6),3(5)))
  • Trunk IB Trunk Sub-tree 4(1(2,3(5)),5(3(1)),6(7))
  • Trunk 1C Trunk Sub-tree 3(1(2,4(5,6)),5(4(1,6)))
  • Trunk 2A Trunk Sub-tree 1(2,4(5(3),6(7)),3(5(4)))
  • Trunk 3C Trunk Sub-tree 1(2,4(5(3),6(7)),3(5(4)))
  • Trunk 3D Trunk Sub-tree 5(3(1(2,4)),4(1(2,3),6(7)))
  • Trunk 4B Trunk Sub-tree 1(2,4(5(3),6(7)),3(5(4)))
  • Trunk 5D Trunk Sub-tree 3(1(2,4(5,6)),5(4(1,6)))
  • Trunk 6G Trunk Sub-tree 7(6(4(1,5)))
  • Trunk 7G Trunk Sub-tree 6(4(1(2,3),5(3)),7)
  • Trunk 1A Trunk Sub-tree 2(1(4(5(3),6(7)),3(5(4))))
  • Trunk IB Trunk Sub-tree 4(1(2,3(5)),5(3(1(2))),6(7))
  • Trunk 1C Trunk Sub-tree 3(1(2,4(5,6(7))),5(4(1(2),6(7))))
  • Trunk 2A Trunk Sub-tree 1(2,4(5(3),6(7)),3(5(4(6))))
  • Trunk 3C Trunk Sub-tree 1(2,4(5(3),6(7)),3(5(4(6))))
  • Trunk 3D Trunk Sub-tree 5(3(1(2,4(6))),4(1(2,3),6(7)))
  • Node 4 Local Sub-tree 4(1(2,3(5)),5(3(1(2))),6(7))
  • Trunk 4B Trunk Sub-tree 1(2,4(5(3),6(7)),3(5(4(6))))
  • Trunk 4F Trunk Sub-tree 6(4(1(2,3(5)),5(3(1))),7)
  • Trunk 5D Trunk Sub-tree 3(1(2,4(5,6(7))),5(4(1(2),6(7))))
  • Trunk 6G Trunk Sub-tree 7(6(4(1(2,3),5(3))))
  • Trunk 7G Trunk Sub-tree 6(4(1(2,3(5)),5(3(1))),7)
  • Trunk 1A Trunk Sub-tree 2(1(4(5(3),6(7)),3(5(4(6)))))
  • Trunk IB Trunk Sub-tree 4(1(2,3(5)),5(3(1(2))),6(7))
  • Trunk 1C Trunk Sub-tree 3(1(2,4(5,6(7))),5(4(1(2),6(7))))
  • Trunk 2A Trunk Sub-tree 1(2,4(5(3),6(7)),3(5(4(6(7)))))
  • Trunk 3C Trunk Sub-tree 1(2,4(5(3),6(7)),3(5(4(6(7)))))
  • Trunk 3D Trunk Sub-tree 5(3(1(2,4(6(7)))),4(1(2,3),6(7)))
  • Trunk 4B Trunk Sub-tree 1(2,4(5(3),6(7)),3(5(4(6(7)))))
  • Trunk 4E Trunk Sub-tree 5(3(1(2,4(6(7)))),4(1(2,3),6(7)))
  • Trunk 4F Trunk Sub-tree 6(4(1(2,3(5)),5(3(1(2)))),7)
  • Trunk 6G Trunk Sub-tree 7(6(4(1(2,3(5)),5(3(1))))
  • Trunk 7G Trunk Sub-tree 6(4(1(2,3(5)),5(3(1(2)))),7)
  • Each node is aware of the entire network, so that local action can be taken if a distant node becomes unreachable. For example, if a critical resource exists in a node that has become unreachable, a local alert can be given.
  • the ATRC program is integrated within the switching system architecture
  • Fig. l depicts the preferred embodiment, a telephone switching system which may be a time-division digital communication system as taught in "Gueldenpfennig et al.” US Patent 4,228,536 and “Breidenstein, et al.” US Patent 4,229,816. It should be noted, however, that the ATRC system of the present invention in no way relies on the specific system architecture, except to the extent that a central processing unit (CPU or Microprocessor) is assumed to exist. There is a Switching Matrix providing for Voice/Data switching between a plurality of Trunk Circuits. These Trunk Circuits connect externally to the adjacent nodes of a communications network which consists of these nodes as network elements.
  • Trunk Circuits connect externally to the adjacent nodes of a communications network which consists of these nodes as network elements.
  • Both the Switching Matrix and Trunk Circuits connect with and are controlled by the System Controller through its Input/Output Interfaces.
  • the System Controller in turn consists of, in addition to these Input/Output Interfaces, a Central Processing Unit (CPU) which may be a Microprocessor, and its associated Read-Only and Read/Write Memory.
  • CPU Central Processing Unit
  • the Read-Only Memory contains the control programs for directing the CPU in performing call processing tasks.
  • the Read/Write memory contains scratchpad areas for temporary storage of transient data associated with calls in progress, database routing tables for determining the routing of calls, buffers for holding data prior to input or output, and other data which may change over time.
  • Read-Only and Read/Write Memory are functional only, and may not be reflected in the types of memory actually used in the system. For example, all memory could be of the Read/ Write type, but the control program storage portion of that memory would by convention not be written into after an initial program load operation had taken place.
  • Fig.2 expands on the memory allocation by showing the additional requirements when the ATRC functions are integrated into the system.
  • This task embodies the algorithms which are the subject of the present invention. Normally a Task Scheduler passes control as required to the Normal Call Processing Tasks which already exist in the system for performing the required call processing functions. The addition of the Special ATRC Task requires that the Scheduler pass control to that task on a regular basis so that it may perform its functions.
  • These functions consist of sending out the local node number sub-tree on all ATRC trunks to other network nodes, receiving and processing the incoming sub-trees on ATRC trunks from other network nodes, determining ATRC trunk groups and the routing digit sets for those groups, and finally writing the ATRC route translations back into the Read/Write Memory reserved for this purpose within the route translation database portion.
  • This memory area is shown in Fig.2 with an arrow linking it to the Special ATRC Task, since that memory is controlled by that task.
  • Routing of calls is accomplished as follows: It might appear that one could simply send the destination node number and station number, and the call could be routed at intermediate nodes simply by choosing a trunk that leads most directly to that destination. That method would in fact work in the example network (FIG. 3) if one additional rule were added: never route back out on the same trunk group on which the call arrived. For a call from node 2 to node 5 for example, if the call reaches node 3 via node 1 and all "D" trunk are busy, this rule prevents routing back to node 1 in an effort to reach node 5 via node 4.
  • routing information (a routing digit set) from the originating end and use that information at any intermediate nodes.
  • This routing digit set is derived from the local node number sub-tree in the originating node and from the destination node number.
  • routing digit set is derived from the local node number sub-tree in the originating node and from the destination node number.
  • Node 1 Local Sub-tree 1(2,4(5(3) ,6(7) ,3(5)) ,3(5(4(6(7))) ,4(5 ,6(7))))
  • Trunk 1A Trunk Sub-tree 2(1(4(5(3),6(7),3(5)),3(5(4(6)),4(5,6(7)))))
  • Trunk IB Trunk Sub-tree 4(1(2,3(5)),5(3(1(2))),6(7),3(1(2),5))
  • Trunk 1C Trunk Sub-tree 3(1 (2,4(5,6(7))), 5 (4(1 (2), 6(7))), 4(1 (2), 5,6(7)))
  • Node 2 Local Sub-tree 2(1(4(5(3),6(7),3(5)),3(5(4(6(7))),4(5,6(7)))))
  • Trunk 2A Trunk Sub-tree 1(2,4(5(3),6(7),3(5)),3(5(4(6(7))),4(5,6(7))))
  • Node 3 Local Sub-tree 3(1(2,4(5,6(7))),5(4(1(2),6(7))),4(1(2),5,6(7)))
  • Trunk 3C Trunk Sub-tree 1(2,4(5(3),6(7),3(5)),3(5(4(6(7))),4(5,6(7))))
  • Trunk 3D Trunk Sub-tree 5(3(1(2,4(6(7))),4(1(2),6(7))),4(1(2,3),6(7),3(1(2))))
  • Trunk 3H Trunk Sub-tree 4(1(2,3(5)),5(3(1(2))),6(7),3(1(2),5))
  • Trunk 4B Trunk Sub-tree 1(2,4(5(3),6(7),3(5)),3(5(4(6(7))),4(5,6(7))))
  • Trunk 4F Trunk Sub-tree 6(4(1(2,3(5)),5(3(1(2))),3(1(2),5)),7)
  • Trunk 4H Trunk Sub-tree 3(1(2,4(5,6(7))),5(4(1(2),6(7))),4(1(2),5,6(7)))
  • Trunk 5D Trunk Sub-tree 3(1(2,4(5,6(7))),5(4(1(2),6(7))),4(1(2),5,6(7)))
  • Trunk 5E Trunk Sub-tree 4(1(2,3(5)),5(3(1(2))),6(7),3(1(2),5))
  • Trunk 6F Trunk Sub-tree 4(1(2,3(5)),5(3(1(2))),6(7),3(1(2),5))
  • Trunk 6G Trunk Sub-tree 7(6(4(1(2,3(5)),5(3(1)),3(1(2),5))))
  • Trunk 7G Trunk Sub-tree 6(4(1(2,3(5)),5(3(1(2))),3(1(2),5)),7)
  • node number sub-tree for node 2 is required:
  • This routing digit set gives all possible routes from node 2 to node 5, and this complete set of digits must be sent out by node 2, (followed of course by the station number) as the address digits for this call.
  • a node On receiving a call in this scheme, a node will use the next node number in the digit sub-string to choose an outgoing dynamic trunk group, taking into account the length of the sub-string as an indication of the most direct route. The call is then routed to a trunk in that group if possible, and the routing digit set sent consists of the digits remaining in sub-strings having the chosen node after deleting the routing digits already used.
  • An example will clarify:
  • Node 2 being the originating node, removes its node number before proceeding, leaving:
  • Node 2 then uses the next digit (1) to choose an outgoing trunk group. There is no choice in this case, so a trunk to node 1 is chosen, and the following routing digit set is sent to node 1:
  • Node 1 then uses the next digit (4) or (3) to choose an outgoing trunk group. Both sets of strings have the same length and so the routes have the same priority. Node 1 chooses a trunk to node 4, and the following routing digit set is sent to node 4: (5, 35)STN
  • Node 4 then uses the next digit (5) or (3) to choose an outgoing trunk group.
  • Sub-string (5) is shorter than (35), so the direct route to node 5 has priority. But let us assume that all trunks in that dynamic group are busy. Node 4 will then chose a trunk to node 3, and the following routing digit set is sent to node 3:
  • Node 3 then uses the next digit (5) to choose an outgoing trunk group to node 5, and the following routing digit set is sent to node 5:
  • Node 5 then routes the call to the station numbered STN.
  • STN represents the station number or any other information required to properly identify the called address.
  • Algorithms for generating node number sub-trees and extracting routing digit sets from them have been incorporated into a network simulation program written in a structured BASIC language.
  • the example node number generations and routing digit sets given above are in fact the output from that program.
  • the program is given here, followed by a line-by-line description.
  • NNODE_l$ FNCLEANUP$("l(" +TRUNK_1_A$ + ", " +TRUNK_1_B$ + " , " +TRUNK_1_
  • NNODE_3$ FNCLEANUP$("3(" +TRUNK_3_C$ + ",” +TRUNK_3_D$+ ", " +TRUNK_3_
  • NNODE_4$ FNCLEANUP$( "4( " + TRUNK_4_B$ + “ , " + TRUNK_4_E$ + “ , " + TRUNK_4_
  • NNODE 5S FNCLEANUP$("5(" +TRUNK_5_D$ + " , " +TRUNK_5_E$ + ”) ")
  • NNODE 6S FNCLEANUP$("6(" +TRUNK_6_F$ + " , " +TRUNK_6_G$ + ”))
  • NNODE_7$ FNCLEANUP$("7(" +TRUNK_7_G$ + ") ")
  • NTREES FNREPL$(FNREPL$(FNREPL$(FNREPL$(FNPRUNE$(TREE$) , "() ", “ "), "(, " , " (
  • ITEM$ LEFT(ITEM$,POS-l)+REPL$+RIGHT(ITEM$,POS-r-LEN(TEXT$)) 1580 UNTIL 0
  • a node number is requested.
  • node number sub-trees are requested.
  • the sub-trees are separated by commas, enclosed in parentheses and appended to the node number as described earlier to obtain the raw local node number subtree.
  • This is then pruned to remove any circular routing patterns, and then cleaned up to return the sub-tree to its canonical form. The results are then printed.
  • Network simulation mode The current values of the local node number sub-trees are printed along with the sub-trees for each of the trunk groups leading to adjacent nodes.
  • the local node number sub-trees are assigned to the trunk groups, simulating the periodic sending of the local node number sub-trees to adjacent nodes.
  • the next generation of the local node number sub-trees is produced by concatenating the received sub-trees separated by commas, enclosing the result in parentheses, appending the result to the local node number, and then cleaning up to return the resulting sub-trees to their canonical form.
  • Network simulation mode The routing digit sets are computed for each source and destination route combination, and printed. The program then exits.
  • FNCLEANUP$( NTREES ) function This function performs a cleanup of a raw node number sub-tree NTREES by eliminating any empty sub-tree components resulting from the pruning process. This returns the sub-tree to the canonical form to facilitate later parsing and prevents the sub-tree from growing in length on account of "junk" components.
  • Lines 1330 - 1520 FNPRUNE$( TREES ) function prunes a node number sub-tree TREES to eliminate any sub-tree components which include the current node. This is done to prevent circular routing patterns from developing. When a component includes the current node number, then all characters of the component below the current parenthesis level are excised, and the result becomes the new node number sub-tree for the next loop iteration. The function returns when no component containing the current node number remains in the sub-tree.
  • FNREPL$( ITEMS, TEXTS, REPLS ) function This function is used by the FNCLEANUPS function. It replaces all occurrences of the character string TEXTS found within the character string ITEMS with a replacement character string REPLS .
  • FNROUTE( TREES ) function This function computes the routing digit sets to be sent for each of the 7 destination nodes in the simulation, given a local node number sub-tree TREES. For each destination node, another function, FNDIGS is called to print the routing digit set for that destination.
  • FNDIGS( DIGITSS ) function TREES, POS and DEST$ are implicit arguments to this function.
  • This function computes and prints the routing digit set for destination node DESTS, starting at character position POS within local node number sub-tree TREES. It loops for each comma-delimited node number in the sub-tree, comparing it with the destination node and printing it if it matches. When the final right parenthesis in the subtree is found, the function returns. If a compound sub-tree (i.e.
  • FNDIGS is called recursively to process the sub-tree. In this way, the entire local node number sub-tree is traversed, and all possible routes to the destination will be found and printed.
  • Crankback alternate routing is a method of increasing the probability of completing a call when all trunks to a destination are found busy in a given node by backing up to the preceding node and trying an alternate route there.
  • crankback alternate routing is difficult to implement in the prior art due to a network node's lack of knowledge of the overall network topology.
  • crankback alternate routing is easily provided in the ATRC scheme.
  • a node simple retains the routing digit set for a call until it is known that the call has been successfully completed or abandoned.
  • the node finds all trunks busy in all available trunk groups to a destination, instead of returning a busy tone or indication to the caller, the node returns a crankback indication.
  • the preceding node receives this indication and proceeds just as if all trunks had been busy in that group, choosing the next alternate route or returning a crankback indication to the preceding node if all alternatives have been tried.
  • the first method would substitute the parentheses and comma characters in the notation with unique control characters chosen from the most common signaling system encountered.
  • a better method is to retain the abstract notation as defined earlier, and substitute appropriate control characters for the particular signaling system as required when sending or receiving on a trunk.
  • Two examples will serve to illustrate this process.
  • the first shows a possible conversion of the node number sub-tree notation into DTMF (Dual Tone Multi-Frequency) signals. This is a commonly used signaling system which is also the standard for push button telephone sets:
  • the following example shows a routing digit set converted into DTMF:
  • the potentially high message bandwidth requirements of the ATRC scheme can be reduced by employing multiple message sending rates. For example, whenever the local node number sub-tree changes, a new set of outgoing messages is sent scheduled by timer A. But when several identical local node number sub-trees are calculated in succession, the outgoing messages can be scheduled by timer B, where B is a longer duration timer than A. In this way the message traffic can be reduced on average, but rapid response to the appearance of new nodes and trunks is retained.
  • node number is expanded to include additional digits representing network and/or sub-network identification. These could be entered by ADMIN at each node.
  • a node When a node receives an incoming node number sub-tree on an ATRC trunk, it will now compare the additional network identifying digits (part of the very first node number in the string) against its own. If they are the same, then the adjacent node is known to be part of the same sub-network, and the normal ATRC process described above is applied. If the subnetworks differ however, then the trunk is known to be an inter-network gateway trunk, and only the sub-network identifying digits are periodically sent instead of the local node number sub-tree.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)
  • Exchange Systems With Centralized Control (AREA)
  • Telephonic Communication Services (AREA)

Abstract

L'invention concerne un système de configuration automatique de tables d'acheminement d'appels des unités de commutation d'un réseau de commutation téléphonique comprenant une multiplicité de noeuds connectés par des lignes réseau, dans lequel des messages de signalisation sont envoyés périodiquement sur les lignes réseau pour informer les noeuds connectés de la topologie du réseau, afin de permettre de créer des groupes de lignes réseau et de créer des tables d'acheminement de réseau. Les appels sont ensuite acheminés dans le réseau sur la base d'une adresse numérotée, laquelle adresse est convertie en chiffres d'acheminement sur la base des configurations d'acheminement stockées dans les tables d'acheminement. La configuration est actualisée de façon périodique, éliminant ainsi toute administration manuelle.
PCT/US2001/022440 2000-07-17 2001-07-17 Reseau de commutation de telecommunications configurable automatiquement WO2002007331A2 (fr)

Priority Applications (3)

Application Number Priority Date Filing Date Title
AU2002222972A AU2002222972A1 (en) 2000-07-17 2001-07-17 Automatically configurable telecommunications switching network
JP2002513111A JP2004519872A (ja) 2000-07-17 2001-07-17 自動構成可能な遠隔通信交換網
EP01984284A EP1314284A4 (fr) 2000-07-17 2001-07-17 Reseau de commutation de telecommunications configurable automatiquement

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
US61739800A 2000-07-17 2000-07-17
US09/617,398 2000-07-17

Publications (2)

Publication Number Publication Date
WO2002007331A2 true WO2002007331A2 (fr) 2002-01-24
WO2002007331A3 WO2002007331A3 (fr) 2002-04-18

Family

ID=24473491

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/US2001/022440 WO2002007331A2 (fr) 2000-07-17 2001-07-17 Reseau de commutation de telecommunications configurable automatiquement

Country Status (4)

Country Link
EP (1) EP1314284A4 (fr)
JP (1) JP2004519872A (fr)
AU (1) AU2002222972A1 (fr)
WO (1) WO2002007331A2 (fr)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20160162978A1 (en) * 2014-12-08 2016-06-09 Alibaba Group Holding Limited Method and system for providing conversation quick phrases

Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US4466060A (en) * 1982-02-11 1984-08-14 At&T Bell Telephone Laboratories, Incorporated Message routing in a computer network

Family Cites Families (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
SE467079B (sv) * 1990-09-19 1992-05-18 Ellemtel Utvecklings Ab Saett och anordning foer adressering i ett paketnaet
JP2856050B2 (ja) * 1993-11-30 1999-02-10 日本電気株式会社 ルーティング制御方法
US5412654A (en) * 1994-01-10 1995-05-02 International Business Machines Corporation Highly dynamic destination-sequenced destination vector routing for mobile computers
US6081512A (en) * 1997-06-30 2000-06-27 Sun Microsystems, Inc. Spanning tree support in a high performance network device

Patent Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US4466060A (en) * 1982-02-11 1984-08-14 At&T Bell Telephone Laboratories, Incorporated Message routing in a computer network

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
See also references of EP1314284A2 *

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20160162978A1 (en) * 2014-12-08 2016-06-09 Alibaba Group Holding Limited Method and system for providing conversation quick phrases

Also Published As

Publication number Publication date
AU2002222972A1 (en) 2002-01-30
EP1314284A2 (fr) 2003-05-28
JP2004519872A (ja) 2004-07-02
EP1314284A4 (fr) 2009-08-19
WO2002007331A3 (fr) 2002-04-18

Similar Documents

Publication Publication Date Title
US5463686A (en) Communication routing method with income optimization for telecommunication networks
US6928484B1 (en) Method and apparatus for discovering edge-disjoint shortest path pairs during shortest path tree computation
US7426518B2 (en) System and method for efficiently searching a forwarding database that is split into a bounded number of sub-databases having a bounded size
US5355364A (en) Method of routing electronic messages
JP2957052B2 (ja) 呼ルーティングシステム
US5333188A (en) Dialed number recognition arrangement
Cassaigne Special Factors of Sequences with Linear Subword Complexity.
JP4220116B2 (ja) 通信発呼者番号の決定および操作
US7327727B2 (en) Atomic lookup rule set transition
US5412714A (en) Mnemonic and synonymic addressing in a telecommunications system
CA2220790A1 (fr) Apprentissage automatique de l'acheminement dans un reseau au moyen de routes aleatoires
CN1074572A (zh) 电信呼叫处理装置
Shi et al. Hierarchical self-healing rings
US5299261A (en) Arrangement for effecting segmentation of a dialed number
JP2651096B2 (ja) 呼処理装置および呼処理方法
US7152113B2 (en) Efficient system and method of node and link insertion for deadlock-free routing on arbitrary topologies
US6111941A (en) Telecommunication system with loop-free switching tables
JP2008167464A (ja) Ｔｌｖに基づいたリンク状態のパケットの処理方法及び装置
WO2002007331A2 (fr) Reseau de commutation de telecommunications configurable automatiquement
US5966435A (en) Intermediate switch service management system architecture and method
US7738640B1 (en) Methods for reconciling discrepancies in circuit information among various telecommunication network management systems
CA2197199A1 (fr) Methode de configuration pour systeme de gestion de donnees
CN100583806C (zh) 路由迭代系统及其方法
US7058724B1 (en) Arrangement for routing a received signaling message based on a selected summary route in an SS7 network
CA2485639A1 (fr) Procede de determination du cout minimum d'installation des appareils d'un reseau de telecommunication fixe

Legal Events

Date Code Title Description
AK Designated states

Kind code of ref document: A2

Designated state(s): AE AG AL AM AT AU AZ BA BB BG BR BY BZ CA CH CN CR CU CZ DE DK DM DZ EE ES FI GB GD GE GH GM HR HU ID IL IN IS JP KE KG KP KR KZ LC LK LR LS LT LU LV MA MD MG MK MN MW MX MZ NO NZ PL PT RO RU SD SE SG SI SK SL TJ TM TR TT TZ UA UG UZ VN YU ZA ZW

AL Designated countries for regional patents

Kind code of ref document: A2

Designated state(s): GH GM KE LS MW MZ SD SL SZ TZ UG ZW AM AZ BY KG KZ MD RU TJ TM AT BE CH CY DE DK ES FI FR GB GR IE IT LU MC NL PT SE TR BF BJ CF CG CI CM GA GN GQ GW ML MR NE SN TD TG

121 Ep: the epo has been informed by wipo that ep was designated in this application
AK Designated states

Kind code of ref document: A3

Designated state(s): AE AG AL AM AT AU AZ BA BB BG BR BY BZ CA CH CN CR CU CZ DE DK DM DZ EE ES FI GB GD GE GH GM HR HU ID IL IN IS JP KE KG KP KR KZ LC LK LR LS LT LU LV MA MD MG MK MN MW MX MZ NO NZ PL PT RO RU SD SE SG SI SK SL TJ TM TR TT TZ UA UG UZ VN YU ZA ZW

AL Designated countries for regional patents

Kind code of ref document: A3

Designated state(s): GH GM KE LS MW MZ SD SL SZ TZ UG ZW AM AZ BY KG KZ MD RU TJ TM AT BE CH CY DE DK ES FI FR GB GR IE IT LU MC NL PT SE TR BF BJ CF CG CI CM GA GN GQ GW ML MR NE SN TD TG

DFPE Request for preliminary examination filed prior to expiration of 19th month from priority date (pct application filed before 20040101)
REG Reference to national code

Ref country code: DE

Ref legal event code: 8642

WWE Wipo information: entry into national phase

Ref document number: 2001984284

Country of ref document: EP

WWP Wipo information: published in national office

Ref document number: 2001984284

Country of ref document: EP