EP2005661B1 - Système, ensembles et procédé pour la gestion d'accès - Google Patents
Système, ensembles et procédé pour la gestion d'accès Download PDFInfo
- Publication number
- EP2005661B1 EP2005661B1 EP06725611A EP06725611A EP2005661B1 EP 2005661 B1 EP2005661 B1 EP 2005661B1 EP 06725611 A EP06725611 A EP 06725611A EP 06725611 A EP06725611 A EP 06725611A EP 2005661 B1 EP2005661 B1 EP 2005661B1
- Authority
- EP
- European Patent Office
- Prior art keywords
- access
- node
- core network
- network
- service
- 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.)
- Active
Links
- 238000000034 method Methods 0.000 title claims description 18
- 230000014759 maintenance of location Effects 0.000 claims description 6
- 230000004044 response Effects 0.000 claims description 5
- 230000003213 activating effect Effects 0.000 claims 1
- 238000010586 diagram Methods 0.000 description 7
- 230000007246 mechanism Effects 0.000 description 5
- 238000013468 resource allocation Methods 0.000 description 4
- 238000012913 prioritisation Methods 0.000 description 3
- 230000008569 process Effects 0.000 description 3
- 230000004913 activation Effects 0.000 description 2
- 230000008901 benefit Effects 0.000 description 2
- 230000004069 differentiation Effects 0.000 description 2
- 230000011664 signaling Effects 0.000 description 2
- 230000008859 change Effects 0.000 description 1
- 238000007726 management method Methods 0.000 description 1
- 230000003068 static effect Effects 0.000 description 1
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/10—Flow control; Congestion control
- H04L47/15—Flow control; Congestion control in relation to multipoint traffic
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L43/00—Arrangements for monitoring or testing data switching networks
- H04L43/16—Threshold monitoring
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/10—Flow control; Congestion control
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/70—Admission control; Resource allocation
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/70—Admission control; Resource allocation
- H04L47/80—Actions related to the user profile or the type of traffic
- H04L47/808—User-type aware
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/70—Admission control; Resource allocation
- H04L47/82—Miscellaneous aspects
- H04L47/821—Prioritising resource allocation or reservation requests
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/70—Admission control; Resource allocation
- H04L47/82—Miscellaneous aspects
- H04L47/824—Applicable to portable or mobile terminals
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L63/00—Network architectures or network communication protocols for network security
- H04L63/10—Network architectures or network communication protocols for network security for controlling access to devices or network resources
- H04L63/105—Multiple levels of security
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L63/00—Network architectures or network communication protocols for network security
- H04L63/20—Network architectures or network communication protocols for network security for managing network security; network security policies in general
-
- 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
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W8/00—Network data management
- H04W8/02—Processing of mobility data, e.g. registration information at HLR [Home Location Register] or VLR [Visitor Location Register]; Transfer of mobility data, e.g. between HLR, VLR or external networks
- H04W8/04—Registration at HLR or HSS [Home Subscriber Server]
Definitions
- the present invention relates to a system comprising a core network access packet data node, a core network access edge node, which node may be separate or combined in one, means holding subscriber data and means holding policy related data and admission control means.
- the invention also relates to a core network access packet data node in a communication network supporting communication of packet data as well as a core network access edge node.
- the invention further relates to a policy server node and to a method for controlling access to network resources in a network supporting communication of packet data which comprises at least a core network access packet data node and a core network access edge node, which nodes may be separate or combined in one, and means holding policy related data and means holding subscriber data.
- network resources may more or less temporarily be scarce, the network may be overloaded etc.
- emergency services it is extremely important to be able to control resources and access to resources end-to-end and, in addition thereto, be capable to make resources free throughout or in part of the end-to-end chain connection in the network when needed, which hence has to be done for example for IP telephony and other IMS based services.
- the network must be capable of quickly and reliably shifting resources dedicated to a bearer or service which are less important to more important bearers or services such as emergency calls or emergency data services, VIP user categories etc. when needed.
- a service may for example be number 112, 110 or 911 and a VIP user category may for example be a fire brigade, police, military etc. using any voice or data service.
- IP PoP Internet Protocol Point of Presence
- APN Access Point Name
- a system as initially referred to is needed through which packet switched networks reliably can be used also for handling communication requiring highly predictable end-to-end behavior.
- a system is needed through which emergency communication or similar can be given the appropriate priority while using a packet switched communication in all kinds of situations, such as when a network or part of a network or nodes in a network are overloaded, malfunctioning etc.
- a packet switched system is needed through which it is possible to make a prioritization of services and user categories.
- a system is needed through which it gets possible to control resources and access to resources end-to-end, and even more particularly to be capable to free resources entirely or in parts of an end-to-end chain when needed.
- a system is needed which allows an efficient and secure resource control, particularly allowing distinguishing between services having the same QoS priority irrespectively of IP PoP or access APN.
- It is particularly an object of the invention to suggest a system through which service differentiation can be provided in a desired manner. Even more particularly it is an object of the present invention to provide a system providing service and subscriber awareness to the network in terms of importance and which allows handling during various network load conditions in a reliable end-to-end fashion and hence to provide a mechanism to handle for example emergency services and emergency situations in a very reliable manner.
- the access priority related information for example comprising a subscriber and priority related access allocation priority parameter, is used for temporarily providing access allowance to network resources, if a given criterium is fulfilled for example in relation to the current network load.
- new defined parameters which are service related, particularly at least a parameter relating to service importance and/or user/subscriber category for final access acceptance and admission control is used.
- a service priority related parameter defines the allocation retention priority for a service used by a user category.
- the subscriber related access priority allocation parameter comprises the HLR based Allocation Retention Priority (ARP) existing in current 3GPP specifications as discussed earlier in the application.
- ARP Allocation Retention Priority
- service ARP service priority related parameter
- the system may temporarily allow access to a network, for example a core network access packet data node, for example an SGSN or a CGSN.
- a network for example a core network access packet data node, for example an SGSN or a CGSN.
- Admission control for resource allocation e.g.
- bandwidth is done when access acceptance is granted based on the service ARP or more generally the service priority related information comprising the service priority related parameter and possibly other parameters relating to pre-emption capability and allowability as discussed earlier in this application.
- This will keep the resource usage until the final decision and access permission is given down to a minimum which is extremely advantageous.
- the system or the inventive concept can be used without regard of the subscriber related access allocation priority parameter which means that resource usage cannot be optimized to the same extent (except in broadband applications, where this is not a similar issue), but it is still advantageous since the end-to-end behavior can be guaranteed and predicted.
- the preliminary decision to process or queue a bearer request in a node is based on the subscriber related access allocation priority parameter, particularly the Access ARP value.
- the subscriber related access allocation priority parameter will be denoted the Access ARP even if it does not have to be ARP as defined in 3GPP and similarly the service priority related parameter will be denoted Service ARP.
- Service ARP Service ARP
- the inventive mechanism allows the Core Network to keep control of the resources and discriminate between high and low prioritized user categories and services for preliminary or initial access permission.
- the Access ARP value can be defined per subscriber and IP PoP.
- the preliminary access permission does not give final access permission as it merely gives temporary access to the network until the final access decision relating to final access permission has been made. Actually it merely (if granted) makes it possible to make a service priority based decision. Even if preliminary access permission is granted, the request may be rejected at a later state if the service ARP does not give enough priority, or even the initial access permission might not be given in every node on the end-to-end path, since preferably the procedure is performed in several nodes on the path.
- the service ARP value is provisioned from the service network or from the core network access edge node, or even the core network access packet data node if it also includes the functionality of the former, see for example the case with an CGSN, e.g. Fig. 4 , and the service priority related information is held or generated therein.
- the service ARP is generated by taking the service importance and/or user category into account. This allows prioritizing not only on services but also on the user category using the service. As an example all services used by the fire brigade can be given a high service ARP, while for other subscribers only 112 or 911 services are given a high service ARP.
- the service ARP for ordinary subscribers using 112 or 911 may e.g. be lower than for any service used by the fire brigade. This is implementation specific and may be set and controlled in a desired manner.
- the network must have at least one entity with service awareness, capable of signalling policies, or at least service priority related information, to other entities.
- it is a policy server as in IMS like system or the access edge in non-IMS like systems. Both entities need to be able to detect and provide service importance and may combine it with user subscriber categories, thus generate a service ARP.
- the service ARP is directly or node by node sent to other network entities and nodes in order to perform final access permission.
- the other network entities comprise entities or nodes in the core network and radio network nodes.
- broadband networks it is for example BRAS (Broadband Access Service) or DSLAM (Digital Subscriber Line Access Management).
- Fig. 1 shows one specific implementation of the inventive concept, in this particular case in a 3G network. It should be clear that nodes or entities etc. which are not directly involved in or necessary for carrying out the inventive concept and not necessary for its functioning are omitted for reasons of clarity.
- a core network CN which comprises a core network access packet data node 10 1 which here is supposed to be an SGSN.
- the SGSN 10 1 comprises preliminary access decision means 2A 1 which here are denoted first such means because preliminary access means also are provided in the core network access edge node 20 1 which is here supposed to be a GGSN and where they are denoted second preliminary access decision means.
- SGSN 10 1 also comprises final access decision means (first) 6A 1 . It should be clear that in Fig. 2 a somewhat more detailed description of generally a core network access packet data node is described which of course also could be an SGSN, but in the schematical figure of Fig.
- the preliminary access decision means 2A 1 in SGSN 10 1 makes a preliminary access decision based on said information and on the current network load (and possibly additional alternative features) and provides the access priority related information or some other relevant access priority related information if the outcome of the decision is positive, i.e. preliminary access is granted as far as SGSN 10 1 is concerned, to (here) GGSN 20 1 .
- GGSN 20 1 also comprises preliminary access decision means 2B 1 which function s in a similar way as the preliminary access decision means of SGSN. It should be clear that it does not have to be a GGSN but it could be some other core network access edge node or a node with a gateway functionality, or some intermediate node.
- policy node 30 1 If also in GGSN 20 1 preliminary access is granted, information thereon is provided to, here, policy node 30 1 .
- the access priority related parameter be included in a policy request.
- GGSN 20 1 or earlier, in SGSN 10 1 .
- service priority related information means 3 1 are provided in the policy node 30 1 .
- Service ARP generating means 4 1 are provided for generating a service priority related parameter which is generated by taking the service importance and/or user category into account allowing prioritizing of services but also of user category using the service which most particularly defines the allocation retention priority for a service used by a user category and it is here briefly denoted service ARP.
- the policy node 30 1 here also comprises pre-emption related information generating means 5 1 , here particularly the allowability or capability of requiring pre-emption of lower prioritized bearers or PDP contexts and the allowability to pre-emption requests made by higher prioritized bearers/PDP contexts.
- the service priority related information comprising service ARP and preferably also pre-emption related parameters is provided to final access decision means 6B 1 in GGSN which then makes a respective final decision on access permission and resource allocation.
- service ARP (as well as pre-emption related information parameters) are provided from the policy server node 30 1 .
- one or more or all of these parameters may also be locally available in the access edge nodes which hence is equipped with service priority related information means.
- the final access permission may require pre-emption of lower prioritized bearer/PDP contexts.
- bandwidth allocation When bandwidth allocation is requested this may be done at this stage in the (respective) final access decision means 6A 1 ,6B 1 .
- the service priority related information or parameters are thus signalled from the final access decision means 6B 1 or more generally from GGSN to the final access decision means 6A 1 in SGSN 10 1 for, in a similar way making a final decision there as well.
- the service priority related parameters are provided to admission control means 7 1 in a radio network node, for example an RNC, Radio Network Control node comprising final access decision means 2C 1 where a (last) final decision on access permission and resource allocation is made.
- Access permission and bandwidth allocation may require pre-emption of other lower prioritized bearers/PDP contexts.
- Fig. 2 schematically illustrates one implementation of a core network access packet data node (PDN) which may, but does not have to, comprise an SGSN (or a CGSN, cf. Fig. 4 ).
- PDN packet data node
- SGSN or a CGSN, cf. Fig. 4
- DSLAM so called DSLAM
- the access edge node may be a BRAS or similar. It is also no need for providing parameters to a radio network.
- the core access packet data node 10 comprises preliminary access handling means 21A holding or fetching (receiving) access priority related parameters from for example HLR, (dashed lines) or actually held in the preliminary access handling means 21A themselves.
- the function of the preliminary access handling means may, instead of a separate means, be included in the preliminary access decision means 2A if the access priority parameters are provided from external means.
- the preliminary access decision means 2A receives or fetches information on the current network load from network load information holding means 22A in order to base a decision as to rejection or grant of preliminary access depending on the received subscriber related access priority parameter with respect to the current network load.
- a decision of allowance or rejection of preliminary access is made depending on the relationship between the current network load and the access priority related parameter in a desired manner. For example a threshold may be given below which preliminary access is to be rejected.
- a network resource request generating means 23A for sending a network resource request including the access priority related parameter to a core network access edge node.
- preliminary access is granted by the core network access edge node, it is supposed that service priority related parameters are provided to service priority related handling means 61A (in case such parameters are not handled by the core access packet data node itself), and the service priority related parameters are provided to final access decision means 6A. A final access decision is then made in the final access decision means 6A and the service priority related parameters are provided to, here, the radio network.
- Fig. 3 shows a core access edge node 20 which may communicate with the core access packet data node of Fig. 2 .
- the access priority related parameter is received from the core access packet data node 10 in preliminary access handling means 21B similar to those of Fig. 2 but with the difference that the access priority related parameter is provided from the core access packet data node instead of from for example a HLR.
- preliminary access decision means 2B information thereon is provided to policy request generating means 23B or the policy request generating means are activated and sends a policy request to a policy node, preferably, but not necessarily, containing the access priority related parameter.
- service priority related parameters are provided to service priority related handling means 61B in the core access edge node 20, from where they are provided to final access decision means 6B similar to those described with reference to Fig. 2 (in the core access packet data node) where a final decision is made and, if final access is granted in the core network access edge node, the service priority related parameters are provided to the core access packet data node.
- the new additional parameters are provided in messages between the different nodes. It should be clear that also other messages could be used for providing the respective parameters to the nodes. It is here supposed that the preliminary access handling means 21B, the preliminary access decision means 2B, the service priority related handling means 61B and final access decision means 6B are included in a so called admission control means 11B which are modified as compared to a conventional implementation in order to handle the additional parameters.
- Fig. 4 shows an alternative implementation with a combined core access edge packet data node, for example a CGSN or a node with the same functionality 1020 which comprises preliminary access handling means 21 receiving a network resource request from a mobile station. It is supposed that the preliminary access handling means 21 generates or holds access priority related information or fetches it from a HLR or similar (not shown), provides the access priority related parameter to preliminary access decision means 2 0 , wherein a decision is made. If the outcome of the decision is positive, i.e.
- the preliminary access decision means 2 0 provides the priority related access parameter to a final access decision means 6 0 comprised by or communicating with service priority related information generating means 30 0 , which in this particular implementation are supposed to be included in the CGSN 1020 itself (although they may as well as in the embodiment discussed with reference to Fig. 3 , be provided externally in e.g. a policy server). However in this case it is supposed that the service information priority related information generating means 30 0 are provided in CGSN and comprise over service priority parameter generating means 40 0 and pre-emption related information providing or holding means 50 0 . The service priority related information is used by the final access decision means 6 0 to make a final decision whereafter (if final access is granted) the service priority related parameters are provided to the radio network.
- service priority related information generating means 30 0 which in this particular implementation are supposed to be included in the CGSN 1020 itself (although they may as well as in the embodiment discussed with reference to Fig. 3 , be provided externally in e.g. a policy
- Fig. 5 is a sequence diagram illustrating one implementation of the inventive concept in a 3G network (or a similar wireless network).
- an attach request 1, is sent from a mobile station to a core access packet data node which may be an SGSN or a similar node.
- an update location 2 is sent to HLR which, here according to the inventive concept is supposed to include access priority related information which is subscriber related, i.e. such access priority related information, here called Access ARP, in the insert subscriber data message, 3.
- the access priority is predefined or provided in the core access PDN, indicated A in the figure.
- an activate PDP context request 4, is sent from the MS to the core access PDN.
- a preliminary access priority control is then performed in the core access PDN, B, to establish if preliminary access can be granted. If yes, a create PDP context request with Access ARP is sent to a core access edge node, 5, for example a GGSN or similar wherein again a preliminary access priority control is performed, B. If granted, a policy request which optionally contains Access ARP is sent to the policy node, 6. It is here supposed that the policy node generates policy priority related data and returns a policy response, 7, including a particular service priority related parameter which here is called service ARP, and in additional thereto capability and vulnerability parameters.
- a final access decision control is then made in the core access edge node, C, and if it is granted, information thereon is provided to the core access packet data node in a create PDP context response including the service related parameters, 8.
- a final access decision C is then made in the core access PDN as well which (if granted) sends a bearer request, 9, with the service ARP, capability, vulnerability to the RAN where a decision on access permission and resource allocation is made based on the service ARP received from the core access packet data node.
- Access permission and bandwidth allocation may here require preemption of other lower prioritized bearers/PDP contexts as also is done in the core access PDN (Box C) and the core access edge node (Box C). If bandwidth allocation is requested, that is done in core access edge node, Box C.
- an activate PDP context accept message is sent from the core access PDN to the MS, 11.
- the Access ARP (or similar) is received as part of the subscriber profile in the core access packet data node.
- a preliminary access decision is made based on Access ARP. If the network load is close to a critical limit, only high Access ARP requests are for example processed, whereby high can be defined in any appropriate manner (bandwidth admission control is not performed at the stage of preliminary access decision). Low Access ARP access is denied which means that bearer/PDP context activation is rejected.
- the service ARP and the other service related parameters are provided in a policy node, they might alternatively be locally available in the core access edge node.
- the steps A, B can be said to consist of a checking of the control plane whereas what is illustrated in Box C corresponds to a user plane control.
- the admission control is split into two steps, first the temporary Access ARP admission control and in the second step the final service related and admission control, particularly a service ARP admission control.
- Fig. 6 is a simplified flow diagram describing the access priority related admission control based on what here is called the Access ARP.
- Access ARP admission control may admit a bearer request temporarily.
- ARP access priority related
- CP control plane
- UP user plane
- the Access ARP allows discrimination between subscribers based on subscription data from for example HLR. Subscription data defines the initial subscriber priority without service knowledge.
- the process of access priority based admission control, for example Access ARP is shown in Fig. 6 .
- node admission control indicates that resources are about to be exceeded
- access admission control CP
- the Access ARP is used to decide, if the resources are scarce or about to be exceeded, if the bearer context shall be temporarily accepted or not. It should be clear that temporary permission does not guarantee final acceptance. Temporary permission can be given to bearer contexts which are described by subscription data as more important than other. Given the Access ARP does not give the bearer context enough priority, the bearer context is rejected and the bearer context can therefore not be established.
- Node admission control may target both the control plane and the user plane.
- the control plane keeps information describing the bearer context, while bandwidth allocations are done on the user plane. Given admission control on the user plane is done if bandwidth guarantees need to be given to a bearer context, while admission control on the control plane always is performed.
- Fig. 7 it is supposed that the bearer context request (with Access ARP) is received, 200 (which pre-supposes that preliminary access has been granted). Then a node admission control is performed particularly on control plane as well as user plane, 201. If resources are available, 202, the bearer context is accepted, 202A. If not, the service priority related parameters are analyzed, particularly service ARP, 203. The received bearer context service ARP is evaluated to establish the importance of it compared to other established bearer contexts, here denoted prioritized bearer establishment, 204. Given there is at least one bearer context with a lower service ARP, the identified bearer context is pre-empted, 205.
- the bearer context request with Access ARP
- the bearer context is rejected, 204A.
- the pre-emption process continues until the requested resources for the new bearer context are available, 205. If another bearer is found which has a lower service ARP and can be pre-empted, this is done, and the bearer context is accepted, 206. If no established bearer context with a lower service ARP can be found, the new bearer context has to be rejected and the bearer context can not be established.
- Service related priority handling is access agnostic whereas access ARP to a large extent relies on 3GPP like systems, which means that actually it is not necessary to perform the steps of Fig. 6 . in for example broadband networks.
- Policy rules among other things define the importance of a service (service ARP) compared to other services.
- a service ARP may depend on the subscriber category to which the subscriber belongs. This means that the service APR may be different among subscriber categories using one and the same service. The intention is to be able to discriminate among subscriber categories when available resources become an issue.
- Policy rules can either be provisioned from a policy server (PCRF) or locally configured in e.g. the access edge node. The rules can match one or more services and are applied in a bearer context request procedure.
- a service class comprises rules for service ARP, QoS, service description, for example port numbers, IP address etc.
Claims (31)
- Système comprenant un noeud de données par paquets d'accès à un réseau fédérateur (10 ; 1020), un noeud de bord d'accès à un réseau fédérateur (201 ; 20 ; 1020), des moyens détenant des données d'abonné (501), et des moyens détenant des données liées à des règles (301 ; 300), et un nombre de moyens de commande d'admission (71 ; 11A ; 11B), le noeud de données par paquets d'accès à un réseau fédérateur (10 ; 1020) et/ou le noeud de bord d'accès à un réseau fédérateur (20 ; 20 ; 1020) étant adaptés pour détenir ou recevoir des informations liées à une priorité d'accès comprenant un paramètre de priorité d'attribution accès lié à un abonné, lié à un abonné demandant une ressource de réseau,
caractérisé en ce que
le noeud de données par paquets d'accès à un réseau fédérateur (10 ; 1020) et/ou le noeud de bord d'accès à un réseau fédérateur (20 ; 20 ; 1020) comprennent des moyens de décision d'accès préliminaire (2A1, 2B1 ; 2A ; 2B ; 20) pour décider si une demande de ressource de réseau doit être traitée ou mise en file d'attente, c'est-à-dire doit faire l'objet d'un accès préliminaire, ou être rejetée, lesdits moyens de décision d'accès préliminaire (2A1, 2B1 ; 2A ; 2B ; 20) comprenant des moyens pour établir la relation entre la charge de réseau actuelle et les informations liées à la priorité d'accès ou des moyens adaptés pour comparer la charge de réseau actuelle à une valeur de seuil donnée et pour, si la relation satisfait un critère donné ou, si la charge de réseau actuelle dépasse une valeur de seuil donnée, décider que les demandes de réseau pour lesquelles les informations liées à une priorité d'accès remplissent des critères donnés, par exemple comprennent un paramètre de priorité d'attribution d'accès dépassant une valeur donnée, ou définissant une haute priorité, doivent faire l'objet d'un accès préliminaire,
une priorité d'attribution de service pour des moyens de détention (41 ; 40D) est prévue, détenant des informations liées à une priorité de service comprenant un paramètre de priorité de service généré en se basant sur l'importance de service ou l'importance de service et une catégorie d'utilisateur,
le noeud de données par paquets d'accès à un réseau fédérateur et/ou le noeud de bord d'accès à un réseau fédérateur comprennent en outre des moyens de décision finale (6A1, 6B1, 2C1 ; 6A ; 6B ; 60) pour prendre une décision finale liée à un accord/rejet d'une demande à laquelle un accès préliminaire a été donné, au moins l'un desdits moyens de décision finale (6A1, 6B1, 2C1 ; 6A ; 6B ; 60) étant composé par ou communiquant avec des moyens de commande d'admission respectifs. - Système selon la revendication 1,
caractérisé en ce que
le noeud de données par paquets d'accès à un réseau fédérateur (101) comprend un SGSN. - Système selon la revendication 1,
caractérisé en ce que
le noeud de données par paquets d'accès à un réseau fédérateur comprend un CGSN (1020). - Système selon la revendication 1,
caractérisé en ce que
le noeud de données par paquets d'accès à un réseau fédérateur comprend ou est associé à un DSLAM ou un noeud similaire d'un réseau à large bande. - Système selon l'une quelconque des revendications précédentes,
caractérisé en ce que
les informations liées à une priorité d'accès sont détenues dans le noeud de données par paquets d'accès à un réseau fédérateur (1020) ou dans un noeud séparé (301). - Système selon l'une quelconque des revendications 1 à 3 et 5,
caractérisé en ce que
les informations liées à une priorité d'accès sont détenues dans un HLR (501) qui est adapté pour inclure lesdites informations liées à une priorité d'accès dans un message répondant à une demande de mise à jour de localisation du noeud de données par paquets à un réseau fédérateur (101). - Système selon la revendication 6,
caractérisé en ce que
lesdites informations liées à une priorité d'accès comprennent une priorité d'allocation / rétention. - Système selon l'une quelconque des revendications précédentes,
caractérisé en ce que
les moyens de décision d'accès préliminaire comprennent des premiers moyens de décision d'accès préliminaire (2A1) prévus dans le noeud de données par paquets d'accès à un réseau fédérateur (101). - Système selon l'une quelconque des revendications 1 à 8,
caractérisé en ce que
les moyens de décision d'accès préliminaire comprennent en outre des seconds moyens de décision d'accès préliminaire (2B1) prévus dans le noeud de bord d'accès à un réseau fédérateur (201 ; 20). - Système selon l'une quelconque des revendications précédentes,
caractérisé en ce que
le noeud de bord d'accès à un réseau fédérateur comprend un GGSN (201 ; 20) ou similaire pour un réseau mobile ou un BRAS pour un réseau à large bande. - Système selon l'une quelconque des revendications précédentes,
caractérisé en ce que
les informations liées à une priorité d'accès sont définies par abonné et point d'accès, par exemple nom de point d'accès, ou point de présence de IP. - Système selon l'une quelconque des revendications précédentes,
caractérisé en ce que
les informations liées à une priorité de service sont détenues et/ou générées dans un noeud de règles (301) pour approvisionnement à un noeud fédérateur (101, 201 ; 20), comprenant la fonctionnalité d'un noeud de bord d'accès à un réseau fédérateur ou d'une passerelle de réseau fédérateur ou dans un tel noeud de bord d'accès à un réseau fédérateur (1020). - Système selon la revendication 12,
caractérisé en ce que
le noeud de bord d'accès à un réseau fédérateur (201 ; 20) est adapté pour fournir les informations liées à une priorité de service au noeud de données par paquets d'accès à un réseau fédérateur (101), à un noeud de réseau de radiocommunication (401) sur lequel une ressource de réseau ou un chemin de communication est demandé pour une communication sans fil ou un noeud d'accès pour une communication non-sans fil. - Système selon l'une quelconque des revendications précédentes,
caractérisé en ce que
les informations liées à une priorité de service comprennent en outre un paramètre d'admissibilité de préemption avec des informations concernant la mesure dans laquelle la ressource de réseau demandée peut faire l'objet d'une préemption, et un paramètre de capacité de préemption avec des informations concernant la mesure dans laquelle et/ou les conditions dans lesquelles la ressource de réseau demandée peut requérir une préemption d'autres porteurs. - Système selon la revendication 14,
caractérisé en ce que
le paramètre d'admissibilité de préemption comprend un paramètre de vulnérabilité et en ce que le paramètre de capacité de préemption comprend un paramètre de capacité. - Système selon l'une quelconque des revendications précédentes,
caractérisé en ce que
les moyens de décision finale (6A1, 6B1 ; 6A ; 6B ; 60) sont prévus dans un ou plusieurs éléments parmi le noeud de données par paquets d'accès à un réseau fédérateur (101 ; 1020), le noeud de bord d'accès à un réseau fédérateur (201 ; 20 ; 1020) et un noeud de réseau de radiocommunication (401). - Noeud d'accès à un réseau fédérateur qui est un noeud de données par paquets d'accès à un réseau fédérateur (101 ; 1020) ou un noeud de bord d'accès à un réseau fédérateur (201 ; 20 ; 1020) dans une communication de support de réseau de communication de données par paquets, comprenant des moyens pour détenir ou adaptés pour recevoir des informations liées à une priorité d'accès comprenant un paramètre d'attribution de priorité d'accès lié à un abonné, lié à un abonné demandant une ressource de réseau comprenant un porteur ou un chemin de communication, en ce qu'il comprend en outre ou communique avec des moyens d'informations de charge de réseau pour détenir ou extraire les informations concernant la charge de réseau actuelle,
caractérisé en ce que
il comprend des moyens de manipulation d'accès préliminaire (21A, 21 ; 21B, 20) comprenant des moyens de décision d'accès préliminaire (2A1 ; 2A ; 200 ; 2B1 ; 2B ; 20) adaptés pour être en communication avec lesdits moyens d'informations de charge de réseau (22A ; 220), et adaptés pour prendre une décision préliminaire si une demande de ressource de réseau doit être manipulée ou rejetée en se basant sur lesdites informations liées à une priorité d'accès et ladite charge de réseau actuelle, en ce qu'il comprend en outre des moyens de manipulation de priorité d'attribution de service (61A ; 500 ; 61B ; 300) adaptés pour maintenir ou recevoir des informations liées à une priorité de service comprenant un ou plusieurs paramètres générés en se basant sur une importance de service ou une importance de service et une catégorie d'utilisateur ou d'abonné, et des moyens de décision finale (6A1, 6A ; 60 ; 6B1 ; 6B) pour prendre une décision finale liée à un accord/rejet d'une demande pour une ressource de réseau à laquelle un accès préliminaire a été donné. - Noeud d'accès à un réseau fédérateur selon la revendication 17,
caractérisé en ce que
il comprend un noeud de support de données par paquets d'un réseau sans fil, par exemple un SGSN (101). - Noeud d'accès à un réseau fédérateur selon la revendication 17,
caractérisé en ce que
il comprend un noeud combiné de support de données par paquets et de passerelle d'un réseau sans fil, par exemple un CGSN (1020). - Noeud d'accès à un réseau fédérateur selon la revendication 17,
caractérisé en ce que
il comprend un noeud de réseau à large bande, par exemple un DSLAM. - Noeud d'accès à un réseau fédérateur selon la revendication 18, 19 ou 20,
caractérisé en ce que
il est adapté pour fournir le paramètre de priorité d'attribution d'accès à un noeud de bord d'accès à un réseau fédérateur, par exemple un GGSN, pour recevoir les paramètres d'informations liés à une priorité de service à partir du noeud de bord d'accès à un réseau fédérateur, pour baser la décision finale sur lesdits paramètres d'informations liés à une priorité de service et pour fournir lesdits paramètres d'informations liés une priorité de service à un noeud d'accès à un réseau de radiocommunication. - Noeud d'accès à un réseau fédérateur selon la revendication 17,
caractérisé en ce que
il comprend un noeud de passerelle de données par paquets, par exemple un GGSN (201 ; 20). - Noeud d'accès à un réseau fédérateur selon la revendication 17 ou 22,
caractérisé en ce que
il comprend un noeud d'un réseau à large bande, par exemple un BRAS. - Noeud d'accès à un réseau fédérateur selon la revendication 22 ou 23,
caractérisé en ce que
il est adapté pour envoyer une demande de règles incluant le paramètre de priorité d'attribution d'accès à un noeud de règles et pour manipuler une réponse avec des règles incluant les paramètres liés à une priorité de service à partir du noeud de règles. - Noeud d'accès à un réseau fédérateur selon l'une quelconque des revendications 17 à 24,
caractérisé en ce que
le paramètre d'attribution de priorité d'accès lié à l'abonné comprend un ARP. - Noeud d'accès à un réseau fédérateur selon l'une quelconque des revendications 17 à 25,
caractérisé en ce que
les informations liées à une priorité de service en plus d'un paramètre lié à une priorité de service comprennent un paramètre d'admissibilité de préemption et un paramètre de capacité de préemption. - Noeud d'accès à un réseau fédérateur selon l'une quelconque des revendications 17 à 26,
caractérisé en ce que
les moyens de décision d'accès préliminaire (2A ; 20) sont adaptés pour, si la charge de réseau actuelle dépasse une valeur de seuil de charge donnée, rejeter/autoriser les demandes de ressource de réseau pour lesquelles le paramètre de priorité d'attribution d'accès est en dessous/au-dessus d'une valeur donnée ou pour une relation donnée entre la valeur de seuil de charge et la valeur de paramètre de priorité d'attribution d'accès. - Procédé pour commander l'accès à des ressources de réseau dans un réseau supportant une communication de données par paquets et comprenant au moins un noeud de données par paquets d'accès à un réseau fédérateur, un noeud de bord d'accès à un réseau fédérateur et des moyens détenant des données liées à des règles, comprenant l'étape de fourniture d'informations liées à un abonné et à une priorité comprenant un paramètre de priorité d'attribution d'accès lié à un abonné, lié à un abonné demandant une ressource de réseau au moins dans le ou au noeud de données par paquets d'accès à un réseau fédérateur, par exemple à la suite d'une demande de ressource de réseau à un tel noeud,
caractérisé en ce que
le procédé comprend en outre les étapes consistant à :- prendre une décision d'accès préliminaire pour manipuler ou rejeter la ressource de réseau en se basant sur les informations liées à un abonné et une priorité et la charge de réseau actuelle, dans le(s) noeud(s) respectif(s), c'est-à-dire pour donner ou non un accès préliminaire ;- si le résultat de la décision consiste à manipuler la demande de ressource de réseau :- fournir ou requérir les informations liées à une priorité de service comprenant au moins un ou plusieurs paramètres générés à partir d'une importance de service et d'une catégorie d'utilisateur/abonné au moins dans le ou au noeud de données par paquets d'accès à un réseau fédérateur concernant la demande de ressource de réseau ;- prendre une décision d'accès finale dans ledit (lesdits) noeud(s) respectif(s) en se basant sur lesdites informations liées à une priorité de service de façon à ce qu'un classement par priorité puisse être effectué en se basant une priorité de service ou une priorité de service et une catégorie d'abonné/utilisateur ;- effectuer une commande d'admission de largeur de bande et/ou une préemption de ressources attribuées de priorité inférieure, si réalisée avec succès ;- activer la ressource de réseau. - Procédé selon la revendication 28,
caractérisé en ce que
il comprend les étapes consistant à :- générer et détenir des informations liées à une priorité de service dans un noeud de serveur de règles ;- fournir les informations liées à une priorité de service à un noeud agissant comme un noeud de bord d'accès à un réseau fédérateur à réception d'une demande de règles dudit noeud ;- prendre une décision d'accès finale dans ledit noeud de bord d'accès à un réseau fédérateur. - Procédé selon la revendication 28 ou 29,
caractérisé en ce que
il comprend en outre les étapes consistant à :- fournir les informations liées à une priorité de service à partir du noeud agissant comme un noeud de bord d'accès à un réseau fédérateur à un noeud agissant comme un noeud de données par paquets d'accès à un réseau fédérateur dans un message de réponse à une demande de ressource de réseau, par exemple pour une demande de création de contexte PDP ;- prendre une décision d'accès finale dans ledit noeud de données par paquets d'accès à un réseau fédérateur. - Procédé selon la revendication 28, 29, 30 ou 31,
caractérisé en ce que
il comprend les étapes consistant à :- fournir les informations liées à une priorité de service à partir du noeud agissant comme un noeud de données par paquets d'accès à un réseau fédérateur à un noeud de réseau de radiocommunication ;- effectuer une commande d'admission dans ledit noeud de réseau de radiocommunication en utilisant lesdits paramètres liés à une priorité de service ; et- prendre une décision d'accès finale respective dans ledit noeud de réseau de radiocommunication.
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
PCT/EP2006/061389 WO2007112784A1 (fr) | 2006-04-06 | 2006-04-06 | Système, ensembles et procédé pour la gestion d'accès |
Publications (2)
Publication Number | Publication Date |
---|---|
EP2005661A1 EP2005661A1 (fr) | 2008-12-24 |
EP2005661B1 true EP2005661B1 (fr) | 2009-12-02 |
Family
ID=36578808
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
EP06725611A Active EP2005661B1 (fr) | 2006-04-06 | 2006-04-06 | Système, ensembles et procédé pour la gestion d'accès |
Country Status (6)
Country | Link |
---|---|
US (3) | US9094456B2 (fr) |
EP (1) | EP2005661B1 (fr) |
CN (1) | CN101416449B (fr) |
AT (1) | ATE450960T1 (fr) |
DE (1) | DE602006010914D1 (fr) |
WO (1) | WO2007112784A1 (fr) |
Families Citing this family (25)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US7875370B2 (en) | 2006-08-18 | 2011-01-25 | United Technologies Corporation | Thermal barrier coating with a plasma spray top layer |
CN101425959B (zh) * | 2007-10-29 | 2013-04-24 | 华为技术有限公司 | 一种承载处理方法和装置 |
CN101998531B (zh) * | 2009-08-11 | 2013-04-24 | 华为技术有限公司 | 策略和计费控制规则授权方法、装置及系统 |
US8964668B2 (en) * | 2009-09-25 | 2015-02-24 | Telefonaktiebolaget L M Ericsson (Publ) | Evolved allocation retention policy solution |
US8514707B2 (en) * | 2009-12-28 | 2013-08-20 | Tti Inventions D Llc | Non-blocking admission control |
CN102223729B (zh) * | 2010-04-16 | 2016-06-29 | 中兴通讯股份有限公司 | 控制机器类型通信设备接入网络的方法及系统 |
CN101969635A (zh) * | 2010-04-30 | 2011-02-09 | 中兴通讯股份有限公司 | 一种机器通信的接入控制方法及系统和系统 |
US8457010B2 (en) | 2010-11-16 | 2013-06-04 | Edgecast Networks, Inc. | Request modification for transparent capacity management in a carrier network |
US9998909B2 (en) * | 2011-06-20 | 2018-06-12 | Telefonaktiebolaget Lm Ericsson (Publ) | 3rd generation direct tunnel (3GDT) optimization |
JP2015513385A (ja) | 2012-02-14 | 2015-05-11 | テレフオンアクチーボラゲット エル エム エリクソン(パブル) | スマート3gdt |
US9015395B2 (en) * | 2012-05-10 | 2015-04-21 | Alcatel Lucent | Methods and apparatuses for multiple priority access in a wireless network system |
US9825879B2 (en) * | 2012-10-17 | 2017-11-21 | Telefonaktiebolaget Lm Ericsson (Publ) | Method and arrangement for admission control based on priority level based differentiation |
US20140122695A1 (en) * | 2012-10-31 | 2014-05-01 | Rawllin International Inc. | Dynamic resource allocation for network content delivery |
US9084136B2 (en) * | 2012-12-05 | 2015-07-14 | Verizon Patent And Licensing Inc. | Single bearer network connection establishment |
US20140177535A1 (en) * | 2012-12-21 | 2014-06-26 | Motorola Solutions, Inc. | Method and apparatus for admission control in a wireless communication system |
US9419977B2 (en) * | 2014-01-24 | 2016-08-16 | Verizon Patent And Licensing Inc. | Method and apparatus for providing value-based resource management and admission control |
CN106068663B (zh) * | 2014-03-04 | 2019-12-31 | 瑞典爱立信有限公司 | 用于管理eps承载的方法、无线装置、无线电基站和第二网络节点 |
EP3155860B1 (fr) * | 2014-06-16 | 2021-02-24 | Telefonaktiebolaget LM Ericsson (publ) | Configuration d'un service dans une station de base |
WO2016022213A1 (fr) * | 2014-08-07 | 2016-02-11 | Intel IP Corporation | Commande de trafic à partir d'applications utilisée lorsque des serveurs tiers rencontrent des problèmes |
EP3186925A4 (fr) | 2014-08-27 | 2018-02-21 | Adaptive Spectrum and Signal Alignment, Inc. | Systèmes, procédés et appareils pour la mise en oeuvre de la virtualisation de fonctions de noeud d'accès |
US9971724B1 (en) * | 2015-06-18 | 2018-05-15 | Rockwell Collins, Inc. | Optimal multi-core network architecture |
US10321471B2 (en) * | 2016-01-07 | 2019-06-11 | Telefonaktiebolaget Lm Ericsson (Publ) | Conveying use of exception reporting to core network nodes |
WO2019000376A1 (fr) * | 2017-06-30 | 2019-01-03 | 北京小米移动软件有限公司 | Procédé et dispositif pour réaliser un calcul de bord de réseau |
CN109818868B (zh) * | 2017-11-20 | 2021-06-22 | 中兴通讯股份有限公司 | 一种实现边缘网络能力开放的方法、装置、设备及存储介质 |
CN111553800B (zh) * | 2020-04-30 | 2023-08-25 | 上海商汤智能科技有限公司 | 一种数据处理方法及装置、电子设备和存储介质 |
Family Cites Families (9)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN1217513C (zh) * | 2002-12-27 | 2005-08-31 | 北京邮电大学 | 在多业务多用户业务平台中保证业务服务等级协议的方法 |
US7826353B2 (en) * | 2003-05-05 | 2010-11-02 | Nokia Corporation | Method, system and network element for authorizing a data transmission |
US20050013589A1 (en) * | 2003-07-14 | 2005-01-20 | Microsoft Corporation | Adding recording functionality to a media player |
FR2859862A1 (fr) | 2003-09-11 | 2005-03-18 | France Telecom | Procede de differenciation de la qualite de service dans les reseaux de communication mobile en mode paquets |
GB0329221D0 (en) * | 2003-12-17 | 2004-01-21 | Nokia Corp | Session control in a communication system |
FR2875667A1 (fr) * | 2004-09-22 | 2006-03-24 | France Telecom | Procede de preemption pour la gestion des ressources radio dans un reseau de communication mobile |
US8200820B2 (en) * | 2005-08-12 | 2012-06-12 | Telefonaktiebolaget Lm Ericsson (Publ) | Access selection method |
US7733891B2 (en) * | 2005-09-12 | 2010-06-08 | Zeugma Systems Inc. | Methods and apparatus to support dynamic allocation of traffic management resources in a network element |
US20070117563A1 (en) * | 2005-10-28 | 2007-05-24 | Interdigital Technology Corporation | Call setup procedure in an evolved third generation radio access network |
-
2006
- 2006-04-06 EP EP06725611A patent/EP2005661B1/fr active Active
- 2006-04-06 AT AT06725611T patent/ATE450960T1/de not_active IP Right Cessation
- 2006-04-06 DE DE602006010914T patent/DE602006010914D1/de active Active
- 2006-04-06 WO PCT/EP2006/061389 patent/WO2007112784A1/fr active Application Filing
- 2006-04-06 US US12/296,267 patent/US9094456B2/en active Active
- 2006-04-06 CN CN2006800541345A patent/CN101416449B/zh active Active
-
2013
- 2013-10-18 US US14/057,071 patent/US9210191B2/en active Active
-
2015
- 2015-11-25 US US14/951,601 patent/US9705928B2/en active Active
Also Published As
Publication number | Publication date |
---|---|
US20100157887A1 (en) | 2010-06-24 |
CN101416449B (zh) | 2013-09-11 |
US9094456B2 (en) | 2015-07-28 |
EP2005661A1 (fr) | 2008-12-24 |
ATE450960T1 (de) | 2009-12-15 |
DE602006010914D1 (de) | 2010-01-14 |
WO2007112784A1 (fr) | 2007-10-11 |
CN101416449A (zh) | 2009-04-22 |
US20160080427A1 (en) | 2016-03-17 |
US9705928B2 (en) | 2017-07-11 |
US9210191B2 (en) | 2015-12-08 |
US20140075503A1 (en) | 2014-03-13 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
EP2005661B1 (fr) | Système, ensembles et procédé pour la gestion d'accès | |
EP3635997B1 (fr) | Technique d'allocation de fonction de plan utilisateur | |
EP1964421B1 (fr) | Mise en corrélation de flux de paquets avec des porteurs dans un système de communication | |
US9438522B2 (en) | Service processing method and system, and policy control and charging rules function | |
EP1834449B1 (fr) | Porteurs prioritaires dans un reseau de telecommunication mobile | |
US8401584B2 (en) | Dynamic group prioritization in communication networks | |
EP3259889B1 (fr) | Traitement de priorité amélioré pour flux de données de transport dans des systèmes de communication | |
EP2481239B1 (fr) | Procédé et appareil de gestion d'une priorité d'allocation et de rétention évoluée | |
WO2008084050A1 (fr) | Procédé destiné à réduire l'utilisation frauduleuse de qos de terminaux mobiles par marquage de paquets à liaison ascendante | |
US20050154780A1 (en) | Pdp context error handling method | |
US11477691B2 (en) | Dedicated bearer management | |
JP2005136966A (ja) | QoSアップリンクおよびダウンリンクの最大ビットレート属性の最適値を判別するための決定木論理 | |
EP2763485B1 (fr) | Procédé de planifications dans un système de télécommunications mobile | |
WO2016023363A1 (fr) | Procédé et appareil de traitement de chaîne de service, classificateur de service et pcrf | |
EP4274306A1 (fr) | Procédé d'utilisation ou d'application d'informations sur la politique de sélection d'itinéraire d'un équipement d'utilisateur lors du fonctionnement d'un équipement d'utilisateur connecté à un réseau de télécommunications, équipement d'utilisateur, système ou réseau de télécommunications, programme et produit programme informatique | |
GB2572443A (en) | Dedicated bearer management |
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: 20081016 |
|
AK | Designated contracting states |
Kind code of ref document: A1 Designated state(s): AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HU IE IS IT LI LT LU LV MC NL PL PT RO SE SI SK TR |
|
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 |
|
GRAL | Information related to payment of fee for publishing/printing deleted |
Free format text: ORIGINAL CODE: EPIDOSDIGR3 |
|
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 BG CH CY CZ DE DK EE ES FI FR GB GR HU IE IS IT LI LT LU LV MC NL PL PT RO SE SI SK TR |
|
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: 602006010914 Country of ref document: DE Date of ref document: 20100114 Kind code of ref document: P |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
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: 20091202 Ref country code: LT 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: 20091202 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: 20091202 |
|
LTIE | Lt: invalidation of european patent or patent extension |
Effective date: 20091202 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: LV 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: 20091202 Ref country code: PL 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: 20091202 Ref country code: SI 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: 20091202 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: 20091202 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
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: 20091202 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: IS 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: 20100402 Ref country code: ES 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: 20100313 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: 20100402 Ref country code: EE 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: 20091202 Ref country code: BG 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: 20100302 Ref country code: RO 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: 20091202 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: SK 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: 20091202 Ref country code: CZ 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: 20091202 |
|
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 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
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: 20100303 |
|
26N | No opposition filed |
Effective date: 20100903 |
|
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: 20100430 |
|
REG | Reference to a national code |
Ref country code: CH Ref legal event code: PL |
|
REG | Reference to a national code |
Ref country code: FR Ref legal event code: ST Effective date: 20101230 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
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: 20091202 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: LI Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20100430 Ref country code: CH Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20100430 |
|
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: 20100430 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: LU Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20100406 Ref country code: HU 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: 20100603 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
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: 20091202 |
|
PGFP | Annual fee paid to national office [announced via postgrant information from national office to epo] |
Ref country code: IE Payment date: 20210427 Year of fee payment: 16 Ref country code: BE Payment date: 20210427 Year of fee payment: 16 |
|
PGFP | Annual fee paid to national office [announced via postgrant information from national office to epo] |
Ref country code: NL Payment date: 20210426 Year of fee payment: 16 |
|
PGFP | Annual fee paid to national office [announced via postgrant information from national office to epo] |
Ref country code: IT Payment date: 20220421 Year of fee payment: 17 Ref country code: GB Payment date: 20220427 Year of fee payment: 17 |
|
REG | Reference to a national code |
Ref country code: NL Ref legal event code: MM Effective date: 20220501 |
|
REG | Reference to a national code |
Ref country code: BE Ref legal event code: MM Effective date: 20220430 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: NL Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20220501 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: BE Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20220430 |
|
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: 20220406 |
|
PGFP | Annual fee paid to national office [announced via postgrant information from national office to epo] |
Ref country code: DE Payment date: 20230427 Year of fee payment: 18 |
|
GBPC | Gb: european patent ceased through non-payment of renewal fee |
Effective date: 20230406 |
|
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: 20230406 |
|
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: 20230406 |
|
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 NON-PAYMENT OF DUE FEES Effective date: 20230406 |