Patent Application
20110249625
The invention relates to telecommunication, in particular to a method of communicating from a first node of a first telecommunications network towards a second node of a second telecommunications network, a method of communicating from a second node of a second telecommunications network towards a first node of a first telecommunications network, a first node of a first telecommunications network for communicating towards a second node of a second telecommunications network, and a second node of a second telecommunications network for communicating towards a first node of a first telecommunications network.
Time Division Multiplexing (TDM) connectivity is frequently used in today mobile networks (Public Land Mobile Network PLMN). In the following, examples of TDM usage are provided:
TDM is used between a call control node (CCN) and GSM EDGE Radio Access Network (GERAN), e.g. via an A-interface with Base Station Server Application Part (BSSAP) as protocol.
TDM is used between CCN nodes, e.g. ISUP is used as call control protocol.
TDM is used between a CCN and another network, e.g. ISUP is used as call control protocol.
It is common to all cases cited above that the CCN controls the usage of TDM circuits within the TDM connection. In a (layered architecture of a) soft-switch network, a CCN controls the usage of TDM circuits while the TDM device itself is owned in the controlled MGw (Media Gateway) node. In a non-layered network architecture, the CCN controls the usage and owns the TDM circuits. In (the layered architecture of the) soft-switch network, there is a functional split in a signaling plane which aims at control of the respective devices/resources/circuits involved in a call (seizure, release, etc. . . . ) and in a user plane which aims at the transportation of the payload, i.e. voice or data.
TDM circuits are used to carry PCM (Pulse Code Modulation) encoded speech or data. TDM circuits are typically grouped according to certain schemes. These schemes are related to the Hard Ware (HW) equipment. For example in A-interface TDM circuits or in N-ISUP (narrowband ISUP) an E1 groups 32 64 Kbps TDM circuits or a T1 groups 24 64 Kbps TDM circuits.
A specific TDM circuit is seized at call setup and is released at the end of the call. In some special cases or in abnormal cases, TDM circuits shall be maintained independent from a call. Examples for these cases are a reset of one or more TDM circuits, a block or unblock of one or more TDM circuits, and a query of one or more TDM circuits (national use in ISUP).
In the following, it will be referred to BICC Circuits. The Bearer Independent Call Control (BICC) protocol is also used between CCNs when the user plane is transported over Asynchronous Transfer Mode (ATM) or Internet Protocol (IP).
Although with ATM and IP user plane there are no circuits statically associated to a device, BICC, in analogy to ISUP, also uses the concept of a logical circuit as the means by which two peer nodes can identify the same call. Thus, at call set up, a BICC circuit is used and the CCN releasing the call uses the circuit number to inform the peer CCN which call is to be released.
In the following, it will be referred to A-interface over IP.
Circuit identifications are also used when the A-interface is transported over IP.
In the following, the term “circuit” will be used to mean or denote both TDM circuits and logical circuits used on non-TDM interfaces.
In mono-processors nodes or single processor nodes, a node failure normally requires that all circuits controlled by the node are to be reset. This is not too problematic for the reasons presented in the following:
ISUP and BICC support a message to reset a group of consecutive circuits with a single message. Thus, up to 32 consecutive circuits can be reset in one message. Therefore only one reset message is needed to be send per PCM group in such a situation.
BSSMAP supports a global reset message. With a global reset of the peer node all circuits can be reset as well.
An MSC node (i.e. a CCN) may be based on a multi-processor platform comprehending a multitude of processing boards responsible for call processing. Each of the processing board can use circuits from the same pool. When, for example, one processing board fails, it (the processing board) may have to release all circuits that are used on the board.
This (releasing) cannot be done using Circuit Group Reset messages, as they (the messages) are sent by a mono-processor node and because the circuits to be reset will generally not be consecutive. Instead, circuits have to be reset individually, sending one message per circuit to the peer node.
The result is a tremendous high number of reset messages generated in the A-interface and respective (ISUP and BICC) links that can overload the receiving node.
Summarizing the forgoing description, operating on, for example resetting, circuits usable during a communication of nodes may result in an increased signaling between the nodes, thereby leading to a message overloading of the communication interface between the nodes.
It may be an object of the invention to provide a method of communicating from a first node of a first telecommunications network towards a second node of a second telecommunications network, a method of communicating from a second node of a second telecommunications network towards a first node of a first telecommunications network, a first node of a first telecommunications network for communicating towards a second node of a second telecommunications network, and a second node of a second telecommunications network for communicating towards a first node of a first telecommunications network which may allow for at least reducing signaling via an interface used between first and second nodes during communicating.
The object is achieved by the subject-matter of the independent claims. Advantageous embodiments are described in the dependent claims.
According to an exemplary aspect of the invention, a method of communicating from a first node of a first telecommunications network towards a second node of a second telecommunications network is provided. The method is executed by the first node. The method comprises dynamically assigning a group identifier to at least one circuit usable by the first node during communicating. The method comprises sending the group identifier towards the second node.
According to another exemplary aspect of the invention, a method of communicating from a second node of a second telecommunications network towards a first node of a first telecommunications network is provided. The method is executed by the second node. The method comprises receiving a group identifier having been dynamically assigned to at least one circuit usable by the first node during communicating. The method comprises storing the received group identifier with respect to at least one circuit used during communicating.
According to another exemplary aspect of the invention, a first node of a first telecommunications network for communicating towards a second node of a second telecommunications network is provided. The first node comprises an assigning unit adapted for dynamically assigning a group identifier to at least one circuit usable by the first node during communicating. The first node comprises a sending unit adapted for sending the group identifier towards the second node.
According to another exemplary aspect of the invention, a second node of a second telecommunications network for communicating towards a first node of a first telecommunications network is provided. The second node comprises a receiving unit adapted for receiving a group identifier having been dynamically assigned to at least one circuit usable by the first node during communicating. The second node comprises a storing unit adapted for storing the received group identifier with respect to at least one circuit used during communicating.
In the context of this application, the first and second telecommunications network may be identical to one another or may be different to one another, i.e. the first and second nodes may be part of the same telecommunications network or of different telecommunications networks.
In particular, the term “circuit” may particularly denote a common resource usable between first and second nodes during communicating with one another. In particular, a circuit may be a physical channel in a circuit switched communication (for example, a TDM circuit) or any type of call or session identifier used by both nodes to uniquely identify a call or session.
In particular, the term “group identifier” may particularly denote an (externally assigned) identification parameter which may be used for identifying a group of elements of an amount or set of elements. In particular, a group of elements may comprise at least one element or more elements or all elements of the amount of elements. In the context of the present application, the terms “group identifier” and “group identity” may be interchangeably used.
In particular, a group identifier identifying circuits usable during communicating between nodes may particularly denote a local group identifier (or a group identifier on a node level) which may be assigned or associated or selected or chosen by one of the nodes.
In particular, the terms “first node” and “second node” may be used in a mutually interchangeable way. A first node may be adapted to execute a method described in connection with the second node and a second node may be adapted to execute a method described in connection with the first node, namely the first node may be adapted for receiving a group identifier having been dynamically assigned to at least one circuit usable by the second node during communicating and storing the group identifier with respect to at least one circuit used during communicating and a second node may be adapted for assigning a group identifier to at least one circuit usable by the second node during communicating and sending the group identifier towards the first node. In particular, each one of the first and second nodes may be adapted for sending its own (local) group identifier, receiving and storing a received (remote) group identifier, and operating on information received together with the (remote) group identifier.
In particular, a second node may be a (another or a further) node of a (another or further) telecommunications network.
According to another exemplary aspect of the present invention, a method for a Call Control Node of a telecommunication network may be provided. The method may comprise the step of sending a Group Identity towards another node handling circuits (TDM or IP or ATM based circuits) and being part of a call controlled by said Call Control Node, either because of having initiated a call towards said another node of said telecommunication network or because of a call being initiated by said another node. The method may comprise the step of detecting that a board or processor undergoes a restart and the step of sending a message indicating a reset towards said another node being accompanied by a Group Identity which identifies the board or processor undergoing restart.
According to another exemplary aspect of the invention, a method for a Node (e.g. MSC, TSC, BSC) handling circuits (TDM or IP or ATM based circuits) of a telecommunication network may be provided. The method may comprise the step of receiving a Group Identity from a Call Control Node controlling a call, either because of having initiated a call towards said another node of said telecommunication network or because of a call being initiated by said another node. The method may comprise the step of storing the Group Identity with respect to a seized circuit, the step of receiving a message indicating a reset from said another node being accompanied by a Group Identity, and the step of initiating a reset of those circuits whose stored group identity matches to the group identity received in the reset message.
Embodiments of the invention will be described in more detail hereinafter with reference to examples but to which the scope of the invention is not limited.
a is a flow diagram illustrating a method of communicating from a first node of a first telecommunications network towards a second node of a second telecommunications network according to an exemplary embodiment of the invention.
b is a flow diagram illustrating a method of communicating from a second node of a second telecommunications network towards a first node of a first telecommunications network according to another exemplary embodiment of the invention.
a is a block diagram illustrating a first node of a first telecommunications network for communicating towards a second node of a second telecommunications network according to an exemplary embodiment of the invention.
b is a block diagram illustrating a second node of a second telecommunications network for communicating towards a first node of a first telecommunications network according to an exemplary embodiment of the invention.
The illustration in the drawing is schematic. In different drawings, similar or identical elements are provided with the same reference signs.
In the following, a basic concept of the teachings of the present application will be described.
In the present application, methods and corresponding nodes are proposed to dynamically assign a group identity to each circuit (e.g. TDM ISUP or BICC for IP or ATM based circuits), when it (the circuit) is assigned to a call and communicate that group identity to the peer node. In a Mobile Switching Center (MSC) comprehending a multitude of call processing boards the group identity may be specific for each processing board.
The group identity will be communicated to the other node (Node Y) in a first message originated by the node (Node X), for example in an ISUP or BICC IAM or BSSAP Assignment Request message. In both examples, a new parameter may be introduced. When considering the underlying communication protocol (ISUP, BICC, BSSAP), in the latter three examples, a new parameter may be introduced.
If, at some point, the Node X may detect an event that may trigger a resetting of all circuits within a group, Node X will send a reset message containing the respective group identity. The receiving node will scan all busy circuits and will only reset those busy circuits whose stored group identity matches the one received in the reset message.
In the following, an example will be described.
Each processing board in a multi-processor Mobile Switching Center Server (MSC-S) may code its board or processor ID into the circuit group identifier. When a board or processor fails, a reset message is then sent to the peer including the circuit group identifier of the failed board or processor.
It should be noted that the group identity only reflects a grouping scheme of the sending node, i.e. Node X. At the same time, Node Y may also be a multi-processor system that obviously assigns a different grouping scheme to its circuits.
The principle of group identity described above can be applied to any kind of logical signaling connection, for example, to connections established by Radio Access Application Part (RANAP) protocol or Session Initiation (SIP) protocol.
Although the teaching of the present application is described mainly with reference to TDM circuits, the teaching or the present application is likewise applicable to any other circuits such as IP or ATM based circuits and their respective signaling control protocols, such as ISUP for TDM circuits, BSSMAP for TDM or IP circuits, BICC for IP or ATM based circuits, RANAP for IP or ATM based circuits, and SIP for IP based circuits.
Hence, in generality, any protocol suited for handling user plane circuits, for example the above mentioned TDM, IP or ATM based circuits, may be subject to the present application.
Furthermore, although addressed in the following with respect to a board or processor, the idea in its generality can also be applied to a single core in the case of a multi-core processor being employed. I.e. when referring in the following to a processor, it is envisaged that the processor may even be a single core of a multi-core processor.
Referring to
The method is executed by the first node and comprises dynamically assigning 102 a group identifier to at least one circuit usable by the first node during communicating and sending 104 the group identifier towards the second node.
Dynamically assigning may comprise dynamically assigning the group identifier to at least one of a circuit and more circuits usable by the first node during communicating.
The method may further comprise receiving an acknowledgement that the group identifier has been stored by the second node with respect to at least one circuit used during communicating. In particular, an acknowledgement may be received in a first backward message during a call or session set up using, for example, an Address Complete Message (ACM), a Call Progress Information (CPG), an Answer Message (ANM), a BSSMAP Assignment Complete message, a RAB Assignment Response message, a Trying message or a Session Progress message.
The method may further comprise sending information together with the group identifier towards the second node.
Referring to
The method is executed by the second node and comprises receiving 112 a group identifier having been dynamically assigned to at least one circuit usable by the first node during communicating and storing 114 the received group identifier with respect to at least one circuit used during communicating.
In particular, in case more than one circuit may be seized or established between the first and second nodes when communicating, the received group identifier may be stored with respect to each one of the seized circuits.
The method may further comprise sending an acknowledgement that the group identifier has been stored by the second node with respect to at least one circuit used during communicating.
Storing may comprise storing an association between the group identifier and at least one circuit identifier for identifying the at least one circuit used during communicating. In particular, for each circuit when communicating between the first and second nodes, an association between the group identifier and particular circuit identifier for identifying the particular circuit used may be stored. Storing may comprise using at least one of a list, a list of associations, and a linked list.
The method may further comprise receiving information together with the group identifier and operating on the received information and the received group identifier.
Operating may comprise scanning the circuits used by the second node during communicating and releasing the circuits whose stored group identifier matches to the group identifier received together with the information.
Sending and receiving the group identifier may comprise sending and receiving the group identifier together with the at least one circuit identifier.
The following description may refer at least one of the methods illustrated in
Sending and receiving the group identifier may comprise incorporating the group identifier into a message which may comprise an Initial Address Message (IAM), a BSSMAP Assignment Request message, a RAB Assignment Request, an INVITE message or a first backward message.
The first backward message may comprise an Address Complete Message (ACM), a Call Progress Information (CPG), an Answer Message (ANM), a BSSMAP Assignment Complete message, a RAB Assignment Response message, a Trying message or a Session Progress message.
The information may comprise a circuit resetting information, a circuit blocking information, or a circuit querying information. In particular, the information may be transmitted in a circuit reset message, circuit blocking message, and circuit querying message.
In particular, the information may be associated with at least one circuit usable by the first node towards the second node when communicating.
In particular, a circuit resetting information may comprise information to reset at least one circuit, particularly to reset a single circuit or a group of circuits. In particular, when considering ISUP and BICC, a RESET CIRCUIT—RSC message may be used to reset a single circuit or a CIRCUIT GROUP RESET—GRS message may be used to reset a group of circuits. The (new) group identifier may be added to each one of the messages, particularly to the CIRCUIT GROUP RESET—GRS.
In particular, a circuit blocking information may comprise information to block at least one circuit, particularly to block a single circuit or a group of circuits. In particular, a BLOCKING—BLO message may be used to block a single circuit and a CIRCUIT GROUP BLOCKING (CGB) message may be used to block a group of circuits.
In particular, a circuit querying information may comprise information to query a group of circuits using a CIRCUIT GROUP QUERY—CQM message.
The circuit identifier may comprise a Call Identifier (CI), a Circuit Identification Code (CIC), a Call Instance Code (CIC), a session name, or an Iu signaling connection identifier.
The sending and the receiving may be based on an ISDN User Part (ISUP) Protocol, a Base Station System Application Part (BSSAP) Protocol, a Bearer Independent Call Control (BICC) Protocol, a Radio Access Network Application Part (RANAP) Protocol, or a Session Initiation Protocol (SIP).
Referring to
A node 1 comprises processors or processing boards A and B. The node 1 is in communication with nodes 2 and 3. In the embodiment illustrated in
Each circuit usable by the nodes 1, 2, and 3 for communicating towards peer nodes are defined by a common call identifier code CIC. For example, circuits usable by the processor A of the node 1 and the node 3 are denoted by CIC=10 and CIC=18. A circuit usable by the processor B of the node 1 and the node 3 is denoted by CIC=15. A circuit usable by the processor A of the node 1 and the node 2 and a circuit usable by the processor B of the node 1 and the node 2 are denoted by CIC=11 and CIC=19, respectively.
Each one of the nodes 1, 2, and 3 defines for internal processing a dedicated grouping of circuits and associates at least one circuit with a group identifier GI. In the embodiment illustrated in
The node which has locally or internally defined the group identifier sends the group identifier together with the CIC to the peer nodes. The node which has received the group identifier and the CIC stores a relation or association between the group identifier and the CIC for each circuit that has been established. In case multiple circuits are seized between nodes, the node which has received the group identifier stores the group identifier-CIC information for each circuit. In the embodiment illustrated in
In case a node intends the peer node operating on all circuits within the circuit group, the node has to send its own circuit group identifier. The peer node receiving the group identifier of the node sending the group identifier will operate on all circuits which the node has stored together with the received (remote) group identifier.
Referring to the processor A of the node 1 and the node 3, a call set up will be described in more detail.
The processor A of the node 1 selects a circuit for a new call, wherein the circuit is identified by CIC=10. The processor A then associates the CIC=10 to a local group identifier, in the particular case to the group identifier GI=1. Then the processor A sends the CIC=10 and the local GI=1 in a call setup message (e.g., an ISUP IAM message) to the node 3. Next, the node 3 stores the CIC and GI received from the node 1. Then, the node 3 associates the CIC=10 with a locally generated group identifier, namely the GI=3−1. The node 3 sends the local GI=3−1 in a first backward message such as ISUP ACM to the node 1. The node 1 receives and stores the GI generated by the node 3.
In the following, a restart of the processor A of the node 1 will be described.
When the processor A of the node 1 restarts, the node 1 sends RESET messages, one to each peer node. Each message includes a group identifier that identifies all circuits which are currently used by the processor A in communicating towards the peer end. The nodes 2 and 3 then release only the circuits for which a group identifier was received in the reset messages. For example, upon receiving the group identifier GI=1, the node 3 releases the circuits identified by CIC=10 and CIC=18. The node 2 releases the circuit identified by CIC=11.
In the following, a restart of the processor A of the node 1 will be described in more detail.
If a restart is required in the processor A, all circuits towards the processor A have to be reset. The node 1 sends a RESET message to the node 2 with a GI=1. The node 2 then scans all circuits associated with the Node 1 and the group identifier GI=1 and releases these circuits.
In the following, a restart of the node 3 with partial impacts on circuits established towards the node 1 will be described in more detail.
The node 3 decides to reset all circuits belonging to GI=3−1 (it is not necessary for the node 1 to know the reason for the reset of the node 3). A RESET message is sent to the node 1 comprising the GI=3−1 and all processors of the node 1 reset all circuits associated with the node 3 and the Group GI=3−1.
In the following, a method according to another exemplary embodiment of the invention will be described.
A telecommunication node A may communicate to another telecommunication node B (in the same or another telecommunications network). The communication may be limited in time (for example, the communication may be part of a transaction or may be a communication session) and may involve a “circuit” (or any similar common resource) which may be identified by a common identifier (for example, a CIC) in both nodes A and B.
The circuit may be chosen, particularly selected or assigned, by one of the nodes A and B, i.e. either by the node A or the node B, and then the chosen circuit may be acknowledged by the another node. The circuit may be locally associated with a dynamic group identifier (GI) on the node A (denoted in the following by “GI A”), on the node B (denoted in the following by “GI B”) or on both nodes A and B. Each local group identifier may relate to a (partial) failure domain in the node A and the node B, respectively. The group identifier may be sent to the another node as part of a communication in the session.
When the node B may receive GI A from node A, the node B may associate the GI A with the CIC as remote GI and acknowledges the reception of GI A to the node A. This applies vice versa for the node A and the GI B.
When the communication session may end normally, both of the nodes may remove the association of the local and remote GIs, if any, from the CIC.
In case of a partial failure of the node A, the node A may send a message to the node B, in order to inform the node B that all sessions involving circuits associated with GI A of the failed component as remote GI may be to be cleared or reset. This applies vice versa for the node B.
The node B may, at a reception of the above described group clear message, terminate all sessions involving circuits associated with the received GI A as remote GI. This applies vice versa for the node A.
Referring to
Circuits may be pooled for all boards/processors, i.e. there are no circuits statically assigned or reserved for each board/processor, but each board or processor in need of a circuit gets a circuit during a call establishment phase and frees it at call release.
The teachings of the invention comprise the following procedures:
If (the) MSC A initiates a call towards another node using a respective protocol such as ISUP, it (the MSC A) sends along a Group Identity, e.g. included in the Initial Address Message IAM message.
If the call was initiated by the another node (a Transit Switching Center TSC B in
In this scenario, a group identity would at least reflect the board or processor which is using the circuit. However, the receiving node needs not to be aware of any structure of this Group identity.
A node ((the) MSC A) receiving a message, such as an IAM message, including a Group Identity shall store the received Group Identity with respect to the Circuit e.g. in a Group Identity—CIC (Circuit Identification Code) association, which association shall be stored until the circuit is released. It (the MSC A) can also acknowledge the another node in a backward message, e.g. the first backward message, that the information has been stored, e.g. by using a new IE Group Identity Acknowledgment.
A node (a Transit Switching Center TSC B) receiving a message, such as an ACM, CPG or ANM message, including the Group Identity shall store the received Group Identity with respect to the Circuit e.g. in a Group Identity—CIC (Circuit Identification Code) association, which association shall be stored until the circuit is released. It can also acknowledge the other node in a message, such as a dedicated INF ISUP message, that the information has been stored, e.g. by using a new IE Group Identity Acknowledgment. Alternatively and depending on the call case, the information could be included alternatively in a COT message.
If a board or processor in (the) MSC A undergoes a restart, (the) MSC A shall send an ISUP reset message containing a Group Identity which identifies the restarting board or processor by means of the Group Identity.
The node receiving the Reset with the Group Identity shall scan all circuits used towards (the) MSC A and shall initiate a reset of those whose group identity matches to the group identity received in the reset message.
(The) MSC A may still send individual reset messages for those circuits for which no acknowledgement was received from (the) TSC B during call set up indicating the TSC B had stored the Group Identity—CIC association.
(The) MSC A shall handle the Group Identities received by the peer node in the same way as described above for (the) TSC B.
Likewise,
There, the teachings of the invention comprise the following procedures:
If MSC A initiates a call towards a BSC, it shall send along a Group Identity, e.g. included in the BSSMAP Assignment Request message.
In this embodiment, the group identity would reflect at least the board or processor which is using the circuit. However, the receiving node needs not to be aware of any structure of the Group identity.
A BSC node receiving a message, such as an Assignment Request, including the Group Identity shall store the Group Identity with respect to the Circuit e.g. in a Group Identity—CIC (Circuit Identification Code) association, which shall be stored until the circuit is released. It (the BSC node) can also acknowledge the other node in a message, such as Assignment Complete message, that the information has been stored, e.g. by using a new IE Group Identity Acknowledgment.
If a board or processor in (the) MSC A undergoes a restart, (the) MSC A shall send a BSSMAP reset message containing a Group Identity which identifies the restarting board or processor by means of the Group Identity.
The node receiving the Reset with the Group Identity shall scan all circuits used towards (the) MSC A and shall initiate a reset of those whose group identity matches to the Group Identity received in the reset message.
(The) MSC A may still send individual reset messages for those circuits for which no acknowledgement was received from BSC B during call set up indicating the BSC B had stored the Group Identity—CIC association.
It is assumed that the MSC is always the node sending the Assignment Request message. However, it is also possible for the BSC to send an Assignment Request. Thus the following two procedures are also part of the teachings of the invention:
An MSC A receiving an Assignment Request from a BSC shall include a Group Identity in the Assignment Complete message.
A circuit may be identified by the MSC A. The MSC A may send a BSSAP Assignment Request message including the group identifier and the CIC. The BSC may reply with an Assignment Complete Message.
A circuit may be identified by a BSC. A MSC A may send a BSSAP Assignment Request message including the group identifier. The BSC may reply with an Assignment Complete message including a CIC.
A MSC A may generate the group identifier without knowing the CIC yet. The MSC A may send the group identifier along in a BSSMAP Assignment Request message. The BSC may accept the group identifier, may create a CIC, and may store a group identifier—CIC relation. A BSC may indicate in a backward message that the group identifier—CIC association has been stored. The MSC A may receive the CIC in a BSSMAP Assignment Complete Message and may associate the CIC and the group identifier.
A BSC receiving the Group Identity along or in the Assignment Request message shall acknowledge it, e.g. in a dedicated and new BSSMAP message using a new IE Group Identity Acknowledgment.
Further, the handling of group identity can be expanded to a handling of call instance code (CIC) in BICC as well as Iu Signaling Connection Identifier in RANAP. Further, it (the handling of group identity) can be applied to the Call Identifier used in A over IP signaling.
Further, the use of circuit groups can be expanded to the SIP protocol, where a session is dynamically assigned a circuit group code. Thereafter a circuit group code may be used in a SIP message to terminate a multitude of sessions affected by one processor failure.
Referring to
The first node 500 comprises an assigning unit 504 adapted for dynamically assigning a group identifier to at least one circuit usable by the first node during communicating and a sending unit 506 adapted for sending the group identifier towards the second node.
The assigning unit 504 may at least partially form part of a processor or a processing unit in which appropriate algorithms may be executed to perform the methods of communicating from a first node 500 of a first telecommunications network towards a second node of a second telecommunications network and of communicating from a second node of a second telecommunications network towards a first node 500 of a first telecommunications network according to exemplary embodiments of the invention as described above.
The first node 500 may comprise a receiving unit 502 for receiving information, particularly a group identifier having been dynamically assigned to at least one circuit usable the second node during communicating.
The sending unit 506 may be adapted for sending information together with the group identifier towards the second node.
The first node 500 may comprise a storing unit 508 adapted for storing data necessary during methods of communicating from a first node 500 of a first telecommunications network towards a second node of a second telecommunications network and of communicating from a second node of a second telecommunications network towards a first node 500 of a first telecommunications network according to exemplary embodiments of the invention as described above.
The first node 500 may be adapted to execute methods of communicating from a first node 500 of a first telecommunications network towards a second node of a second telecommunications network and of communicating from a second node of a second telecommunications network towards a first node 500 of a first telecommunications network according to exemplary embodiments of the invention as described.
In particular, the receiving unit 502 may be adapted for receiving a group identifier having being dynamically assigned to at least one circuit usable by the second node during communicating and the storing unit 508 may be adapted for storing the received group identifier with respect to at least one circuit used during communicating.
The first node 500 may be a call initiating node or a call recipient node.
The first node 500 may be adapted as a Mobile Switching Center Server (MSC-S), a Transit Switch Center, a Base Station Controller, a Gateway Mobile Switching Center Server (GMSC), a Media Gateway Control Function (MGCF), or a Radio Network Controller (RNC).
Referring to
The second node 510 comprises a receiving unit 512 adapted for receiving a group identifier having being dynamically assigned to at least one circuit usable by the first node during communicating and a storing unit 518 adapted for storing the received group identifier with respect to at least one circuit used during communicating.
The receiving unit 512 may be adapted for receiving information together with the group identifier.
The second node 510 may comprise an operating unit 514 adapted for operating on the received information and the received group identifier.
The operating unit 514 may at least partially part of a processor or a processing unit in which appropriate algorithms may be executed to perform the methods of communicating from a first node 500 of a first telecommunications network towards a second node 510 of a second telecommunications network and of communicating from a second node 510 of a second telecommunications network towards a first node 500 of a first telecommunications network according to exemplary embodiments of the invention as described above.
The second node 510 may comprise a sending unit 516 adapted for sending information, particularly a group identifier having been dynamically assigned to at least one circuit usable the second node during communicating.
The second node 510 may comprise a storing unit 518 adapted for storing data necessary during methods of communicating from a first node 500 of a first telecommunications network towards a second node 510 of a second telecommunications network and of communicating from a second node 510 of a second telecommunications network towards a first node 500 of a first telecommunications network according to exemplary embodiments of the invention as described above.
The second 510 may be adapted to execute methods of communicating from a first node 500 of a first telecommunications network towards a second node 510 of a second telecommunications network and of communicating from a second node 510 of a second telecommunications network towards a first node 500 of a first telecommunications network according to exemplary embodiments of the invention as described above.
In particular, the operating unit 514 may be adapted for dynamically assigning a group identifier to at least one circuit usable by the second node 510 during communicating and the sending unit 516 may be adapted for sending the group identifier towards the first node 500.
The second node 510 may be a call initiating node or a call recipient node.
The second node 510 may be adapted as a Mobile Switching Center Server (MSC-S), a Transit Switch Center, a Base Station Controller, a Gateway Mobile Switching Center Server (GMSC), a Media Gateway Control Function (MGCF), or a Radio Network Controller (RNC).
In the following, advantages of the teachings of the present application will be detailed:
Using the teachings of the present application, the enormous bulk of signaling will be eliminated which occurs in case of a single processor or board failure in a multi-processor based MSC/Gateway MSC/TSC/MGCF. A MSC/Gateway MSC/TSC/MGCF may be considered as Call Control Nodes CCN.
The teachings of the present application can be applied on the A- and Iu-interfaces of an MSC-S as well as between CCN nodes using ISUP, BICC or SIP protocols. It applies to TDM circuits as well as to logical circuits used to identify calls on an ATM or IP user plane.
Further, by using the teachings of the present application, overloading the receiving node by an avalanche of messages is prevented.
In the following, a list of abbreviations used throughout the application will be provided:
ACM Address Complete Message
BSSAP Base Station Server Application Part
CCN Call Control Node
CIC Circuit Identification Code or Caller Identification Code
COT Continuity
CPG Call Progress
CGR Circuit Group Reset
IAM Initial Address Message
GERAN GSM EDGE Radio Access Network
GI Group Identifier
IE Information Element
INF Information
ISUP ISDN User Part
TDM Time Division Multiplexing
Modifications and other embodiments of the disclosed invention will come to mind to one skilled in the art having the benefit of the teachings presented in the foregoing descriptions and the associated drawings. Therefore, it is to be understood that the invention is not to be limited to the specific embodiments disclosed and that modifications and other embodiments are intended to be included within the scope of this disclosure. Although specific terms may be employed herein, they are used in a generic and descriptive sense only and not for purposes of limitation.
| Filing Document | Filing Date | Country | Kind | 371c Date |
|---|---|---|---|---|
| PCT/EP2009/066968 | 12/11/2009 | WO | 00 | 6/9/2011 |
| Number | Date | Country | |
|---|---|---|---|
| 61121740 | Dec 2008 | US |
