EP2926591A1 - Procédé et système pour la prise en charge de la compensation d'une association de transferts intercellulaires proactifs - Google Patents

Procédé et système pour la prise en charge de la compensation d'une association de transferts intercellulaires proactifs

Info

Publication number
EP2926591A1
EP2926591A1 EP12812181.1A EP12812181A EP2926591A1 EP 2926591 A1 EP2926591 A1 EP 2926591A1 EP 12812181 A EP12812181 A EP 12812181A EP 2926591 A1 EP2926591 A1 EP 2926591A1
Authority
EP
European Patent Office
Prior art keywords
ayz
sharedladx
given
hopa
netsurfing
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.)
Withdrawn
Application number
EP12812181.1A
Other languages
German (de)
English (en)
Inventor
Sigram Schindler
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Sigram Schindler Beteiligungs GmbH
Original Assignee
Sigram Schindler Beteiligungs GmbH
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Sigram Schindler Beteiligungs GmbH filed Critical Sigram Schindler Beteiligungs GmbH
Publication of EP2926591A1 publication Critical patent/EP2926591A1/fr
Withdrawn legal-status Critical Current

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W36/00—Hand-off or reselection arrangements
    • H04W36/24—Reselection being triggered by specific parameters
    • H04W36/26—Reselection being triggered by specific parameters by agreed or negotiated communication parameters
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W36/00—Hand-off or reselection arrangements
    • H04W36/24—Reselection being triggered by specific parameters
    • H04W36/32—Reselection being triggered by specific parameters by location or mobility data, e.g. speed data
    • H04W36/322—Reselection being triggered by specific parameters by location or mobility data, e.g. speed data by location data

