(51) Int Cl.: H04L 12/00 ( )

Save this PDF as:
 WORD  PNG  TXT  JPG

Size: px
Start display at page:

Download "(51) Int Cl.: H04L 12/00 (2006.01)"

Transcription

1 (19) (11) EP B1 (12) EUROPEAN PATENT SPECIFICATION (4) Date of publication and mention of the grant of the patent: Bulletin 11/0 (21) Application number: (22) Date of filing: (1) Int Cl.: H04L 12/00 (06.01) (86) International application number: PCT/IB07/00390 (87) International publication number: WO 08/07167 ( Gazette 08/26) (4) METHOD AND APPARATUS FOR DETECTING VOCAL DATA FLOW IN A PACKET DATA FLOW VERFAHREN UND VORRICHTUNG ZUR DETEKTION DES VOKALDATENFLUSSES IN EINEM PAKETDATENFLUSS MÉTHODE ET APPAREIL DE DÉTECTION D UN FLUX DE DONNÉES VOCALES DANS UN FLUX DE DONNÉES DE PAQUET (84) Designated Contracting States: 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 () Priority: IT MI (43) Date of publication of application: Bulletin 09/47 (73) Proprietors: Vodafone Group PLC Newbury Berkshire RG14 2FN (GB) Politecnico di Torino 129 Torino (IT) Vodafone Omnitel N.V. 094 Corsico Milano (IT) (72) Inventors: PERINO, Massimo 0 Ivrea (TO) (IT) MELLIA, Marco 129 Torino (TO) (IT) ROSSI, Dario 129 Torino (TO) (IT) MEO, Michela 129 Torino (TO) (IT) (74) Representative: Keston, David Arthur Vodafone Group Services Ltd. Group Legal (Patents) Vodafone House The Connection Newbury Berkshire RG14 2FN (GB) (6) References cited: MOORE A W ET AL: "Internet Traffic Classification Using Bayesian Analysis Techniques" SIGMETRICS 0 / PERFORMANCE EVALUATION REVIEW.INTERNATIONAL CONFERENCE ON MEASUREMENT AND MODELING OF COMPUTER SYSTEMS. PROCEEDINGS. BANFF, ALBERTA, CANADA, JUNE 6 -, 0; [PROCEEDINGS OF THE ACM SIGMETRICS INTERNATIONAL CONFERENCE ON MEASUREME, 6 June 0 ( ), pages 0-60, XP ISBN: SUH K ET AL: "Characterizing and Detecting Skype-Relayed Traffic" INFOCOM 06. 2TH IEEE INTERNATIONAL CONFERENCE ON COMPUTER COMMUNICA TIONS. PROCEEDINGS, IEEE, PI, 1 April 06 ( ), pages 1-12, XP ISBN: EP B1 Note: Within nine months of the publication of the mention of the grant of the European patent in the European Patent Bulletin, any person may give notice to the European Patent Office of opposition to that patent, in accordance with the Implementing Regulations. Notice of opposition shall not be deemed to have been filed until the opposition fee has been paid. (Art. 99(1) European Patent Convention). Printed by Jouve, 7001 PARIS (FR)

2 Description [0001] The present invention concerns a method for detecting vocal data flow in a packet data flow. The problem of detecting vocal data flow in a packet data flow or voice traffic in traffic on an IP network is known in the current state of the art. [0002] This problem is known in particular with reference to VoIP telephony wherein a vocal communication is established on an IP network between two users. A typical example of software that generates vocal data flow on an IP network is Skype. [0003] The protocols and algorithms that enable Skype, like most vocal programmes, to generate vocal data flow on an IP network, are known and encrypted. [0004] For this reason it is very difficult to detect the presence of vocal data flow, such as Skype, in an aggregate data flow comprising flows of various types: vocal, data, video, etc. [000] The above situation demonstrates a need to be able to detect the presence of vocal data flow in a packet data flow when the protocols and algorithms used to generate the vocal data flow are not known, and to include this vocal flow in the packet data flow. [0006] Previous attempts to detect the presence of vocal data flow in aggregate packet data flow include the systems described in "Characterizing and Detecting Skype-Related traffic" (SUH, et al.) and "internet traffic classification using basic analysis techniques" (MOORE, et al.) [0007] In view of the state of the art described, the object of the present invention is to devise a method and apparatus for identifying vocal data flow in a packet data flow which is capable of overcoming the drawbacks that exist in the known art. [0008] According to the present invention, this object is achieved by a method for identifying vocal data flow in a packet data flow according to claim 1. [0009] According to a further aspect, this object is achieved by an apparatus for identifying vocal data flow in a packet data flow according to claim 11. [00] Thanks to the present invention it is possible to obtain a method and an apparatus capable of detecting vocal data flow in an aggregate flow on an IP network by using a simple technique. [0011] Further features and advantages of the method and apparatus According to the present invention will emerge from the following description of a preferred embodiment, given by way of example and in no way limiting, and with reference to the accompanying drawings, in which: - Figure 1 shows an explanatory schematic diagram of the method of detecting vocal data flow in a packet data flow according to the present invention, - Figure 2 shows likelihood functions used in an embodiment of the method according to the present invention, - Figures 3 and 4 show belief distributions obtained during the method described in the present invention, - Figure shows a block diagram of an apparatus for detecting vocal data flow in a packet data flow according to the present invention. [0012] In the course of the present description, the likelihood or belief function used in the Naive Bayes Classifier technique shall be adopted. The Naive Bayes Classifier technique will now be described in order to make the following description of the invention clearer. [0013] The Naive Bayes Classifier (NBC) technique is based on Bayes Theorem. In fact, it treats the observation of an object that can be described by a plurality of observable or measurable quantities, referred to in the present invention as measurable variables. [0014] Given a measurable variable X of an object under observation, we can obtain different samples of the variable X, which can be described by means of the vector x=[x i ], in which x i is the i th value of the measured variable X. What is pertinent as regards the present invention is determining the probability P{C x} that the object belongs to a Class C having observed or measured a sequence of values x of the measurable variable X. The NBC technique is thus based on an a priori knowledge of the probability P{x C} in order to determine the a posteriori probability P{C x}, in which 0 [00] The NBC technique is based on the theory that the measured values x i of the variable X are independent so that 2

3 [0016] In some cases, instead of estimating the probability P{C x}, it is possible to find out the likelihood that the object belongs to class C rather than to other classes, so that a criterion of maximum likelihood can be used in which P{C x} P{x C}. P{x C} is referred to in literature as likelihood or belief. The greater the belief for a given class, the greater the probability that the object belongs to that given class. [0017] In order to detect the presence of vocal data flow in a packet data flow it is necessary to identify a number of measurable variables of the packet data flow and calculate the belief that each variable belongs to a vocal data flow. [0018] The packet data flow is divided into packet blocks w (k), each block w comprising a predefined number of packets. [0019] With reference to the accompanying Figures, the method for detecting the vocal data flow in a packet data flow comprises the steps of a) providing, for each measurable variable X, Y at least one function P{x C}, P{y C} representative of the distribution of the values of the respective variable X, Y in a vocal data flow, b) measuring, for each block w (k) of a predefined number K of blocks of packet data flow, at least one value x, y of each variable X, Y in order to obtain, for each variable X, Y, a sequence of measured values x (k), y (k) on the predefined number K of blocks; c) applying, for each variable X, Y, each measured value x (k), y (k) of the sequence of measured values of the variable to the respective distribution function P{x C}, P{y C} in order to generate a sequence of likelihood values 2 d) processing, for each variable X, Y, the respective sequence of likelihood values in order to generate the respective average likelihood value E[B x ], E [B y ] on the predefined number K of blocks, e) processing the average likelihood values E [B x ], E [B y ] generated for each X, Y variable in order to generate a reference likelihood value B ; f) comparing the reference likelihood value B with a threshold likelihood value B min in order to detect the presence of vocal data flow in the predefined number K of blocks of the packet data flow to be analysed. 3 [00] In particular, the presence of vocal data flow is detected when the reference likelihood value B is greater than the threshold likelihood value B min. [0021] Advantageously, the processing step e) includes the step of calculating the minimum value min (E[B x ],E[B y ]) of the average likelihood values E[B x ], E[B y ] generated for each variable X, Y in order to generate the reference likelihood value B. [0022] In order to provide the distribution function of each measurable variable X, Y, step a) includes the steps of: al) providing a packet vocal data flow; a2) measuring, for each variable X, Y, the values of the variable in the packet vocal data flow in order to obtain the distribution function of the variable P{x C}, P{y C}. [0023] If the vocal data flow is generated by a plurality of voice codecs and the values assumed by at least one variable X depend on the voice codec, step a) of the method includes, for the purpose of providing the distribution function of this measurable variable X, the steps of: 4 a1) providing a plurality of packet vocal data flows, each flow being generated by one respective voice codec of the plurality of voice codecs; a2) measuring, for at least one variable X, the values of the variable X in each packet vocal data flow in order to obtain the distribution function P j {x C} of the variable X for each voice codec j. 0 [0024] If each voice codec has a plurality of operating configurations, step a2) includes the measurement step, for at least one variable X, for each operating configuration of each voice codec, of the values of the variable X in each packet vocal data flow in order to obtain a distribution function of the variable X for each operating configuration of each voice codec j. [002] In the above-mentioned case, the successive steps c) and d) are performed for at least one variable X and for each codec (j) in order to generate an average likelihood value [0026] In particular, step c) includes the steps of: for each codec. 3

4 c1) applying each measured value of the sequence of measured values of at least one variable X depending on the voice codec to the distribution function of each operating configuration of the respective voice codec in order to generate a plurality of likelihood values, and c2) calculating, for each measured value of the sequence of measured values, the maximum of the plurality of likelihood values in order to generate the sequence of likelihood values steps of: In this case, step d) includes the d1) processing for at least one variable X and for each codec j, the respective sequence of likelihood values in order to generate the respective average likelihood value d2) processing the average likelihood values generated for each codec for at least one variable [0027] X in order to generate the average likelihood value E [B x ] on the predefined number K of blocks. According to a preferred embodiment and as shown in the example given below, step d2) includes the step of calculating the maximum of the average likelihood values generated for each codec E[B x ] on the predefined number K of blocks, where in order to generate the average likelihood value 2 [0028] The method of the present invention also enables the maximum likelihood codec to be found. For this purpose, a step is included that involves finding the codec j associated with the maximum of the likelihood values 3 generated for each codec j, this codec j representing the maximum likelihood voice codec of the vocal data flow. [0029] With reference to Figure 1, there now follows a description of the application of the method according to the invention in order to detect Skype vocal data flow in a packet data flow. [00] As Skype is a closed and proprietary programme, it is not possible to decode a data flow generated by Skype in order to detect the presence of vocal data flow. [0031] According to the method of the present invention, at least two measurable variables of a packet data flow must be selected. Advantageously, the measurable variables chosen must be capable of differentiating Skype vocal flow from normal Internet flow on an IP network. [0032] Considering the nature of voice communication in real time, a Skype flow will generate a low-rate bit flow lasting a few tenths of a second and comprising a high number of brief messages, the size of which depends on the sampling rate of the codec and the period of time that elapses between two consecutive messages belonging to the same data flow. By contrast, a data flow tends to have long messages and high bit rates. [0033] Consequently, the following measurable variables have been chosen: 4 - size of the message, or length of the payload incorporated into the transport level protocol packet. In particular, a window or packet block of messages w is considered and for each message the size of the packet is measured. This therefore gives: 0 in which s i is the size of the message of the i th packet of a window of consecutive packets w. Since the size of the message depends heavily on the specific codec, a distribution function for each of the codecs supported by Skype is required; - the average inter-packet gap (IPG), regarded as the interval of time between the instant at which the first packet and the w th packet are received within a window or packet block. This therefore gives: 4

