EP1195074A1 - Improvements in, or relating to, telecommunications systems - Google Patents
Improvements in, or relating to, telecommunications systemsInfo
- Publication number
- EP1195074A1 EP1195074A1 EP00946635A EP00946635A EP1195074A1 EP 1195074 A1 EP1195074 A1 EP 1195074A1 EP 00946635 A EP00946635 A EP 00946635A EP 00946635 A EP00946635 A EP 00946635A EP 1195074 A1 EP1195074 A1 EP 1195074A1
- Authority
- EP
- European Patent Office
- Prior art keywords
- resource
- vector
- downgrade
- user
- price
- 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.)
- Granted
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04Q—SELECTING
- H04Q3/00—Selecting arrangements
- H04Q3/0016—Arrangements providing connection between exchanges
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L12/00—Data switching networks
- H04L12/54—Store-and-forward switching systems
- H04L12/56—Packet switching systems
- H04L12/5601—Transfer mode dependent, e.g. ATM
- H04L2012/5629—Admission control
- H04L2012/563—Signalling, e.g. protocols, reference model
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L12/00—Data switching networks
- H04L12/54—Store-and-forward switching systems
- H04L12/56—Packet switching systems
- H04L12/5601—Transfer mode dependent, e.g. ATM
- H04L2012/5629—Admission control
- H04L2012/5631—Resource management and allocation
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L12/00—Data switching networks
- H04L12/54—Store-and-forward switching systems
- H04L12/56—Packet switching systems
- H04L12/5601—Transfer mode dependent, e.g. ATM
- H04L2012/5638—Services, e.g. multimedia, GOS, QOS
- H04L2012/5639—Tariffs or charging
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04Q—SELECTING
- H04Q2213/00—Indexing scheme relating to selecting arrangements in general and for multiplex systems
- H04Q2213/13095—PIN / Access code, authentication
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04Q—SELECTING
- H04Q2213/00—Indexing scheme relating to selecting arrangements in general and for multiplex systems
- H04Q2213/13166—Fault prevention
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04Q—SELECTING
- H04Q2213/00—Indexing scheme relating to selecting arrangements in general and for multiplex systems
- H04Q2213/13248—Multimedia
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04Q—SELECTING
- H04Q2213/00—Indexing scheme relating to selecting arrangements in general and for multiplex systems
- H04Q2213/13251—Restricted service, class of service
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04Q—SELECTING
- H04Q2213/00—Indexing scheme relating to selecting arrangements in general and for multiplex systems
- H04Q2213/1329—Asynchronous transfer mode, ATM
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04Q—SELECTING
- H04Q2213/00—Indexing scheme relating to selecting arrangements in general and for multiplex systems
- H04Q2213/13332—Broadband, CATV, dynamic bandwidth allocation
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04Q—SELECTING
- H04Q2213/00—Indexing scheme relating to selecting arrangements in general and for multiplex systems
- H04Q2213/13348—Channel/line reservation
Definitions
- the present invention relates to a telecommunications system employing a resource reservation protocol, a subscriber terminal adapted for use with the telecommunications system and a method of resource reservation for use in a telecommunications system.
- resource reservation protocols propagate only one specific resource value, for example, peak transmission rate, per reservation trial, even if there are several, distinct, resource values that can be accepted by a scalable application. If the required resource value cannot be reserved, it is up to the end-user application to downgrade the original resource demand and send a new reservation message. Therefore, multiple reservation trials are needed, since the scalable nature of the application is ignored. Even the exceptions, for example, ABR in ATM, handle only two resource values, i.e. mean and peak cell rates. The ability of users to perceive quality in a more granular manner, i.e. the ability of users to differentiate several steps between the two extremes, is ignored.
- a common approach is to have policy servers associate only a simple priority to users and applications, e.g. high, medium, or low, see Dynamic-Access Software, 3COM Technical Papers, 1997, although the QoS policy could reflect the capabilities of the application and the preferences of the user.
- Multimedia applications with distinct quality parameters have a certain set of possible resource values that they require from the network.
- the set of these resource values can be expressed in a Resource Vector.
- users have different opinions about the different quality settings and assign different price thresholds to each, resulting in a Price Vector.
- the information represented by these two vectors can be combined in a Downgrade Vector, which can be carried in the reservation message (e.g. RSVP/RESV or IRMA/RING). This enables routers, or ATM switches, to utilise the downgrade vector for intelligent resource reservation.
- the present invention utilises Resource Vectors, Price Vectors and Downgrade Vectors to provide an improved technique for resource reservation.
- Resource Vector for generalised resource types and applications, their calculation and usage for policy based resource reservation, is unique to the present invention.
- a simpler concept using the downgrade vector has been described for the videophone service with four quality parameters and one resource type, namely bandwidth, see R. Szab ⁇ , I. Cselenyi, Performance Evaluation of an Intelligent Resource Allocation Scheme for Multimedia Applications, SPECTS'98, Symposium on Performance Evaluation of Computer and Telecommunication Systems, Reno, Nevada, July 19-22, 1998, pp. 302-306.
- the main advantages of using the Downgrade Vector approach for resource reservation, as in the present invention, include:
- connection setup time is reduced and is fixed, there is a reduced demand for temporary allocation of resources which, in turn, reduces the probability of call blocking.
- signalling messages per connection setup are required.
- a telecommunications data transmission system comprising a transmission network having a plurality of nodes, a plurality of access nodes and a plurality of subscriber terminals connected to access nodes, said telecommunications data transmission system being adapted to support provision of multimedia telecommunications services and employing a resource reservation protocol, characterised in that said resource reservation protocol is adapted to permit users to specify a preference for a multiplicity of levels of QoS and in that said resource reservation protocol is adapted to reserve a plurality of resource types.
- a user «s preference with regard to QoS may be recorded by elements of a
- Price Vector each element of which corresponds to a notional •price* that a user is prepared to pay for a given level of said multiplicity of levels of QoS.
- Default values for each element of said Price Vector may be determined from user trials.
- a set of possible resource values for each resource type may be recorded by the elements of a Resource Vector, each element of which corresponds to an available resource level for a given one of said plurality of resource types.
- Means for merging said Price Vector with said Resource Vector to produce a Downgrade Vector specifying resource levels supported by a given application which a user is prepared to accept in a descending order of user preference may be provided.
- Said Downgrade Vector may be carried by resource reservation messages propagated between nodes in said transmission network.
- Each of said plurality of subscriber terminals may be adapted to calculate a Downgrade Vector for each application running thereon and said subscriber terminal may be adapted to transmit said Downgrade Vectors to the transmission network.
- Said Downgrade Vectors may be calculated from Price Vectors and Resource Vectors retrieved from configuration files stored in said subscriber terminals.
- Said Downgrade Vectors may be calculated from Price Vectors and Resource Vectors retrieved by said subscriber terminals from a policy server.
- Said Downgrade Vectors may be calculated from Price Vectors, derived directly from requests addressed to a user of said subscriber terminal, and Resource Vectors retrieved by said subscriber terminal.
- Said access nodes may be adapted to calculate a Downgrade Vector from a Price Vector stored in a user database and a Resource Vector.
- Downgrade Vectors for each application and user, or groups thereof, may be pre-calculated and stored in a policy server from where they can be retrieved by a subscriber terminal, or access node.
- a Downgrade Vector may be built into a resource reservation protocol adapted to handle specific resource demands.
- a Downgrade Vector may be carried in a RSVP/RESV reservation message.
- a Downgrade Vector may be carried in an IRMA/RING reservation message.
- a subscriber terminal for use with a telecommunications data transmission system as set forth in any preceding paragraph, and adapted to support a resource reservation protocol, characterised in that said resource reservation protocol is adapted to permit users to specify a preference for a multiplicity of levels of QoS and in that said resource reservation protocol is adapted to reserve a plurality of resource types.
- a user*s preference with regard to QoS may be recorded by elements of a Price Vector, each element of which corresponds to a notional • price* that a user is prepared to pay for a given level of said multiplicity of levels of QoS.
- a set of possible resource values for each resource type may be recorded by the elements of a Resource Vector, each element of which corresponds to an available resource level for a given one of said plurality of resource types.
- Merge means for merging said Price Vector with said Resource Vector to produce a Downgrade Vector specifying resource levels supported by a given application which a user is prepared to accept in a descending order of user preference, may be provided .
- Said Downgrade Vector may be transmitted to said transmission network by resource reservation messages.
- Said Downgrade Vector may be calculated from a Price Vector and a Resource Vector retrieved from configuration files stored in said subscriber terminal.
- Said Downgrade Vector may be calculated from a Price Vector and Resource Vector retrieved by said subscriber terminal from a policy server.
- Said Downgrade Vector may be calculated from a Price Vector, derived directly from requests addressed to a user of said subscriber terminal, and a
- a Downgrade Vector may be carried in a RSVP/RESV reservation message.
- a method of reserving resources in a telecommunications data transmission system comprising a transmission network having a plurality of nodes, a plurality of access nodes and a plurality of subscriber terminals connected to access nodes, said telecommunications data transmission system being adapted to support provision of multimedia telecommunications services and employing a resource reservation protocol, characterised by said resource reservation protocol being adapted to permit users to specify a preference for a multiplicity of levels of QoS and by said resource reservation protocol being adapted to reserve a plurality of resource types.
- a user*s preference, with regard to QoS, may be recorded as elements of a Price Vector, each element of which corresponds to a notional • price* that a user is prepared to pay for a given level of said multiplicity of levels of QoS.
- Default values for each element of said Price Vector may be determined from user trials.
- a set of possible resource values for each resource type may be recorded as elements of a Resource Vector, each element of which corresponds to an available resource level for a given one of said plurality of resource types.
- Said Price Vector may be merged with said Resource Vector to produce a Downgrade Vector specifying resource levels supported by a given application which a user is prepared to accept in a descending order of user preference.
- Said Downgrade Vector may be propagated between nodes in said transmission network in resource reservation messages.
- Each of said plurality of subscriber terminals may calculate a Downgrade Vector for each application running thereon, and said subscriber terminal may transmit said Downgrade Vectors to the transmission network.
- Said Downgrade Vectors may be calculated from Price Vectors and
- Said Downgrade Vectors may be calculated from Price Vectors and Resource Vectors retrieved from a policy server.
- Said Downgrade Vectors may be calculated from Price Vectors, derived directly from requests addressed to a user of said subscriber terminal, and Resource Vectors retrieved by said subscriber terminal.
- Said access nodes may calculate a Downgrade Vector from a Price Vector stored in a user database and a Resource Vector.
- Downgrade Vectors may be pre-calculating for each application and user, or groups thereof, and said Downgrade Vectors may be stored in a policy server from where they can be retrieved by a subscriber terminal, or access node.
- a Downgrade Vector may be built into a resource reservation protocol adapted to handle specific resource demands.
- a Downgrade Vector may be carried in a RSVP/RESV reservation message.
- Figure 1 is a flow chart for calculating a Downgrade Vector by merging a Resource Vector and Price Vector.
- Figure 2 illustrates a resource reservation scheme according to the present invention.
- Multimedia applications with distinct quality parameters have a certain set of possible resource values that they require from the network.
- the set of these resource values can be expressed in a Resource Vector.
- users have different opinions about the different quality settings and assign different price thresholds to each resulting in a Price Vector.
- a Downgrade Vector which can be carried in the reservation message, e.g. RSVP/RESV, or IRMA/RING.
- Routers, or ATM switches can utilise the downgrade vector for intelligent resource reservation.
- Multimedia applications usually have several parameters which influence the quantity of network resource, e.g. bandwidth, or multiplexing buffer size, required for a given QoS. For instance, by altering the video coding parameters of a scalable MPEG application, its bandwidth requirement scales from 2.7, 3.085, 3.6, 4.32, 5.4, 7.2 up to 10.8 Mbps, see CAMVision-2 7615, User Guide, Litton Network Access Systems, Inc., October 1998. For describing the general case, the following terminology can be used:
- N the number of independent quality parameters of the multimedia application.
- K the number of independent network resource types, e.g. bandwidth, token bucket size, route, priority, ..., which are demanded by the application.
- Lk denotes the number of elements in the i h resource set, i.e. the number of combinations of every parameter influencing how much the application requires from the k 1 * 1 resource type and U is given by:
- each Resource Vector can be sorted in descending order yielding K Resource Vectors:
- the second task is to describe how much the user prefers the different application's qualities which result from different parameter settings.
- the simplest way to achieve this task is to establish a vector describing the maximum price that the user is prepared to pay for the different settings of the parameters.
- Price is simply considered as a type of metric for ranking purposes.
- price * relates to a user*s preference and does not represent an absolute value and has nothing to do with real charge, cost, or price. If the user does not want to accept a certain parameter combination, he may give 0 as a threshold, in other words he states that he does not wish to pay anything for the quality resulting from this setting.
- There is a Price Vector for each resource type namely:
- P denotes the maximum price in the system (e.g. 65535 or 255).
- Default prices can be determined from user trials and can be individually adjusted for each user.
- the information about the application and user behaviour i.e. the Resource and Price Vectors, can be merged into the Downgrade Vector.
- Jk denotes the number of elements in the Downgrade Vector belonging to the kth resource type. This can be equal, or less than, L k , because all resource values which are not unique, or for which the price is zero or not unique, may be omitted from the Downgrade Vector. It should be noted that the price is not unique if the user does not perceive any difference in the application quality when a quality parameter is changed. Therefore, different parameter combinations, i.e. resource values may be equally preferred, (priced), by the user.
- the merging algorithm is illustrated by a flowchart shown in Figure 1.
- the Downgrade Vector, d k expresses the information that the network nodes consider during the reservation of the k h resource.
- the policy enforcement point e.g. access routers
- the terminal has the Resource and Price Vectors. Both can be retrieved from a configuration file, or from the policy server, or the latter can also be directly requested from the user.
- the Downgrade Vector can be calculated for each application demanding QoS in advance, or just before sending the reservation message.
- a simple scenario is depicted in Figure 2 in order to illustrate a possible reservation scheme for this case.
- the caller sends the Downgrade Vector, which has three elements, in this example, in the reservation message.
- the nodes perform CAC and if the largest element of the vector can be admitted, they allocate resources according to that and forward the reservation message onward.
- the penultimate node cannot accept the largest resource value, thus it takes the second element, which fits in well with the available resource. It allocates resources, forwards a new reservation message which does not contain the largest resource value, i.e. the new Downgrade Vector starts with the original second element, and sends back a tear message to the previous nodes, in order to release the resources beyond element two. When the reservation message reaches the callee, the connection is established with guaranteed resources.
- the user requesting resource reservation is first authenticated to the access node, i.e. the user starts a user session.
- the access node can look up the Price Vector belonging to the identified user in its user database, or that of the ISP. After authentication, the user specifies the service session by giving some reference to the service, the other parties and the required quality.
- the access node uses this information to find the right policy for the user and the service, e.g. by contacting the policy server. This policy information contains the proper Price Vector, or at least a part of it, if the user is not allowed to take all resource values.
- the access node can then calculate the Downgrade Vector and initiate the reservation by sending the Downgrade Vector in a reservation message (e.g. IRMA/RING).
- a reservation message e.g. IRMA/RING
- the policy server stores pre- calculated Downgrade Vectors for each application and user, or application group and user group.
- the host, or the access node retrieves these preexisting Downgrade Vectors before initiating a reservation.
- the Downgrade Vector can be built into any resource reservation protocol, which handles explicit resource demands, e.g. ATMF/UNI, ITU/Q.2931 ,
- the network nodes are then able to perform downgrading based on the Downgrade Vector.
- the Resource and Price Vectors can be built into policy servers, which store the relationships among users - applications - and network policy. Instead of a simple high/low priority mapping, a complete Preference Vector can be stored in this table.
- the policy can be obtained by the policy enforcement point, or the sending host, and merged together into a Downgrade Vector.
- Known signalling protocols for resource reservation specify only one, or two, bandwidth values, while the downgrade vector describes the full range of possible resource levels for several resource types which can be taken by the application and which are preferred by the user.
- Resource Vector for generalised resource types and applications, their calculation and usage for policy based resource reservation, is unique to the present invention.
- a simpler concept using the downgrade vector has been described for the videophone service with four quality parameters and one resource type, namely bandwidth, see R. Szab ⁇ , I. Cselenyi, Performance Evaluation of an Intelligent Resource Allocation Scheme for Multimedia Applications, SPECTS'98, Symposium on Performance Evaluation of Computer and Telecommunication Systems, Reno, Nevada, July 19-22, 1998, pp. 302-306
- the present invention has particular application to the IRMA (Intelligent Resource Management Architecture) project, an ongoing internal project conducted by Telia Research.
- IRMA Intelligent Resource Management Architecture
- a new, hop-by-hop resource reservation protocol, called RING, has been implemented in the IRMA Router prototype.
- the current prototype will be extended by:
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
- Exchange Systems With Centralized Control (AREA)
- Executing Machine-Instructions (AREA)
- Communication Control (AREA)
- Optical Communication System (AREA)
- Reduction Or Emphasis Of Bandwidth Of Signals (AREA)
- Curing Cements, Concrete, And Artificial Stone (AREA)
Abstract
Description
Claims
Applications Claiming Priority (3)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| SE9902419A SE516754C2 (en) | 1999-06-24 | 1999-06-24 | A telecommunications system that uses a resource reservation protocol |
| SE9902419 | 1999-06-24 | ||
| PCT/SE2000/001340 WO2001001728A1 (en) | 1999-06-24 | 2000-06-22 | Improvements in, or relating to, telecommunications systems |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| EP1195074A1 true EP1195074A1 (en) | 2002-04-10 |
| EP1195074B1 EP1195074B1 (en) | 2007-09-19 |
Family
ID=20416237
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| EP00946635A Expired - Lifetime EP1195074B1 (en) | 1999-06-24 | 2000-06-22 | Improvements in, or relating to, telecommunications systems |
Country Status (9)
| Country | Link |
|---|---|
| EP (1) | EP1195074B1 (en) |
| AT (1) | ATE373939T1 (en) |
| DE (1) | DE60036473D1 (en) |
| DK (1) | DK1195074T3 (en) |
| EE (1) | EE05120B1 (en) |
| ES (1) | ES2295038T3 (en) |
| NO (1) | NO326027B1 (en) |
| SE (1) | SE516754C2 (en) |
| WO (1) | WO2001001728A1 (en) |
Family Cites Families (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CA2186795A1 (en) * | 1995-11-17 | 1997-05-18 | Cormac John Sreenan | Resource management system for a broadband multipoint bridge |
| GB2319710B (en) * | 1996-11-23 | 1999-08-11 | Inmedia Investment Ltd | Data communication system |
| JP4201978B2 (en) * | 1997-09-09 | 2008-12-24 | ブリティッシュ・テレコミュニケーションズ・パブリック・リミテッド・カンパニー | Packet network |
-
1999
- 1999-06-24 SE SE9902419A patent/SE516754C2/en not_active IP Right Cessation
-
2000
- 2000-06-22 DK DK00946635T patent/DK1195074T3/en active
- 2000-06-22 AT AT00946635T patent/ATE373939T1/en not_active IP Right Cessation
- 2000-06-22 WO PCT/SE2000/001340 patent/WO2001001728A1/en not_active Ceased
- 2000-06-22 EE EEP200100703A patent/EE05120B1/en not_active IP Right Cessation
- 2000-06-22 EP EP00946635A patent/EP1195074B1/en not_active Expired - Lifetime
- 2000-06-22 DE DE60036473T patent/DE60036473D1/en not_active Expired - Lifetime
- 2000-06-22 ES ES00946635T patent/ES2295038T3/en not_active Expired - Lifetime
-
2001
- 2001-12-03 NO NO20015881A patent/NO326027B1/en not_active IP Right Cessation
Non-Patent Citations (1)
| Title |
|---|
| See references of WO0101728A1 * |
Also Published As
| Publication number | Publication date |
|---|---|
| SE516754C2 (en) | 2002-02-26 |
| NO20015881D0 (en) | 2001-12-03 |
| ES2295038T3 (en) | 2008-04-16 |
| NO20015881L (en) | 2002-02-20 |
| SE9902419D0 (en) | 1999-06-24 |
| EE05120B1 (en) | 2008-12-15 |
| ATE373939T1 (en) | 2007-10-15 |
| EE200100703A (en) | 2003-02-17 |
| NO326027B1 (en) | 2008-09-01 |
| DK1195074T3 (en) | 2008-01-28 |
| SE9902419L (en) | 2000-12-25 |
| DE60036473D1 (en) | 2007-10-31 |
| WO2001001728A1 (en) | 2001-01-04 |
| EP1195074B1 (en) | 2007-09-19 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US5461611A (en) | Quality of service management for source routing multimedia packet networks | |
| US7092395B2 (en) | Connection admission control and routing by allocating resources in network nodes | |
| US6028843A (en) | Earliest deadline first communications cell scheduler and scheduling method for transmitting earliest deadline cells first | |
| US5408465A (en) | Flexible scheme for admission control of multimedia streams on integrated networks | |
| US20020101826A1 (en) | Method and systems for bandwidth management in packet data networks | |
| US6233223B1 (en) | Control of distributed allocation of channels | |
| US6956857B2 (en) | Guaranteed admission and incremental bandwidth allocation in a packet network | |
| US6205484B1 (en) | Controlling access to resources in a connectionless network using a ticket message containing reserved network resource allocation information | |
| JP2001197084A (en) | Telecommunications network and method for controlling such a network | |
| JP3884082B2 (en) | Flexible bandwidth negotiation for block transfer of data | |
| JPH10136023A (en) | Packet communication method | |
| JP3086075B2 (en) | Bandwidth reservation system in ATM exchange | |
| US6359889B1 (en) | Cell switching device for controlling a fixed rate connection | |
| US6999474B1 (en) | Method for bandwidth management by resizing pipes | |
| Kilkki | Simple integrated media access (sima) | |
| CN1356011A (en) | Communications network | |
| EP1195074A1 (en) | Improvements in, or relating to, telecommunications systems | |
| US8797853B2 (en) | System and method for checking the permissibility of a use of a service | |
| EP1195075A1 (en) | Improvements in, or relating to, telecommunications service provision | |
| JP2008085686A (en) | Reservation reception control system and method and program | |
| JP3607402B2 (en) | Multimedia communication service control device | |
| US7142561B1 (en) | Path setting control method and switching system | |
| US7301964B1 (en) | Method for bandwidth management by resizing pipes | |
| Woo et al. | Dynamic QoS management for real-time communication in ATM networks | |
| JP3191921B2 (en) | Connection reception control method and flow reception control method |
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: 20020124 |
|
| 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 |
|
| AX | Request for extension of the european patent |
Free format text: LT PAYMENT 20020124;LV PAYMENT 20020124 |
|
| 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 |
|
| AX | Request for extension of the european patent |
Extension state: LT LV |
|
| 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 |
|
| REF | Corresponds to: |
Ref document number: 60036473 Country of ref document: DE Date of ref document: 20071031 Kind code of ref document: P |
|
| REG | Reference to a national code |
Ref country code: IE Ref legal event code: FG4D |
|
| RAP2 | Party data changed (patent owner data changed or rights of a patent transferred) |
Owner name: TELIASONERA AB |
|
| REG | Reference to a national code |
Ref country code: DK Ref legal event code: T3 |
|
| PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
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: 20070919 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: 20070919 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: 20070919 |
|
| NLT2 | Nl: modifications (of names), taken from the european patent patent bulletin |
Owner name: TELIASONERA AB Effective date: 20071219 |
|
| 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: 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: 20070919 |
|
| REG | Reference to a national code |
Ref country code: CH Ref legal event code: PL |
|
| REG | Reference to a national code |
Ref country code: ES Ref legal event code: FG2A Ref document number: 2295038 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: 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: 20071220 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: 20070919 |
|
| EN | Fr: translation not filed | ||
| 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: 20080219 |
|
| 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: 20071219 |
|
| 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: DE 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: 20071220 |
|
| 26N | No opposition filed |
Effective date: 20080620 |
|
| 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 FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20080523 |
|
| 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: 20080630 |
|
| GBPC | Gb: european patent ceased through non-payment of renewal fee |
Effective date: 20080622 |
|
| 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: 20080623 |
|
| 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: 20080622 |
|
| 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: 20070919 |
|
| 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: 20080622 |
|
| 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: 20080630 |
|
| PGFP | Annual fee paid to national office [announced via postgrant information from national office to epo] |
Ref country code: FI Payment date: 20140611 Year of fee payment: 15 Ref country code: ES Payment date: 20140627 Year of fee payment: 15 |
|
| PGFP | Annual fee paid to national office [announced via postgrant information from national office to epo] |
Ref country code: DK Payment date: 20140618 Year of fee payment: 15 |
|
| REG | Reference to a national code |
Ref country code: LT Ref legal event code: MM9D Effective date: 20150622 |
|
| REG | Reference to a national code |
Ref country code: DK Ref legal event code: EBP Effective date: 20150630 |
|
| 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 NON-PAYMENT OF DUE FEES Effective date: 20150622 |
|
| REG | Reference to a national code |
Ref country code: ES Ref legal event code: FD2A Effective date: 20160728 |
|
| 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 NON-PAYMENT OF DUE FEES Effective date: 20150630 |
|
| 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: 20150623 |