Definitions

  • HOPA-ClearS The Handover (HO) Proactive Association Clearing Support (HOPA-ClearS) method/system supports
  • An HO of an Ayz is optimal iff its HO-time is "basically zero" and it complies with MSFO, potentially also taking a suitable provisioning data structure into account.
  • the technical innovation of the HOPA-ClearS method/ system may be put as follows: It comprises for an Ayz determining anytime - hence pre-HO - its optimal HOs, potentially limited to optimality over a suitable provisioning data structure.
  • This permanent predetermination of optimal HOs implies - due to dynamically changing services available to or requested from the Ayz - assessing permanently all MSFm (being u n ifo rm I y/Ayz-s pe c if i ca I ly/Ayz- group-specifically given e.g.
  • the managements of the Ayz such as: always or at certain occasions select the cheapest service or the best service or provided by a certain implementation or 7) subject to a given global market satisfaction function MSFO assessing some given global qualities of the clearing processes (such as: no Ayz must starve, no sharedlADx is overbooked, no cost unnecessarily incurred, one Ayz gets always best quality ) and establishing the resp. x/yz-, netsurfing x/yz-, and Sxyzj-associations.
  • the HOPA-ClearS method/system resolves the problem to manage the communications between the elements of its parameters, such that always holds:
  • the HOPA-ClearS method/system works on top of all today's networks between/within which HOs are to be executed - though it may be integrated into networks and/or their HO mechanisms, as well - yet requires sufficiently powerful netsurfing Ayz and IADs and for efficiency Internet-apps' implementations supporting it.
  • Fig. 1 is a block diagram of a netsurfing configuration applicable to the present invention
  • Figs. 2a and 2b are respective schematic and block diagrams of a business district having overlapping wireless network cells
  • Figs. 3a and 3b are block diagrams illustrating different particular handover situations for a subscriber, in
  • Fig. 4 is a diagram illustrating a handover proactive clearing and support data structure, in accordance with the present invention. DETAILED DESCRIPTION OF THE INVENTION
  • This HOPA-ClearS patent application comprises no limitation of the functionalities of pre-HO clearing strategies of x/y- and alike-associations" (see Section D) - thus the HOPA-ClearS method/system is inherent in all HO proactive association clearing strategies.
  • Each MHO of a netsurfing system AO is supported by its homelADO (see the HOBIS patent). Any OSI- connection of AO is relayed via the MHO-module MHO-M, which is controlled by an MHO-specification MHO-S in the homelADO or even executed there.
  • the MHO-S may be homelADO-management-private, AO-type-specific or even AO-individual.
  • the HOPA-ClearS-S/-M are peer to the MHO-S/-M, but functionally quite different.
  • Figure 1 shows the simplest netsurfing configurations.
  • MHO-S/-M and HOPA-ClearS-S/-M are assumed to be integrated into the homelADO ( Figures 6-8 in the HOBIS patent show their distributed implementations and hence there is no need to recapitulate this here).
  • It illustrates an MHO of the netsurfing AO (e.g. of a smartphone with a user and an existing OSI-connection, OCO, see chapter D.) from its homeWLANO, for short: WO (of the homelADO), into W1 , which is non-disjoint to it, respectively into W2, which is disjoint to it, along route 1 or 2 respectively.
  • WO of the homelADO
  • IAW Internet access LAN/WLAN
  • IAW Internet access LAN/WLAN
  • this IAW must be managed (by some "overlay network functionality") such that it functionally is a single endsystem representing a single home/sharedlAD, as managed in this invention.
  • BS Base Station of a mobile network
  • PSNs Packet Switching Networks
  • the HOPA-ClearS method/system achieves its innovations by acting at points in time, namely pre-HO - which is neither considered by the prior art in HO technology nor by the HOBIS patent.
  • ⁇ achieves the optimization of its market satisfaction functions alias its set of CSm: It namely identifies all the consolidated Sj which are available post-HO for optimization of the global market satisfaction function.
  • the person of pertinent skill knows that thereby a "suitable provisioning data structure" is needed (see Section D) - which here is assumed to be given - providing the basis for any optimization of this consolidation - for avoiding post-HO conflicts of SLAs and/or resources availability.
  • ⁇ actually may marginalize HO-times encountered by the Ayz user (and would be caused if the Ayz had to reconnect, after the HO, to the service(s) of Sxyzjkm used prior to the HO, unless the pre- and post-HO networks cooperated in handing it over between them, what is not assumed in this patent application and thus implies that an Sxyzjkm-association must be established after the HO, again), why the HOPA-ClearS method/system establishes it proactively pre-HO.
  • the HOBIS method/system guarantees that the x/yz- association(s) are established completely, while it may be impossible to instantly complete the establishment of an x/u-association (which need not exist, at all), e.g. pre-HO - due to the design or implementation of a communications application underlying it. This then is called a "basic establishment" of the communications connection, and the implied resp. HO-time then is reduced to "basically zero".
  • ClearS-S controls the implementation of the HOPA-ClearS-M - always consists of physical HW and SW components, just like all working computers. Therefore, these HW components need not be used exclusively by its HOPA-ClearS-SW components, but may be used also by any other system's SW components. Thereby the implementation of the HOPA-ClearS data structure and its managing system(s) may be distributed, e.g. onto the respective homelADz or sharedlADx, or centralized on some server, or a mixture of both. In addition, system design knows techniques enabling efficient and integrity preserving concurrent accesses to this data structure for updating/changing it flexibly and instantly by appropriately synchronizing all read and write accesses to it. Thus, the person of pertinent ordinary skill knows a plurality of embodiments of the HOPA-ClearS method/system.
  • the HOPA-ClearS method/system (for a netsurfing Ayz, its homelADz and a sharedlADx) is subject to the fundamental restriction that Ayz may use the sharedlADx solely as a router solely to the Ayz-homelADz resp. its Ayz-MHO_S with a fixed IP address - except for the services of communications applications privately provided by the sharedlADx. Both, the correctness of the IP address as well as the compatibility of such private services with the implementation of the HOPA-ClearS (and HOBIS, ...) method/system, need to be explicitly approved by the managements of the sharedlADx prior to completing the HO of Ayz to it resp.
  • Ayz may use this sharedlADx also for using other services than those provided via the netsurfing x/yz- association, namely provided privately by the sharedlADx and bypassing the Ayz-homelADz.
  • the sharedlADx thus guarantees in real-time that its management can always identify, as to communications relayed over it and even prior to starting its application system, the managements of an Ayz and a PSxyzjkm being responsible for it (e.g. by their approvals).
  • Figure 2a schematically shows a business district, in any building of which there are several sharedlADx cells, overlapping and independent of each other (e.g. WiFi based, as zoomed-in by Figure 2b), which on their turn overlap with several GSM networks - wherein the respective areas of accessibility of the sharedlADx'es are indicated by surveillancedashed" boundary lines.
  • sharedlADx cells e.g. WiFi based, as zoomed-in by Figure 2b
  • GSM networks wherein the respective areas of accessibility of the sharedlADx'es are indicated by surveillancedashed” boundary lines.
  • Ayz are schematically shown (visualized by their two different shapes), as they belong to two different homelADz and its Ayz-MHO_S. If a mobile Ayz moves, e.g.
  • FIG. 3a shows for Ay1 its homelADI , its currently used sharedlADx, and its 2 0Cy1 , 0Cy2 and 4 BCy1- 4.
  • the HOPA-ClearS method/system may recognize pre-HO, which Sxyzjkmu-association proactively to establish resp. relay.
  • Figure 3b shows in addition that sharedlADx has the ability to also provide to Ay1 on his own BCy5 and BCy6, e.g. as demanded by Ayl's security and/or marketing and/or logistics and/or accounting and/or invoicing needs - being approved/supported by the HOPA-ClearS method/system.
  • Enriching the Figures 3 by an Ay2 kind of netsurfing systems is skipped here - but one single sharedlADx is able to route both kinds of Ay's at any point in time, i.e. is able to co-operate with several different HOPA clearing systems.
  • Figure 4 schematically shows a HOPA-ClearS data structure entry, as accessed from the side of the
  • ⁇ HOPA-ClearS modules on behalf of the managements of the homelADz and their Ayz resp. of the sharedlADx and at least of one HOPA clearing system, as well as from the side of e.g. the
  • the HOPA-ClearS method/system may also support identifying/negotiating - concurrently to its above pre-
  • statically e.g. upon buying or renting Ayz, globally or regionally or address dependent, with initial operation or anytime requested by its user, ... and/or
  • ⁇ dynamically, e.g. dependent on the actual level of stress these devices are under (e.g. in a certain region), or on the degree of utilization of the Internet (e.g. in a region) or a Sxyzjkm, or ....
  • ⁇ There is no limitation as to the generation of and/or checking for and/or detection of a signal SIGxyz. In particular, it may be generated by a HOPA-ClearS system, as mentioned above.
  • Any Internet application service Sxyzjkm may be provided by a set of alternative and/or cooperating and/or concurrent or sequential communication applications and may involve several Internet endsystems.
  • a parameter may be constant or variable over time (predictable or not) and/or the same for several Ayz or sharedlADx or homelADz and/or (in)dependent of another one, which holds in at least one geographic region and/or in at least one period of time.
  • a HOPA-ClearS method/system may be capable of generating given alarms on the occurrence of certain events, such as on attempts to route data outside of the approved routings.
  • An auction of the HOPA-ClearS method/system may be fully automatic or interact with at least one user and/or may take place under its own control, or the control of the HOPA clearing system, or some separate system.
  • the communication architecture of the HOPA-ClearS method/system discussed above, with a HOPA-ClearS-S module in an endsystem's homelAD, is independent of whether the latter includes in addition an MHO-S and/or a HOPA-ClearS-S module - i.e. that the HOPA-ClearS method/system may be used also to support ,, ⁇ -managed" and/or ,, ⁇ -cleared” HOs; and this holds for communicatevertical" just as for ..horizontal" HOs (see the HOBIS patent), and any mixture of all HO types mentioned above.
  • the HOPA-ClearS method/system can be integrated in an arbitrary XYZ functionality, which differs from the former's precedingly disclosed functionality in any thinkable manner, i.e. not at all exhibit the usage of the HOPA-ClearS method/system in a separated way. Nevertheless it holds in that case: As soon as this XYZ functionality includes the above disclosed functionality of a HOPA-ClearS method/system, it interferes with the scope of patent protection for the HOPA-ClearS method/system - provided it will be granted.
  • ISO 7498-1 Information Technology- Open Systems Interconnection - Basic Reference Model: The basic model", called “ISO/OSI-Reference Model”.
  • ISO/OSI-Reference Model The basic model
  • ISO/OSI-Reference Model For the person skilled in the art it is the absolutely mandatory basis also for the interpretation of, i.e. meanings allocation to, all communications technological terms, which have arisen only after the adoption of this OSI Reference Model by all relevant international and national consensus forming bodies, worldwide, such as ISO, IEEE, ITU, ANSI, ETSI, DIN, BSI, AFNOR This holds also for the communications technology based terms introduced here for enabling describing the innovations of this patent application.
  • OSI-RM there is, i.e. exists, an "OSI connection" for any interacting communications application, i.e. for every communication between the two endsystems (e.g. AO and ZO) hosting the resp. interacting communications application system causing it.
  • OSI connection for any interacting communications application, i.e. for every communication between the two endsystems (e.g. AO and ZO) hosting the resp. interacting communications application system causing it.
  • OSI connection for the interacting communications application (system) starts with the very beginning of its first interaction.
  • This OSI connection then exists in particular between the two endsystems hosting the interacting communications application.
  • OSI connection is often denoted as "communications connection”.
  • the OSI-RM defines the meaning of any "connection” - i.e. not only of a whole OSI connection, but also of any of its Li-connections (see below) - to be an "association" of its two endpoints. These endpoints are contained by an endsystem or a transitsystem.
  • An example of an endsystem is a "netsurfing system, Ayz", and of a transitsystem is a "sharedlADx" being used by Ayz when roaming (for providing service Sj to its user). Thereby this sharedlADx is at the same time an endsystem of this roaming communications application system, partially contained by it.
  • Each OSI connection comprises for each Layer.i, defined by the OSI-RM, at least one "Li-connection” alias “Li-association", 1 ⁇ i ⁇ 7 (needing no clearing to their end-/transitsystems, see below).
  • any Li-connection "exists" with its Li- association - as both terms have the same meaning - as soon as one of its endpoint systems knows about the second one, i.e. knows the address of the other endpoint system.
  • an OSI connection exists between endsystems A and Z, as soon as in one of A or Z this association has become known for an interaction between their communications application, e.g. as soon as in A the address of Z and a communications application is available for this interaction.
  • the availability of a communications application for achieving this interaction requires to first "provision" this communications application at least to A. I.o.w., at the time of an OSI association/connection coming into existence, its at least one communications application is already provisioned at least to the system starting this application's first interaction.
  • any Li-connection of an existing/existent OC or BC the transfer of data between its both endpoints and hence endsystems - i.e. of this interaction via any of this OC's/BC's Li-connections - may start for/with performing its "establishment” alias "set-up", which achieves any necessary exertestablishment'7"set-up" of the resources needed for this Li-connection in A and Z and/or agreement between both endpoints about what technical parameters would be used in it.
  • x/yz-association For the HOPA-ClearS method/apparatus let the terms "x/yz-association”, “netsurfing-x/yz-association”, and “Sxyzjkm-association” denote a conglomerate of Li-associations between the sharedlADx and the Ayz resp. the sharedlADx and the homelADz resp. the sharedlADx or Ayz and at least one other endsystem hosting part of a communications application - in all three cases (to be) used for providing a service Sxyzjkm to Ayz.
  • a netsurfing-x/yz-association always connects the sharedlADx with the homelADz and an Sxyzjkm- association may be relayed partially or completely over the homelADz.
  • the "clearing " of any one of both kinds of HOPA-ClearS associations denotes, as defined above already, making the resp. communications applications available to these associations' endsystems. It is (to be) performed pre-HO in a way outside of the scope of the HOPA-ClearS method/apparatus. HOPA-ClearS associations then come into existence as explained above, but would not yet be established in the general case.
  • HOPA-ClearS associations may be performed "basically pre-HO". I.e.: If the systems and network(s) executing an embodiment of the HOPA-ClearS clearing system are fast enough, it is possible to establish completely pre-HO
  • An "Ayz performs an HO to the sharedlADx", or briefly “Ayz HOes to sharedlADx”, if such a modification occurs with at least one Li-connection of at least one of Ayz' existent OSI-connections. Thereby frequently an L3-association is modified in its quality and/or replaced by another one and/or added/removed to/from an OSI-connection.
  • This notion of HO comprises also "service HOs" occurring to Ayz as soon as an Sxyzjkm provided to it and/or its user by a sharedlADx is modified, be it a modification e.g. of one of its L3-connections and/or one of its L7-connections. This such modification may also occur only within the Ayz and/or may be supported by Ayz's communications with at least one given other system and/or network than that/those of the sharedlADx.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Mobile Radio Communication Systems (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