5 [0034] In this case, there is only one classifier or distribution function since the average IPG is independent of the codec used. [003] In order to optimise numeric and normalisation calculations, B s is defined as the belief of the message size variable and B τ is defined as the belief of the average IPG variable, where and 2 3 [0036] It is helpful to remember that the logarithmic operator has been inserted only for the purposes of numeric calculation since the values of the functions P{s i C}, P{τ C} are extremely small while their logarithm enables easier management on the level of numeric calculation. [0037] It should also be noted that the above-mentioned measurable variables have been chosen as variables in a reduced window of samples, so as to compensate for the effect of the high variability of the flow. For the choice of the value w of windows, it has been found that its value has no influence on the final calculation for values greater than. In the example described below, w has been set at which roughly corresponds to a window of 1 second. [0038] A Skype flow source is then provided and the message size variable in the Skype flow is measured in order to obtain the distribution of the values of the message size variable for each codec. As is known, a codec can operate at different operating points that correspond to different settings of various parameters of the codec, for example the rate of sampling, the size of the header, the redundancy factor and the message framing time. For each combination of values of the above-mentioned parameters, the distribution of the message size is represented by a Gaussian curve N (, σ) where is the average value and σ is the standard deviation. [0039] Figure 2 shows an example of message size distribution curves for various operating points of ISAC and G. 729 codecs. Each Gausssian curve represents an operating point of the codec, or one class as regards the NBC technique. [00] The same method is adopted to find the distribution curve of the average IPG values, represented by a Gaussian curve with an average value of equal to the framing time T and standard deviation σ =3 regardless of the codec. [0041] Subsequently, having taken a data flow to be analysed, the values of the two variables chosen, the message size and the average IPG, are measured Message size 4 [0042] The message size is measured for each measurement window w. In each window w, for each codec j, the message size is measured and this value is applied to the distribution functions of the message size and the maximum is chosen as a belief value between the class C beliefs of the distribution curves, or the different operating 0 points of the j th codec. This maximum value is indicated by [0043] By repeating this measurement on all of the windows, a belief sequence is generated for each codec. [0044] The belief value of the flow for the codec j is obtained by calculating the average value on k of belief of the codec j, which gives

6 [004] In order to find the average belief E[B s ] for the message size variable, the maximum is calculated between the beliefs which gives [0046] The maximum likelihood codec is therefore the codec j associated with Max B s or [0047] Basically, first and foremost the temporal trend of the beliefs for each codec is obtained and then the average value for each codec is calculated so as to obtain the belief value of each codec. In this way, it is possible to determine which codec has the greatest belief or the maximum likelihood. Average IPG [0048] The same procedure applies to the average IPG except that the average IPG value is independent of the 2 codecs used. For each window k, belief is obtained. The belief value of the flow is obtained by calculating the temporal average so as to obtain the average belief value E [B τ ], where [0049] In order to decide whether the flow has been generated by Skype, the classifiers of the message size and the average IPG are found by calculating the minimum B of the average beliefs E[B s ], E[B τ ], where represents the reference belief value. [000] Lastly, value B of the reference belief value is compared with a threshold belief value B min in order to determine whether the flow is a Skype flow. [001] Various experiments have been carried out to analyse the impact of the threshold belief value B min. [002] The experiments performed have shown that the distribution of the belief value has a "knee" region in which the derivative before distribution shifts from very low values to values tending to infinity (Figures 3 and 4). This region greatly simplifies the setting of the threshold belief value B min. [003] With reference to Figures 3 and 4, the continuous line represents belief E [B s ], while the dotted line represents belief E [B τ ] for two different codecs, namely ISAC codec and G.729 codec. [004] The present invention also concerns an apparatus for detecting vocal data flow in a packet data flow divided into packet blocks w (k), each block w comprising a predefined number of packets (Figure ). [00] The apparatus comprises storage means 11 capable of providing, for each measurable variable X, Y, at least one, function P{x C} P{y C} representative of the distribution of the values of the respective variable X, Y in a vocal data flow. [006] The apparatus also comprises measuring means 12 capable of receiving packet data flow in order to measure, for each block w (k) of a predefined number K of blocks of packet data flow, at least one value x, [007] y of each variable X, Y so as to obtain, for each variable X, Y, a sequence of x (k) y (k) measured values for the predefined number K of blocks. [008] The apparatus also comprises processing means 13 connected to the storage means 11 and the measuring means 12 and capable of: 6

7 - applying, for each variable X, Y, each measured value x (k) y (k) of the sequence of measured values of the variable at the respective distribution function P{x C}, P{y C} in order to generate a sequence of likelihood values 2 - processing, for each variable X, Y, the respective sequence of likelihood values in order to generate the respective average likelihood value E[B x ], E[By] on said predefined number K of blocks, and - processing the average likelihood values E[B x ], E[B y ] generated for each variable X, Y in order to generate a reference likelihood value B. [009] Lastly, the apparatus comprises comparison means 14 connected to the processing means 13 and capable of comparing the reference likelihood value B with a likelihood threshold value B min so as to detect the presence of vocal data flow in packet data flow, particularly in the predefined number K of blocks. In the embodiment, likelihood threshold value B min is stored in the storage means 11. Alternatively this threshold value can be stored in other storage means connected to the comparison means 14. [0060] Depending on the comparison, the comparison means 14 are capable of generating a value on the basis of which it is possible to establish whether vocal data flow is present in packet data flow, particularly in the predefined number K of blocks. [0061] Advantageously, the processing means 13 are capable of calculating the minimum of the average likelihood values E[B x ], E[B y ] generated for each variable X, Y in order to generate the reference likelihood value B. [0062] If the vocal data flow is generated by a plurality of voice codecs j and at least one variable X is dependent on the voice codec, the storage means 11 provide the distribution function P j {x C} of the variable X for the respective voice codec j. [0063] More particularly, when each voice codec j has a plurality of operating configurations, the storage means 11 provide a distribution function of the variable X for each operating configuration of the respective voice codec j. [0064] In this case, the processing means 13 are capable of: - applying each measured value of the sequence of measured values of at least one variable X dependent on the voice codec to the distribution function of each operating configuration of the respective voice codec in order to generate a plurality of likelihood values, and - calculating, for each measured value of the sequence of measured values, the maximum of the plurality of likelihood values in order to generate the sequence of likelihood values 3 [006] Furthermore, the processing means 13 are capable of: - processing, for at least one variable X and for each codec j, the respective sequence of likelihood values in order to generate the respective average likelihood value and - processing the average likelihood values generated for each codec for at least one variable X in order to generate the average likelihood value E[B x ] on the predefined number K of blocks. 4 [0066] In particular, the processing means 13 are capable of calculating the maximum of the average likelihood values generated for each codec in order to generate the average likelihood value E[B x ] on the predefined number K of blocks, where as defined above by relation (3). 0 [0067] The apparatus also enables the maximum likelihood codec to be found. For this purpose, the processing means 13 are capable of finding the codec j associated with the maximum of the likelihood values generated for each codec j, this codec j representing the maximum likelihood voice codec of the vocal data flow. [0068] With reference to the embodiment shown in the accompanying Figures, the measuring means 12 of the apparatus comprise first measuring means 12a capable of measuring the message size and second measuring means 12b capable of measuring the average IPG. [0069] The output signal from the first measuring means 12a is split by a demultiplexer and sent to a plurality of 7

8 likelihood calculation blocks 16a, 16b, 16c, one for each codec j, each representing an NBC. [0070] The probability distribution functions P j {s i C} of the message size variable of each codec j are stored in the storage means 11 connected to each likelihood calculation block 16a, 16b, 16c. [0071] The likelihood calculation blocks 16a, 16b, 16c apply to each message size measurement value input into the respective probability distribution functions P j {s i C} of the message size of the respective codec j. [0072] The output values from the likelihood calculation blocks 16a, 16b, 16c are input into the respective maximum calculation blocks 17a, 17b, 17c which calculate as belief value the maximum among the class C beliefs of the distribution curves P j {s i C}. [0073] The belief values are then input into the respective average value calculation blocks 18a, 18b, 18c which calculate the average value on k of the beliefs of each codec j. The calculation blocks 18a, 18b, 18c will therefore output values [0074] In order to find the average belief E[B s ] for the message size variable, the apparatus comprises a calculation block 19 capable of calculating the maximum value between the beliefs output from the calculation blocks 18a, 18b, 18c from which is obtained. [007] The calculation block 19 also enables the maximum likelihood codec to be determined, that is the codec j 2 associated with the Max B s, or the codec j that satisfies the relation [0076] The probability distribution functions P{τ C} of the average IPG variable are stored in the storage means 11. [0077] The apparatus also comprises a likelihood calculation block 16d into which the average IPG values measured by the second measuring means 12b are input thereby, such calculation block 16d representing an NBC. [0078] The values output by the likelihood calculation block 16d are input into a maximum calculation block 17d which calculates as belief value the maximum among the class C beliefs of the probability distribution curves P{τ C}. 3 [0079] The belief values are then input into an average value calculation block 18d which calculates the average value on k of the beliefs Calculation block 18d will therefore output the average value of belief E[B τ ], where 4 0 [0080] In order to decide whether the flow has been generated by Skype, the output of the calculation block 18d, or the average value of belief E [B τ ], and the output of calculation block 19, or the average belief value E[B s ], are input into a calculation block 21 which calculates the minimum B of the average beliefs E[B s ], E[B τ ], where B = min(e[b s ],E[B τ ]) represents the reference belief value. [0081] This reference belief value B is then compared by the comparator 14 with a threshold belief value B min to establish whether the flow is a Skype flow. [0082] As can be appreciated from the above description, the method according to the present invention makes it possible to meet the requirements and to overcome the drawbacks referred to in the introductory part of the present description with reference to the known art. [0083] In particular, the method and the apparatus according to the invention make it possible to detect the presence of any type of vocal flow, even if it is encrypted. [0084] Clearly, an expert in the field, in order to meet contingent and specific requirements, may make numerous modifications and variations to the method and apparatus according to the above-described invention, all being contained, however, within the scope of protection of the invention as defined by the following claims. 8

9 Claims 1. Method for detecting vocal data flow in a packet data flow, said packet data flow being divided into packet blocks (w (k) ) each block (w) comprising a predefined number of packets, said data flow having at least two measurable variables (X,Y), a first of said measurable variables (X) being the message size and a second of said measurable variables (Y) being the average inter-packet gap, said method being characterised in that it includes the steps of: a) providing, for each measurable variable (X,Y), at least one function (P{x C}, P{y C}) representative of the distribution of the values of the respective variable (X, Y) in a vocal data flow; b) measuring, for each block (w (k) ) of a predefined number (K) of blocks of said packet data flow, at least one value (x, y) of each variable (X, Y) in order to obtain, for each variable (X, Y), a sequence of measured values (x (k), y (k) ) on the predefined number (K) of blocks; c) applying, for each variable (X, Y), each measured value (x (k), y (k) ) of the sequence of measured values of the variable to the respective distribution function (P{x C}, P{y C}) in order to generate a sequence of likelihood values d) processing, for each variable (X, Y), the respective sequence of likelihood values in order 2 to generate the respective average likelihood value (E[B x ], E[B y ]) on said predefined number (K) of blocks; e) processing the average likelihood values (E[B x ], E[B y ]) generated for each variable (X, Y) in order to generate a reference likelihood value ( B ), the reference likelihood value ( B )being generated by calculating the minimum of the average likelihood values ( E [B x ], E[B y ]) generated for each variable (X, Y); and f) comparing said reference likelihood value ( B ) with a threshold likelihood value (B min ) in order to detect the presence of vocal data flow in the predefined number (K) of blocks of said packet data flow. 2. Method according to claim 1, wherein the presence of vocal data flow is detected when said reference likelihood value ( B ) is greater than said threshold likelihood value (B min ). 3. Method according to any one of claims 1 to 2, wherein said step a) of providing at least one distribution function includes the steps of: 3 a1) providing a packet vocal data flow, a2) measuring, for each measurable variable (X,Y), the values of the variable in said packet vocal data flow in order to obtain the distribution function of the variable (P{x C}, P{y C}). 4. Method according to any one of claims 1 to 2, wherein said vocal data flow is generated by a plurality of voice codecs (j), at least one variable (X) being dependent on the voice codec, said step a) of providing at least one distribution function includes the steps of: 4 0 a1) providing a plurality of packet vocal data flows, each flow being generated by one respective voice codec of the plurality of voice codecs, a2) measuring, for at least one variable (X), the values of the variable (X) in each packet vocal data flow in order to obtain the distribution function (P j {x C}) of the variable (X) for each voice codec.. Method according to claim 4, wherein each voice codec has a plurality of operating configurations, said step a2) including the measurement step, for at least one variable (X), for each operating configuration of each voice codec, of the values of the variable (X) in each packet vocal data flow in order to obtain a distribution function of the variable (X) for each operating configuration of each voice codec (j). 6. Method according to either claim 4 or claim, wherein said steps c) and d) are performed for at least one variable (X) and for each codec (j) in order to generate an average likelihood value for each codec (j). 7. Method according to any one of claims 4 to 6, wherein said step c) includes the steps of: c1) applying each measured value of the sequence of measured values of at least one variable depending on 9

