+

WO2005054996A2 - Procede et systeme servant a cloisonner et a affecter des codes dans une entite de reseau possedant une architecture d'arriere-plan de traitement distribue - Google Patents

Procede et systeme servant a cloisonner et a affecter des codes dans une entite de reseau possedant une architecture d'arriere-plan de traitement distribue Download PDF

Info

Publication number
WO2005054996A2
WO2005054996A2 PCT/US2004/039424 US2004039424W WO2005054996A2 WO 2005054996 A2 WO2005054996 A2 WO 2005054996A2 US 2004039424 W US2004039424 W US 2004039424W WO 2005054996 A2 WO2005054996 A2 WO 2005054996A2
Authority
WO
WIPO (PCT)
Prior art keywords
message
card
ccm
call
node
Prior art date
Application number
PCT/US2004/039424
Other languages
English (en)
Other versions
WO2005054996A3 (fr
Inventor
Brahmananda Vempati
Jianming Xu
Original Assignee
Acatel Wireless, 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 Acatel Wireless, Inc. filed Critical Acatel Wireless, Inc.
Publication of WO2005054996A2 publication Critical patent/WO2005054996A2/fr
Publication of WO2005054996A3 publication Critical patent/WO2005054996A3/fr

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04Q—SELECTING
    • H04Q3/00—Selecting arrangements
    • H04Q3/64—Distributing or queueing
    • H04Q3/66—Traffic distributors

Definitions

  • the performance of a network node is judged by its capacity and speed in handling simultaneous calls. That is, the benchmark is the maximum number of calls that the network node can handle at any given time. Therefore, the processing speed of the network node plays a major feature of, and often determines, the market acceptability of such a product. Taking a telecommunication switch as an example, depending on a geographical area in the switch is deployed, the capacity of the switch may be required to handle from a few hundred thousand to a few million calls.
  • a Circuit Identification Code For each call, a Circuit Identification Code (CIC) should be assigned and reserved for the duration of the call. Multiple CICs can be assigned at the same time for multiple calls occurring simultaneously in the switch. However, current methods for allocating and managing CICs are inefficient and may require human intervention.
  • FIG. 1 illustrates a schematic of one embodiment of a distributed architecture system for call processing in a telecommunication network entity.
  • Fig. 2 is a flow chart of one embodiment of a method for assigning and partitioning CICs to Call
  • CCMs Control Modules
  • Fig. 3 illustrates the application of the method of Fig. 2 within the system of Fig. 1.
  • Fig. 4 illustrates one embodiment of a method for steady state monitoring that may be performed by a Facility Manager (FM) process on a System Administration Module (SAM) card within the distributed architecture system of Fig. 1.
  • Fig. 5 illustrates one embodiment of a method for assigning and partitioning CICs to CCMs when a CCM fails within the distributed architecture system of Fig. 1.
  • Fig. 3 illustrates the application of the method of Fig. 2 within the system of Fig. 1.
  • Fig. 4 illustrates one embodiment of a method for steady state monitoring that may be performed by a Facility Manager (FM) process on a System Administration Module (SAM) card within the distributed architecture system of Fig. 1.
  • Fig. 5 illustrates one embodiment of a method for assigning and partitioning CICs to CCMs when a CCM fails within the distributed architecture system of Fig. 1.
  • FIG. 6 is a flow chart of one embodiment of a method that may be used for assigning and partitioning CICs to CCMs when multiple CCMs fail within the distributed architecture system of Fig. 1.
  • Fig. 7 illustrates an exemplary telecommunications system within which the distributed architecture system of Fig. 1 maybe implemented. WRITTEN DESCRIPTION
  • the present disclosure is directed to a method and system for dynamically partitioning a number of CICs over a set of operational CCMs without manual intervention. It is understood that the following disclosure provides many different embodiments, or examples, for implementing different features of the invention. Specific examples of components and arrangements are described below to simplify the present disclosure. These are, of course, merely examples and are not intended to be limiting.
  • a telecommunication switch and voice applications processed thereon are used as representative applications.
  • the present disclosure may apply to any type of switch or any network node that needs partitioning of circuit identification numbers or similar identifiers over multiple processing entities coexisting within the same node.
  • a certain type of architecture is used herein to describe the disclosure, the present disclosure applies to any type of architecture that includes distributed call processing entities.
  • a CIC For each call handled by a telecommunications switch, a CIC should be assigned and reserved for the duration of the call. Multiple CICs can be assigned at the same time for multiple calls occurring simultaneously in the switch.
  • a switch supporting voice calls is allocated a fixed number of CICs depending on the switch's engineered maximum capacity.
  • CICs may serve various purposes for a given protocol.
  • a CIC serves the following purposes: (1) identification of the physical circuits and (2) identification of the signaling relationship between the peer ISUP entities and association of all signaling messages to that relationship.
  • the role of a CIC is only to identify the signaling relationship between peer BICC entities.
  • CCMs Call Control Modules
  • the CCMs may be located in independent pieces of hardware or may coexist on the same hardware, but each is an independent software module. Each CCM can handle up to a maximum number of calls at a given time.
  • a switch 100 with a distributed architecture is illustrated.
  • the switch 100 is coupled to an SS7 network 118 and contains multiple CCMs for handling incoming traffic from the SS7 network.
  • each CCM resides on an independent physical card where the intelligence of handling calls is implemented in software.
  • the present disclosure applies to embodiments where the modules are located on the same hardware, as well as embodiments where such functionality is provided at least partially using hardware .
  • the present disclosure refers to each module as a card.
  • the switch 100 includes Signaling Interface Module (SIM) cards 102 and 104, as well as Data
  • DDM Distribution Module
  • SAM System Administration Module
  • the SIM cards 102 and 104 act as an interface with the SS7 network 118.
  • the SIM cards 102, 104 receive SS7 messages and convert the messages into internal messages that are sent to the DDM cards 106, 108.
  • the DDM cards are responsible for selecting one of the CCM cards 110, 112 for each message and forwarding the message to the selected card.
  • a DCard Distribution Function (DDF) (not shown) in each of the DDMs 106, 108 may be used to distribute incoming ISUP/BICC messages to one of the CCM cards 110, 112.
  • Each CCM card 110, 112 may include one or more ISUP Signaling Gateways (ISUPSG) (not shown) and/or BICC Signaling Gateways (BICCSG) (not shown), as will be described later in greater detail.
  • ISUPSG ISUP Signaling Gateways
  • BICCSG BICC Signaling Gateways
  • Each SAM 114, 116 may include a Facility Manager (FM) process (not shown) for assigning the appropriate ISUPSG or BICCSG for local allocation of CICs.
  • FM Facility Manager
  • all allocated CICs should be partitioned across all configured CCMs.
  • the method may be implemented to as to be internal to the system and not visible to the other network nodes in the SS7 network. As will be described later in greater detail, the method may also provide a solution for automatically re-partitioning the CICs without manual intervention when new CCMs are added in the switch, as well as when a CCM is removed or breaks down. In some embodiments, the method may provide improved or optimal use without requiring manual intervention, and without violating the SS7 protocols. The method may also handle incoming calls with minimum processing delay and have good scalability without losing efficiency when handling a relatively large number of calls. Referring now to Fig. 2, in one embodiment, a method 200 may be used to implement some or all of the characteristics described above.
  • the method 200 may, when given a CIC number, assign the number to one of the CCM cards in a distributed architecture system (e.g., the switch 100 of Fig. 1).
  • the method applies a modulo scheme using the CIC and a value N as follows, where N is the number of configured CCM pairs in the switch.
  • a CCM pair is composed of one CCM card that is active and handling calls, and another CCM card that acts as a standby to take over the first CCM card's activities if the first card fails.
  • One embodiment of the method 200 uses recursion and assigns the CIC as follows.
  • step 202 a determination is made using a value pair A(CIC, N) as to whether CIC modulo N equals zero.
  • the method assigns the CIC to node N in step 204 and ends. If CIC modulo N is not equal to zero, a variable k is set equal to the value of CIC divided by N in step 206. The value pair is updated to A(CIC - k, N - 1) in step 208, and the method returns to step 202. The steps 202, 206, and 208 may be repeated until a zero result is reached.
  • This embodiment of the method 200 may be represented as follows:
  • the method 200 may be implemented in a DDF process (e.g., in the DDMs 106, 108) to distribute incoming ISUP/BICC messages to one of the CCM cards 110, 112.
  • a Facility Manager process in the SAMs 114, 116 may use the method 200 for assigning the ISUPSGs and BICCSGs for local allocation of CICs.
  • the ISUPSG and BICCSG in the CCMs may also use the method 200 during transient conditions when message forwarding to the appropriate CCM pair is needed.
  • the method 200 may be used to distribute the CICs equitably if they are contiguously numbered. Since in practice, CICs are generally assigned contiguously, the allocation will generally result in a fairly uniform distribution.
  • the method 200 assumes that CCM node numbers are in a sequential range from 1 to N. However, since this assumption is not practical, an internal mapping table may be used to map between an index number assigned by the method 200 and the corresponding node number. For example, 5 CCM pairs may be mapped as shown below in Table 1.
  • This mapping table may be dynamically created and maintained to reflect the current status of the CCM pairs.
  • the mapping table may be updated to reflect only the in-service CCMs as shown below in Table 2.
  • Table 2 hen the failed CCM pair (e.g., node number 44) returns to service or another CCM pair is added, the mapping table is updated to reflect this by adding the node number as shown below in Table 3.
  • Table 3
  • the method 200 may be used for the provisioning of new CICs without any associated configuration changes.
  • the new CIC ranges that are provisioned may be accommodated by the method and distributed equitably among the CCM nodes.
  • a switch e.g., the switch 100 of Fig. 1
  • the additional functionality may be embedded within the switch 100 (e.g., within the FM and ISUPSG) in order to transition the traffic to the new CCM pair without needing to issue ISUP blocks.
  • the additional ISUPSG functionality enables the ISUPSG to verify and, if necessary, locate another CCM pair that should handle the ISUP message.
  • This functionality makes it possible to handle calls that originated prior to the addition of new CCM(s) and that are still in progress in those CCM nodes.
  • a distribution method may be implemented within the DDF 106 that takes into account the (N+l) 4 CCM pair.
  • there may be calls currently associated with the CIC on a CCM e.g., the CCM 112 based on the old distribution method (before the node pair was added).
  • the DDF 106 begins to route all ISUP messages taking into account newly added CCM pair 300, oblivious of whether the call is now on the CCM pair per the new configuration or on the CCM pair per the old configuration.
  • the ISUPSG on the CCM preprocesses the ISUP message and checks to see if mere is a call instance associated with the CIC. If there is one, then it continues processing normally. It is noted that this check may only be done for non-IAM messages. IAMs themselves may be handled normally. If the ISUPSG finds that there is no call associated with this ISUP message, then it uses the "old" distribution method (e.g., the configuration before the new CCM pair was added) and forwards the ISUP message to that CCM pair. This forwarding by the ISUPSG on the CCM pair may continue until all the CICs have been retired from the old distribution method, which may be signaled to the ISUPSG by the FM as will be described later in greater detail with respect to Fig. 4.
  • the "old" distribution method e.g., the configuration before the new CCM pair was added
  • This process may be used in adding one or more CCM pairs to the switch 100.
  • the forwarding activity will be called into play only for a brief period of time and then subside to handle the rare cases of long duration calls.
  • one embodiment of the additional functionality embedded within the switch 100 may be implemented within the FM in order to transition the traffic to the new CCM pair without issuing ISUP blocks.
  • the FM functionality is used to disable the forwarding mechanism in ISUPSGs.
  • the forwarding mechanism is disabled when it is recognized by the FM that a "steady state" has been reached that signifies that all CICs have homed to the appropriate CCMs.
  • the FM then instructs the ISUPSGs on each CCM to disable the forwarding mechanism.
  • a method for recognizing the "steady state” may be implemented as follows.
  • the FM may maintain a counter of the number of busy circuits (CurrBUSYCount) at any given time by incrementing on allocation of a circuit and decrementing on release of a circuit.
  • a configuration change e.g., the addition or removal of a CCM pair
  • the counter and a timestamp (T) are saved to reflect the number of busy circuits at the time of the configuration change. Meanwhile, the original counter continues to be updated.
  • T timestamp
  • men men the saved counter is decremented.
  • the FM instructs the ISUPSGs to stop forwarding.
  • a process may be implemented to handle CCM pair failure using one of two approaches.
  • the first approach is to recognize the CCM pair failure and block all circuits that would be handled by that CCM.
  • the second approach is to reassign the CICs to other CCM pairs that are still active.
  • the CIC allocation method can handle the reduction in the number of CCMs in a manner similar to that used to add CCM pairs, as will be described in greater detail below.
  • a method 600 illustrates one embodiment of a forwarding process that may be implemented using the present disclosure. As will be described using specific examples with respect to Fig.
  • the method 600 enables a CCM node to receive a message and determine whether the message should be forwarded and, if so, to what CCM.
  • a CCM receives a message (e.g., from a DDM) and, in step 604, determines whether there is a corresponding call on the CCM that is associated with the message. If so, the method continues to step 606, where the message is handled. If not, a determination is made in step 608 as to whether the message may be forwarded. This may be indicated by using an indicator such as a field or other value either received with the message or received separately. If forwarding is not allowed, the method drops the call in step 610 and ends.
  • the method determines which system configuration to use for forwarding in step 612 and updates the forwarding indicator accordingly in step 614.
  • the method forwards the message to the CCM indicated by the configuration, and the process begins again at the CCM to which the message is forwarded.
  • Fig. 7 shows how successive CCM failures may be handled by extending the previously described mechanism of forwarding non-IAM messages to handle multiple forwardings.
  • each ISUPSG keeps a stack of methods (e.g., configurations indicating the number of nodes (e.g., CCMs), node numbers, and corresponding indices).
  • Each ISUPSG uses these methods to forward messages when a corresponding call is not found on the CCM to which the ISUPSG belongs.
  • each ISUPSG knows which method(s) have previously been used to forward a message based on an indicator (e.g., a TTL IE) associated with the message to ensure that forwarding will not continue indefinitely.
  • the TTL may also be used to indicate which method an ISUPSG should use to forward the message.
  • Fig. 7 includes up to six nodes identified (from left to right) as nodes
  • each ISUPSG Upon detecting the configuration change, each ISUPSG adjusts to use method AO (corresponding to the original configuration) to forward non-IAM messages that do not correspond to a call on the receiving ISUPSG.
  • an updated method (identified as Al) is stored for each of the remaining nodes (e.g., the nodes are now operating in configuration Al).
  • Al an updated method
  • the various CICs may be repartitioned among the nodes using one of the previously described methods (e.g., the method 200 of Fig. 2). Accordingly, a CIC handled by one node during one configuration may be handled by another node during a later configuration.
  • Different exemplary messages after Event 1 are handled as follows.
  • message A is received by CCM node 22, which finds that it has no corresponding call. Because CCM node 22 has no corresponding call, it forwards the call based on the assumption that the call may have started prior to the latest configuration change. Accordingly, it uses the A0 configuration (which is the configuration prior to current configuration Al) to identify the node that was associated with the call in the previous configuration and forwards the call to the relevant node. In the present example, CCM node 16 is identified by A0 as the node handling the call associated with message A, and so CCM node 22 forwards the message to CCM node 16.
  • A0 configuration which is the configuration prior to current configuration Al
  • CCM node 22 is aware that CCM node 16 was associated with the message A during the A0 configuration, and simply uses A0 to identify the time period for which it must identify the relevant node for the message A. CCM node 22 also sets the TTL to 0 to indicate that the node receiving the forwarded message is not allowed to forward the message again.
  • the ISUPSG on CCM Node 16 delivers the message to the corresponding call that exists on CCM node 16. If the call is not present on CCM node 16, then CCM Node 16 drops the message because TTL is set to zero (e.g., CCM node 16 is not allowed to forward the message).
  • Message B is received by the ISUPSG on CCM node 14, which finds that there is no corresponding call on CCM node 14.
  • the ISUPSG on CCM node 16 delivers the message to the corresponding call on CCM node 16. If the call is not present, CCM node 16 drops the message since TTL is 0.
  • Messages C and D are received by CCM nodes 19 and 14, respectively, each of which determines that it has the corresponding call. Accordingly, no forwarding is required for either message.
  • Message E is received by CCM node 22, which finds that there is no corresponding call on CCM node 22.
  • CCM node 22 forwards the call on the assumption that this call may have started prior to the latest configuration change.
  • CCM node 22 refers to A0 and finds that the recipient is CCM node 17, which is not in service. This signifies a message for a call that does not exist because of the failure of CCM node 17, and CCM node 22 drops the message. It is noted that, because there are no recorded configurations prior to AO (because the system was in the steady state), further forwarding is not possible. hi Event 2, CCM node 22 fails (after the failure of CCM node 17). Upon detecting the configuration change (placing the system in current configuration A2), each remaining ISUPSG adjusts so as to use method Al for forwarding and AO for subsequent forwarding.
  • Both methods may be needed for forwarding because a call may have originated during the time when either the first or second configurations were active (and prior to the current configuration A2).
  • Message A is received by CCM node 14, which finds that there is no corresponding call on CCM node 14.
  • CCM node 14 forwards the message based on the assumption that the call may have started during the system's previous configuration. Accordingly, CCM node 14 uses Al and forwards the message to CCM node 16, which CCM node 14 knows was handling the call associated with message A during configuration Al.
  • the ISUPSG on CCM node 16 receives the message and determines that there is no corresponding call on CCM node 16.
  • CCM node 16 forwards the message using A0.
  • CCM node 16 forwards the message to CCM node 19, which CCM node 16 knows was handling the call associated with message A during configuration A0.
  • the ISUPSG on CCM node 19 delivers the message to the corresponding call on CCM node 19.
  • CCM node 19 drops the message since TTL is 0.
  • Message B is received by CCM node 14, which finds that there is no corresponding call on CCM node 14.
  • CCM node 14 forwards the message based on the assumption that the call may have started during the system's previous configuration. Accordingly, CCM node 14 uses Al and forwards the message to CCM node 16, which CCM node 14 knows was handling the call associated with message B during configuration Al.
  • the ISUPSG on CCM node 16 delivers the message to the corresponding call on CCM node 16.
  • CCM node 16 would forward the message based on configuration A0.
  • Messages C and D are received by CCM nodes 19 and 25, respectively, each of which determines that it has the corresponding call. Accordingly, no forwarding is required for either message.
  • CCM Node 17 is returned to service.
  • each remaining ISUPSG adjusts so as to use method A2 for forwarding, and Al and A0 for subsequent forwarding. All three methods may be needed for forwarding because a call may have originated during the time when one of the first, second, or third configurations was active (and prior to the current configuration A3).
  • Message A is received by CCM node 14, which finds that there is no corresponding call on CCM node 14.
  • CCM node 16 forwards the message to CCM node 19, which CCM node 16 knows was handling the call associated with message A during configuration Al.
  • the ISUPSG on CCM node 19 receives the message and determines that there is no • corresponding call on CCM node 19.
  • Message E is received by CCM node 25, which finds that there is no corresponding call on CCM node 25.
  • CCM node 25 forwards the message based on the assumption that the call may have started during the system's previous configuration. Accordingly, CCM node 25 uses A2 and forwards the message to CCM node 19, which CCM node 25 knows was handling the call associated with message E during configuration A2.
  • the ISUPSG on CCM node 19 receives the message and determines that there is no corresponding call on CCM node 19.
  • the ISUPSG on CCM node 16 delivers the message to the corresponding call on CCM node 16.
  • CCM node 16 would forward the message based on configuration AO.
  • Message F is received by CCM node 14, which finds that there is no corresponding call on CCM node 14.
  • CCM node 14 forwards the message based on the assumption that the call may have started during the system's previous configuration. Accordingly, CCM node 14 uses A2 and forwards the message to CCM node 16, which CCM node 14 knows was handling the call associated with message F during configuration A2.
  • the ISUPSG on CCM node 16 receives the message and determines that there is no corresponding call on CCM node 16.
  • the ISUPSG on CCM node 19 receives the message and determines that there is no corresponding call on CCM node 19.
  • CCM node 19 forwards the message to CCM node 17, which CCM node 19 knows was handling the call associated with message A during configuration A0.
  • the ISUPSG on CCM node 17 (now back in service) delivers the message to the corresponding call on CCM node 17. If the call is not present, CCM node 17 drops the message since TTL is 0. If CCM node 17 had not returned to service, the message would be dropped by CCM node 19.
  • the various configurations may be used for message forwarding using an indicator (e.g., the TTL) to identify which configuration should be used next and how many times the message may be forwarded.
  • the present disclosure applies to any telecommunication node with any internal architecture type that has multiple call processing entities. Furthermore, even though a telecommunication node architecture with call processing entities residing on different hardware cards is used to describe the disclosure, the present disclosure applies for call processing entities that reside on the same piece of hardware. In addition, even though a certain number of call processing entities or CCM cards are used to describe the disclosure, the present disclosure applies to any number of call processing entities that exist in the telecommunication switch. Furthermore, even though the addition of one CCM card was used to describe the disclosure for CIC partitioning during capacity increase, the present disclosure applies to any number of CCM cards that can be added to the architecture of the telecommunication node.
  • the present disclosure presents a method and system for partitioning Circuit Identification Codes allocated to a switch across all call processing entities in the switch with a distributed architecture.
  • the present disclosure provides a solution that evenly distributes traffic among all active and available Call Control Modules (CCMs).
  • CCMs Call Control Modules
  • the solution is internal to the system and is not visible to the other network nodes in the SS7 network.
  • the partitioning method also provides a solution for automatically re-partitioning the CICs with no manual intervention needed when new CCMs are added to the switch.
  • the solution also works when removing a CCM or if one or many CCMs break down in the switch, hi addition, the solution presented in the present disclosure may be optimal without requiring any manual intervention, without violating any of the SS7 protocols, and while providing ease of scalability for the entire telecommunication switch.
  • the concepts presented in the present disclosure are implemented using software solutions.
  • the present disclosure provides a solution that works in the architecture to support the capability to route messages pertinent to a CIC to the CCM that has been assigned the responsibility to handle that CIC. Specifically, the process in a Data Distribution Module (DDM) may use the CIC information to route incoming ISUP/BICC messages to the correct CCM.
  • DDM Data Distribution Module
  • the Facility Manager (FM) process in the System Administration Module (SAM) may be responsible for determining the CCM.
  • the present disclosure provides a dynamic CIC allocation/partitioning mechanism to overcome issues presented by static partitioning.
  • the solution presented in the present disclosure includes a method that unambiguously maps CICs to CCMs.
  • the present disclosure also presents a solution for repartitioning a fixed number of CICs over a set of CCMs automatically and dynamically when one or many CCMs become unavailable, or when one or many CCMs are added to an existing set of CCMs or when one or many CCMs are brought back into service after break-down.
  • the present disclosure provides a method that can be executed automatically and dynamically without manual intervention to partition the CICs over an available number of CCMs by taking in consideration a combination of destination and origination addresses of other entity nodes in the network.
  • the present disclosure also presents a solution that does not introduce changes into or violate standard
  • the present disclosure provides a solution to partition CICs over multiple CCMs in a manner transparent to other network entities. In other words, the solution does not impact or change other network entities.
  • the present disclosure also presents a solution to route an incoming call at the switch to the correct CCM.
  • the present disclosure presents a solution that allows traffic handling in the switch to be evenly distributed within a configurable variance among all operational
  • the present disclosure also provides a solution for group messages consistent with the partitioning scheme, hi addition, the present disclosure provides a solution for dynamically repartitioning CICs over a set of CCMs without any service interruption.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Computer And Data Communications (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)
  • Multi Processors (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

Procédé et système servant à affecter, cloisonner et gérer des identificateurs, tels que des codes d'identification de circuit (CIC), dans des entités multiples de traitement de communication dans un noeud de réseau possédant une architecture distribuée.
PCT/US2004/039424 2003-11-25 2004-11-24 Procede et systeme servant a cloisonner et a affecter des codes dans une entite de reseau possedant une architecture d'arriere-plan de traitement distribue WO2005054996A2 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
US52504703P 2003-11-25 2003-11-25
US60/525,047 2003-11-25

Publications (2)

Publication Number Publication Date
WO2005054996A2 true WO2005054996A2 (fr) 2005-06-16
WO2005054996A3 WO2005054996A3 (fr) 2008-01-10

Family

ID=34652294

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/US2004/039424 WO2005054996A2 (fr) 2003-11-25 2004-11-24 Procede et systeme servant a cloisonner et a affecter des codes dans une entite de reseau possedant une architecture d'arriere-plan de traitement distribue

Country Status (1)

Country Link
WO (1) WO2005054996A2 (fr)

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6023473A (en) * 1996-07-25 2000-02-08 Telebit Corporation Application programming interface for modem and ISDN processing
US5991263A (en) * 1996-09-30 1999-11-23 Lucent Technologies Inc. Channel and data link automatic restoration

Also Published As

Publication number Publication date
WO2005054996A3 (fr) 2008-01-10

Similar Documents

Publication Publication Date Title
JP3048879B2 (ja) 信号伝送リンクのトラフィックを転換する方法
EP2371086B1 (fr) Noeud de réseau et procédé pour réguler des ressources dans un réseau de communication
US8214479B2 (en) Scalability and redundancy in an MSC-Server blade cluster
US8295459B2 (en) System and method for dynamically partitioning context servers
CN111935314B (zh) 区块链系统、消息传输方法及装置
CN1254481A (zh) 动态控制路由选择
US6510214B1 (en) System and method of detecting overload in a service control point of a telecommunications network
CN118300978A (zh) 一种多设备资源共享方法和系统
WO2005054996A2 (fr) Procede et systeme servant a cloisonner et a affecter des codes dans une entite de reseau possedant une architecture d'arriere-plan de traitement distribue
JP2005184467A (ja) 共通線信号方式を利用したネットワークシステム
EP1289208B1 (fr) Une méthode de contrôle de routage de data sur un réseau
CN112188514A (zh) 一种业务处理方法、网络设备及存储介质
US6519337B1 (en) Method for searching trunks in telecommunication N/Ws
US7289450B2 (en) Flood signaling architecture and process for provisioning communication paths
KR20000033243A (ko) 초고속 전용통신망 최적 설계를 위한 망 설계 방법
US8538447B2 (en) Handling resources in a communications network
KR100204476B1 (ko) 에이티엠 망에서의 최적 경로 설정 방법
KR100600327B1 (ko) 데이터베이스를 공유하는 복수의 서비스제어시스템에서부하분담 호처리시 중복출호 방지 및 장애처리 방법
CN115002852A (zh) 网络接入方法、装置、电子设备及可读存储介质
KR100473158B1 (ko) 에이티엠 기반의 이동 통신 시스템에서의 에이티엠 자원관리 방법
CN118101558A (zh) 一种异构路由切换方法及装置
JP2006074319A (ja) 無線基地局及び無線基地局のリソース割り当て方法
KR19990075509A (ko) 이동통신 시스템내 신호 접속 제어기의 연결형 서비스에서 지역참조번호 할당방법
JP2002044696A (ja) ノード装置
CN105791111A (zh) 一种全局码翻译中路由选择的方法和系统

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 BW BY BZ CA CH CN CO CR CU CZ DE DK DM DZ EC EE EG 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 NA NI NO NZ OM PG PH PL PT RO RU SC SD SE SG SK SL SY TJ TM TN TR TT TZ UA UG US UZ VC VN YU ZA ZM ZW

AL Designated countries for regional patents

Kind code of ref document: A2

Designated state(s): BW GH GM KE LS MW MZ NA SD SL SZ TZ UG ZM ZW AM AZ BY KG KZ MD RU TJ TM AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HU IE IS IT LU MC NL PL PT RO SE SI SK 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
DPEN Request for preliminary examination filed prior to expiration of 19th month from priority date (pct application filed from 20040101)
NENP Non-entry into the national phase

Ref country code: DE

WWW Wipo information: withdrawn in national office

Country of ref document: DE

32PN Ep: public notification in the ep bulletin as address of the adressee cannot be established

Free format text: COMMUNICATION UNDER RULE 69 EPC ( EPO FORM 1205A DATED 13/10/06 )

122 Ep: pct application non-entry in european phase
DPE1 Request for preliminary examination filed after expiration of 19th month from priority date (pct application filed from 20040101)
点击 这是indexloc提供的php浏览器服务，不要输入任何密码和下载