EP1474943B1 - Noeud permettant d'etablir des connexions prioritaires dans des reseaux de telecommunication et procede afferent - Google Patents

Noeud permettant d'etablir des connexions prioritaires dans des reseaux de telecommunication et procede afferent Download PDF

Info

Publication number
EP1474943B1
EP1474943B1 EP02702356A EP02702356A EP1474943B1 EP 1474943 B1 EP1474943 B1 EP 1474943B1 EP 02702356 A EP02702356 A EP 02702356A EP 02702356 A EP02702356 A EP 02702356A EP 1474943 B1 EP1474943 B1 EP 1474943B1
Authority
EP
European Patent Office
Prior art keywords
connection
node
priority
indication
timer
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Expired - Lifetime
Application number
EP02702356A
Other languages
German (de)
English (en)
Other versions
EP1474943A1 (fr
Inventor
Mark Hollis
Philip Hodges
Ian Rytina
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Telefonaktiebolaget LM Ericsson AB
Original Assignee
Telefonaktiebolaget LM Ericsson AB
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 Telefonaktiebolaget LM Ericsson AB filed Critical Telefonaktiebolaget LM Ericsson AB
Publication of EP1474943A1 publication Critical patent/EP1474943A1/fr
Application granted granted Critical
Publication of EP1474943B1 publication Critical patent/EP1474943B1/fr
Anticipated expiration legal-status Critical
Expired - Lifetime legal-status Critical Current

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W28/00—Network traffic management; Network resource management
    • H04W28/16—Central resource management; Negotiation of resources or communication parameters, e.g. negotiating bandwidth or QoS [Quality of Service]
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/14—Session management
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
    • H04L9/40—Network security protocols
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L69/00—Network arrangements, protocols or services independent of the application payload and not provided for in the other groups of this subclass
    • H04L69/30—Definitions, standards or architectural aspects of layered protocol stacks
    • H04L69/32—Architecture of open systems interconnection [OSI] 7-layer type protocol stacks, e.g. the interfaces between the data link level and the physical level
    • H04L69/322—Intralayer communication protocols among peer entities or protocol data unit [PDU] definitions
    • H04L69/329—Intralayer communication protocols among peer entities or protocol data unit [PDU] definitions in the application layer [OSI layer 7]
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04Q—SELECTING
    • H04Q2213/00—Indexing scheme relating to selecting arrangements in general and for multiplex systems
    • H04Q2213/1307—Call setup
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04Q—SELECTING
    • H04Q2213/00—Indexing scheme relating to selecting arrangements in general and for multiplex systems
    • H04Q2213/13098—Mobile subscriber
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04Q—SELECTING
    • H04Q2213/00—Indexing scheme relating to selecting arrangements in general and for multiplex systems
    • H04Q2213/13176—Common channel signaling, CCS7
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04Q—SELECTING
    • H04Q2213/00—Indexing scheme relating to selecting arrangements in general and for multiplex systems
    • H04Q2213/13196—Connection circuit/link/trunk/junction, bridge, router, gateway
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04Q—SELECTING
    • H04Q2213/00—Indexing scheme relating to selecting arrangements in general and for multiplex systems
    • H04Q2213/13204—Protocols
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04Q—SELECTING
    • H04Q2213/00—Indexing scheme relating to selecting arrangements in general and for multiplex systems
    • H04Q2213/13209—ISDN
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04Q—SELECTING
    • H04Q2213/00—Indexing scheme relating to selecting arrangements in general and for multiplex systems
    • H04Q2213/13213—Counting, timing circuits
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04Q—SELECTING
    • H04Q2213/00—Indexing scheme relating to selecting arrangements in general and for multiplex systems
    • H04Q2213/1325—Priority service
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W28/00—Network traffic management; Network resource management
    • H04W28/02—Traffic management, e.g. flow control or congestion control
    • H04W28/10—Flow control between communication endpoints
    • H04W28/14—Flow control between communication endpoints using intermediate storage
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W28/00—Network traffic management; Network resource management
    • H04W28/16—Central resource management; Negotiation of resources or communication parameters, e.g. negotiating bandwidth or QoS [Quality of Service]
    • H04W28/26—Resource reservation
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W76/00—Connection management
    • H04W76/10—Connection setup
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W76/00—Connection management
    • H04W76/30—Connection release

Definitions

  • the present invention relates to a method according to the preamble of claim 1.
  • Devices and software programs embodying the invention are also described.
  • Bearer Independent Call Control (BICC) protocol is used to control the set-up and establishment of connections, e.g. telephone calls, independent of the underlying bearer technology for handling the payload of the connections.
  • BICC Bearer Independent Call Control
  • BICC Capability Set 3 is introducing a priority service as specified in ITU-T Recommendation 1.255.4, Integrated Services Digital Network (ISDN) General Structure and Service Capabilities, Priority Service.
  • ITU-T Recommendation 1.255.4 Integrated Services Digital Network (ISDN) General Structure and Service Capabilities
  • Priority Service Priority Service.
  • priority connections shall be given preferential treatment within the network for the priority service.
  • preferential treatment can especially include the functions of an extended waiting time before time-out of network units handling the connection and/or waiting for a line on the route to become free.
  • the priority of a connection can be indicated by a corresponding field in the initial message for the connection set-up, e.g. an initial address message (IAM).
  • IAM initial address message
  • bits of an octet in the IAM can be designated for this purpose.
  • connection establishment is processed without special treatments.
  • At least one node processing i.e. controlling or handling the connection attributes a timer to it, which ensures that resources reserved for said connection are released should the set-up fail.
  • a node controlling the connection can be for example an MSC (Mobile Services Switching Center) or a transit-switching node (TSN) connecting a mobile network to a fixed network.
  • the bearer can either be handled in the same node or in a separate bearer node, e.g. in a media gateway (MGW), which is at least partly controlled by the controlling node.
  • MSC Mobile Services Switching Center
  • TSN transit-switching node
  • the nodes can give preferential treatments based on the priority level.
  • the preferential treatment can especially include access to reserved network resources, e.g. only the highest priority connections are given access to the resources reserved for highest priority connections while the second priority connections are given only access to resources reserved for the second priority connections, excluding the resources reserved for the highest priority connections. Further priority levels are possible, connections for each level having only access to resources reserved for the same or a lower level.
  • Allocation of reserved network resources to specific priority levels is implementation specific. If a node cannot complete a high priority connection establishment request even after application of the preferential treatment, it clears the connection.
  • Nodes with interaction to the served user can receive the connection priority information from the user.
  • the originating node then forwards the information to further nodes in the connection.
  • the connection priority parameter is included in the ERQ message (Establish Request). If a connection priority parameter is received in an ERQ message by an incoming protocol entity, the incoming protocol entity instance passes the connection priority information to the nodal function along with the request for a new connection.
  • the priority information can be used in the nodes in different ways. For example, when the nodal functions select a route at the originating endpoint of the bearer, priority information can be used to select a route that has sufficient resources to the succeeding bearer node or directly to the terminating user. For bearer nodes without interaction to the originating user of a connection, the nodal functions can also check the availability of resources in the incoming bearer path. The connection priority information can further be used to allocate internal resources of the bearer node to establish an internal path for the connection from the incoming bearer path through the bearer node to the outgoing bearer path, either to a subsequent bearer node or to the terminating user of the connection.
  • the above specifications for a telecommunication network allow to handle connections with the corresponding priority in all nodes. However, this does often not ensure a successful establishment of priority connections.
  • different nodes use different mechanisms for ensuring connection priority, especially if nodes in different parts of a network are updated at different times, e.g. by different operators. In this case it is possible that a connection is queued in a first node, i.e. waiting for free resources to become available in said or another node, while a timer for said connection expires in a still further node. Even if each node handles the connection with priority, it is therefore still possible that a connection is not successfully established. It is also possible that the user requesting the connection terminates the request if the establishment takes an excessive time due to queuing.
  • the method described in claim 1 is performed. Furthermore, the invention is embodied in a communication network, a node and a software program as described in claims 9 to 11. Advantageous embodiments are described in the further claims.
  • the processing can be a handling or a controlling of the connection.
  • the nodes can accordingly be control nodes or bearer nodes or nodes handling both control signaling and bearer establishment.
  • the nodes comprise resources, which can be attributed for handling or controlling the connection. For each connection request, resources are attributed in the node.
  • the resources can for example comprise circuitry to process the connection, allocated memory or processing intervals or software identifiers like addresses.
  • At least one timer in the node supervises the connection establishment. It is possible that more than one timer is attributed to a connection, e.g. for supervising different aspects of the establishment of said connection relating to the control signaling and the bearer establishment. An expiry of any of said timers releases the resources attributed to the connection.
  • an expiry value is specified to avoid the blocking of resources if the request for connection establishment fails.
  • the first node selects a first of said timers according to an expiry value specified for priority connections, generally being different from the expiry value of the corresponding timer for regular connections.
  • the period for timer expiry is increased compared to a regular connection, i.e. a later timer expiry is specified for a priority connection. It is possible, that different timers attributed to a priority connection have different expiry values.
  • the first node sends an indication of the connection priority and a queuing indication to a further node controlling the connection.
  • the queuing indication is a notification that at least one special expiry value was selected for this connection.
  • the queuing indication can be for example an indication, that a queuing of priority call attempts can be accommodated by the preceding nodes, a flag that at least one timer was extended, or an information specifying which timers were selected, optionally including also an indication of the amended expiry value.
  • the further node checks whether an indication of a connection priority and a queuing indication is received.
  • the further node selects, according to the result of the check, at least one further of said timers according to an expiry value specified for priority connections, i.e. the expiry value for priority connections is selected if a queuing indication and a priority indication is received.
  • the selection of the timers and corresponding expiry values depends on the value of the connection priority indication.
  • the proposed method enables to extend network timers without the danger of an unintended release of the connection.
  • the method is easy to implement and can flexibly be adapted to different queuing requirements.
  • the method is especially suitable for use within a BICC network.
  • the request is the initial message to set up a connection and said initial message comprises a data field indicating a priority class for the connection.
  • the initial message is for example an IAM.
  • the data field or specified values or selected bits of the data field can be used to indicate different levels of connection priority, e.g. an emergency call.
  • Said plurality of nodes can comprise control nodes controlling the connection, e.g. an MSC server, and bearer nodes adapted to establish a bearer for the connection, e.g. an MGW. It is, however, also possible that a node both controls the connection and establishes bearers like a customary MSC.
  • the first and the further node both control the connection, that both nodes handle the bearer for the connection or that one node controls the connection while the other node handles the bearer. Therefore different queuing indications in the control level, in the bearer level and between both levels for the connection can be distinguished.
  • the queuing indication is contained in a group comprising a first queuing indication for messages between nodes controlling the connection, a second queuing indication for messages between nodes handling the connection and a third queuing indication for a message between a node handling the connection and a node controlling the connection. It is either possible to amend existing messages in the used protocols to comprise these indications or to define new messages for this purpose.
  • the further node replies to the queuing indication with a connection progress notification.
  • the connection progress notification can be forwarded by the nodes processing the connection in the direction of the party requesting the priority connection. It is possible that the sending of this message is delayed by a specified period of time.
  • the connection progress notification can initiate the sending of a tone or an announcement to the party requesting the priority connection.
  • the further node sends a first request to set up the connection and the indication of the connection priority and the queuing indication to a third node processing the connection, preferably all in a single message.
  • the third node rejects the queuing indication as unsupported to the further node.
  • the further node waits for a confirmation of a bearer establishment for said connection and sends a further request to set up the connection and a further indication of the connection priority to the third node, if a release message is received from the third node for said connection. In this way, an establishment of priority connections can also be ensured if a node in the connection is not adapted to the queuing of connections.
  • the selection of the first or the further timer can be a decision that no timer for releasing the resources is attributed to a priority connection. It is of course also possible to use extended timers for supervising one aspect of priority connections while supervising a different aspect only for regular connections, i.e. to attribute a reduced number of, optionally extended, timers to priority connections. If an infinite expiry time is specified, preferably a mechanism to detect and release unsuccessful connection establishment requests is implemented in the communication system to avoid the blocking of resources.
  • a preferable node for processing connections in a telecommunication network with a plurality of nodes comprises resources, which can be attributed for processing the connection and at least one timer for supervising the connection establishment. An expiry of the timer initiates a release of the resources attributed to the connection.
  • the node comprises also interfaces to receive a request to set up a priority connection and to send messages to further nodes, i.e. transmission and reception units for sending and receiving messages.
  • the node comprises a processing system which is adapted to select the at least one timer according to an expiry value specified for priority connections.
  • the node is also adapted to send an indication of the connection priority and a queuing indication being indicative of the timer selection to a further node processing the connection.
  • the proposed method can also be embodied in a program unit adapted for execution in the processing system of a node for processing connections in a telecommunication network with a plurality of nodes.
  • the program unit comprises code for attributing resources to the connection for processing the connection and at least one timer for supervising the connection establishment. An expiry of the timer initiates a release of the resources attributed to the connection.
  • the program unit is adapted to select the at least one timer according to an expiry value specified for priority connections.
  • the program unit is also adapted to send an indication of the connection priority and a queuing indication for the timer selection to a further node processing the connection.
  • the steps performed by the processing unit can be executed by function calls to an operating system or commands to hardware units in the node.
  • the program unit as well as the node can perform any steps relating to the respective node in the method described above.
  • a program unit according to the invention is for example stored on a data carrier or loadable into the operating system of a node, e.g. as a sequence of signals.
  • Timer t1 also denoted Timer_ERQ, ensures that a reply to a bearer establishment request is received.
  • a typical time-out value is 5-30 seconds.
  • the timer t1 is started when an ERQ message is sent and stopped at the receipt of an ECF (Establish Confirm) message. If timer t1 expires, all resources and the connection are released and a release message (REL) is sent.
  • ECF Establish Confirm
  • Timer t1 is the bearer establishment supervision timer for the Q.2630.1 bearer control protocol as defined in ITU-T Recommendation Q. 2630.1 (12/99), AAL Type 2 Signaling Protocol (Capability Set 1) .
  • Other bearer control protocols have similar supervision timers that can initiate premature connection release. Throughout the text these timers are generically referred to as "bearer establishment supervision timers”.
  • a timer denoted T7 ensures that the network has enough routing information to route the connection to the called party.
  • a typical time-out value is 20-30 seconds.
  • Timer T7 is started in the control level when the latest address message is sent and stopped when the condition for normal release of address and routing information is met, e.g. the receipt of a message ACM (Address Complete Message) or CON (Connect). At expiry, a release procedure for the resources attributed to the connection is initiated.
  • ACM Address Complete Message
  • CON Connection
  • a timer denoted T8 ensures the supervision of the bearer path establishment.
  • a typical time-out value is 10-15 seconds.
  • Timer T8 is started when the CSF (Call Service Function) at a Serving Node (SN) receives an IAM indicating that a continuity message (COT) is to be expected and stopped at receipt of the COT. At expiry, a release procedure for the reserved resources is initiated.
  • AAL2 ATM Adaptation Layer Type 2 bearer technology utilizing Q.2630.2 (ITU-T Recommendation Q. 2630.2 (12/2000), AAL Type 2 Signaling Protocol (Capability Set 2) ) as bearer control protocol is used as an example for a connection bearer.
  • Q.2630.2 ITU-T Recommendation Q. 2630.2 (12/2000), AAL Type 2 Signaling Protocol (Capability Set 2)
  • any other suitable bearer protocol e.g. the Internet Protocol IP, can be used and also a different bearer control protocol compared to the examples.
  • GSN gateway serving nodes 1, 2
  • BCF Bearer Control Function
  • FIG 1 shows the consequence of not extending the network timers while queuing a priority connection establishment request.
  • a connection is set up between two control nodes 1, 2 starting with an initial address message (IAM) comprising a priority indication. It is possible that the first node 1 receives an IAM from a preceding node in the connection as indicated on the left side of figure 1.
  • IAM initial address message
  • Corresponding timers T7 and T8 are started in the control level at times ST7, ST8, respectively. Both nodes 1,2 send also ADD requests to the bearer layer to initiate the bearer establishment. In the bearer level, establishment requests indicating also a priority connection are used to initiate the bearer establishment.
  • a congestion CG is encountered at an intermediate AAL2 bearer switching node 3 with a Bearer Control Function (BCF) designated BCF-R.
  • BCF Bearer Control Function
  • connection establishment request is queued waiting for resources to become free in BCF-R
  • timer t1 in BCF-G (z) of node 2 will expire at time TO1 and the connection will be cleared by a corresponding notification message for BNC (Backbone Network Connection) release to the control level in node 2 and a subsequent release message (REL) to all preceding nodes controlling the connection.
  • BNC Backbone Network Connection
  • REL release message
  • the timers are extended or inhibited and a queuing indication is set.
  • the corresponding timers should also be extended or inhibited. This is shown in figure 2.
  • an extended timer is started at time SE7 instead of timer T7.
  • the priority indication in the IAM is used to indicate that the connection is to be treated with priority.
  • the connection can be given priority in a number of ways that do not involve queuing. One is the reservation of special resources that can only be used by high priority connections. Another way of providing a priority service is connection preemption, i.e. clearing of lower priority connections. Neither of these techniques requires the extension of timers. Even if some nodes in a network do not implement queuing, a connection can be handled with priority using these other techniques while the queuing indication is needed to determine if a priority connection can be queued.
  • node 2 in figure 2 When node 2 in figure 2 receives both the priority indication and the queuing indication in the IAM, it starts an extended timer at time SE8 before sending the ADD request to the BCF for establishing the bearer.
  • the ADD request is used to add a termination, i.e. a further source or sink of payload, to a context, i.e. to the group of all terminations associated with a connection.
  • the ADD request may also be used to modify default properties or capabilities or initiate new properties on the termination being added. Details are described in specification ITU-T Recommendation H.248 (06/00), Gateway control protocol, Section 7.2.1.
  • the ADD Response is used to indicate successful or unsuccessful completion of the addition of a termination to a context.
  • a BICC network is able to tolerate queuing of priority connection attempts without premature release.
  • subscriber behavior must also be taken into account. If the calling subscriber does not receive any progress information within a reasonable time during the connection establishment, i.e. if there is an excessive post-dialing delay, the calling subscriber might get impatient and hang up.
  • Figure 2 exemplifies this case by message Sub originating from the subscriber and triggering a release of the connection by a sequence of REL messages to all nodes controlling the connection.
  • connection-progress notification This can be for example a tone, an announcement or a message.
  • a node decides to queue a priority connection, a mechanism is required to trigger the sending of this connection progress information.
  • connection progress information can be sent using out-of-band signaling between the controlling nodes. In order to know when to send this information, the control layer needs an information whether the establishment attempt is being queued.
  • control layer queues the establishment request as in figure 3, then it generates a connection in progress notification or a queuing initiated APM (Application Transport Mechanism) for initiating, e.g., a call-in-progress tone to the user requesting the connection when node 2 queues the connection establishment request.
  • APM Application Transport Mechanism
  • the bearer establishment using extended timers t1 started at times SE1, SE1', is initiated by an ADD message and the IAM with queuing and priority parameters is forwarded to the subsequent control node in the connection.
  • a COT message is sent to the subsequent control node to indicate the successful bearer establishment for the bearers up to control node 2.
  • node 2 After receiving the Address Complete Message (ACM) from the subsequent control node in the connection, node 2 sends a message APM to the preceding control node to switch the call-in-progress tone off, followed by the customary ACM to preceding node 1 as well as any further preceding control nodes.
  • ACM Address Complete Message
  • the bearer layer queues the establishment request as shown in figure 4, e.g. if a resource congestion CG is encountered at node 3. Then a second queuing indication 5 is required to be passed from the place of congestion CG through the bearer network and then a third queuing indication 6 from the bearer level to the control level when the connection establishment request is queued.
  • This indication from the bearer level, that queuing is performed, needs to be mapped by the connection layer to the connection in progress notification or queuing initiated APM.
  • the further messages IAM, ADD, ERQ, APM and ACM correspond to those as described with respect to figure 3.
  • a corresponding indication can be passed backwards toward the calling party. This indication can then be either passed to the terminal of the user or mapped to a tone or announcement by any of the preceding nodes that have the capability to do so. Also, a notification does not need to be sent immediately when the connection is first queued, but instead it can be delayed by a defined time, e.g. X seconds after the queuing is performed. Of course, the latter alternatives are possible for any congestion, e.g. for a congestion encountered on the control level as described with respect to figure 3.
  • Figure 5 shows the situation in which nodes adapted to the proposed method are inter-working with control nodes according to the state of the art.
  • Queuing is not supported in a third node 4 and the third node 4 does not recognize the queuing indicator.
  • the third node 4 rejects the queuing indication as being unsupported with message CFN (confusion) and starts an ordinary timer T8 at time ST8'.
  • the further node 2 stores in a memory that the queuing indication is unsupported in the subsequent third node 4.
  • the call establishment is queued in the further node 2 until the bearer has been established up to the bearer control nodal function (BCF-N) in the further node 2 or under it's control as described above.
  • BCF-N bearer control nodal function
  • the call establishment is then continued toward the third node 4 with an initial address message comprising the priority indication but no queuing indication.
  • the IAM is sent if the timer T8 expires prematurely in the third node 4 and an according release message is received in node 2. If no release message REL is received by further node 2, a further IAM is not sent.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Computer Security & Cryptography (AREA)
  • Quality & Reliability (AREA)
  • Mobile Radio Communication Systems (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)
  • Telephonic Communication Services (AREA)
  • Communication Control (AREA)

Claims (12)

  1. Procédé pour établir une connexion prioritaire dans un réseau de télécommunications comportant une pluralité de noeuds (1-4) pour traiter la connexion, dans lequel les noeuds (1-4) comprennent des ressources qui peuvent être attribuées pour le traitement de la connexion et un temporisateur pour superviser l'établissement de la connexion, une expiration du temporisateur libérant les ressources attribuées à la connexion, dans lequel un premier desdits noeuds (1-4) reçoit une demande afin d'établir une connexion prioritaire, caractérisé en ce que
    le premier noeud (1) sélectionne un premier desdits temporisateurs en fonction d'une valeur d'expiration spécifiée pour les connexions prioritaires,
    le premier noeud (1) envoie une indication de la priorité de connexion et une indication de mise en file d'attente pour la sélection du temporisateur à un autre noeud (2) traitant la connexion,
    et l'autre noeud (2) vérifie si une indication d'une priorité de connexion et une indication d'une mise en file d'attente est reçue et sélectionne, en fonction du résultat de la vérification, un autre desdits temporisateurs en fonction d'une valeur d'expiration spécifiée pour les connexions prioritaires.
  2. Procédé selon la revendication 1, dans lequel la demande est le message initial pour établir une connexion et ledit message initial comprend un champ de données indiquant une classe de priorité pour la connexion.
  3. Procédé selon la revendication 1 ou 2, dans lequel ladite pluralité de noeuds (1-4) comprend des noeuds de commande commandant la connexion et des noeuds de support (3) adaptés pour établir un support pour la connexion.
  4. Procédé selon la revendication 3, dans lequel l'indication de mise en file d'attente est contenue dans un groupe comprenant une première indication de mise en file d'attente pour les messages entre les noeuds commandant la connexion, une deuxième indication de mise en file d'attente (5) pour les messages entre les noeuds traitant la connexion et une troisième indication de mise en file d'attente (6) pour un message entre un noeud traitant la connexion et un noeud commandant la connexion.
  5. Procédé selon l'une quelconque des revendications précédentes, dans lequel l'autre noeud répond à l'indication de mise en file d'attente par une notification de progression de la connexion.
  6. Procédé selon la revendication 5, dans lequel la notification de progression de la connexion initie l'envoi d'une tonalité à la partie demandant la connexion prioritaire.
  7. Procédé selon l'une quelconque des revendications précédentes, dans lequel l'autre noeud (2) envoie une première demande afin d'établir la connexion et l'indication de la priorité de connexion et l'indication de mise en file d'attente à un troisième noeud (4) traitant la connexion, le troisième noeud (4) rejette l'indication de mise en file d'attente comme étant non-supportée à l'autre noeud (2) et l'autre noeud (2) attend une confirmation d'un établissement de support pour ladite connexion et envoie une demande supplémentaire afin d'établir la connexion et une indication supplémentaire de la priorité de connexion au troisième noeud (4), si un message de libération est reçu d'un troisième noeud (4) pour ladite connexion.
  8. Procédé selon l'une quelconque des revendications précédentes, dans lequel un temps d'expiration infini est spécifié pour une connexion prioritaire et dans lequel la sélection du premier ou de l'autre temporisateur est une décision qu'aucun temporisateur ou un nombre réduit de temporisateurs est attribué à une connexion prioritaire afin de libérer les ressources.
  9. Réseau de communication adapté afin d'appliquer un procédé selon l'une quelconque des revendications précédentes.
  10. Noeud pour traiter les connexions dans un réseau de télécommunications comportant une pluralité de noeuds, dans lequel le noeud (1,2) comprend des ressources qui peuvent être attribuées pour le traitement de la connexion et au moins un temporisateur pour superviser l'établissement de la connexion, une expiration du temporisateur libérant les ressources attribuées à la connexion et des interfaces pour recevoir une demande d'établissement d'une connexion prioritaire et pour envoyer des messages à d'autres noeuds (1-4), caractérisé en ce que
    le noeud (1,2) est adapté pour sélectionner au moins un temporisateur en fonction d'une valeur d'expiration spécifiée pour les connexions prioritaires,
    le noeud (1,2) est adapté pour envoyer une indication de la priorité de connexion et une indication de mise en file d'attente pour la sélection du temporisateur à un autre noeud (1-4) traitant la connexion.
  11. Unité de programmes adaptée pour être exécutée dans un noeud de traitement de connexions dans un réseau de télécommunications comportant une pluralité de noeuds (1-4) et comprenant du code pour attribuer des ressources à la connexion afin de traiter la connexion et au moins un temporisateur pour superviser l'établissement de la connexion, une expiration du temporisateur libérant les ressources attribuées à la connexion, caractérisée en ce que
    l'unité de programmes est adaptée afin de sélectionner au moins un temporisateur en fonction d'une valeur d'expiration spécifiée pour les connexions prioritaires,
    l'unité de programmes est adaptée afin d'envoyer une indication de connexion prioritaire et une indication de mise en file d'attente pour la sélection du temporisateur à un autre noeud traitant la connexion.
  12. Unité de programmes selon la revendication 11, dans lequel l'unité de programmes est stockée sur un support de stockage.
EP02702356A 2002-02-15 2002-02-15 Noeud permettant d'etablir des connexions prioritaires dans des reseaux de telecommunication et procede afferent Expired - Lifetime EP1474943B1 (fr)

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/EP2002/001613 WO2003077580A1 (fr) 2002-02-15 2002-02-15 Noeud permettant d'etablir des connexions prioritaires dans des reseaux de telecommunication et procede afferent

Publications (2)

Publication Number Publication Date
EP1474943A1 EP1474943A1 (fr) 2004-11-10
EP1474943B1 true EP1474943B1 (fr) 2005-07-27

Family

ID=27798744

Family Applications (1)

Application Number Title Priority Date Filing Date
EP02702356A Expired - Lifetime EP1474943B1 (fr) 2002-02-15 2002-02-15 Noeud permettant d'etablir des connexions prioritaires dans des reseaux de telecommunication et procede afferent

Country Status (8)

Country Link
US (1) US20050181782A1 (fr)
EP (1) EP1474943B1 (fr)
CN (1) CN100559901C (fr)
AT (1) ATE300849T1 (fr)
AU (1) AU2002235903A1 (fr)
DE (1) DE60205280T2 (fr)
ES (1) ES2246386T3 (fr)
WO (1) WO2003077580A1 (fr)

Families Citing this family (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8031697B2 (en) * 2004-12-31 2011-10-04 Samsung Electronics Co., Ltd Method for bearer independent call control (BICC) optimization for IP bearer support
US7512073B2 (en) * 2005-09-14 2009-03-31 Telefonaktiebolaget L M Ericsson (Publ) Method and signaling node for reducing signaling during call setup
US8385262B2 (en) * 2006-09-28 2013-02-26 St-Ericsson Sa Transferring data in a dual transfer mode between a mobile network and mobile stations
CN101420717B (zh) * 2007-10-26 2013-03-27 摩托罗拉移动公司 用于在通信网络中确定呼叫优先级的方法
JP5353072B2 (ja) * 2008-06-09 2013-11-27 富士通株式会社 無線通信方法、及び無線通信装置
US20100008293A1 (en) * 2008-07-09 2010-01-14 Qualcomm Incorporated X2 interfaces for access point base stations in self-organizing networks (son)
EP2436208B1 (fr) * 2009-05-29 2015-08-05 Telefonaktiebolaget LM Ericsson (publ) Méthode et arrangement pour le management de l'accès d'un équipement utilisateur dans un système de communication sans fil
CN102340753B (zh) * 2010-07-23 2016-03-30 中兴通讯股份有限公司 一种实现呼叫优先接入的方法和系统
US9439234B2 (en) * 2012-12-19 2016-09-06 Apple Inc. System and method for intelligently selecting a network interface
US9320064B2 (en) * 2014-03-25 2016-04-19 Telefonaktiebolaget Lm Ericsson (Publ) System and method for improving PDP context activation latency
EP3238500A1 (fr) * 2014-12-22 2017-11-01 Koninklijke KPN N.V. Gestion de demandes d'établissement de connexion

Family Cites Families (20)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US4491739A (en) * 1982-09-27 1985-01-01 Watson William K Airship-floated wind turbine
US5301356A (en) * 1991-12-10 1994-04-05 Telefonaktiebolaget L M Ericsson Prioritization between handoff and new call requests in a cellular communications system
EP0680680B1 (fr) * 1993-09-20 2002-10-16 CODEX CORPORATION, a subsidiary company of MOTOROLA INC. Reglage dynamique de capacite destine a la regulation de surcharge dans des reseaux de communications
US5740231A (en) * 1994-09-16 1998-04-14 Octel Communications Corporation Network-based multimedia communications and directory system and method of operation
KR100247146B1 (ko) * 1995-03-31 2000-04-01 비센트 비.인그라시아 통신자원을 할당하는 방법 및 장치
US5711010A (en) * 1995-05-31 1998-01-20 Motorola, Inc. Method of establishing access to secondary communication resources in a communication system
US5812656A (en) * 1995-11-15 1998-09-22 Lucent Technologies, Inc. System for providing prioritized connections in a public switched network
US5889779A (en) * 1996-12-02 1999-03-30 Rockwell Science Center Scheduler utilizing dynamic schedule table
US6496515B2 (en) * 1997-05-26 2002-12-17 Alcatel Method for prioritised data transmission and data transmission arrangement
US6115613A (en) * 1997-07-02 2000-09-05 Telefonaktiebolaget L M Ericsson System and method for providing telephone service to each member of a group of radio telephone subscribers
US7050445B1 (en) * 1997-07-30 2006-05-23 Bellsouth Intellectual Property Corporation System and method for dynamic allocation of capacity on wireless networks
JP4266403B2 (ja) * 1998-02-18 2009-05-20 キヤノン株式会社 通信システム及びその制御方法
JPH11261609A (ja) * 1998-03-11 1999-09-24 Fujitsu Ltd Ｃｓｍａ／ｃｄ方式におけるデータ優先送信方法及びその装置
US6542476B1 (en) * 1998-10-16 2003-04-01 Telefonaktiebolaget Lm Ericsson (Publ) System and method for dynamic timer regeneration
JP3286939B2 (ja) * 1998-12-17 2002-05-27 富士通株式会社 移動通信システムにおける移動局の加入者データ収容制御方法及び装置
US7200110B1 (en) * 1999-03-24 2007-04-03 Alcatel Canada Inc. Method and apparatus for prioritized release of connections in a communications network
US7065203B1 (en) * 2001-05-07 2006-06-20 Cisco Technology, Inc. Method and system for managing call requests in a limited bandwidth environment
US7212490B1 (en) * 2001-07-06 2007-05-01 Cisco Technology, Inc. Dynamic load balancing for dual ring topology networks
US7039061B2 (en) * 2001-09-25 2006-05-02 Intel Corporation Methods and apparatus for retaining packet order in systems utilizing multiple transmit queues
US6904032B2 (en) * 2002-01-10 2005-06-07 Harris Corporation Method and device for establishing communication links between mobile communication systems

Also Published As

Publication number Publication date
DE60205280T2 (de) 2006-05-24
US20050181782A1 (en) 2005-08-18
ATE300849T1 (de) 2005-08-15
DE60205280D1 (de) 2005-09-01
ES2246386T3 (es) 2006-02-16
AU2002235903A1 (en) 2003-09-22
CN100559901C (zh) 2009-11-11
CN1620835A (zh) 2005-05-25
WO2003077580A1 (fr) 2003-09-18
EP1474943A1 (fr) 2004-11-10

Similar Documents

Publication Publication Date Title
EP1771995B1 (fr) Procede et dispositif pour le controle de session dans des reseaux de telecommunication hybrides
EP2361468B1 (fr) Procédé de régulation d'encombrement et dispositifs
CN101151858B (zh) 资源预留设置协议rsvp环境中提供带宽预留的系统和方法
EP1071267B1 (fr) Réacheminement d'appels vocaux n'obtenant pas une certaine qualité de service dans un réseau a base de paquets
US7787501B2 (en) Congestion control in an IP network
JP2003179636A (ja) ＶｏＩＰネットワークの輻輳制御システム
JP4034187B2 (ja) ボイスオーバーｉｐ優先度及び帯域要件の最適化
EP1474943B1 (fr) Noeud permettant d'etablir des connexions prioritaires dans des reseaux de telecommunication et procede afferent
EP1440586B1 (fr) Procede et systeme pour la gestion d'appel dans un systeme de telecommunications
WO2000077988A1 (fr) Systeme et procede permettant de fournir un niveau de qualite de service (qos) requis pour un appel emanant d'un mobile et achemine via un reseau a commutation par paquets
CN1295906C (zh) 用于指定呼叫优先级的系统和方法
EP1446970B1 (fr) Procede et noeud permettant de configurer une connexion dans un reseau de telecommunication
US20020077109A1 (en) Method and system for establishing a connection
US6735176B1 (en) Dynamic bandwidth management and rerouting
US6570879B1 (en) Communications system and method of controlling same
CN110392019B (zh) 一种集群音视频业务专用承载建立方法和系统
KR100735389B1 (ko) 네트워크상의 콜 센터에서 호를 분배하는 장치
EP1942631B1 (fr) Procédé et système de gestion d'appel dans un système de télécommunication
US8750289B2 (en) Call setup using voice over the internet protocol (VoIP)
MXPA01011084A (es) Metodo de terminacion de transaccion de la parte de aplicacion de las capacidades de transaccion (tcap).
JP2000004234A (ja) 回線選択方式
KR20000025924A (ko) 차세대 지능망에서의 클릭 팩스 송신 서비스 제공방버뵤

Legal Events

Date Code Title Description
PUAI Public reference made under article 153(3) epc to a published international application that has entered the european phase

Free format text: ORIGINAL CODE: 0009012

17P Request for examination filed

Effective date: 20040728

AK Designated contracting states

Kind code of ref document: A1

Designated state(s): AT BE CH CY DE DK ES FI FR GB GR IE IT LI LU MC NL PT SE TR

AX Request for extension of the european patent

Extension state: AL LT LV MK RO SI

GRAP Despatch of communication of intention to grant a patent

Free format text: ORIGINAL CODE: EPIDOSNIGR1

GRAS Grant fee paid

Free format text: ORIGINAL CODE: EPIDOSNIGR3

GRAA (expected) grant

Free format text: ORIGINAL CODE: 0009210

AK Designated contracting states

Kind code of ref document: B1

Designated state(s): AT BE CH CY DE DK ES FI FR GB GR IE IT LI LU MC NL PT SE TR

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: IT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT;WARNING: LAPSES OF ITALIAN PATENTS WITH EFFECTIVE DATE BEFORE 2007 MAY HAVE OCCURRED AT ANY TIME BEFORE 2007. THE CORRECT EFFECTIVE DATE MAY BE DIFFERENT FROM THE ONE RECORDED.

Effective date: 20050727

Ref country code: LI

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20050727

Ref country code: TR

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20050727

Ref country code: NL

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20050727

Ref country code: AT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20050727

Ref country code: FI

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20050727

Ref country code: BE

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20050727

Ref country code: CH

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20050727

REG Reference to a national code

Ref country code: GB

Ref legal event code: FG4D

REG Reference to a national code

Ref country code: CH

Ref legal event code: EP

REG Reference to a national code

Ref country code: IE

Ref legal event code: FG4D

REF Corresponds to:

Ref document number: 60205280

Country of ref document: DE

Date of ref document: 20050901

Kind code of ref document: P

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: SE

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20051027

Ref country code: GR

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20051027

Ref country code: DK

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20051027

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: PT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20051227

REG Reference to a national code

Ref country code: CH

Ref legal event code: PL

NLV1 Nl: lapsed or annulled due to failure to fulfill the requirements of art. 29p and 29m of the patents act
PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: IE

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20060215

REG Reference to a national code

Ref country code: ES

Ref legal event code: FG2A

Ref document number: 2246386

Country of ref document: ES

Kind code of ref document: T3

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: MC

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20060228

Ref country code: LU

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20060228

ET Fr: translation filed
PLBE No opposition filed within time limit

Free format text: ORIGINAL CODE: 0009261

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: NO OPPOSITION FILED WITHIN TIME LIMIT

26N No opposition filed

Effective date: 20060428

REG Reference to a national code

Ref country code: IE

Ref legal event code: MM4A

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: CY

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20050727

REG Reference to a national code

Ref country code: FR

Ref legal event code: PLFP

Year of fee payment: 15

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: DE

Payment date: 20160226

Year of fee payment: 15

Ref country code: ES

Payment date: 20160226

Year of fee payment: 15

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: GB

Payment date: 20160226

Year of fee payment: 15

Ref country code: FR

Payment date: 20160217

Year of fee payment: 15

REG Reference to a national code

Ref country code: DE

Ref legal event code: R119

Ref document number: 60205280

Country of ref document: DE

GBPC Gb: european patent ceased through non-payment of renewal fee

Effective date: 20170215

REG Reference to a national code

Ref country code: FR

Ref legal event code: ST

Effective date: 20171031

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: FR

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20170228

Ref country code: DE

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20170901

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: GB

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20170215

REG Reference to a national code

Ref country code: ES

Ref legal event code: FD2A

Effective date: 20180625

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: ES

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20170216