10 the voice codec to the distribution function of each operating configuration of the respective voice codec in order to generate a plurality of likelihood values; c2) calculating, for each measured value of the sequence of measured values, the maximum of the plurality of likelihood values in order to generate the sequence of likelihood values 8. Method according to claim 7, wherein said step d) includes the steps of: d1) processing, for at least one variable (X) and for each codec (j), the respective sequence of likelihood values in order to generate the respective average likelihood value d2) processing the average likelihood values generated for each codec for said at least one variable (X) in order to generate the average likelihood value (E[B x ]) on said predefined number (K) of blocks. 9. Method according to claim 8, wherein said step d2) includes the step of calculating the maximum of the average likelihood values generated for each codec in order to generate the average likelihood value (E[B x ]) on said predefined number (K) of blocks.. Method according to claim 9, including furthermore the step of finding the codec (j) associated with the maximum 2 of the likelihood values (E[B x ]) generated for each codec likelihood voice codec of said vocal data flow. said codec (j) representing the maximum Apparatus () for detecting the vocal data flow in a packet data flow, said packet data flow being divided into packet blocks (w (k) ) each block ( w ) comprising a predefined number of packets, said data flow having at least two measurable variables (X,Y), a first of said measurable variables (X) being the message size and a second of said measurable variables (Y) being the average inter-packet gap, said apparatus () being characterised in that it includes: - storage means (11) capable of providing, for each measurable variable (X,Y), at least one function (P{x C}, P {y C}) representative of the distribution of the values of the respective variable (X,Y) in a vocal data flow, - measuring means (12) capable of receiving said packet data flow in order to measure, for each block (w (k) ) of a predefined number (K) of blocks of said data flow, at least one value (x,y) of each variable (X,Y) so as to obtain, for each variable (X,Y), a sequence of measured values (x (k), y (k) ) for the predefined number (K) of blocks, - processing means (13) connected to said storage means (11) and to said measuring means (12) and capable of: - applying, for each variable (X,Y), each measured value (x (k), y (k) ) of the sequence of measured values of the variable at the respective distribution function (P{x C}, P{y C}) in order to generate a sequence of likelihood values 4 - processing, for each variable (X,Y), the respective sequence of likelihood values in order to generate the respective average likelihood value (E[B x ], E[B y ]) on said predefined number (K) of blocks, - processing the average likelihood values (E[B x ], E[B y ]) generated for each variable (X,Y) in order to generate a reference likelihood value (B), the reference likelihood value (B) being generated by calculating the minimum of the average likelihood values (E[B x ], E[B y ]) generated for each variable (X, Y), 0 and - comparison means (14) connected to said processing means (13) and capable of comparing said reference likelihood value ( B ) with a likelihood threshold value (B min ) so as to detect the presence of vocal data flow in said packet data flow. 12. Apparatus () according to claim 11, wherein said vocal data flow is generated by a plurality of voice codecs (j) and at least one variable (X) is dependent on the voice codec, said storage means 11 being capable of providing the distribution function (P j {x C}) of at least one variable (X) for each voice codec (j).

11 13. Apparatus () according to claim 12, wherein each voice codec (j) has a plurality of the operating configurations, the storage means (11) being capable of providing a distribution function of at least one variable (X) for each operating configuration of each voice codec (j). 14. Apparatus () according to claim 13, wherein said processing means (13) are capable of: - applying each measured value of the sequence of measured values of at least one variable (X) depending on the voice codec to the distribution function of each operating configuration of the respective voice codec (j) in order to generate a plurality of likelihood values, and - calculating, for each measured value of the sequence of measured values, the maximum of the plurality of likelihood values in order to generate the sequence of likelihood values. Apparatus () according to claim 14, wherein said processing means (13) are capable of: - processing, for at least one variable (X) and for each codec (j), the respective sequence of likelihood values in order to generate the respective average likelihood value and - processing the average likelihood values generated for each codec for at least one variable (X) in order to generate the average likelihood value (E[B x ]) on the predefined number (K) of blocks. 16. Apparatus () according to claim, wherein said processing means (13) are capable of calculating the maximum 2 of the average likelihood values generated for each codec value (E[B x ]) on said predefined number (K) of blocks. in order to generate the average likelihood 17. Apparatus () according to claim 16, wherein said processing means (13) are capable of finding the codec (j) associated with the maximum of the likelihood values generated for each codec (j), this codec (j) representing the maximum likelihood voice codec of the vocal data flow. 3 Patentansprüche 1. Verfahren zur Detektion eines Vokaldatenflusses in einem Paketdatenfluss, wobei der genannte Paketdatenfluss in Paketblöcke (w (k) ) unterteilt ist, wobei jeder Block (w) eine vordefinierte Anzahl von Paketen umfasst, wobei der genannte Datenfluss wenigstens zwei messbare Variablen (X, Y) hat, wobei eine erste der genannten messbaren Variablen (X) die Nachrichtengröße und eine zweite der genannten messbaren Variablen (Y) der durchschnittliche Abstand zwischen Paketen ist, wobei das genannte Verfahren dadurch gekennzeichnet ist, dass es die folgenden Schritte beinhaltet: 4 0 a) Bereitstellen, für jede messbare Variable (X, Y), wenigstens einer Funktion (P{x C}, (P{y C}), die für die Verteilung der Werte der jeweiligen Variablen (X, Y) in einem Vokaldatenfluss repräsentativ ist; b) Messen, für jeden Block (w (k) ) einer vordefinierten Anzahl (K) von Blöcken des genannten Paketdatenflusses, wenigstens eines Wertes (x, y) jeder Variablen (X, Y), um für jede Variable (X, Y) eine Folge von Messwerten (x (k), y (k) ) über die vordefinierte Anzahl (K) von Blöcken zu erhalten; c) Anwenden, für jede Variable (X, Y), jedes Messwertes (x (k), y (k) ) der Folge von Messwerten der Variablen, auf die jeweilige Verteilungsfunktion (P{x C}, P{y C}), um eine Folge von Wahrscheinlichkeitswerten (B x (k), B y (k) ) zu erzeugen; d) Verarbeiten, für jede Variable (X, Y), der jeweiligen Folge von Wahrscheinlichkeitswerten (B x (k), B y (k) ), um den jeweiligen durchschnittlichen Wahrscheinlichkeitswert (E[B x ], E[B y ]) über die genannte vordefinierte Anzahl (K) von Blöcken zu erzeugen; e) Verarbeiten der für jede Variable (X, Y) erzeugten durchschnittlichen Wahrscheinlichkeitswerte (E[B x ], E [B y ]), um einen Referenzwahrscheinlichkeitswert (B) zu erzeugen, wobei der Referenzwahrscheinlichkeitswert (B) durch Berechnen des Minimums der für jede Variable (X, Y) erzeugten durchschnittlichen Wahrscheinlich- 11

12 keitswerte (E[B x ], E[B y ]) erzeugt wird; und f) Vergleichen des genannten Referenzwahrscheinlichkeitswerts (B) mit einem Schwellenwahrscheinlichkeitswert (B min ), um die Anwesenheit eines Vokaldatenflusses in der vordefinierten Anzahl (K) von Blöcken des genannten Paketdatenflusses zu detektieren. 2. Verfahren nach Anspruch 1, wobei die Anwesenheit eines Vokaldatenflusses dann detektiert wird, wenn der genannte Referenzwahrscheinlichkeitswert (B) größer ist als der genannte Schwellenwahrscheinlichkeitswert (B min ). 3. Verfahren nach einem der Ansprüche 1 bis 2, wobei der genannte Schritt a) des Bereitstellens von wenigstens einer Verteilungsfunktion die folgenden Schritte beinhaltet: 2 3 a1) Bereitstellen eines Paketvokaldatenflusses, a2) Messen, für jede messbare Variable (X, Y), der Werte der Variablen in dem genannten Paketvokaldatenfluss, um die Verteilungsfunktion der Variablen (P{x C}, P{y C}) zu erhalten. 4. Verfahren nach einem der Ansprüche 1 bis 2, wobei der genannte Vokaldatenfluss durch mehrere Sprachcodecs (j) erzeugt wird, wobei wenigstens eine Variable (X) von dem Sprachcodec abhängig ist und wobei der genannte Schritt a) des Bereitstellens von wenigstens einer Verteilungsfunktion die folgenden Schritte beinhaltet: a1) Bereitstellen mehrerer Paketvokaldatenflüsse, wobei jeder Fluss durch einen jeweiligen Sprachcodec der mehreren Sprachcodecs erzeugt wird, a2) Messen, für wenigstens eine Variable (X), der Werte der Variablen (X) in jedem Paketvokaldatenfluss, um die Verteilungsfunktion (P j {x C}) der Variablen (X) für jeden Sprachcodec zu erhalten.. Verfahren nach Anspruch 4, wobei jeder Sprachcodec mehrere Betriebskonfigurationen hat, wobei der genannte Schritt a2) den Messschritt für wenigstens eine Variable (X), für jede Betriebskonfiguration jedes Sprachcodec, der Werte der Variablen (X) in jedem Paketvokaldatenfluss beinhaltet, um eine Verteilungsfunktion der Variablen (X) für jede Betriebskonfiguration jedes Sprachcodec (j) zu erhalten. 6. Verfahren nach Anspruch 4 oder Anspruch, wobei die genannten Schritte c) und d) für wenigstens eine Variable (X) und für jeden Codec (j) durchgeführt werden, um einen durchschnittlichen Wahrscheinlichkeitswert E[B x (j) ] für jeden Codec (j) zu erzeugen. 7. Verfahren nach einem der Ansprüche 4 bis 6, wobei der genannte Schritt c) die folgenden Schritte beinhaltet: c1) Anwenden jedes Messwertes der Folge von Messwerten von wenigstens einer von dem Sprachcodec abhängigen Variablen auf die Verteilungsfunktion jeder Betriebskonfiguration des jeweiligen Sprachcodec, um mehrere Wahrscheinlichkeitswerte zu erzeugen; c2) Berechnen, für jeden Messwert der Folge von Messwerten, des Maximums der mehreren Wahrscheinlichkeitswerte, um die Folge von Wahrscheinlichkeitswerten (B x (k,j) ) zu erzeugen. 8. Verfahren nach Anspruch 7, wobei der genannte Schritt d) die folgenden Schritte beinhaltet: 4 0 d1) Verarbeiten, für wenigstens eine Variable (X) und für jeden Codec (j), der jeweiligen Folge von Wahrscheinlichkeitswerten (B x (k,j) ), um den jeweiligen durchschnittlichen Wahrscheinlichkeitswert (E[B x (j) ]) zu erzeugen; d2) Verarbeiten der durchschnittlichen Wahrscheinlichkeitswerte, die für jeden Codec (E[B x (j) ]) für die genannte wenigstens eine Variable (X) erzeugt wurden, um den durchschnittlichen Wahrscheinlichkeitswert (E[B x ]) über die genannte vordefinierte Anzahl (K) von Blöcken zu erzeugen. 9. Verfahren nach Anspruch 8, wobei der genannte Schritt d2) den Schritt des Berechnens des Maximums der für jeden Codec (E[B x (j) ]) erzeugten durchschnittlichen Wahrscheinlichkeitswerte beinhaltet, um den durchschnittlichen Wahrscheinlichkeitswert (E[B x ]) auf der genannten vordefinierten Anzahl (K) von Blöcken zu erzeugen.. Verfahren nach Anspruch 9, das ferner den Schritt des Suchens des Codec (j) beinhaltet, der mit dem Maximum der für jeden Codec (E[B x (j) ]) erzeugten Wahrscheinlichkeitswerte (E[B x ]) assoziiert ist, wobei der genannte Codec (j) den maximalen Wahrscheinlichkeits-Sprachcodec des genannten Vokaldatenflusses repräsentiert. 11. Vorrichtung () zum Detektieren des Vokaldatenflusses in einem Paketdatenfluss, wobei der genannte Paketda- 12

