EP1994734A1 - Verfahren zum identifizieren von spit oder spam für voip - Google Patents
Verfahren zum identifizieren von spit oder spam für voipInfo
- Publication number
- EP1994734A1 EP1994734A1 EP07726586A EP07726586A EP1994734A1 EP 1994734 A1 EP1994734 A1 EP 1994734A1 EP 07726586 A EP07726586 A EP 07726586A EP 07726586 A EP07726586 A EP 07726586A EP 1994734 A1 EP1994734 A1 EP 1994734A1
- Authority
- EP
- European Patent Office
- Prior art keywords
- subscriber
- subscribers
- list
- call
- participants
- 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.)
- Ceased
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04M—TELEPHONIC COMMUNICATION
- H04M3/00—Automatic or semi-automatic exchanges
- H04M3/42—Systems providing special services or facilities to subscribers
- H04M3/436—Arrangements for screening incoming calls, i.e. evaluating the characteristics of a call before deciding whether to answer it
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L65/00—Network arrangements, protocols or services for supporting real-time applications in data packet communication
- H04L65/1066—Session management
- H04L65/1076—Screening of IP real time communications, e.g. spam over Internet telephony [SPIT]
- H04L65/1079—Screening of IP real time communications, e.g. spam over Internet telephony [SPIT] of unsolicited session attempts, e.g. SPIT
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04M—TELEPHONIC COMMUNICATION
- H04M7/00—Arrangements for interconnection between switching centres
- H04M7/006—Networks other than PSTN/ISDN providing telephone service, e.g. Voice over Internet Protocol (VoIP), including next generation networks with a packet-switched transport layer
Definitions
- the invention relates to a computer and to a method for computer-aided identification of a class of calls of the first kind in a communication network, wherein the communication network has a number N of first subscribers and a number M of second subscribers and a clearer one of the first and the second subscribers Identifier is assigned.
- a subscriber is understood as a communication device in a communication network which communicates in particular according to the Internet Protocol (IP).
- IP Internet Protocol
- a communication device for example, a computer, a Wegmunikationsendgerat such.
- a landline or mobile phone or the like.
- call is to be understood as an attempt to establish a communication connection of a second party to a first party.
- the method according to the invention for computer-aided identification of a class of calls of the first type in a communication network which has a number N of first subscribers and a number M of second subscribers and the first and the second subscribers are each assigned a unique identifier comprises the following steps: At least some of the first participants are each assigned at least one list which includes at least one unique identifier of the second subscriber. In the case of a call of one of the second subscribers at one of the first subscribers, it is checked whether the identifier of the second subscriber is included in the list of the first subscriber, in which case the second subscriber is not included in the list of the first subscriber called the lists of the other first participants are used to decide whether the call is classified as a first-kind call.
- the first and second subscribers do not differ, but rather, as already explained, constitute communication devices of the communication network.
- the second subscribers are subscribers who initiate a call.
- the first subscribers are the subscribers called by the second subscribers.
- the class of calls of the first kind is understood to mean spam in the present description, but this is not mandatory. If the transmission of calls according to the Internet Protocol (IP), as provided in accordance with an embodiment of the invention, the class of calls of the first kind is referred to as SPIT (spam over IP Wegy).
- IP Internet Protocol
- SPIT spam over IP
- the invention is based on the idea of protecting the first subscribers of the communication network from spam or SPIT by associating them with personalized lists containing information about other subscribers and using the information contained in the list for deciding whether a call contains spam or SPIT.
- the list associated with a first subscriber may include identifiers of the second subscribers which initiate calls of the first type or which initiate calls of a second, of which different nature. These lists are known in professional circles under the name blacklist or whitelist.
- a blacklist is a list of punching - z. People, phone lines, IP addresses - which should be penalized compared to other instances.
- the counterpart to the black list is the white list (whitelist), in which the instances mentioned on the list are preferred to the other instances.
- a first participant can be assigned both a black list and a white list or even both lists.
- the invention further provides, in the case where the second subscriber is not included on the list of the called first subscriber, to determine indirectly by checking the lists of other first subscribers whether it could be a first type call or not. In order to determine whether calls of the first type are present, the invention thus uses the evaluation of personalized lists with preferred or otherwise designated subscribers.
- the list represents a blacklist
- no communication establishment between the first and the second subscriber is realized in the case where the second subscriber is included in the list of the called first subscriber.
- the list represents a white list according to another variant, a communication establishment between the first and the second subscriber is made for calls of such second subscribers, which are contained in the list of one of the first subscribers.
- the caller is not included in the list of the called first subscriber, classified in the manner described above, the caller as a caller first nature or caller of the second kind.
- the determination of whether the call is classified as the first type is performed by a collaborative filtering method.
- the collaborative filtering process can be performed according to a memory-based method or a model-based method.
- the collaborative filtering method can also optionally operate according to a method which uses a first subscriber-based approach (so-called user-based approach) or which uses a second subscriber-based approach (so-called object-based approach / item-based approach ) used.
- the coincidence of patterns in the lists of the first participants is statistically evaluated according to the procedure of the invention. It is concluded that a dependence between two of the second participants when they are included in a variety of the used for evaluation lists.
- the invention is based on the approach that similar lists of two first subscribers can be found by comparing lists of a plurality of first subscribers. If two first subscribers are assigned high-correlation lists, then it can be concluded that the classification of the calls by the first subscribers is based on similar principles. This can be concluded from the list information of a first participant with a certain probability to the desired behavior of the other, called first participant. This makes it possible to decide whether it is highly probable that the call is first or second class.
- a value in particular a probability value, is determined on the basis of which the decision can be made as to whether the call is classified as a call of the first type.
- the probability value is determined using a Markov chain, also referred to as Markov Random Walk.
- the determined value or the determined probability value is transformed, wherein based on a resulting transformation value, the decision is made as to whether the call is classified as a call of the first kind.
- the transformation can be done be based on a predetermined transformation rule.
- the preparation of the list can, according to an embodiment of the method according to the invention by the relevant first
- the storage of the list can be done locally at the first subscriber, but also centrally in a computer of the communication network.
- calls classified as first-type calls may be redirected to a voice announcement or recording device.
- the calls may be signaled to the first subscriber by a particular type of signaling, e.g.
- the calls can also be signaled to the first subscriber with the possibility of classifying the latter variant, especially if a certain probability value has been exceeded which indicates that This can be realized by defining appropriate intervention instructions in the form of simple rules, in which case the called first subscriber is then in particular free to block the call, to accept the call (ie to establish a connection to the second subscriber), the To save a call or assign the calling second party a certain signaling type (especially for future calls).
- a computer for identifying a class of calls of the first type in a communication network can be connected to this communication network.
- the communication network has a number N of first subscribers and a number M of second subscribers, wherein the first and the second subscribers are each assigned a unique identifier.
- At least some of the first participants are each assigned at least one list which at least one unique identifiers second subscriber, wherein the computer is adapted to check in a call of one of the second participants in one of the first participants, whether the identifier of the second subscriber is included in the list of the first subscriber, and in the In the case where the second subscriber is not included in the list of the called first subscriber, the lists of the other first subscribers are used to decide whether the call is classified as a first-kind call.
- the computer according to the invention can optionally be in the first subscriber or any computer of the communication network, which z. B. in the mediation or establishment of a communication link between the calling second party and the called first participant is involved, be arranged.
- Fig. 3a, b two probability distributions, which for
- Classification of a call can be used
- 4 shows a second table, based on which the procedure of the inventive method is illustrated, and
- Fig. 5 is a graph which illustrates the information contained in the second table of FIG. 4 illustratively.
- FIG. 1 Shown are two X-Y diagrams, each on the X-axis, the unique identifiers of second participants (callers) and on the Y-axis, the unique identifiers of first participants (called parties) are shown.
- Each point in the X-Y diagrams represents an entry in the list, e.g. As a black list, a first participant dar.
- FIG. 1 shows the XY diagram after the entries have been regrouped. For the sake of clarity, however, it has been omitted to represent the corresponding unique identifiers in unsorted manner over the X and Y axis. Rather, in turn, a representation in sorted order.
- the group of second subscribers identified by reference numeral 1 is contained in nearly all blacklists of the first subscribers.
- a marked with the reference numeral 2 nete group of second participants also included only on the black lists of a group of first participants.
- a plurality of further groups corresponding to the block 2 can be recognized, the corresponding second subscribers being assigned to a specific group of first subscribers.
- the invention uses user-defined black and / or white
- a second subscriber which is also referred to below as a caller or caller, is also referred to as a called subscriber or subscriber on the black list of a first subscriber, all calls made by the caller to the subscriber called are ckiert. This means that there is no establishment of a communication connection between the caller and the called party.
- the list associated with a called party further makes it possible to determine the likelihood of a call initiated by a caller being SPIT if that caller is not on the list associated with the called party.
- the determination of the probability takes place on the basis of the lists of other first participants.
- the determination of the probability of a call being SPIT is determined using collaborative filtering techniques.
- the underlying assumption is that first subscribers who have similar blacklists tend to have similar beliefs as to whether a caller is a spitter or not.
- the second subscribers are also referred to as callers, for which reason the column names are supplemented by the reference symbols Cl,..., C7.
- the line headings are supplemented by the reference symbols S1,..., S5, after the first subscribers are also referred to as subscribers.
- a line entry represents by way of example in each case a black list of the first participants TnI-I, ... Tnl-5.
- a tick in the table line indicates that the assigned second subscriber Tn2-1, ..., Tn2-7 is considered a so-called spitter.
- Empty entries in the table mean that, with respect to calls made by a relevant second subscriber, the first subscriber is not actively classified as either SPIT was made by the first participant, nor that in the context of the inventive method, a high SPIT probability was determined.
- the grayed out and X marked table entries indicate that there is a significant likelihood that calls from the relevant second party will be considered SPIT for the relevant first party.
- calls of the second subscriber Tn2-4 for the first subscriber TnI-I are considered as
- callers of the second subscriber Tn2-7 are classified as SPIT in the first subscriber Tnl-4, since the first subscribers Tnl-3 and Tnl-4 have similar blacklists.
- Calls from the second subscriber Tn2-1 to the first subscriber Tnl-5 are considered suspicious, since the other first subscribers, in particular subscribers TnI-I and Tnl-2, have classified the second subscriber Tn2-1 as a spitter.
- the method according to the invention is thus able to identify callers of SPIT if they have been identified globally, ie by a large number of first subscribers, as spitter, ie are included in their lists.
- the invention makes it possible to identify a second subscriber not only globally as a spitter, but rather a personalized association between the second and first participants, whereby the different interests of a plurality of first participants are taken into account.
- Collaborative filtering was first used to develop personalized suggestion systems.
- the technology has been successfully used in business-to-customer (B2C) platforms, such as: B. from Amazon, used.
- a collaborative filter algorithm works with a NM matrix X in which each row is assigned to a user and each column to an object (product). Each matrix entry X 13 then displays the opinion of the user i regarding the product j.
- each user corresponds to a first participant and each product to a second participant or their respective unique identifiers.
- a matrix X can therefore be very large and provided with few matrix entries, after each first participant leaves his opinion regarding only a very small number of second participants.
- This matrix forms the starting point of the collaborative filter in order to predict the opinion of a first participant regarding the missing matrix entries.
- a probability is determined. This is expressed by the variable x.
- the variable x is either a numeric value, e.g. From 1 to 7, as shown in Fig. 3a) or takes a binary value, e.g. B. Normal and SPIT (see Fig. 3b). In the following, the latter case is considered.
- the variable x is dependent on the second participant j and the first participant i.
- the goal of the collaborative filtering is therefore the determination of a probability distribution P (x
- i, j, X) This is shown in FIGS. 3a) and 3b).
- Fig. 3a) an exemplary expected probability distribution for the preferences of the first party is shown in numerical form. The distribution not only makes a statement about the expected value (in the present case 5), but also about the vagueness of this estimate. In the example of FIG. 3b), the probability value can only have two values (normal or SPIT). where the probability distribution indicates how likely the checked call is to SPIT.
- Algorithms of collaborative filtering can thus be considered as a way of filling all the missing elements of the matrix X.
- padding is associated with large storage costs and processing complexity because conventional memories can not contain a complete matrix of millions of elements multiplied by hundreds of thousands of elements.
- Another difficulty in practice is that not all of the first participants will answer requests to update the matrix from a higher level entity in the communication network. To increase the performance, therefore, a caching of previously determined probability values may be necessary.
- a second participant is considered to be a first participant
- Spitter is considered or not, usually no change made by the first participant list is made.
- the collaborative filtering can be done either by a model-based method or a memory-based method.
- the memory-based method is known as "memory-based method", the model-based method as “model-based method” in the art.
- the term collaborative filtering refers only to the memory-based method. This was based on the observation that people usually trust recommendations from similar-thinking acquaintances. These procedures apply a nearest-neighbor-like scheme to predict a user's assessment based on the judgments of like-minded users.
- the term "memory-based” comes from the fact that a database is provided with user entries and processing of the contents stored therein is only performed if a prediction is required. In the context of the present invention, when a first subscriber receives a call, according to the memory-based method, the list of the first subscriber is used to find other first subscribers with similar lists and to check whether the calling, second Participant is also included in these similar lists.
- model-based collaborative filtering which learns a compact model based on the considered matrix X, then uses the learned model to make predictions.
- each user data record can be transformed into smaller dimensional latent subspaces. After these latent subspaces describe the dependency between the first and second subscribers, the subspace describing a user data record can be used to predict the subscriber interests of the first subscriber with respect to the second subscribers.
- Memory-based methods are also referred to as "lazy learning" in the sense that no special training phase is needed.
- the memory-based method can handle new data by merely adding to the matrix.
- the model-based method can provide significant computational advantage so that the prediction can be made very quickly.
- the incremental addition of models is not trivial.
- Both the memory and model-based methods of collaborative filtering algorithms can be used in either a first subscriber-based approach or a second subscriber-based approach.
- the first participant-based approach is known in professional circles as a user-based method, the second participant-based approach as an item-based method. The following brief explanation is in the context of the memory-based filtering method.
- [i, j] denote the edge connecting a node V 1 and a node V 3 .
- the transition probability of the Markov chain from V 1 to V 3 is defined as:
- the edge weight W 1 - can be interpreted as the frequency of transitions between V 1 and V 3 .
- P 13 can be considered as how large the proportion of all
- a transition thus encodes a matching pattern of two interconnected nodes.
- An edge weight W 13 of a high value indicates a frequent coincidence of the two nodes.
- P 13 encodes the conditional probability when V 1 occurs, as well as V 1 also likely to occur. This conditional probability is used to infer the SPIT probability of a new second party with respect to the lists of all first participants.
- FIG. 5 shows the example of an undirected graph that takes into account the information of the matrix contained in FIG. 4.
- the first subscriber TnI-I to Tnl-4 through the nodes Sl to S4 and the second subscriber Tn2-1 to Tn2-7 by the nodes C1 to C7.
- Second jump t 2: When continuing the chain (Random Walk), the nodes S1, S2 and S3 connected to the nodes C1, C2 and C3 again receive a probability mass.
- the method of the Markov chain can be considered as a user-based approach because user similarity is measured by the transitions between users.
- the similarity between first subscribers is caused by the two-step transition on the graph in FIG. 5, namely from the first subscribers to the second subscribers back to the first subscribers.
- the Markov method can equivalently be considered as an object-based approach in which the similarity of the object or second participant is measured by the transitions between the products and second participants. This similarity is caused by a two-step transition on the graph of Fig. 5, which proceeds from the second participants to the first participants, and finally back to the second participants.
- the difference amounts merely to factor 3.
- the object-based approach is more efficient.
- the procedure is identical to the one described above.
- the invention thus proposes a method for computer-aided identification of calls of a specific class (in particular special spam or SPIT) in the context of IP telephony.
- a specific class in particular special spam or SPIT
- SPIT special spam or SPIT
- the invention makes use of lists defined by the participants, which can be configured as black or white lists in order to be able to draw conclusions about the probable behavior of the first participant.
- the invention makes use of collabo- rative filter methods which are applied to the lists defined by the participants.
Landscapes
- Engineering & Computer Science (AREA)
- Signal Processing (AREA)
- Business, Economics & Management (AREA)
- General Business, Economics & Management (AREA)
- Multimedia (AREA)
- Computer Networks & Wireless Communication (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
- Telephonic Communication Services (AREA)
- Information Transfer Between Computers (AREA)
Abstract
Description
Claims
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
DE102006010153 | 2006-03-06 | ||
PCT/EP2007/051989 WO2007101821A1 (de) | 2006-03-06 | 2007-03-02 | Verfahren zum identifizieren von spit oder spam für voip |
Publications (1)
Publication Number | Publication Date |
---|---|
EP1994734A1 true EP1994734A1 (de) | 2008-11-26 |
Family
ID=38080822
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
EP07726586A Ceased EP1994734A1 (de) | 2006-03-06 | 2007-03-02 | Verfahren zum identifizieren von spit oder spam für voip |
Country Status (4)
Country | Link |
---|---|
US (1) | US20090202061A1 (de) |
EP (1) | EP1994734A1 (de) |
CN (1) | CN101461224A (de) |
WO (1) | WO2007101821A1 (de) |
Families Citing this family (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
KR101580185B1 (ko) * | 2009-06-29 | 2015-12-24 | 삼성전자주식회사 | VoIP 서비스에서 스팸 제어 방법 및 장치 |
CN104023109B (zh) * | 2014-06-27 | 2015-09-30 | 努比亚技术有限公司 | 来电提示方法和装置及分类方法和装置 |
CN104883428B (zh) * | 2015-05-05 | 2017-08-11 | 中国联合网络通信集团有限公司 | 识别voip电话的方法及装置 |
US11909912B2 (en) * | 2021-10-26 | 2024-02-20 | Ribbon Communications Operating Company, Inc. | Methods and apparatus for call traffic anomaly mitigation |
Citations (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
WO2004099905A2 (en) * | 2003-05-05 | 2004-11-18 | Mailfrontier, Inc. | Message handling with selective user participation |
Family Cites Families (11)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US6075770A (en) * | 1996-11-20 | 2000-06-13 | Industrial Technology Research Institute | Power spectrum-based connection admission control for ATM networks |
US8032592B2 (en) * | 2002-04-18 | 2011-10-04 | Intuit Inc. | System and method for data collection and update utilizing surrogate e-mail addresses using a server |
US7945674B2 (en) * | 2003-04-02 | 2011-05-17 | Aol Inc. | Degrees of separation for handling communications |
US7320020B2 (en) * | 2003-04-17 | 2008-01-15 | The Go Daddy Group, Inc. | Mail server probability spam filter |
US20040267929A1 (en) * | 2003-06-27 | 2004-12-30 | Servgate Technologies, Inc | Method, system and computer program products for adaptive web-site access blocking |
US7412050B2 (en) * | 2003-10-01 | 2008-08-12 | Aol Llc, A Delaware Limited Liability Company | Conference calls via an intelligent call waiting interface |
US7307997B2 (en) * | 2004-05-21 | 2007-12-11 | Alcatel Lucent | Detection and mitigation of unwanted bulk calls (spam) in VoIP networks |
US7653188B2 (en) * | 2005-07-20 | 2010-01-26 | Avaya Inc. | Telephony extension attack detection, recording, and intelligent prevention |
US8621604B2 (en) * | 2005-09-06 | 2013-12-31 | Daniel Chien | Evaluating a questionable network communication |
US20070118750A1 (en) * | 2005-10-27 | 2007-05-24 | The Go Daddy Group, Inc. | Authenticating a caller initiating a communication session |
US7813482B2 (en) * | 2005-12-12 | 2010-10-12 | International Business Machines Corporation | Internet telephone voice mail management |
-
2007
- 2007-03-02 EP EP07726586A patent/EP1994734A1/de not_active Ceased
- 2007-03-02 WO PCT/EP2007/051989 patent/WO2007101821A1/de active Application Filing
- 2007-03-02 US US12/281,935 patent/US20090202061A1/en not_active Abandoned
- 2007-03-02 CN CNA2007800078907A patent/CN101461224A/zh active Pending
Patent Citations (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
WO2004099905A2 (en) * | 2003-05-05 | 2004-11-18 | Mailfrontier, Inc. | Message handling with selective user participation |
Non-Patent Citations (1)
Title |
---|
See also references of WO2007101821A1 * |
Also Published As
Publication number | Publication date |
---|---|
US20090202061A1 (en) | 2009-08-13 |
CN101461224A (zh) | 2009-06-17 |
WO2007101821A1 (de) | 2007-09-13 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
LU101105B1 (de) | Verfahren zur automatisierten Erstellung eines an eine vorgegebene Person gerichteten Phishing-Dokuments | |
DE60306186T2 (de) | Verfahren und system zur anordnung von dienste in einer webdienstarchitektur | |
DE602004004321T9 (de) | Vorrichtung und Verfahren zur Echtzeitbeurteilung einer Netzverwaltungsregel | |
DE602005002340T2 (de) | Entdeckung von unerwünschten elektronischen Nachrichten (Spam) | |
DE102005029287B4 (de) | Verfahren zum Unterbinden einer Vermittlung von unerwünschten Telefonanrufen | |
DE69815819T2 (de) | Adaptives verteiltes informationsnetzwerk | |
EP1178409A1 (de) | Cookiemanager zur Kontrolle des Cookietransfers in Internet-Client-Server Computersystem | |
DE102006047499A1 (de) | Datenerweiterbarkeit mit Hilfe externer Datenbanktabellen | |
EP1926081A1 (de) | Verfahren zur Dialoganpassung und Dialogsystem zur Durchführung | |
EP1994734A1 (de) | Verfahren zum identifizieren von spit oder spam für voip | |
DE60108680T2 (de) | Dynamische Regelsätze für erzeugte Logbücher in einem Netz | |
EP3629567A1 (de) | Verfahren zur automatisierten unterdrückung von spam-telefonanrufen | |
EP1783631A1 (de) | Suchergebnis Ranking mittels Relevance Feedback | |
EP1211588A1 (de) | Verfahren zum Nutzen einer Datenverarbeitungsanlage abhängig von einer Berechtigung, zugehörige Datenverarbeitungsanlage und zugehöriges Programm | |
DE10210553B4 (de) | Verfahren zum automatischen Klassifizieren eines Textes durch ein Computersystem | |
EP1109370A2 (de) | Vorrichtung and Verfahren zum individuellen Filtern von über ein Netzwerk übertragener Informationen | |
DE102012102399B4 (de) | Verfahren und Telekommunikationsanordnung zur Bereitstellung von Daten an einem Client-Computer | |
DE102019005545A1 (de) | Verfahren zum Betreiben eines Maschinendatenkommunikationsnetzwerks, sowie Maschinendatenkommunikationsnetzwerk | |
DE102004061512A1 (de) | Verfahren, Vorrichtung und Routing-Maschine zum automatisierten Ermitteln einer Bearbeitungsinstanz | |
EP3494507B1 (de) | Verfahren zur prüfung der verfügbarkeit und integrität eines verteilt gespeicherten datenobjekts | |
DE19857336C1 (de) | Verfahren zur Erfassung des Nutzungsverhaltens eines Teilnehmers im Internet/Intranet | |
WO2002037351A2 (de) | Verfahren zur verknüpfung von unterschiedlichen zielgruppen sowie ein geeignetes system hierfür | |
DE102009053585A1 (de) | System zur automatischen Erstellung von Aufgabenlisten | |
DE60202858T2 (de) | Installation von softwareanwendungen in einem endgerät | |
DE102004014414A1 (de) | Verfahren und System zur wissensbasierten Sprechererkennung |
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: 20081006 |
|
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 MT NL PL PT RO SE SI SK TR |
|
DAX | Request for extension of the european patent (deleted) | ||
RAP1 | Party data changed (applicant data changed or rights of an application transferred) |
Owner name: SIEMENS AKTIENGESELLSCHAFT |
|
17Q | First examination report despatched |
Effective date: 20160219 |
|
RAP1 | Party data changed (applicant data changed or rights of an application transferred) |
Owner name: NOKIA SIEMENS NETWORKS GMBH & CO.KG |
|
17Q | First examination report despatched |
Effective date: 20160322 |
|
RAP1 | Party data changed (applicant data changed or rights of an application transferred) |
Owner name: NOKIA SOLUTIONS AND NETWORKS GMBH & CO. KG |
|
REG | Reference to a national code |
Ref country code: DE Ref legal event code: R003 |
|
STAA | Information on the status of an ep patent application or granted ep patent |
Free format text: STATUS: THE APPLICATION HAS BEEN REFUSED |
|
18R | Application refused |
Effective date: 20191126 |