Method and device for establishing a communication link
Abstract
The method involves a receiver station classifying the communications traffic w.r.t. predefined combinations of the parameters mean bit rate and peak bit rate to the check the ability to accept a communications request. Acceptance checking is based on an effective bandwidth by the use of a known statistical multiplexer algorithm for homogeneous traffic, taking into account a reduced transmission capacity. The effective bandwidths determined as necessary for the lasses produced is taken into account essentially additively without statistical multiplexing. An Independent claim is also included for an equipment for receiving a number of digital; signals with potentially different bandwidths.

Term
Term ended
Projected expiry passed 25 January 2019, 7.7 years ago.
- Priority
- Filed
- Published
- Projected expiry
- Today
6 claims: 6 independent, 0 dependent
- 1Method for establishing a communication link for the transmission of digital signals with potentially variable transmission rates in a communication network, in which traffic parameters, including the mean bit rate (m) and the peak bit rate (h), are transmitted from a network node with a transmission request and from another network node using the transmitted parameters an acceptance test is carried out whether with regard to the own transmission capacity (C) the connection can be established with a high probability for lossless transmission of all information, characterized in that in the receiving station for the acceptance test of a transmission request, a classification of the transmission traffic of the receiving station with regard to predetermined combinations of the parameters "mean bit rate" (m) and "peak bit rate" (h) is carried out that an effective bandwidth (ci) by using a statistical multiplexing algorithm known for homogeneous traffic, taking into account a reduced transmission capacity (Cred, i) is taken as a basisand that the effective bandwidths thus determined as required for the classes formed are taken into account essentially additively without statistical multiplexing. Verfahren zur Herstellung einer Kommunikationsverbindung zur Übertragung digitaler Signale mit potentiell variablen Übertragungsraten in einem Kommunikationsnetz, bei dem von einem Netzknoten mit einem Übertragungswunsch Verkehrsparameter, einschließlich der mittleren Bitrate (m) und der Spitzenbitrate (h), übermittelt werden und von einem anderen Netzknoten anhand der übermittelten Parameter eine Annahmeprüfung dahingehend vorgenommen wird, ob im Hinblick auf die eigene Übertragungskapazität (C) die Verbindung mit einer hohen Wahrscheinlichkeit für eine verlustfreie Übertragung aller Informationen hergestellt werden kann, dadurch gekennzeichnet, daß in der Empfangsstation für die Annahmeprüfung eines Übertragungswunsches eine Klassifizierung des Übertragungsverkehrs der Empfangsstation bezüglich vorgegebener Kombinationen der Parameter "mittlere Bitrate" (m) und "Spitzenbitrate" (h) vorgenomen wird, daß für die Annahmeprüfung eine effektive Bandbreite (ci) durch Anwendung eines für einen homogenen Verkehr bekannten Algorithmus für ein statistisches Multiplexen unter Berücksichtigung einer reduzierten Übertragungskapazität (Cred,i) zugrundegelegt wird und daß die so für die gebildeten Klassen als benötigt ermittelten effektiven Bandbreiten im wesentlichen additiv ohne statistisches Multiplexen berücksichtigt werden.
- 2Method according to Claim 1, characterized in that connections with a constant bit rate (CBR) are assigned to a separate class which is treated in the same way as the other classes formed. Verfahren nach Anspruch 1, dadurch gekennzeichnet, daß Verbindungen mit konstanter Bitrate (CBR) einer eigenen Klasse zugeordnet werden, die in gleicher Weise wie die anderen gebildeten Klassen behandelt wird.
- 3Method according to Claim 1 or 2, characterized in that the classification is carried out with parameter combinations "average bit rate" (m) and "ratio of peak bit rate to average bit rate" (h / m). Verfahren nach Anspruch 1 oder 2, dadurch gekennzeichnet, daß die Klassifizierung mit Parameterkombinationen "mittlere Bitrate" (m) und "Verhältnis Spitzenbitrate zu mittlerer Bitrate" (h/m) vorgenomen wird.
- 4Device for receiving a plurality of digital signals with potentially different bandwidths, for which a transmission request and traffic parameters, including the mean bit rate (m) and the peak bit rate (h), are first transmitted to establish the connection, with a device for carrying out an acceptance test by comparing the own reception capacity (C) with the bandwidth used by existing connections plus the transmission request, characterized in that a classification of the transmission traffic is carried out in the device for carrying out the acceptance test with regard to predetermined combinations of the parameters "mean bit rate" (m) and "peak bit rate" (h),that for the acceptance test an effective bandwidth reduced compared to the maximum bandwidth (ci) by using a statistical multiplexing algorithm known for homogeneous traffic, taking into account a reduced transmission capacity (Cred, i) is taken as a basisand that the effective bandwidths thus determined as required for the classes formed are taken into account essentially additively without statistical multiplexing. Gerät zum Empfang einer Mehrzahl digitaler Signale mit potentiell unterschiedlichen Bandbreiten, für die zur Herstellung der Verbindung zunächst ein Übertragungswunsch und Verkehrsparameter, einschließlich der mittleren Bitrate (m) und der Spitzenbitrate (h) übermittelt werden, mit einer Einrichtung zur Durchführung einer Annahmeprüfung durch Vergleich der eigenen Empfangskapazität (C) mit den durch bestehende Verbindungen zuzüglich des Übertragungswunsches beanspruchten Bandbreite, dadurch gekennzeichnet, daß in der Einrichtung zur Durchführung der Annahmeprüfung eine Klassifizierung des Übertragungsverkehrs bezüglich vorgegebener Kombinationen der Parameter "mittlere Bitrate" (m) und "Spitzenbitrate" (h) vorgenomen wird, daß für die Annahmeprüfung eine gegenüber der maximalen Bandbreite verringerte effektive Bandbreite (ci) durch Anwendung eines für einen homogenen Verkehr bekannten Algorithmus für ein statistisches Multiplexen unter Berücksichtigung einer reduzierten Übertragungskapazität (Cred,i) zugrundegelegt wirdund daß die so für die gebildeten Klassen als benötigt ermittelten effektiven Bandbreiten im wesentlichen additiv ohne statistisches Multiplexen berücksichtigt werden.
- 5Device according to Claim 4, characterized in that connections with constant bit rate (CBR) are assigned to a separate class in the device for carrying out the acceptance test. Gerät nach Anspruch 4, dadurch gekennzeichnet, daß in der Einrichtung zur Durchführung der Annahmeprüfung Verbindungen mit konstanter Bitrate (CBR) einer eigenen Klasse zugeordnet werden.
- 6Apparatus according to claim 4 or 5, characterized in that the classification with parameter combinations "average bit rate" (m) and "ratio peak bit rate to average bit rate" (h / m) is carried out in the device for carrying out the acceptance test. Gerät nach Anspruch 4 oder 5, dadurch gekennzeichnet, daß in der Einrichtung zur Durchführung der Annahmeprüfung die Klassifizierung mit Parameterkombinationen "mittlere Bitrate" (m) und "Verhältnis Spitzenbitrate zu mittlerer Bitrate" (h/m) vorgenomen wird.
Independent claims6
31 paragraphs, as filed
The invention relates to a method for establishing a communication link for the transmission of digital signals with potentially variable transmission rates in a communication network, in which traffic parameters, including the mean bit rate and the peak bit rate, are transmitted from a network node with a transmission request and from another network node on the basis of the transmitted parameters an acceptance test is carried out whether the connection with a high probability of lossless transmission of all information can be established with regard to the own transmission capacity.
The invention further relates to a device for receiving a plurality of digital signals with potentially variable transmission rates, for which a transmission request and traffic parameters, including the average bit rate and the peak bit rate, are first transmitted to establish the connection, with a device for carrying out an acceptance test by comparing the own transmission capacity with the bandwidth used by existing connections plus the transmission request.
To establish a communication connection, in particular in ATM (asynchronous transfer mode), the receiving network node must check whether the transmission node can handle the transmission intended for transmission. For this purpose, it must be estimated in the network node whether the transmission of the digital signal has a predetermined low cell loss probability (e.g. 10th<sup>-9</sup>) can be received. Since the transmitting stations do not regularly transmit with a maximum bandwidth, it is customary for checking the connection acceptance to calculate an effective bandwidth from the traffic parameters signaled when the connection is established. The effective bandwidth is always between the average bandwidth and the maximum bandwidth of a connection. As long as the sum of the effective bandwidths of all connections including the newly arriving ones is below the nominal service rate of the network node (nominal link rate), the new connection can be accepted, otherwise it is rejected.
Since the sum of the maximum bandwidths of all connections can be greater than the link rate, one speaks of statistical multiplexing.
Since the decision about the acceptance of the connection must be made in real time, algorithms have been proposed in which the computation effort is much less than with an exact calculation. Such an algorithm should approximate the achievable utilization of the network node as closely as possible to the exact calculation, but should never exceed it, because this would cause a violation of the quality of service.
A known algorithm has been proposed by Lindberger ("Dimensioning and design methods for integrated ATM networks", Proceedings of the 14th ITC, June 1994, pages 897-906).
With homogeneous traffic, i.e. connections with the same bit rates, the known algorithms based on the effective bandwidth are very successful. They also capture the non-linear relationship between the link rate and the number of connections. In general, if the link rate is doubled, more than twice as many connections can be accepted, because with an increasing number of connections the probability decreases that all transmit at the same time at maximum rate, so that the risk of cell loss decreases with the same relative load.
In contrast, with heterogeneous traffic with potentially very different maximum and average bit rates, the problem arises that statistical multiplexing between connections with very different traffic parameters works less well. The acceptance curve, i.e. the limit curve for the acceptance of connections, is not linear but concave with different traffic parameters. In the case of the linear approximation, as is carried out by the known algorithms, connections would be assumed which would cause a violation of the quality of service.
Optimized algorithms are therefore not available for heterogeneous traffic, which enable a real-time decision on the acceptance of the connection, practically exclude a violation of the quality of service and nevertheless provide a good approximation to the exact calculation of the possible workload of the receiving station.
The present invention is therefore based on the problem of bringing about improvements with regard to the requirements mentioned.
Based on this problem, a method of the type mentioned at the outset is characterized in that in the network node for the acceptance test of a transmission request, a classification of the transmission traffic of the receiving station is carried out with regard to predetermined combinations of the parameters "mean bit rate" and "peak bit rate", that an effective bandwidth is used for the acceptance test by using an algorithm for statistical multiplexing known for homogeneous traffic, taking into account a reduced transmission capacity, and that the effective bandwidths thus determined as required for the classes formed are taken into account essentially additively without statistical multiplexing.
To solve the problem mentioned, a device of the type mentioned at the outset is also equipped with a device which carries out the classification and evaluation mentioned for carrying out the acceptance test.
The present invention is based on the fact that for the calculation of the effective bandwidth of the parameter space formed by the parameters "average bit rate" and "peak bit rate", preferably "average bit rate" and "ratio of peak bit rate to average bit rate", for the connections in classes (regions) is divided. For the calculation of the effective bandwidth of a connection it is assumed that statistical multiplexing works as well within a class as with homogeneous traffic because the connections have relatively similar traffic parameters. No statistical multiplexing is assumed between connections from different classes.
If connections with a constant bit rate frequently occur when establishing the communication connections, it is particularly expedient to assign these connections to a separate class, which is treated in the same way as the other classes formed, i.e. as a special case of a class with a variable bit rate.
The partitioning of the connections with variable bit rate into the different classes takes place exclusively for the calculation of the effective bandwidth. This means that the shares of the individual classes in the total capacity (link rate) of the receiving station are completely flexible and that a new connection is only rejected if the sum of all effective bandwidths would be greater than the link rate.
For the mathematical calculation, the transmission capacity of the network node is taken into account as service rate C and the cell loss probability B. A target limit is set for the cell loss rate<maths id="math0001" num=""><math display="inline"><mrow><mover accent="true"><mrow><mtext>B</mtext></mrow><mo>^</mo></mover></mrow></math><img file="EP0940952A2_D0001.tif" /></maths> formulated.
The concept of effective bandwidth transmission rates provides that the effective bandwidths c<sub>i</sub> be calculated for each connection so that the connection can be accepted as long as applies<maths id="math0002" num=""><math display="block"><mrow><apply><sum /><lowlimit><mtext>i</mtext></lowlimit><uplimit /><mrow><msub><mrow><mtext>c</mtext></mrow><mrow><mtext>i</mtext></mrow></msub><mtext> ≤ C</mtext></mrow></apply></mrow></math><img file="EP0940952A2_D0002.tif" /></maths>
The difficulty now is to find an expression for the effective bandwidth. With a homogeneous operation is the greatest number of connections<maths id="math0003" num=""><math display="inline"><mrow><mover accent="true"><mrow><mtext>N</mtext></mrow><mo>^</mo></mover></mrow></math><img file="EP0940952A2_D0003.tif" /></maths> find for whom the cell loss probability is still below <maths id="math0004" num=""><math display="inline"><mrow><mover accent="true"><mrow><mtext>B</mtext></mrow><mo>^</mo></mover></mrow></math><img file="EP0940952A2_D0004.tif" /></maths> lies. The effective bandwidth then results in<maths id="math0005" num=""><math display="inline"><mrow><mtext>c = C /</mtext><mover accent="true"><mrow><mtext>N</mtext></mrow><mo>^</mo></mover></mrow></math><img file="EP0940952A2_D0005.tif" /></maths>.
The Lindberger algorithm is a simple formula for calculating the effective bandwidth, which is based on the traffic parameters m (average bit rate) and h (peak bit rate), as well as the service rate C and the target size <maths id="math0006" num=""><math display="inline"><mrow><mover accent="true"><mrow><mtext>B</mtext></mrow><mo>^</mo></mover></mrow></math><img file="EP0940952A2_D0006.tif" /></maths> for the cell loss probability supports:<maths id="math0007" num=""><img file="EP0940952A2_D0007.tif" /></maths> With <maths id="math0008" num=""><math display="block"><mrow><mtext>a = 1 - </mtext><mfrac><mrow><mtext>log</mtext><mover accent="true"><mrow><mtext mathvariant="italic">B</mtext></mrow><mo>^</mo></mover></mrow><mrow><mtext>50</mtext></mrow></mfrac><mtext> and </mtext><mtext mathvariant="italic">z</mtext><mtext> = </mtext><mfrac><mrow><mtext>-2 * log</mtext><mover accent="true"><mrow><mtext mathvariant="italic">B</mtext></mrow><mo>^</mo></mover></mrow><mrow><mtext mathvariant="italic">C</mtext><mtext>/</mtext><mtext mathvariant="italic">H</mtext></mrow></mfrac><mtext>.</mtext></mrow></math><img file="EP0940952A2_D0008.tif" /></maths>
In any case, the Lindberger approximation is very good for large values of C / h. It also takes into account the profit that can be achieved by statistical multiplexing and increases with the service rate C.
A linear approximation is made for the acceptance limit, which assumes that the effective bandwidths are independent of heterogeneous traffic conditions. However, it has been shown that for large deviations, in particular high peak bit rates in relation to the mean bit rate, there are considerable deviations from the linear approximation, so that the linear approximation underestimates the cell loss probability in a manner which cannot be neglected. This applies in particular to a mix of connections with constant bit rate and the mentioned connections with variable bit rate.
According to the schematic and exemplary representation in FIG. 1, the connections with variable bit rate (VBR connections) are divided into classes, which are regions VBR 1, VBR 2, VBR 3, VBR 4 of the here by the average bit rate m and the ratio of Result in peak bit rate h at medium bit rate m on a spanned parameter space. In addition, the connections with constant bit rate CBR are taken into account separately.
The linear approximation method described above is applied to the connections within the individual classes. On the other hand, if there are two connections in different classes i and j, a reduced service rate C<sub>red</sub>,<sub>i</sub> used as parameters for the effective bandwidth formula for connections in class i:<maths id="math0009" num=""><math display="block"><mrow><msub><mrow><mtext mathvariant="italic">C</mtext></mrow><mrow><mtext mathvariant="italic">red</mtext></mrow></msub><msub><mrow><mtext></mtext></mrow><mrow><mtext>,</mtext><mtext mathvariant="italic">i</mtext></mrow></msub><mtext> = </mtext><mtext mathvariant="italic">C</mtext><mtext> - </mtext><msub><mrow><mtext mathvariant="italic">C</mtext></mrow><mrow><mtext mathvariant="italic">CBR</mtext></mrow></msub><mtext> - </mtext><apply><sum /><lowlimit><mtext mathvariant="italic">k</mtext><mtext>=</mtext><mtext mathvariant="italic">l</mtext><mtext></mtext><mtext mathvariant="italic">k</mtext><mtext>≠</mtext><mtext mathvariant="italic">i</mtext></lowlimit><uplimit><mtext mathvariant="italic">K</mtext></uplimit><mrow><mtext></mtext><msub><mrow><mtext mathvariant="italic">C</mtext></mrow><mrow><mtext mathvariant="italic">VBR</mtext></mrow></msub><msub><mrow><mtext></mtext></mrow><mrow><mtext>,</mtext><mtext mathvariant="italic">k</mtext></mrow></msub></mrow></apply></mrow></math><img file="EP0940952A2_D0009.tif" /></maths>
The service rate is thus determined by the sum of the CBR bandwidths C<sub>CBR</sub> and reduced by summed effective bandwidths of the other VBR classes.
Furthermore, the target variable B is also corrected for the cell loss probability as follows:<maths id="math0010" num=""><math display="block"><mrow><msubsup><mrow><mover accent="true"><mrow><mtext mathvariant="italic">B</mtext></mrow><mo>˜</mo></mover></mrow><mrow><mtext mathvariant="italic">i</mtext></mrow><mrow><mtext>*</mtext></mrow></msubsup><mtext> = </mtext><mover accent="true"><mrow><mtext mathvariant="italic">B</mtext></mrow><mo>^</mo></mover><mtext> · </mtext><mfrac><mrow><apply><sum /><lowlimit><mtext mathvariant="italic">k</mtext></lowlimit><uplimit /><mrow><msub><mrow><mtext mathvariant="italic">M</mtext></mrow><mrow><mtext mathvariant="italic">VBR</mtext></mrow></msub><msub><mrow><mtext></mtext></mrow><mrow><mtext>,</mtext><mtext mathvariant="italic">k</mtext></mrow></msub><mtext>+</mtext><msub><mrow><mtext mathvariant="italic">M</mtext></mrow><mrow><mtext mathvariant="italic">CBR</mtext></mrow></msub></mrow></apply></mrow><mrow><msub><mrow><mtext mathvariant="italic">M</mtext></mrow><mrow><mtext mathvariant="italic">VBR</mtext></mrow></msub><msub><mrow><mtext></mtext></mrow><mrow><mtext>,</mtext><mtext mathvariant="italic">i</mtext></mrow></msub></mrow></mfrac></mrow></math><img file="EP0940952A2_D0010.tif" /></maths> where M<sub>VBR</sub> the sum of the average bit rate of the VBR connections in a class and M<sub>CBR</sub> specify the average bit rate for CBR connections.
An alternative approach to calculating the reduced service rate can be:<maths id="math0011" num=""><math display="block"><mrow><msub><mrow><mtext mathvariant="italic">C</mtext></mrow><mrow><mtext mathvariant="italic">red</mtext></mrow></msub><msub><mrow><mtext></mtext></mrow><mrow><mtext>,</mtext><mtext mathvariant="italic">i</mtext></mrow></msub><mtext> = </mtext><mtext mathvariant="italic">C</mtext><mtext> - </mtext><msub><mrow><mtext mathvariant="italic">C</mtext></mrow><mrow><mtext mathvariant="italic">CBR</mtext></mrow></msub><mtext> - </mtext><apply><sum /><lowlimit><mtext mathvariant="italic">k</mtext><mtext>= l </mtext><mtext mathvariant="italic">k</mtext><mtext>≠</mtext><mtext mathvariant="italic">i</mtext></lowlimit><uplimit><mtext mathvariant="italic">K</mtext></uplimit><mrow><mtext></mtext><msub><mrow><mtext mathvariant="italic">M</mtext></mrow><mrow><mtext mathvariant="italic">VBR</mtext></mrow></msub><msub><mrow><mtext></mtext></mrow><mrow><mtext>,</mtext><mtext mathvariant="italic">k</mtext></mrow></msub></mrow></apply></mrow></math><img file="EP0940952A2_D0011.tif" /></maths>
In the following, the first-mentioned approach for the reduced service rate will be considered. In the receiving station, the variables C<sub>CBR</sub>, M<sub>CBR</sub>, C<sub>VBR, k</sub> and M<sub>VBR, k</sub> (k = 1, ..., K; K is the number of classes) must be known or determined. When receiving a transmission request for a VBR connection with the parameters m<sub>New</sub> and h<sub>New</sub> the following process steps are carried out:<ul id="ul0001" list-style="none"><li>1. Determination of class k<sub>New</sub> for the new connection by evaluating m<sub>New</sub> and h<sub>New</sub>.</li><li>Second Calculation of the reduced service rate C<sub>red</sub>, k<sub>New</sub> for class k<sub>New</sub> according to the given equation.</li><li>Third Calculation of<img file="EP0940952A2_D0012.tif" /></li><li>4th Effective bandwidth calculation <maths id="math0012" num=""><math display="inline"><mrow><msub><mrow><mtext>c</mtext></mrow><mrow><mtext>New</mtext></mrow></msub><mtext> = c</mtext></mrow></math><img file="EP0940952A2_D0013.tif" /></maths> (m<sub>New</sub>, H<sub>New</sub>, C<sub>red</sub>, k<sub>New</sub>,<img file="EP0940952A2_D0014.tif" /> with the Lindberger formula.</li><li>5th If<maths id="math0013" num=""><math display="block"><mrow><msub><mrow><mtext>c</mtext></mrow><mrow><mtext>New</mtext></mrow></msub><msub><mrow><mtext> + C</mtext></mrow><mrow><mtext>CBR</mtext></mrow></msub><mtext> + </mtext><apply><sum /><lowlimit><mtext>k</mtext></lowlimit><uplimit /><mrow><msub><mrow><mtext> C</mtext></mrow><mrow><mtext>VBR, k</mtext></mrow></msub><mtext> ≤ C,</mtext></mrow></apply></mrow></math><img file="EP0940952A2_D0015.tif" /></maths> Accept connection, otherwise reject.</li><li>6th If the connection can be accepted, update from C<sub>VBR, k</sub> and M<sub>VBR, k</sub> (k = 1, ..., K).</li></ul>
The step 6 update is also required to reflect the impact on connections in other classes. If a connection is added or removed in another class, the effective bandwidths of all existing connections have to be recalculated and added up for each class to the value C<sub>VBR, k</sub> to obtain. This procedure must be carried out as an iterative procedure until the variables C<sub>VBR, k</sub> converge to their exact values. In practice, however, it is sufficient to carry out only a few iteration steps. The data must also be updated if a CBR connection is established instead of a VBR connection.
If a connection with the parameters m<sub>rem</sub> and h<sub>rem</sub> a procedure similar to that described above is performed. The effective bandwidth for the terminated connection is calculated and by C<sub>VBR, krem</sub> subtracted for the class in question. M<sub>VBR, krem</sub> is around m<sub>rem</sub> reduced. Then an update of all C<sub>VBR, k</sub>- Variables updated in the same way as for connecting.
As the effective bandwidth can be calculated very quickly with the Lindberger formula, the updates are not too time-consuming for a reasonable number of connections. However, a compromise must be found between the computing capacity and the accuracy of the bandwidth calculation. It may be justified not to update if the composition of the existing connections has not varied too much since the last update.
It may be sufficient to carry out the update calculations not at every connection change but at regular time intervals, which can result from a time lapse (eg every 30 s) or event-driven (for example after every 10 connections have been established or terminated).
17 sheets
Sheet 1 Sheet 2 Sheet 3 Sheet 4 Sheet 5 Sheet 6 Sheet 7 Sheet 8 Sheet 9 Sheet 10 Sheet 11 Sheet 12 Sheet 13 Sheet 14 Sheet 15 Sheet 16 Sheet 17
Every citation, both ways
| Document | Relation | Office | Cited during |
|---|---|---|---|
| US10091675B2 | Cited by | United States of America | Applicant |
| WO2014090075A1 | Cited by | World Intellectual Property Organization (WIPO) | International search |
| EP0756403A2 | Cites | European Patent Office (EPO) | Search report |
6 members in 3 offices
Priority claims5
| Document | Office | Kind | Date |
|---|---|---|---|
| 19809593 | Germany | A | |
| 19809593 | Germany | A | |
| 19809593 | Germany | – | |
| 19809593 | – | – | – |
| DE1998109593 | – | – | – |
Members6
| Document | Office | Kind | |
|---|---|---|---|
| EP0940952A2This record | European Patent Office (EPO) | A2 | |
| DE19809593A1 | Germany | A1 | |
| EP0940952A3 | European Patent Office (EPO) | A3 | |
| EP0940952B1 | European Patent Office (EPO) | B1 | |
| AT312452T | Austria | T | |
| DE59912873D1 | Germany | D1 |
38 legal events, as 5 offices reported them to INPADOC
Over the term
Point at a mark for the eventEvents
| Event | Code | Office | |
|---|---|---|---|
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Notification of lapseLapsedST | ST | FR | |
| Gb: european patent ceased through non-payment of renewal feeCeasedGBPC | GBPC | EP | |
| Application deemed withdrawn, or ip right lapsed, due to non-payment of renewal feeWithdrawnR119 | R119 | DE | |
| Annual fee paid to national office [announced via postgrant information from national office to epo]GrantedPGFP | PGFP | EP | |
| Annual fee paid to national office [announced via postgrant information from national office to epo]GrantedPGFP | PGFP | EP | |
| Annual fee paid to national office [announced via postgrant information from national office to epo]GrantedPGFP | PGFP | EP | |
| No opposition filedOpposition26N | 26N | EP | |
| No opposition filed within time limitOppositionORIGINAL CODE: 0009261PLBE | PLBE | EP | |
| Information on the status of an ep patent application or granted ep patentGrantedSTATUS: NO OPPOSITION FILED WITHIN TIME LIMITSTAA | STAA | EP | |
| Patent ceasedCeasedPL | PL | CH | |
| Fr: translation filedET | ET | EP | |
| Gb: translation of ep patent filed (gb section 77(6)(a)/1977)GBT | GBT | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Corresponds to:REF | REF | EP | |
| European patent takes effect as a national patent in ch/liEP | EP | CH | |
| Designated contracting statesAK | AK | EP | |
| European patent grantedGrantedNOT ENGLISHFG4D | FG4D | GB | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| (expected) grantORIGINAL CODE: 0009210GRAA | GRAA | EP | |
| Grant fee paidORIGINAL CODE: EPIDOSNIGR3GRAS | GRAS | EP | |
| Despatch of communication of intention to grant a patentORIGINAL CODE: EPIDOSNIGR1GRAP | GRAP | EP | |
| Designation fees paidAKX | AKX | EP | |
| First examination report despatched17Q | 17Q | EP | |
| Request for examination filed17P | 17P | EP | |
| Designated contracting statesAK | AK | EP | |
| Request for extension of the european patentAX | AX | EP | |
| Information provided on ipc code assigned before grantRIC1 | RIC1 | EP | |
| Search report despatchedORIGINAL CODE: 0009013PUAL | PUAL | EP | |
| Party data changed (applicant data changed or rights of an application transferred)RAP1 | RAP1 | EP | |
| Designated contracting statesAK | AK | EP | |
| Request for extension of the european patentAL;LT;LV;MK;RO;SIAX | AX | EP | |
| Public reference made under article 153(3) epc to a published international application that has entered the european phaseORIGINAL CODE: 0009012PUAI | PUAI | EP |
Numbers
- Publication
- 0940952
- Publication, DOCDB
- 0940952
- Publication, EPODOC
- EP0940952
- Application
- 99101306
- Application, DOCDB
- 99101306
- Application, EPODOC
- EP19990101306
Titles3
- German
- Verfahren und Gerät zur Herstellung einer Kommunikationsverbindung
- English
- Method and device for establishing a communication link
- French
- Méthode et appareil pour établir une liaison de communication
Classification
- CPC, 3
- H04Q11/0478
- H04L2012/5627
- H04L2012/5635
- IPC, 2
- H04L12 70
- H04Q11 04
Designated states25
- Contracting states, 19
- Austria
- Belgium
- Switzerland
- Cyprus
- Germany
- Denmark
- Spain
- Finland
- France
- United Kingdom
- Greece
- Ireland
- Italy
- Liechtenstein
- Luxembourg
- Monaco
- Netherlands (Kingdom of the)
- Portugal
- Sweden
- Extension states, 6
- Albania
- Lithuania
- Latvia
- North Macedonia
- Romania
- Slovenia