13 tenfluss in Paketblöcke (w (k) ) unterteilt ist, wobei jeder Block (w) eine vordefinierte Anzahl von Paketen umfasst, wobei der genannte Datenfluss wenigstens zwei messbare Variablen (X, Y) umfasst, wobei eine erste der genannten messbaren Variablen (X) die Nachrichtengröße und eine zweite der genannten messbaren Variablen (Y) der durchschnittliche Abstand zwischen Paketen ist, wobei die genannte Vorrichtung () dadurch gekennzeichnet ist, dass sie Folgendes umfasst: - Speichermittel (11), um für jede messbare Variable (X, Y) wenigstens eine Funktion (P{x C}, P{y C}) bereitzustellen, die für die Verteilung der Werte der jeweiligen Variablen (X, Y) in einem Vokaldatenfluss repräsentativ ist, - Messmittel (12) zum Empfangen des genannten Paketdatenflusses, um für jeden Block (w (k) ) einer vorbestimmten Anzahl (K) von Blöcken des genannten Datenflusses wenigstens einen Wert (x, y) jeder Variablen (X, Y) zu messen, um für jede Variable (X, Y) eine Folge von Messwerten (x (k), y (k) ) für die vordefinierte Anzahl (K) von Blöcken zu erhalten, - Verarbeitungsmittel (13), die mit dem genannten Speichermittel (11) und dem genannten Messmittel (12) verbunden sind und Folgendes durchführen können: 2 - Anwenden, für jede Variable (X, Y), jedes Messwertes (x (k), y (k) ) der Folge von Messwerten der Variablen an der jeweiligen Verteilungsfunktion (P{x C}, P{y C}), um eine Folge von Wahrscheinlichkeitswerten (B x (k), B y (k) ) zu erzeugen, - Verarbeiten, für jede Variable (X, Y), der jeweiligen Folge von Wahrscheinlichkeitswerten (B x (k), B y (k) ), um den jeweiligen durchschnittlichen Wahrscheinlichkeitswert (E[B x ], E[B y ]) über die genannte vordefinierte Anzahl (K) von Blöcken zu erzeugen, - Verarbeiten der für jede Variable (X, Y) erzeugten durchschnittlichen Wahrscheinlichkeitswerte (E[B x ], E [B y ]), u m einen Referenzwahrscheinlichkeitswert (B) zu erzeugen, wobei der Referenzwahrscheinlichkeitswert (B) durch Berechnen des Minimums der für jede Variable (X, Y) erzeugten durchschnittlichen Wahrscheinlichkeitswerte (E[B x ], E[B y ]) erzeugt wird, 3 und - ein Vergleichsmittel (14), das mit dem genannten Verarbeitungsmittel (13) verbunden ist und den genannten Referenzwahrscheinlichkeitswert ( B ) mit einem Wahrscheinlichkeitsschwellenwert ( B min ) vergleichen kann, um die Anwesenheit eines Vokaldatenflusses in dem genannten Paketdatenfluss zu detektieren. 12. Vorrichtung () nach Anspruch 11, wobei der genannte Vokaldatenfluss durch mehrere Sprachcodecs (j) erzeugt wird und wenigstens eine Variable (X) von dem Sprachcodec abhängig ist, wobei das genannte Speichermittel (11) die Verteilungsfunktion (P j {x C}) von wenigstens einer Variablen (X) für jeden Sprachcodec (j) bereitstellen kann Vorrichtung () nach Anspruch 12, wobei jeder Sprachcodec (j) mehrere der Betriebskonfigurationen hat, wobei das Speichermittel (11) eine Verteilungsfunktion von wenigstens einer Variablen (X) für jede Betriebskonfiguration jedes Sprachcodec (j) bereitstellen kann. 14. Vorrichtung () nach Anspruch 13, wobei das genannte Verarbeitungsmittel (13) Folgendes durchführen kann: - Anwenden jedes Messwertes der Folge von Messwerten von wenigstens einer Variablen (X) je nach dem Sprachcodec auf die Verteilungsfunktion jeder Betriebskonfiguration des jeweiligen Sprachcodec (j), um mehrere Wahrscheinlichkeitswerte zu erzeugen, und - Berechnen, für jeden Messwert der Folge von Messwerten, des Maximums der mehreren Wahrscheinlichkeitswerte, um die Folge von Wahrscheinlichkeitswerten (B x (k,j) ) zu erzeugen. 0. Vorrichtung () nach Anspruch 14, wobei das genannte Verarbeitungsmittel (13) Folgendes durchführen kann: - Verarbeiten, für wenigstens eine Variable (X) und für jeden Codec (j), der jeweiligen Folge von Wahrscheinlichkeitswerten (B x (k,j) ), um den jeweiligen durchschnittlichen Wahrscheinlichkeitswert (E[B x (,j) ]) zu erzeugen, und - Verarbeiten der durchschnittlichen Wahrscheinlichkeitswerte, die für jeden Codec (E[B x (j) ]) für wenigstens eine Variable (X) erzeugt wurden, um den durchschnittlichen Wahrscheinlichkeitswert (E[B x ]) über die vordefinierte Anzahl (K) von Blöcken zu erzeugen. 16. Vorrichtung () nach Anspruch, wobei das genannte Verarbeitungsmittel (13) das Maximum der für jeden Codec 13

14 (E[B x (j) ]) erzeugten durchschnittlichen Wahrscheinlichkeitswerte berechnen kann, um den durchschnittlichen Wahrscheinlichkeitswert (E[B x ]) auf der genannten vordefinierten Anzahl (K) von Blöcken zu erzeugen. 17. Vorrichtung () nach Anspruch 16, wobei das genannte Verarbeitungsmittel (13) den Codec (j) suchen kann, der mit dem Maximum der für jeden Codec (j) erzeugten Wahrscheinlichkeitswerte (E[B x (j) ]) assoziiert ist, wobei dieser Codec (j) den maximalen Wahrscheinlichkeits-Sprachcodec des Vokaldatenflusses repräsentiert. 2 Revendications 1. Procédé pour détecter un flux de données vocales dans un flux de données par paquets, ledit flux de données par paquets étant divisé en blocs de paquets (w (k) ), chaque bloc (w) comprenant un nombre prédéfini de paquets, ledit flux de données ayant au moins deux variables mesurables (X, Y), une première desdites variables mesurables (X) étant la taille du message et une deuxième desdites variables mesurables (Y) étant l espace moyen entre les paquets, ledit procédé étant caractérisé en ce qu il comprend les étapes consistant à : a) fournir, pour chaque variable mesurable (X, Y), au moins une fonction (P{x C}, P{y C}) représentative de la distribution des valeurs de la variable respective (X, Y) dans un flux de données vocales ; b) mesurer, pour chaque bloc (w (k) ) d un nombre prédéfini (K) de blocs dudit flux de données par paquets, au moins une valeur (x, y) de chaque variable (X, Y) afin d obtenir, pour chaque variable (X, Y), une séquence de valeurs mesurées (x (k), y (k) ) sur le nombre prédéfini (K) de blocs ; c) appliquer, pour chaque variable (X, Y), chaque valeur mesurée (x (k), y (k) ) de la séquence de valeurs mesurées de la variable à la fonction de distribution respective (P{x C}, P{y C}) afin de générer une séquence de valeurs de probabilité (B x (k), B y (k) ). d) traiter, pour chaque variable (X, Y), la séquence respective de valeurs de probabilité (B x (k), B y (k) ), afin de générer la valeur de probabilité moyenne respective (E[B x ], E[B y ]) sur ledit nombre prédéfini (K) de blocs ; e) traiter les valeurs de probabilité moyennes (E[B x ], E[B y ]) générées pour chaque variable (X, Y) afin de générer une valeur de probabilité de référence (B), cette valeur de probabilité de référence (B) étant générée en calculant le minimum des valeurs de probabilité moyennes (E[B x ], E[B y ]) générées pour chaque variable (X, Y) ; et à f) comparer ladite valeur de probabilité de référence (B) avec une valeur de probabilité de seuil (B min ) afin de détecter la présence de flux de données vocales dans le nombre prédéfini (K) de blocs dudit flux de données par paquets Procédé selon la revendication 1, dans lequel la présence de flux de données vocales est détectée lorsque ladite valeur de probabilité de référence (B) est plus grande que ladite valeur de probabilité de seuil (B min ). 3. Procédé selon l une quelconque des revendications 1 à 2, dans lequel ladite étape a) consistant à fournir au moins une fonction de distribution comprend les étapes consistant à : 4 a1) fournir un flux de données vocales par paquets, a2) mesurer, pour chaque variable mesurable (X, Y), les valeurs de la variable dans ledit flux de données vocales par paquets afin d obtenir la fonction de distribution de la variable (P{x C}, P{y C}). 4. Procédé selon l une quelconque des revendications 1 à 2, dans lequel ledit flux de données vocales est généré par une pluralité de codecs vocaux (j), au moins une variable (X) étant dépendante du codec vocal, ladite étape a) consistant à fournir au moins une fonction de distribution comprend les étapes consistant à : 0 a1) fournir une pluralité de flux de données vocales par paquets, chaque flux étant généré par un codec vocal respectif de la pluralité de codecs vocaux, a2) mesurer, pour au moins une variable (X), les valeurs de cette variable (X) dans chaque flux de données vocales par paquets afin d obtenir la fonction de distribution (P j {x C}) de la variable (X) pour chaque codec vocal.. Procédé selon la revendication 4, dans lequel chaque codec vocal a une pluralité de configurations de fonctionnement, ladite étape a2) comprenant l étape de mesure, pour au moins une variable (X), pour chaque configuration de fonctionnement de chaque codec vocal, des valeurs de la variable (X) dans chaque flux de données vocales par paquets afin d obtenir une fonction de distribution de la variable (X) pour chaque configuration de fonctionnement de chaque codec vocal (j). 14

15 6. Procédé selon soit la revendication 4, soit la revendication, dans lequel les étapes c) et d) sont exécutées pour au moins une variable (X) et pour chaque codec (j) afin de générer une valeur de probabilité moyenne E[B x (j) ] pour chaque codec (j). 7. Procédé selon l une quelconque des revendications 4 à 6, dans lequel ladite étape c) comprend les étapes consistant à: c1) appliquer chaque valeur mesurée de la séquence de valeurs mesurées d au moins une variable dépendant du codec vocal à la fonction de distribution de chaque configuration de fonctionnement du codec vocal respectif afin de générer une pluralité de valeurs de probabilité ; c2) calculer, pour chaque valeur mesurée de la séquence de valeurs mesurées, le maximum de la pluralité de valeurs de probabilité afin de générer la séquence de valeurs de probabilité (B x (k,,j) ) Procédé selon la revendication 7, dans lequel ladite étape d) comprend les étapes consistant à : d1) traiter, pour au moins une variable (X) et pour chaque codec (j), la séquence respective de valeurs de probabilité (B x (k,,j) ) afin de générer la valeur de probabilité moyenne respective (E[B x(j) ]) ; d2) traiter les valeurs de probabilité moyennes générées pour chaque codec (E[B x (j) ]) pour ladite au moins une variable (X) afin de générer la valeur de probabilité moyenne (E[B x ]) sur ledit nombre prédéfini (K) de blocs. 9. Procédé selon la revendication 8, dans lequel ladite étape d2) comprend l étape consistant à calculer le maximum des valeurs de probabilité moyennes générées pour chaque codec (E[B x (j) ]) afin de générer la valeur de probabilité moyenne (E[B x ]) sur ledit nombre prédéfini (K) de blocs.. Procédé selon la revendication 9, comprenant en outre l étape consistant à trouver le codec (j) associé au maximum de valeurs de probabilité (E[B x ]) générées pour chaque codec (E[B x (j) ]), ledit codec (j) représentant le codec vocal de probabilité maximum dudit flux de données vocales. 11. Appareil () pour détecter un flux de données vocales dans un flux de données par paquets, ledit flux de données par paquets étant divisé en blocs de paquets (w (k) ), chaque bloc (w) comprenant un nombre prédéfini de paquets, ledit flux de données ayant au moins deux variables mesurables (X, Y), une première desdites variables mesurables (X) étant la taille du message et une deuxième desdites variables mesurables (Y) étant l espace moyen entre les paquets, ledit appareil () étant caractérisé en ce qu il comprend : - des moyens de stockage (11) capables de fournir, pour chaque variable mesurable (X, Y), au moins une fonction (P{x C}, P{y C}) représentative de la distribution des valeurs de la variable respective (X, Y) dans un flux de données vocales, - des moyens de mesure (12) capables de recevoir ledit flux de données par paquets afin de mesurer, pour chaque bloc (w (k) ) d un nombre prédéfini (K) de blocs dudit flux de données, au moins une valeur (x, y) de chaque variable (X, Y) afin d obtenir, pour chaque variable (X, Y), une séquence de valeurs mesurées (x (k), y (k) ) pour le nombre prédéfini (K) de blocs, - des moyens de traitement (13) connectés auxdits moyens de stockage (11) et auxdits moyens de mesure (12) et capables de : - appliquer, pour chaque variable (X, Y), chaque valeur mesurée (x (k), y (k) ) de la séquence de valeurs mesurées de la variable à la fonction de distribution respective (P{x C}, P{y C}) afin de générer une séquence de valeurs de probabilité (B x (k), B y (k) ), - traiter, pour chaque variable (X, Y), la séquence respective de valeurs de probabilité (B x (k), B y (k) ), afin de générer la valeur de probabilité moyenne respective (E[B x ], E[B y ]) sur ledit nombre prédéfini (K) de blocs, - traiter les valeurs de probabilité moyennes (E[B x ], E[B y ]) générées pour chaque variable (X, Y) afin de générer une valeur de probabilité de référence (B), cette valeur de probabilité de référence (B) étant générée en calculant le minimum des valeurs de probabilité moyennes (E[B x ], E[B y ]) générées pour chaque variable (X, Y), et - des moyens de comparaison (14) connectés auxdits moyens de traitement (13) et capables de comparer ladite valeur de probabilité de référence (B) avec une valeur de probabilité de seuil (B min ) afin de détecter la présence de flux de données vocales dans ledit flux de données par paquets.