La présente invention se rapporte à un procédé et à un système pour la prise en charge de la compensation d'une association de transferts intercellulaires proactifs. Le procédé et le système selon l'invention sont adaptés pour minimiser les temps de transfert intercellulaire d'au moins un système d'extrémité surfant sur le Net, et pour optimiser une fonction de satisfaction d'un marché donné (MSF0) qui dépend potentiellement d'applications Internet pour divers procédés de transfert intercellulaire (HO) sous-jacents. Pour ce faire, le procédé selon l'invention établit potentiellement un pré-HO pour une association de dispositifs x/yz libres, une association de dispositifs x/yz surfant sur le Net, et/ou une association de dispositifs Sxyzj, pour faire ce que l'on appelle une compensation. Un HO d'un dispositif Ayz est optimal si son temps de HO est égal à zéro, à la base, et s'il remplit la fonction MSF0. Le procédé et le système selon l'invention sont innovants en ce qu'ils permettent à un dispositif Ayz de déterminer à tout moment comment ses HO peuvent être optimaux. Cette détermination préalable permanente de HO optimaux impliquent une évaluation permanente de l'ensemble des paramètres concernés. C'est ainsi que, quand un dispositif Ayz doit exécuter un HO, ces opérations de pré-HO du procédé et du système selon l'invention ont déjà identifié au moins un HO optimal pour lui et l'ont signalé à un dispositif partagé IADx et/ou Sxyzj disponible, de même qu'ils ont établi les associations respectives pour des dispositifs x/yz libres, des dispositifs x/yz surfant sur le Net, et/ou des dispositifs Sxyzj.
EP12812181.1A 2012-11-27 2012-11-27 Procédé et système pour la prise en charge de la compensation d'une association de transferts intercellulaires proactifs Withdrawn EP2926591A1 (fr)

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/EP2012/073722 WO2014082659A1 (fr) 2012-11-27 2012-11-27 Procédé et système pour la prise en charge de la compensation d'une association de transferts intercellulaires proactifs