16 12. Appareil () selon la revendication 11, dans lequel ledit flux de données vocales est généré par une pluralité de codecs vocaux (j), et au moins une variable (X) est dépendante du codec vocal, lesdits moyens de stockage 11 étant capables de fournir la fonction de distribution (P j {x C}) d au moins une variable (X) pour chaque codec vocal (j). 13. Appareil () selon la revendication 12, dans lequel chaque codec vocal (j) a une pluralité de configurations de fonctionnement, les moyens de stockage (11) étant capables de fournir une fonction de distribution d au moins une variable (X) pour chaque configuration de fonctionnement de chaque codec vocal (j). 14. Appareil () selon la revendication 13, dans lequel lesdits moyens de traitement (13) sont capables de : - appliquer chaque valeur mesurée de la séquence de valeurs mesurées d au moins une variable (X) dépendant du codec vocal à la fonction de distribution de chaque configuration de fonctionnement du codec vocal respectif (j) afin de générer une pluralité de valeurs de probabilité, et de - calculer, pour chaque valeur mesurée de la séquence de valeurs mesurées, le maximum de la pluralité de valeurs de probabilité afin de générer la séquence de valeurs de probabilité (B x (k,,j) ).. Appareil () selon la revendication 14, dans lequel lesdits moyens de traitement (13) sont capables de : - traiter, pour au moins une variable (X) et pour chaque codec (j), la séquence respective de valeurs de probabilité (B x (k,,j) ) afin de générer la valeur de probabilité moyenne respective (E[B x (,j) ]), et de - traiter les valeurs de probabilité moyennes générées pour chaque codec (E[B x (,j) ]) pour au moins une variable (X) afin de générer la valeur de probabilité moyenne (E[B x ]) sur le nombre prédéfini (K) de blocs Appareil () selon la revendication, dans lequel lesdits moyens de traitement (13) sont capables de calculer le maximum des valeurs de probabilité moyennes générées pour chaque codec (E[B x (,j) ]) afin de générer la valeur de probabilité moyenne (E[B x ]) sur ledit nombre prédéfini (K) de blocs. 17. Appareil () selon la revendication 16, dans lequel lesdits moyens de traitement (13) sont capables de trouver le codec (j) associé au maximum des valeurs de probabilité (E[B x (,j) ]) générées pour chaque codec (j), ce codec (j) représentant le codec vocal de probabilité maximum du flux de données vocales

17 17

18 18

19 19

(51) Int Cl.: B29C 41/20 (2006.01) F21S 4/00 (2006.01) H05K 3/28 (2006.01)

(51) Int Cl.: B29C 41/20 (2006.01) F21S 4/00 (2006.01) H05K 3/28 (2006.01) (19) TEPZZ 68698B_T (11) EP 2 68 698 B1 (12) EUROPEAN PATENT SPECIFICATION (4) Date of publication and mention of the grant of the patent: 18.11.201 Bulletin 201/47 (21) Application number: 11808612.3

More information

(51) Int Cl.: G05F 3/26 (2006.01) G05F 3/24 (2006.01)

(51) Int Cl.: G05F 3/26 (2006.01) G05F 3/24 (2006.01) (19) Europäisches Patentamt European Patent Office Office européen des brevets (11) EP 1 280 033 B1 (12) EUROPEAN PATENT SPECIFICATION (4) Date of publication and mention of the grant of the patent: 31.0.2006

More information

*EP001173363B1* EP 1 173 363 B1 (19) (11) EP 1 173 363 B1 (12) EUROPEAN PATENT SPECIFICATION

*EP001173363B1* EP 1 173 363 B1 (19) (11) EP 1 173 363 B1 (12) EUROPEAN PATENT SPECIFICATION (19) Europäisches Patentamt European Patent Office Office européen des brevets *EP001173363B1* (11) EP 1 173 363 B1 (12) EUROPEAN PATENT SPECIFICATION (4) Date of publication and mention of the grant of

More information

(51) Int Cl.: G10L 15/26 (2006.01)

(51) Int Cl.: G10L 15/26 (2006.01) (19) TEPZZ Z 8B_T (11) EP 2 023 338 B1 (12) EUROPEAN PATENT SPECIFICATION (4) Date of publication and mention of the grant of the patent: 28.0.14 Bulletin 14/22 (1) Int Cl.: GL /26 (06.01) (21) Application

More information

(51) Int Cl.: G06F 1/00 (2006.01)

(51) Int Cl.: G06F 1/00 (2006.01) (19) (11) EP 0 972 234 B1 (12) EUROPEAN PATENT SPECIFICATION (4) Date of publication and mention of the grant of the patent: 0.09.07 Bulletin 07/36 (21) Application number: 98913219.6 (22) Date of filing:

More information

TEPZZ_768 7_B_T EP 1 768 371 B1 (19) (11) EP 1 768 371 B1 (12) EUROPEAN PATENT SPECIFICATION. (51) Int Cl.: H04M 19/04 (2006.01)

TEPZZ_768 7_B_T EP 1 768 371 B1 (19) (11) EP 1 768 371 B1 (12) EUROPEAN PATENT SPECIFICATION. (51) Int Cl.: H04M 19/04 (2006.01) (19) TEPZZ_768 7_B_T (11) EP 1 768 371 B1 (12) EUROPEAN PATENT SPECIFICATION (4) Date of publication and mention of the grant of the patent: 1.01.2014 Bulletin 2014/03 (1) Int Cl.: H04M 19/04 (2006.01)

More information

(51) Int Cl.: H04M 3/50 (2006.01)

(51) Int Cl.: H04M 3/50 (2006.01) (19) TEPZZ_Z48_64B_T (11) EP 1 048 164 B1 (12) EUROPEAN PATENT SPECIFICATION (4) Date of publication and mention of the grant of the patent: 07.01.1 Bulletin 1/02 (21) Application number: 9893133.0 (22)

More information

(51) Int Cl. 7 : G03G 15/00

(51) Int Cl. 7 : G03G 15/00 (19) Europäisches Patentamt European Patent Office Office européen des brevets *EP001179B1* (11) EP 1 17 9 B1 (12) EUROPEAN PATENT SPECIFICATION (4) Date of publication and mention of the grant of the

More information

(51) Int Cl.: H04L 29/06 (2006.01) G06F 9/445 (2006.01) G06F 13/00 (2006.01)

(51) Int Cl.: H04L 29/06 (2006.01) G06F 9/445 (2006.01) G06F 13/00 (2006.01) (19) TEPZZ_7486_6B_T (11) EP 1 748 616 B1 (12) EUROPEAN PATENT SPECIFICATION (4) Date of publication and mention of the grant of the patent: 03.09.2014 Bulletin 2014/36 (1) Int Cl.: H04L 29/06 (2006.01)

More information

(51) Int Cl.: G06F 9/455 (2006.01) G06F 9/50 (2006.01)

(51) Int Cl.: G06F 9/455 (2006.01) G06F 9/50 (2006.01) (19) TEPZZ 6987 B_T (11) EP 2 698 711 B1 (12) EUROPEAN PATENT SPECIFICATION (4) Date of publication and mention of the grant of the patent: 0.08.1 Bulletin 1/32 (21) Application number: 118777.8 (22) Date

More information

(51) Int Cl.: H04L 9/32 (2006.01) G09C 1/00 (2006.01) G06F 21/33 (2013.01) H04L 29/06 (2006.01)

(51) Int Cl.: H04L 9/32 (2006.01) G09C 1/00 (2006.01) G06F 21/33 (2013.01) H04L 29/06 (2006.01) (19) TEPZZ Z48B_T (11) EP 2 2 048 B1 (12) EUROPEAN PATENT SPECIFICATION (4) Date of publication and mention of the grant of the patent: 13.0. Bulletin / (21) Application number: 1179238.6 (22) Date of

More information

(51) Int Cl.: G01S 7/52 (2006.01)

(51) Int Cl.: G01S 7/52 (2006.01) (19) (11) EP 0 92 48 B1 (12) EUROPEAN PATENT SPECIFICATION (4) Date of publication and mention of the grant of the patent: 18.08. Bulletin /33 (1) Int Cl.: G01S 7/2 (06.01) (21) Application number: 993172.3

More information

(51) Int Cl.: H04N 7/16 (2011.01)

(51) Int Cl.: H04N 7/16 (2011.01) (19) TEPZZ_796 89B_T (11) EP 1 796 389 B1 (12) EUROPEAN PATENT SPECIFICATION (4) Date of publication and mention of the grant of the patent: 04.03.1 Bulletin 1/ (1) Int Cl.: H04N 7/16 (11.01) (21) Application

More information

(51) Int Cl.: H04W 4/14 (2009.01)

(51) Int Cl.: H04W 4/14 (2009.01) (19) (12) EUROPEAN PATENT SPECIFICATION (11) EP 2 184 897 B1 (4) Date of publication and mention of the grant of the patent: 14.03.12 Bulletin 12/11 (21) Application number: 087774.3 (22) Date of filing:

More information

(51) Int Cl.: H04L 9/32 (2006.01) H04B 7/00 (2006.01) A61N 1/37 (2006.01)

(51) Int Cl.: H04L 9/32 (2006.01) H04B 7/00 (2006.01) A61N 1/37 (2006.01) (19) TEPZZ_4977B_T (11) EP 1 49 77 B1 (12) EUROPEAN PATENT SPECIFICATION (4) Date of publication and mention of the grant of the patent:.12.14 Bulletin 14/0 (21) Application number: 03723989.4 (22) Date

More information

(51) Int Cl.: H04L 12/66 (2006.01)

(51) Int Cl.: H04L 12/66 (2006.01) (19) (12) EUROPEAN PATENT SPECIFICATION (11) EP 1 73 43 B1 (4) Date of publication and mention of the grant of the patent: 18.01.12 Bulletin 12/03 (21) Application number: 02792. (22) Date of filing: 26.12.02

More information

(51) Int Cl.: G06F 1/00 (2006.01)

(51) Int Cl.: G06F 1/00 (2006.01) (19) TEPZZ_4 Z4ZB_T (11) EP 1 433 040 B1 (12) EUROPEAN PATENT SPECIFICATION (4) Date of publication and mention of the grant of the patent: 11.11.201 Bulletin 201/46 (21) Application number: 0277267.9

More information

(51) Int Cl.: C08K 5/523 (2006.01) C08K 5/521 (2006.01) C08K 5/52 (2006.01) C08G 64/00 (2006.01)

(51) Int Cl.: C08K 5/523 (2006.01) C08K 5/521 (2006.01) C08K 5/52 (2006.01) C08G 64/00 (2006.01) (19) Europäisches Patentamt European Patent Office Office européen des brevets (11) EP 0 78 966 B1 (12) EUROPEAN PATENT SPECIFICATION (4) Date of publication and mention of the grant of the patent: 01.03.06

More information

(51) Int Cl.: G06F 13/38 (2006.01) G06F 1/16 (2006.01)

(51) Int Cl.: G06F 13/38 (2006.01) G06F 1/16 (2006.01) (19) TEPZZ 9777B_T (11) EP 2 97 77 B1 (12) EUROPEAN PATENT SPECIFICATION (4) Date of publication and mention of the grant of the patent: 1.07.1 Bulletin 1/29 (1) Int Cl.: G06F 13/38 (06.01) G06F 1/16 (06.01)

More information

(51) Int Cl.: H04L 12/56 (2006.01)

(51) Int Cl.: H04L 12/56 (2006.01) (19) (11) EP 1 779 90 B1 (12) EUROPEAN PATENT SPECIFICATION (4) Date of publication and mention of the grant of the patent: 28.12.11 Bulletin 11/2 (21) Application number: 0783482.2 (22) Date of filing:

More information

(51) Int Cl.: H04B 3/23 (2006.01)

(51) Int Cl.: H04B 3/23 (2006.01) (19) (11) EP 0 983 638 B1 (12) EUROPEAN PATENT SPECIFICATION (4) Date of publication and mention of the grant of the patent: 21.03.12 Bulletin 12/12 (21) Application number: 989232.7 (22) Date of filing:

More information

TEPZZ_9 6Z46B_T EP 1 926 046 B1 (19) (11) EP 1 926 046 B1 (12) EUROPEAN PATENT SPECIFICATION. (51) Int Cl.:

TEPZZ_9 6Z46B_T EP 1 926 046 B1 (19) (11) EP 1 926 046 B1 (12) EUROPEAN PATENT SPECIFICATION. (51) Int Cl.: (19) TEPZZ_9 6Z46B_T (11) EP 1 926 046 B1 (12) EUROPEAN PATENT SPECIFICATION (4) Date of publication and mention of the grant of the patent: 21.08.13 Bulletin 13/34 (1) Int Cl.: G06F 19/00 (11.01) (21)

More information

(51) Int Cl.: H04L 9/24 (2006.01) G06Q 10/00 (2012.01)

(51) Int Cl.: H04L 9/24 (2006.01) G06Q 10/00 (2012.01) (19) TEPZZ_4Z 68ZB_T (11) EP 1 2 680 B1 (12) EUROPEAN PATENT SPECIFICATION (4) Date of publication and mention of the grant of the patent: 01.04.1 Bulletin 1/14 (21) Application number: 02741722.9 (22)

More information

(51) Int Cl.: G10L 19/00 (2006.01) H04L 1/20 (2006.01)

(51) Int Cl.: G10L 19/00 (2006.01) H04L 1/20 (2006.01) (19) Europäisches Patentamt European Patent Office Office européen des brevets (11) EP 1 317 72 B1 (12) EUROPEAN PATENT SPECIFICATION (4) Date of publication and mention of the grant of the patent:.08.06

More information

(51) Int Cl.: H04L 29/12 (2006.01)

(51) Int Cl.: H04L 29/12 (2006.01) (19) (11) EP 1 4 260 B1 (12) EUROPEAN PATENT SPECIFICATION (4) Date of publication and mention of the grant of the patent:.09.08 Bulletin 08/37 (1) Int Cl.: H04L 29/12 (06.01) (21) Application number:

More information

(51) Int Cl.: G06F 21/00 (2006.01) H04L 29/06 (2006.01)

(51) Int Cl.: G06F 21/00 (2006.01) H04L 29/06 (2006.01) (19) TEPZZ_8Z_7 _B_T (11) EP 1 801 721 B1 (12) EUROPEAN PATENT SPECIFICATION (4) Date of publication and mention of the grant of the patent: 16.06. Bulletin /24 (1) Int Cl.: G06F 21/00 (06.01) H04L 29/06

More information

(51) Int Cl.: H04L 12/26 (2006.01) H04L 12/24 (2006.01)

(51) Int Cl.: H04L 12/26 (2006.01) H04L 12/24 (2006.01) (19) TEPZZ 4 686 B_T (11) EP 2 426 862 B1 (12) EUROPEAN PATENT SPECIFICATION (4) Date of publication and mention of the grant of the patent: 12.08.1 Bulletin 1/33 (21) Application number: 769368.1 (22)

More information

(51) Int Cl.: G06F 11/20 (2006.01)

(51) Int Cl.: G06F 11/20 (2006.01) (19) TEPZZ 66_ B_T (11) EP 2 366 13 B1 (12) EUROPEAN PATENT SPECIFICATION (4) Date of publication and mention of the grant of the patent: 13.0.201 Bulletin 201/20 (21) Application number: 08878183.6 (22)

More information

(51) Int Cl.: H04L 12/26 (2006.01)

(51) Int Cl.: H04L 12/26 (2006.01) (19) TEPZZ 84 8B_T (11) EP 2 84 338 B1 (12) EUROPEAN PATENT SPECIFICATION (4) Date of publication and mention of the grant of the patent: 23.09.1 Bulletin 1/39 (1) Int Cl.: H04L 12/26 (06.01) (21) Application

More information

(56) References cited:

(56) References cited: (19) (12) EUROPEAN PATENT SPECIFICATION (11) EP 1 371 26 B1 (4) Date of publication and mention of the grant of the patent: 21.01.09 Bulletin 09/04 (21) Application number: 02711612.8 (22) Date of filing:

More information

(51) Int Cl.: H04Q 3/00 (2006.01) H04M 1/72 (2006.01)

(51) Int Cl.: H04Q 3/00 (2006.01) H04M 1/72 (2006.01) (19) TEPZZ Z B_T (11) EP 2 0 113 B1 (12) EUROPEAN PATENT SPECIFICATION (4) Date of publication and mention of the grant of the patent: 16.09.1 Bulletin 1/38 (21) Application number: 07809477.8 (22) Date

More information

(51) Int Cl.: G08G 1/14 (2006.01) G07B 15/02 (2006.01) G10L 15/28 (2006.01)

(51) Int Cl.: G08G 1/14 (2006.01) G07B 15/02 (2006.01) G10L 15/28 (2006.01) (19) (12) EUROPEAN PATENT SPECIFICATION (11) EP 1 862 986 B1 (4) Date of publication and mention of the grant of the patent: 14.07. Bulletin /28 (1) Int Cl.: G08G 1/14 (06.01) G07B 1/02 (06.01) GL 1/28

More information

TEPZZ_57 7_9B_T EP 1 573 719 B1 (19) (11) EP 1 573 719 B1 (12) EUROPEAN PATENT SPECIFICATION

TEPZZ_57 7_9B_T EP 1 573 719 B1 (19) (11) EP 1 573 719 B1 (12) EUROPEAN PATENT SPECIFICATION (19) TEPZZ_7 7_9B_T (11) EP 1 73 719 B1 (12) EUROPEAN PATENT SPECIFICATION (4) Date of publication and mention of the grant of the patent:.11.13 Bulletin 13/47 (21) Application number: 0277098.3 (22) Date

More information

(51) Int Cl.: H04L 29/06 (2006.01) H04L 12/26 (2006.01) H04M 3/22 (2006.01) H04M 7/00 (2006.01)

(51) Int Cl.: H04L 29/06 (2006.01) H04L 12/26 (2006.01) H04M 3/22 (2006.01) H04M 7/00 (2006.01) (19) TEPZZ 48786B_T (11) EP 2 48 786 B1 (12) EUROPEAN PATENT SPECIFICATION (4) Date of publication and mention of the grant of the patent: 23.03.16 Bulletin 16/12 (21) Application number: 806012.0 (22)

More information

(51) Int Cl.: B62M 7/12 (2006.01) B62M 23/02 (2006.01)

(51) Int Cl.: B62M 7/12 (2006.01) B62M 23/02 (2006.01) (19) (11) EP 1 810 918 B1 (12) EUROPEAN PATENT SPECIFICATION (4) Date of publication and mention of the grant of the patent: 18.11.2009 Bulletin 2009/47 (1) Int Cl.: B62M 7/12 (2006.01) B62M 23/02 (2006.01)

More information

TEPZZ_ 8_69B_T EP 1 338 169 B1 (19) (11) EP 1 338 169 B1 (12) EUROPEAN PATENT SPECIFICATION

TEPZZ_ 8_69B_T EP 1 338 169 B1 (19) (11) EP 1 338 169 B1 (12) EUROPEAN PATENT SPECIFICATION (19) TEPZZ_ 8_69B_T (11) EP 1 338 169 B1 (12) EUROPEAN PATENT SPECIFICATION (4) Date of publication and mention of the grant of the patent: 27.03.13 Bulletin 13/13 (21) Application number: 01997179. (22)

More information

(51) Int Cl.: H05K 1/02 (2006.01)

(51) Int Cl.: H05K 1/02 (2006.01) (19) (11) EP 1 229 767 B1 (12) EUROPEAN PATENT SPECIFICATION (4) Date of publication and mention of the grant of the patent: 20.01.2010 Bulletin 2010/03 (1) Int Cl.: H0K 1/02 (2006.01) (21) Application

More information

(51) Int Cl.: H04L 12/46 (2006.01) H04L 29/14 (2006.01) H04L 29/12 (2006.01)

(51) Int Cl.: H04L 12/46 (2006.01) H04L 29/14 (2006.01) H04L 29/12 (2006.01) (19) (11) EP 1 342 344 B1 (12) EUROPEAN PATENT SPECIFICATION (4) Date of publication and mention of the grant of the patent: 03.06.09 Bulletin 09/23 (21) Application number: 019639.0 (22) Date of filing:.08.01

More information

(51) Int Cl.: H04L 12/56 ( )

(51) Int Cl.: H04L 12/56 ( ) (19) Europäisches Patentamt European Patent Office Office européen des brevets (11) EP 1 636 948 B1 (12) EUROPEAN PATENT SPECIFICATION (4) Date of publication and mention of the grant of the patent: 02.11.06

More information

(51) Int Cl.: G01S 15/89 (2006.01) G01S 7/521 (2006.01) G01S 7/52 (2006.01)

(51) Int Cl.: G01S 15/89 (2006.01) G01S 7/521 (2006.01) G01S 7/52 (2006.01) (19) Europäisches Patentamt European Patent Office Office européen des brevets (11) EP 1 488 253 B1 (12) EUROPEAN PATENT SPECIFICATION (45) Date of publication and mention of the grant of the patent: 20.09.2006

More information

(51) Int Cl.: H04L 29/06 (2006.01) H04M 3/56 (2006.01) H04M 3/44 (2006.01) H04L 12/18 (2006.01)

(51) Int Cl.: H04L 29/06 (2006.01) H04M 3/56 (2006.01) H04M 3/44 (2006.01) H04L 12/18 (2006.01) (19) TEPZZ Z9 79B_T (11) EP 2 091 179 B1 (12) EUROPEAN PATENT SPECIFICATION (4) Date of publication and mention of the grant of the patent: 17.12.14 Bulletin 14/1 (21) Application number: 07817029.7 (22)

More information

TEPZZ 9 Z5A_T EP 2 922 305 A1 (19) (11) EP 2 922 305 A1. (12) EUROPEAN PATENT APPLICATION published in accordance with Art.

TEPZZ 9 Z5A_T EP 2 922 305 A1 (19) (11) EP 2 922 305 A1. (12) EUROPEAN PATENT APPLICATION published in accordance with Art. (19) TEPZZ 9 ZA_T (11) EP 2 922 A1 (12) EUROPEAN PATENT APPLICATION published in accordance with Art. 13(4) EPC (43) Date of publication: 23.09.1 Bulletin 1/39 (21) Application number: 1386446.2 (22) Date

More information

*EP000961991B1* EP 0 961 991 B1 (19) (11) EP 0 961 991 B1 (12) EUROPEAN PATENT SPECIFICATION

*EP000961991B1* EP 0 961 991 B1 (19) (11) EP 0 961 991 B1 (12) EUROPEAN PATENT SPECIFICATION (19) Europäisches Patentamt European Patent Office Office européen des brevets *EP000961991B1* (11) EP 0 961 991 B1 (12) EUROPEAN PATENT SPECIFICATION (4) Date of publication and mention of the grant of

More information

Jouve, 18, rue Saint-Denis, 75001 PARIS

Jouve, 18, rue Saint-Denis, 75001 PARIS @ EuroPean Patent Office iiililiili^ ^-S Office europeen des brevets (fi) Publication number: 0 477 448 B1 @ EUROPEAN PATENT SPECIFICATION @ Date of publication of patent specification : @ Int. CI.6 :

More information

(51) Int Cl.: H04L 12/24 (2006.01)

(51) Int Cl.: H04L 12/24 (2006.01) (19) TEPZZ_8_9Z96B_T (11) EP 1 819 096 B1 (12) EUROPEAN PATENT SPECIFICATION (4) Date of publication and mention of the grant of the patent: 24..12 Bulletin 12/43 (21) Application number: 0818628.9 (22)

More information

(51) Int Cl.: H04L 29/06 (2006.01)

(51) Int Cl.: H04L 29/06 (2006.01) (19) Europäisches Patentamt European Patent Office Office européen des brevets (11) EP 1 146 711 B1 (12) EUROPEAN PATENT SPECIFICATION (4) Date of publication and mention of the grant of the patent: 13.09.06

More information

(51) Int Cl.: G06F 9/44 (2006.01) G06F 9/445 (2006.01)

(51) Int Cl.: G06F 9/44 (2006.01) G06F 9/445 (2006.01) (19) (11) EP 1 63 34 B1 (12) EUROPEAN PATENT SPECIFICATION (4) Date of publication and mention of the grant of the patent: 23.07.08 Bulletin 08/ (1) Int Cl.: G06F 9/44 (06.01) G06F 9/44 (06.01) (21) Application

More information

(51) Int Cl.: H04L 12/24 (2006.01) H04L 12/26 (2006.01)

(51) Int Cl.: H04L 12/24 (2006.01) H04L 12/26 (2006.01) (19) (11) EP 1 3 219 B1 (12) EUROPEAN PATENT SPECIFICATION (4) Date of publication and mention of the grant of the patent: 03.01.07 Bulletin 07/01 (1) Int Cl.: H04L 12/24 (06.01) H04L 12/26 (06.01) (21)

More information

EUROPEAN PATENT SPECIFICATION

EUROPEAN PATENT SPECIFICATION Patentamt JEuropâisches European Patent Office Publication number: 0 1 47 5 9 7 Office européen des brevets R1 B1 EUROPEAN PATENT SPECIFICATION ( ) Date of publication of patent spécification: 05.08.87

More information

(51) Int Cl.: H04L 29/06 (2006.01) H04M 15/00 (2006.01)