Publications (1)

Publication Number Publication Date
EP2926591A1 true EP2926591A1 (fr) 2015-10-07

Family

ID=47520018

Family Applications (1)

Application Number Title Priority Date Filing Date
EP12812181.1A Withdrawn EP2926591A1 (fr) 2012-11-27 2012-11-27 Procédé et système pour la prise en charge de la compensation d'une association de transferts intercellulaires proactifs

Country Status (3)

Country Link
EP (1) EP2926591A1 (fr)
CN (2) CN111491344B (fr)
WO (1) WO2014082659A1 (fr)

Family Cites Families (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
FI109321B (fi) * 1999-06-10 2002-06-28 Nokia Corp Menetelmä ja järjestely nopean solunvaihdon toteuttamiseksi pakettikytkentäisessä solukkoradiojärjestelmässä
EP1458148A1 (fr) * 2003-03-10 2004-09-15 Sony International (Europe) GmbH Procédure de transfert d'appel tenant compte de la Qualité de Service (QoS) pour réseaux ad hoc
CN100588293C (zh) * 2004-01-28 2010-02-03 株式会社Ntt都科摩 无线控制装置和移动通信控制方法
KR100893860B1 (ko) * 2004-06-10 2009-04-20 엘지전자 주식회사 광대역 무선 접속 시스템에 적용되는 핸드오버 수행 방법및 핸드오버 실패시 통신 재개 방법
US7515909B2 (en) * 2005-04-21 2009-04-07 Qualcomm Incorporated Wireless handoffs between multiple networks
WO2008081840A1 (fr) * 2006-12-27 2008-07-10 Kyocera Corporation Dispositif de commande de communication et procédé de commande de communication
PT2027747E (pt) * 2007-02-12 2011-09-19 Sigram Schindler Beteiligungs Gmbh Navegação na net em chamadas voip mediante transferências geridas (mhos)
US8929894B2 (en) * 2009-01-06 2015-01-06 Qualcomm Incorporated Handover failure messaging schemes
CN102215495A (zh) * 2010-04-07 2011-10-12 清华大学 一种无线通信中增强移动终端室内信号的***

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
None *
See also references of WO2014082659A1 *

Also Published As

Publication number Publication date
CN111491344A (zh) 2020-08-04
CN104956727A (zh) 2015-09-30
CN111491344B (zh) 2023-04-18
CN104956727B (zh) 2019-12-03
WO2014082659A1 (fr) 2014-06-05

Similar Documents

Publication Publication Date Title
EP3643114B1 (fr) Transfert de services vocaux
US8620307B2 (en) Selection of access interface
KR101466069B1 (ko) 무선 통신 디바이스에 대한 접속 관리자
EP2793510A1 (fr) Méthode, système et dispositif de commutation
US20180020386A1 (en) Improvements in handovers between different access networks
US8711701B2 (en) Method and system and policy server for guaranteeing data not to be interrupted
EP3585100B1 (fr) Procédés et dispositifs de détermination d'identifiant de porteuse, et support de stockage correspondant
EP3643113A1 (fr) Transfert intercellulaire de service vocal
JP4422101B2 (ja) 途切れずに引渡しを行うためのコンテキスト転送
CN112187495A (zh) 终端与服务器的通信方法、通信***
EP3179777A1 (fr) Station mobile, station de base, procédé de contrôle de restriction, et procédé de transmission d'informations de diffusion
CN104735807A (zh) Wifi热点服务的提供方法、***和wifi接入点
US9578552B2 (en) Handover proactive association provisioning support method and system
KR100375825B1 (ko) 패킷 이동통신망에서의 하드 핸드오프 방법
CN103813395A (zh) 终端用户在不同网络间进行无缝移动的方法及wog
US11212663B2 (en) Establishing a roaming connection via a bootstrap server
US9820192B2 (en) Handover proactive association clearing support method and system
EP2926591A1 (fr) Procédé et système pour la prise en charge de la compensation d'une association de transferts intercellulaires proactifs
CN109845329B (zh) 一种通信方法、网络设备及应用管理单元
CN107770787B (zh) 一种确定目标运营商网络的方法和装置
EP2926595A1 (fr) Procédé et système pour la prise en charge de l'approvisionnement d'une association de transferts intercellulaires proactifs
Lee et al. Media independent service for software-defined radio access networks
GB2563657A (en) Voice service handover
KR20200112022A (ko) 통신 시스템에서 공용 망 및 비-공용 망 간의 핸드오버를 수행하는 장치 및 방법
CN101754310A (zh) 融合业务***和基于融合业务的切换方法

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: 20150521

AK Designated contracting states

Kind code of ref document: A1

Designated state(s): AL AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HR HU IE IS IT LI LT LU LV MC MK MT NL NO PL PT RO RS SE SI SK SM TR

AX Request for extension of the european patent

Extension state: BA ME

DAX Request for extension of the european patent (deleted)
STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: EXAMINATION IS IN PROGRESS

17Q First examination report despatched

Effective date: 20180622

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

Free format text: STATUS: EXAMINATION IS IN PROGRESS

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

Free format text: STATUS: THE APPLICATION IS DEEMED TO BE WITHDRAWN

18D Application deemed to be withdrawn

Effective date: 20230215