(51) Int Cl.: H04L 29/06 (2006.01) H04M 15/00 (2006.01) (19) TEPZZ 7Z 74 B_T (11) EP 2 702 742 B1 (12) EUROPEAN PATENT SPECIFICATION (4) Date of publication and mention of the grant of the patent:.04. Bulletin /16 (21) Application number: 1171674.6 (22) Date

More information

IntCl.4: A 61 C 1/00

IntCl.4: A 61 C 1/00 à Europâisches Patentamt European Patent Office Office européen des brevets (J) Publication number: 0 042 2 6 7 B1 EUROPEAN PATENT SPECIFICATION ( ) Date of publication of patent spécification: 15.05.85

More information

TEPZZ 68575_A_T EP 2 685 751 A1 (19) (11) EP 2 685 751 A1. (12) EUROPEAN PATENT APPLICATION published in accordance with Art.

TEPZZ 68575_A_T EP 2 685 751 A1 (19) (11) EP 2 685 751 A1. (12) EUROPEAN PATENT APPLICATION published in accordance with Art. (19) TEPZZ 687_A_T (11) EP 2 68 71 A1 (12) EUROPEAN PATENT APPLICATION published in accordance with Art. 3(4) EPC (43) Date of publication:.01.14 Bulletin 14/03 (21) Application number: 1278849.6 (22)

More information

TEPZZ 87_546A T EP 2 871 546 A2 (19) (11) EP 2 871 546 A2 (12) EUROPEAN PATENT APPLICATION. (51) Int Cl.: G05B 19/05 (2006.01)

TEPZZ 87_546A T EP 2 871 546 A2 (19) (11) EP 2 871 546 A2 (12) EUROPEAN PATENT APPLICATION. (51) Int Cl.: G05B 19/05 (2006.01) (19) TEPZZ 87_46A T (11) EP 2 871 46 A2 (12) EUROPEAN PATENT APPLICATION (43) Date of publication: 13.0.1 Bulletin 1/ (1) Int Cl.: G0B 19/0 (06.01) (21) Application number: 14188238.1 (22) Date of filing:

More information

(51) Int Cl.: H04L 29/06 (2006.01) H04L 29/12 (2006.01)

(51) Int Cl.: H04L 29/06 (2006.01) H04L 29/12 (2006.01) (19) TEPZZ_8 Z _9B_T (11) EP 1 8 319 B1 (12) EUROPEAN PATENT SPECIFICATION (4) Date of publication and mention of the grant of the patent: 17.06.1 Bulletin 1/2 (21) Application number: 08163. (22) Date

More information

TEPZZ 5Z _9_B_T EP 2 502 191 B1 (19) (11) EP 2 502 191 B1 (12) EUROPEAN PATENT SPECIFICATION

TEPZZ 5Z _9_B_T EP 2 502 191 B1 (19) (11) EP 2 502 191 B1 (12) EUROPEAN PATENT SPECIFICATION (19) TEPZZ Z _9_B_T (11) EP 2 02 191 B1 (12) EUROPEAN PATENT SPECIFICATION (4) Date of publication and mention of the grant of the patent: 17.06.1 Bulletin 1/2 (21) Application number: 787872.0 (22) Date

More information

EP 2 455 926 A1 (19) (11) EP 2 455 926 A1 (12) EUROPEAN PATENT APPLICATION. (43) Date of publication: 23.05.2012 Bulletin 2012/21

EP 2 455 926 A1 (19) (11) EP 2 455 926 A1 (12) EUROPEAN PATENT APPLICATION. (43) Date of publication: 23.05.2012 Bulletin 2012/21 (19) (12) EUROPEAN PATENT APPLICATION (11) EP 2 4 926 A1 (43) Date of publication: 23.0.2012 Bulletin 2012/21 (21) Application number: 11190024.7 (1) Int Cl.: G08B 2/14 (2006.01) G08B 2/00 (2006.01) G0B

More information

Title (fr) SOURCE IONIQUE INTERNE DOUBLE POUR PRODUCTION DE FAISCEAU DE PARTICULES AVEC UN CYCLOTRON

Title (fr) SOURCE IONIQUE INTERNE DOUBLE POUR PRODUCTION DE FAISCEAU DE PARTICULES AVEC UN CYCLOTRON Title (en) A TWIN INTERNAL ION SOURCE FOR PARTICLE BEAM PRODUCTION WITH A CYCLOTRON Title (de) DOPPELTE INTERNE IONENQUELLE FÜR PARTIKELSTRAHLHERSTELLUNG MIT EINEM ZYKLOTRON Title (fr) SOURCE IONIQUE INTERNE

More information

(51) Int Cl.: H04L 29/06 (2006.01) H04L 12/22 (2006.01)

(51) Int Cl.: H04L 29/06 (2006.01) H04L 12/22 (2006.01) (19) (11) EP 0 998 091 B1 (12) EUROPEAN PATENT SPECIFICATION (4) Date of publication and mention of the grant of the patent: 31.01.07 Bulletin 07/0 (1) Int Cl.: H04L 29/06 (06.01) H04L 12/22 (06.01) (21)

More information

EURÓPAI SZABADALOM SZÖVEGÉNEK FORDÍTÁSA. (51) Int. Cl.: H04L 12/24 (2006.01)

EURÓPAI SZABADALOM SZÖVEGÉNEK FORDÍTÁSA. (51) Int. Cl.: H04L 12/24 (2006.01) *HU000011740T2* HU000011740T2 (19) HU (11) Lajstromszám: E 011 740 (13) T2 MAGYARORSZÁG Szellemi Tulajdon Nemzeti Hivatala EURÓPAI SZABADALOM SZÖVEGÉNEK FORDÍTÁSA (21) Magyar ügyszám: E 09 157877 (22)

More information

TEPZZ 8898 7A_T EP 2 889 827 A1 (19) (11) EP 2 889 827 A1 (12) EUROPEAN PATENT APPLICATION. (51) Int Cl.: G06Q 40/04 (2012.01)

TEPZZ 8898 7A_T EP 2 889 827 A1 (19) (11) EP 2 889 827 A1 (12) EUROPEAN PATENT APPLICATION. (51) Int Cl.: G06Q 40/04 (2012.01) (19) TEPZZ 8898 7A_T (11) EP 2 889 827 A1 (12) EUROPEAN PATENT APPLICATION (43) Date of publication: 01.07.201 Bulletin 201/27 (1) Int Cl.: G06Q 40/04 (2012.01) (21) Application number: 14199864.1 (22)

More information

(51) Int Cl.: H04L 12/24 (2006.01)

(51) Int Cl.: H04L 12/24 (2006.01) (19) (12) EUROPEAN PATENT SPECIFICATION (11) EP 1 487 11 B1 (4) Date of publication and mention of the grant of the patent: 01.07.09 Bulletin 09/27 (1) Int Cl.: H04L 12/24 (06.01) (21) Application number:

More information

(51) Int Cl.: H04L 12/24 (2006.01) G06F 9/445 (2006.01)

(51) Int Cl.: H04L 12/24 (2006.01) G06F 9/445 (2006.01) (19) (12) EUROPEAN PATENT SPECIFICATION (11) EP 1 978 672 B1 (4) Date of publication and mention of the grant of the patent: 01.09. Bulletin /3 (1) Int Cl.: H04L 12/24 (06.01) G06F 9/44 (06.01) (21) Application

More information

TEPZZ 858 ZB_T EP 2 858 320 B1 (19) (11) EP 2 858 320 B1 (12) EUROPEAN PATENT SPECIFICATION

TEPZZ 858 ZB_T EP 2 858 320 B1 (19) (11) EP 2 858 320 B1 (12) EUROPEAN PATENT SPECIFICATION (19) TEPZZ 88 ZB_T (11) EP 2 88 3 B1 (12) EUROPEAN PATENT SPECIFICATION (4) Date of publication and mention of the grant of the patent: 06.04.16 Bulletin 16/14 (21) Application number: 1287929.9 (22) Date

More information

(56) References cited:

(56) References cited: (19) (12) EUROPEAN PATENT SPECIFICATION (11) EP 1 04 B1 (4) Date of publication and mention of the grant of the patent: 26.12.07 Bulletin 07/2 (21) Application number: 03742391.0 (22) Date of filing: 02.07.03

More information

(51) Int Cl.: H04L 12/58 (2006.01)

(51) Int Cl.: H04L 12/58 (2006.01) (19) (11) EP 1 628 448 B1 (12) EUROPEAN PATENT SPECIFICATION (4) Date of publication and mention of the grant of the patent: 21.11.07 Bulletin 07/47 (1) Int Cl.: H04L 12/8 (06.01) (21) Application number:

More information

(51) Int Cl.: H04L 29/06 (2006.01)

(51) Int Cl.: H04L 29/06 (2006.01) (19) (11) EP 2 07 816 B1 (12) EUROPEAN PATENT SPECIFICATION (4) Date of publication and mention of the grant of the patent: 04.0.11 Bulletin 11/18 (21) Application number: 07804833.7 (22) Date of filing:

More information

TEPZZ 6_Z76 A_T EP 2 610 763 A1 (19) (11) EP 2 610 763 A1 (12) EUROPEAN PATENT APPLICATION. (51) Int Cl.:

TEPZZ 6_Z76 A_T EP 2 610 763 A1 (19) (11) EP 2 610 763 A1 (12) EUROPEAN PATENT APPLICATION. (51) Int Cl.: (19) TEPZZ 6_Z76 A_T (11) EP 2 6 763 A1 (12) EUROPEAN PATENT APPLICATION (43) Date of publication: 03.07.2013 Bulletin 2013/27 (51) Int Cl.: G06F 17/30 (2006.01) (21) Application number: 12192220.7 (22)

More information

(51) Int Cl.: H04N 1/19 (2006.01) H04N 3/15 (2006.01) H04N 9/04 (2006.01)

(51) Int Cl.: H04N 1/19 (2006.01) H04N 3/15 (2006.01) H04N 9/04 (2006.01) (19) (12) EUROPEAN PATENT SPECIFICATION (11) EP 1 417 829 B1 (45) Date of publication and mention of the grant of the patent: 08.04.2009 Bulletin 2009/15 (21) Application number: 02751534.5 (22) Date of

More information

(51) Int Cl.: G06F 13/42 (2006.01)

(51) Int Cl.: G06F 13/42 (2006.01) (19) TEPZZ 67487_B_T (11) EP 2 674 871 B1 (12) EUROPEAN PATENT SPECIFICATION (4) Date of publication and mention of the grant of the patent: 04.03.201 Bulletin 201/ (1) Int Cl.: G06F 13/42 (2006.01) (21)

More information

*EP A1* EP A1 (19) (11) EP A1 (12) EUROPEAN PATENT APPLICATION. (43) Date of publication: Bulletin 2005/48

*EP A1* EP A1 (19) (11) EP A1 (12) EUROPEAN PATENT APPLICATION. (43) Date of publication: Bulletin 2005/48 (19) Europäisches Patentamt European Patent Office Office européen des brevets *EP001600303A1* (11) EP 1 600 303 A1 (12) EUROPEAN PATENT APPLICATION (43) Date of publication: 30.11.2005 Bulletin 2005/48

More information

(51) Int Cl.: H04N 7/15 (2006.01) H04N 7/18 (2006.01)

(51) Int Cl.: H04N 7/15 (2006.01) H04N 7/18 (2006.01) (19) TEPZZ_4967ZZB_T (11) EP 1 496 700 B1 (12) EUROPEAN PATENT SPECIFICATION (4) Date of publication and mention of the grant of the patent: 1.01.14 Bulletin 14/03 (1) Int Cl.: H04N 7/1 (06.01) H04N 7/18

More information

(51) Int Cl.: G06F 11/14 (2006.01) G06F 17/30 (2006.01)

(51) Int Cl.: G06F 11/14 (2006.01) G06F 17/30 (2006.01) (19) TEPZZ_97799B_T (11) EP 1 97 799 B1 (12) EUROPEAN PATENT SPECIFICATION (4) Date of publication and mention of the grant of the patent: 06.0. Bulletin /19 (1) Int Cl.: G06F 11/14 (06.01) G06F 17/ (06.01)

More information

(51) Int Cl.: H01M 8/04 (2006.01)

(51) Int Cl.: H01M 8/04 (2006.01) (19) (11) EP 1 791 20 B1 (12) EUROPEAN PATENT SPECIFICATION (4) Date of publication and mention of the grant of the patent: 12.09.2012 Bulletin 2012/37 (1) Int Cl.: H01M 8/04 (2006.01) (21) Application

More information

TEPZZ 4_888 B_T EP 2 418 883 B1 (19) (11) EP 2 418 883 B1 (12) EUROPEAN PATENT SPECIFICATION. (51) Int Cl.: H04W 12/00 (2009.01)

TEPZZ 4_888 B_T EP 2 418 883 B1 (19) (11) EP 2 418 883 B1 (12) EUROPEAN PATENT SPECIFICATION. (51) Int Cl.: H04W 12/00 (2009.01) (19) TEPZZ 4_888 B_T (11) EP 2 418 883 B1 (12) EUROPEAN PATENT SPECIFICATION (4) Date of publication and mention of the grant of the patent: 23.04.14 Bulletin 14/17 (21) Application number: 09842887.3

More information

(51) Int Cl.: G04B 19/08 (2006.01)

(51) Int Cl.: G04B 19/08 (2006.01) (19) (11) EP 1 988 432 B1 (12) EUROPEAN PATENT SPECIFICATION (4) Date of publication and mention of the grant of the patent: 0.10.2011 Bulletin 2011/40 (21) Application number: 0771278.9 (22) Date of filing:

More information

(51) Int Cl.: H04L 12/10 (2006.01) H04L 12/40 (2006.01)

(51) Int Cl.: H04L 12/10 (2006.01) H04L 12/40 (2006.01) (19) TEPZZ 4799 B_T (11) EP 2 479 92 B1 (12) EUROPEAN PATENT SPECIFICATION (4) Date of publication and mention of the grant of the patent: 14.0.14 Bulletin 14/ (1) Int Cl.: H04L 12/ (06.01) H04L 12/ (06.01)

More information

TEPZZ _Z9458A_T EP A1 (19) (11) EP A1 (12) EUROPEAN PATENT APPLICATION. (51) Int Cl.: F02P 19/02 ( )

TEPZZ _Z9458A_T EP A1 (19) (11) EP A1 (12) EUROPEAN PATENT APPLICATION. (51) Int Cl.: F02P 19/02 ( ) (19) TEPZZ _Z948A_T (11) EP 3 9 48 A1 (12) EUROPEAN PATENT APPLICATION (43) Date of publication: 28.12.16 Bulletin 16/2 (1) Int Cl.: F02P 19/02 (06.01) (21) Application number: 161666.1 (22) Date of filing:.04.16

More information

TEPZZ A_T EP A1 (19) (11) EP A1 (12) EUROPEAN PATENT APPLICATION

TEPZZ A_T EP A1 (19) (11) EP A1 (12) EUROPEAN PATENT APPLICATION (19) TEPZZ 89949A_T (11) EP 2 899 49 A1 (12) EUROPEAN PATENT APPLICATION (43) Date of publication: 29.07.201 Bulletin 201/31 (21) Application number: 111986. (1) Int Cl.: G01R 1/08 (2006.01) G01R 19/27

More information

(51) Int Cl.: G06F 17/00 (2006.01) G06F 11/20 (2006.01)

(51) Int Cl.: G06F 17/00 (2006.01) G06F 11/20 (2006.01) (19) Europäisches Patentamt European Patent Office Office européen des brevets (11) EP 1 388 08 B1 (12) EUROPEAN PATENT SPECIFICATION (4) Date of publication and mention of the grant of the patent: 29.11.06

More information

(51) Int Cl.: H04M 3/51 (2006.01)

(51) Int Cl.: H04M 3/51 (2006.01) (19) TEPZZ_976 B_T (11) EP 1 976 2 B1 (12) EUROPEAN PATENT SPECIFICATION (4) Date of publication and mention of the grant of the patent: 18.03.1 Bulletin 1/12 (1) Int Cl.: H04M 3/1 (06.01) (21) Application

More information

(51) Int Cl.: G06F 21/24 (2006.01)

(51) Int Cl.: G06F 21/24 (2006.01) (19) (12) EUROPEAN PATENT SPECIFICATION (11) EP 1 674 960 B1 (45) Date of publication and mention of the grant of the patent: 05..2011 Bulletin 2011/40 (51) Int Cl.: G06F 21/24 (2006.01) (21) Application

More information

(51) Int Cl.: H04L 12/56 (2006.01) H04L 12/28 (2006.01) H04M 7/00 (2006.01)

(51) Int Cl.: H04L 12/56 (2006.01) H04L 12/28 (2006.01) H04M 7/00 (2006.01) (19) (12) EUROPEAN PATENT SPECIFICATION (11) EP 1 129 0 B1 (4) Date of publication and mention of the grant of the patent: 09.04.08 Bulletin 08/1 (21) Application number: 9996836.2 (22) Date of filing:

More information

(51) Int Cl.: H04M 3/42 (2006.01) H04Q 3/00 (2006.01)

(51) Int Cl.: H04M 3/42 (2006.01) H04Q 3/00 (2006.01) (19) (11) EP 1 696 646 B1 (12) EUROPEAN PATENT SPECIFICATION (4) Date of publication and mention of the grant of the patent: 07.03.12 Bulletin 12/ (1) Int Cl.: H04M 3/42 (06.01) H04Q 3/00 (06.01) (21)

More information

TEPZZ 57_ A_T EP A1 (19) (11) EP A1 (12) EUROPEAN PATENT APPLICATION. (51) Int Cl.: H04L 29/06 ( )

TEPZZ 57_ A_T EP A1 (19) (11) EP A1 (12) EUROPEAN PATENT APPLICATION. (51) Int Cl.: H04L 29/06 ( ) (19) TEPZZ 57_ A_T (11) EP 2 571 223 A1 (12) EUROPEAN PATENT APPLICATION (43) Date of publication: 20.03.2013 Bulletin 2013/12 (51) Int Cl.: H04L 29/06 (2006.01) (21) Application number: 11181229.3 (22)

More information

TEPZZ 84 587A_T EP 2 843 587 A1 (19) (11) EP 2 843 587 A1 (12) EUROPEAN PATENT APPLICATION. (51) Int Cl.: G06F 21/64 (2013.01)

TEPZZ 84 587A_T EP 2 843 587 A1 (19) (11) EP 2 843 587 A1 (12) EUROPEAN PATENT APPLICATION. (51) Int Cl.: G06F 21/64 (2013.01) (19) TEPZZ 84 87A_T (11) EP 2 843 87 A1 (12) EUROPEAN PATENT APPLICATION (43) Date of publication: 04.03.201 Bulletin 201/ (1) Int Cl.: G06F 21/64 (2013.01) (21) Application number: 13181902.1 (22) Date

More information

TEPZZ 65Z79 A_T EP 2 650 793 A1 (19) (11) EP 2 650 793 A1. (12) EUROPEAN PATENT APPLICATION published in accordance with Art.

TEPZZ 65Z79 A_T EP 2 650 793 A1 (19) (11) EP 2 650 793 A1. (12) EUROPEAN PATENT APPLICATION published in accordance with Art. (19) TEPZZ 65Z79 A_T (11) EP 2 650 793 A1 (12) EUROPEAN PATENT APPLICATION published in accordance with Art. 153(4) EPC (43) Date of publication: 16.10.2013 Bulletin 2013/42 (21) Application number: 12818771.3

More information

(51) Int Cl.: G06F 11/14 (2006.01) G06F 12/08 (2006.01)

(51) Int Cl.: G06F 11/14 (2006.01) G06F 12/08 (2006.01) (19) TEPZZ 488949B_T (11) EP 2 488 949 B1 (12) EUROPEAN PATENT SPECIFICATION (4) Date of publication and mention of the grant of the patent: 07.0.14 Bulletin 14/19 (21) Application number: 76367.4 (22)

More information

(51) Int Cl.: G06F 17/30 (2006.01)

(51) Int Cl.: G06F 17/30 (2006.01) (19) TEPZZ 7 _B_T (11) EP 1 127 321 B1 (12) EUROPEAN PATENT SPECIFICATION (4) Date of publication and mention of the grant of the patent: 03.04.13 Bulletin 13/14 (21) Application number: 99948341. (22)

More information

(51) Int Cl.: B43M 3/04 (2006.01)

(51) Int Cl.: B43M 3/04 (2006.01) (19) (11) EP 0 899 129 B1 (12) EUROPEAN PATENT SPECIFICATION (4) Date of publication and mention of the grant of the patent: 13.08.08 Bulletin 08/33 (1) Int Cl.: B43M 3/04 (06.01) (21) Application number:

More information

(51) Int Cl.: G08B 21/02 (2006.01) H04M 11/04 (2006.01)

(51) Int Cl.: G08B 21/02 (2006.01) H04M 11/04 (2006.01) (19) Europäisches Patentamt European Patent Office Office européen des brevets (11) EP 1 224 642 B1 (12) EUROPEAN PATENT SPECIFICATION (4) Date of publication and mention of the grant of the patent: 1.03.06

More information

(51) Int Cl.: H04W 4/02 (2009.01)

(51) Int Cl.: H04W 4/02 (2009.01) (19) TEPZZ_6 9B_T (11) EP 1 62 329 B1 (12) EUROPEAN PATENT SPECIFICATION (4) Date of publication and mention of the grant of the patent: 17.06.1 Bulletin 1/2 (21) Application number: 04778713.0 (22) Date

More information

(51) Int Cl.: G01C 21/36 (2006.01)

(51) Int Cl.: G01C 21/36 (2006.01) (19) TEPZZ_ 678B_T (11) EP 1 26 78 B1 (12) EUROPEAN PATENT SPECIFICATION (4) Date of publication and mention of the grant of the patent:.09.14 Bulletin 14/37 (1) Int Cl.: G01C 21/36 (06.01) (21) Application

More information

(51) Int Cl.: B61K 9/12 (2006.01)

(51) Int Cl.: B61K 9/12 (2006.01) (19) (11) EP 2 001 722 B1 (12) EUROPEAN PATENT SPECIFICATION (4) Date of publication and mention of the grant of the patent: 21.12.11 Bulletin 11/1 (21) Application number: 077926.6 (22) Date of filing:

More information

(51) Int Cl.: G06Q 10/00 (2006.01)

(51) Int Cl.: G06Q 10/00 (2006.01) (19) (11) EP 1 69 282 B1 (12) EUROPEAN PATENT SPECIFICATION (4) Date of publication and mention of the grant of the patent: 2.03.09 Bulletin 09/13 (21) Application number: 048.1 (22) Date of filing: 29.11.04

More information

(56) References cited:

(56) References cited: (19) TEPZZ 7Z4487B_T (11) EP 2 704 487 B1 (12) EUROPEAN PATENT SPECIFICATION (4) Date of publication and mention of the grant of the patent: 27.04.16 Bulletin 16/17 (1) Int Cl.: H04W 36/ (09.01) (21) Application

More information

(51) Int Cl.: H04L 12/58 (2006.01) H04L 29/06 (2006.01)

(51) Int Cl.: H04L 12/58 (2006.01) H04L 29/06 (2006.01) (19) TEPZZ_986 8 B_T (11) EP 1 986 382 B1 (12) EUROPEAN PATENT SPECIFICATION (4) Date of publication and mention of the grant of the patent: 19.02.14 Bulletin 14/08 (1) Int Cl.: H04L 12/8 (06.01) H04L

More information

(51) Int Cl.: B29C 44/06 (2006.01)

(51) Int Cl.: B29C 44/06 (2006.01) (19) TEPZZ 8 9 B_T (11) EP 2 81 193 B1 (12) EUROPEAN PATENT SPECIFICATION (4) Date of publication and mention of the grant of the patent: 2.11.1 Bulletin 1/48 (1) Int Cl.: B29C 44/06 (06.01) (21) Application

More information

EP 0 678 590 B1 (19) (11) EP 0 678 590 B1 (12) EUROPEAN PATENT SPECIFICATION

EP 0 678 590 B1 (19) (11) EP 0 678 590 B1 (12) EUROPEAN PATENT SPECIFICATION (19) Europäisches Patentamt European Patent Office Office européen des brevets (11) EP 0 678 90 B1 (12) EUROPEAN PATENT SPECIFICATION (4) Date of publication and mention of the grant of the patent: 06.09.00

More information

(51) Int Cl.: H04Q 11/04 (2006.01) H04L 12/64 (2006.01)

(51) Int Cl.: H04Q 11/04 (2006.01) H04L 12/64 (2006.01) (19) (11) EP 1 181 839 B1 (12) EUROPEAN PATENT SPECIFICATION (4) Date of publication and mention of the grant of the patent: 27.0.09 Bulletin 09/22 (21) Application number: 009391.3 (22) Date of filing:

More information

(51) Int Cl.: H04L 29/02 (2006.01) H04L 12/801 (2013.01)

(51) Int Cl.: H04L 29/02 (2006.01) H04L 12/801 (2013.01) (19) TEPZZ 7 48ZB_T (11) EP 2 72 480 B1 (12) EUROPEAN PATENT SPECIFICATION (4) Date of publication and mention of the grant of the patent: 03.12.2014 Bulletin 2014/49 (21) Application number: 11784039.7

More information