EP2656548A1 - Communications network management - Google Patents
Communications network managementInfo
- Publication number
- EP2656548A1 EP2656548A1 EP11805910.4A EP11805910A EP2656548A1 EP 2656548 A1 EP2656548 A1 EP 2656548A1 EP 11805910 A EP11805910 A EP 11805910A EP 2656548 A1 EP2656548 A1 EP 2656548A1
- Authority
- EP
- European Patent Office
- Prior art keywords
- segment
- network
- management module
- supervisory
- segments
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/22—Alternate routing
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/04—Network management architectures or arrangements
- H04L41/044—Network management architectures or arrangements comprising hierarchical management structures
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/14—Network analysis or design
- H04L41/147—Network analysis or design for predicting network behaviour
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/50—Network service management, e.g. ensuring proper service fulfilment according to agreements
- H04L41/5003—Managing SLA; Interaction between SLA and QoS
- H04L41/5019—Ensuring fulfilment of SLA
- H04L41/5025—Ensuring fulfilment of SLA by proactively reacting to service quality change, e.g. by reconfiguration after service quality degradation or upgrade
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/30—Routing of multiclass traffic
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/42—Centralised routing
Definitions
- the present invention relates to the operation of communications networks and in particular to the autonomic operation of communications networks.
- Network capacity management can be determined on the basis of network demands forecasts and modelling, with the expectation that the demand placed upon the network does not exceed the provisioned limit. The process of putting in more capacity once this limit has been exceeded is laborious and might even require engineers to lay more cable and connect them back into the network. Evidently, this method is very static.
- PSTN Public Switched Telephone Network
- RSVP within the Integrated Services framework
- Traditional call admission only looks at allowing a service, or data flow, access into the network. It does not address the problem of gradual underperformance of a service while being assigned to a specific sequence of resources. This becomes increasingly important when the number of services delivered on the IP networks and the variety in the Quality of Service guarantees they require expands with the introduction of TV and gaming content from numerous content providers.
- a communications network comprising: a plurality of network segments, each of the plurality of network segments comprising a segment management module, one or more routers and a plurality of communications links, the communications links connecting each router to one or more other routers; and a supervisory management module, wherein, in use, the network is configured such that each segment management module predicts the performance of the or each router in its respective segment that carries a data flow based on operational data reported by the or each router and if the predicted performance exceeds a threshold value, that segment management module will a) identify an alternative routing for the data flow within that network segment; or b) if an alternative routing for the data flow cannot be found within that network segment, send a report to the supervisory management module, the supervisory management module being configured to, in use, take action in response to the report.
- a method of managing a communications network comprising: a plurality of network segments, each of the plurality of network segments comprising a segment management module, one or more routers and a plurality of communications links, the communications links connecting each router to one or more other routers; and a supervisory management module, the method comprising the steps of: i) each segment management module predicting the performance of the or each router in its respective segment that carries a data flow based on operational data reported by the or each router and if the predicted performance exceeds a threshold value, that segment management module will ii) identify an alternative routing for the data flow within that network segment; or iii) if an alternative routing for the data flow cannot be found within that network segment, send a report to the supervisory management module, the supervisory management module being configured to, in use, take action in response to the report.
- a data carrier device comprising computer executable code for performing a method as described above.
- Figure 1 shows a schematic depiction of a communications network which comprises a plurality of different network segments
- Figure 2 shows; a schematic depiction of a network segment
- Figure 3 shows a schematic depiction of a further example of a segmented communications network
- Figure 4 shows a schematic depiction of a further example of a network being operated in accordance with the present invention
- Figure 5 shows a flowchart which provides a graphical depiction of a method according to the present invention
- Figure 6 shows a schematic depiction of a communications network after a network re-routing has been performed.
- Figure 1 shows a schematic depiction of a communications network 100.
- a path across the communications network 100 can be considered to be comprised of a plurality of different network segments 200.
- Each of the plurality of network segments 200 is associated with a respective network segment management module 300.
- Figure 1 shows only a subset of the plurality of network segments which lie on or near to an approximate route from point A to point B across the network. It will be understood that the network can be considered to comprise more network segments than are shown in Figure 1. Furthermore, only some of the plurality of network segment management modules 300 are shown in Figure .
- Figure 2 shows a schematic depiction of one of the plurality of network segments 200 which comprises one or more network routers 210 and one or more communications links 220 .
- the communications links 220 interconnect the network routers 210 within the network segment 200 and also provide connections outside the network segment, for example to network routers within other network segments or to destinations at the edge of the network, for example points A or B. These destinations at the edge of the network may comprise a node that is generating or receiving data or a gateway to further networks.
- a network segment may also comprise other elements such as switches, bridges, etc.
- the communications network 100 is divided into a number of network segments.
- a route between endpoints A and B is likely to pass through a set of the shaded segments that are shown in Figure 1.
- QoS quality of service
- P - ⁇ delay, jitter, loss ⁇ [1] but it will be understood that other parameters may be used in addition, or in the alternative. If the values of these QoS parameters exceed predetermined values which represent acceptable QoS boundaries then a SLA (Service Level Agreement) may be breached.
- SLA Service Level Agreement
- P a represent the limits to the various QoS parameters that apply to the transmission of data for the local segment a for that service session. This can be expressed as "per router or per link, this service can tolerate x seconds of delay, y seconds of loss and z seconds of jitter given that the service flow traverses a range of m - n routers in total from source to destination".
- QoS parameters can be defined centrally, obtained using operator expertise, or derived periodically by the segment management module on a per flow or per service category basis depending on the proportion of links/routers that the service traverses in that segment compared to the end-to-end distance.
- the overall QoS thresholds for each segment can be derived from this ratio, based on the size of the segment in comparison to the end-to-end chain.
- the QoS parameters are either communicated directly to each of the segment management modules or are held in a separate network management database 305.
- Each of the segment management modules are in communication with the network management database 305 such the network management database can be queried by a segment management module and the associated segment QoS parameters are returned to the management module.
- each of the segment management modules will have, for a given service flowing through the network, an array P a that states the maximum allowable QoS parameters for that particular segment in order that the overall QoS satisfies the SLA.
- MIB Management Information Base
- P 3 (d, e, f, g) [2] and to determine the function f and the parameters d, e, f & g which are equivalent to P a . It is known to perform such translations using either linear regression or, if necessary, a non-linear regression technique such as, for example, a multi-layer perceptron. It will be understood that linear regression is easier to implement and should provide sufficient accuracy. It should also be understood that if suitable router parameters can be found from another source, such as from an aggregator entity (as described below) or another protocol or set of flooded LSAs that have already been implemented to collect such network performance data, then it is possible to use this alternative source of parameters to determine the equivalent expression of P a .
- an alternative method of translating the router parameters in order to determine P a could be used.
- monitor a selected subset of parameters that directly reflect the operational performance of each of the routers in the network segments of interest and use this information in order to determine the value of P a in real time.
- Once the values of P a are determined for each network segment then it is possible to use this data to predict when the performance of the network is likely to lead to the SLA being breached, either when considering one or more segments in the network, or an end-to- end network path.
- the output required from the network as a result of this step is a "near real-time progress report" of the performance of every individual, or class of, service flow in the network.
- the actual values of the required router parameters may be obtained by each of the segment management modules periodically polling each of the routers that are comprised within their respective network segments.
- each of the routers may 'push' the required router data to the segment management modules on a periodic basis or as and when parameter values change.
- an aggregator entity 210 could be implemented to perform the mapping function f and pass the instantaneous QoS matrix it calculates from all its router sources to the segment management module, which then makes predictions based on this QoS data.
- predictions of potential underperformance can be made in a number of different known ways.
- One of the simplest methods is to use trend analysis. For example, if the buffer occupancy has increased over the past n periods, then it is likely that delays in the router will increase and therefore exceed the acceptable local threshold after the next periods.
- the number of packets discarded from a UDP voice call flow increases over n periods, then it is likely that the loss of packets will exceed acceptable thresholds after m periods if the same trend continues.
- association rule mining that learns from historical data. This could lead to rules such as
- association rule mining is a known technique and there are several known learning methods (for example, decision and regression trees or neural networks, see T Mitchell, "Machine Learning”, McGraw-Hill Science/Engineering/Math, 1st edition, 997) that could be used to make these predictions and to map these predictions to specific parameter values in the form ⁇ d a , e a , f a , g a ⁇ .
- the segment management modules compares the real-time parameter inputs it receives from its routers to the criteria required by these predictions. This can be done by comparing the rules stored in a database to the incoming parameters and automatically triggering a subsequent action when a rule is fulfilled. It will be understood that this can be done according to class of service or on a per flow basis. This distinction might be necessitated by various services from different providers requiring different SLAs and QoS parameters, therefore leading to different rules for each class of service and/or flow.
- the consequent action to be performed could comprise one or more of a large range of actions in order to prevent network congestion building up at one or more particular routers along one or more communications links within a given network segment. It is thought that one appropriate response is to spread data across the network segment, based upon historical knowledge of how much data that other currently available communications links in that segment can tolerate whilst still being able to sustain the locally assigned SLA. It will be understood that all of the traffic being transmitted over that link may be re-distributed, or alternatively just a fraction of the data can be re-distributed.
- a further advantage of such a re-assignment of some or all of the traffic from an underperforming link is that the reduction of the load on that link should provide an opportunity for the performance of that link to recover and to minimise the effect of its underperformance until a recovery has been effected.
- the segment management module will poll the router that is upstream of the most underperforming routers in order to learn about the next best hop to replace the suffering link.
- the next best hop may be within the same network segment or it may be in a different network segment. If it is in the same network segment, then a rule repository about the prior performance of the next hop link can be consulted to decide how much of the data can be offloaded onto the new link, given the current occupancy and expected performance of the proposed next hop.
- the data distribution can be done randomly across all the links that could be used to carry that particular service.
- the traffic may be distributed evenly across some or all of the available links, or the traffic may be distributed in a manner which is proportional to the available capacity on these links.
- next hop is located within the same network segment as the suffering link, once it has been decided how much data to re-route, and the next hop(s) over which it is to be re-routed, then it is necessary to implement a mechanism which distributes the re-routed traffic onto the new next hop(s).
- the iterative handover process requires a prediction period that is longer than might be necessary because the first alternative route might not be suitable, and several alternatives might need to be investigated before an acceptable alternative is found
- Figure 1 further shows a supervisory network management module 320 which is in communication with each of the plurality of network segment management modules 300.
- a network management database 310 is in communication with both the supervisory network management module and the plurality of network segment management modules.
- the supervisory network management module can function in two different methods. Firstly, if the segment management modules make local decisions to optimise each individual part of the network, but only once service degradation has occurred, then the supervisory module can add an overlay to those network segment management modules.
- the supervisory module can add a overlay to the proactive segment management modules discussed above with reference to Figure 1.
- the processing and responses of the supervisory module have to be quick enough that it can react to network speeds so that data is not lost while the processing is taking place.
- the purpose of the supervisory module is to reduce the number of handovers made between the local entities by preventing unnecessary handovers from being triggered.
- the supervisor module has access to real time performance data from each of the network elements in each of the network segments which comprise the communications network 100, and these are expressed as real-time QoS parameters P.
- the supervisory module will receive periodic updates for these QoS parameters P for each locally managed network segment, for a given class of service, thereby enabling the supervisory module to make predictions about the future health of a given network segment (alternatively, if a local management entity is already in place such as that described above these predictions can be inherited directly instead of the supervisor module having to replicate the local management's actions).
- These predictions can be made using a number of different methods, which may include knowledge held by a network operator regarding prior experience about a network segment.
- Another automated technique of making this prediction is to use an association rule miner or a time series analysis for each QoS parameter, as described above with regard to the segment management modules.
- one of the network segments determines that a communications link within that segment will soon become overloaded, then this change will be communicated to the supervisory module. If that network segment is able to re-route the data solely within the network segment then there is no need to invoke the functionality of the supervisory module. However, if it is not possible to re-route the data within that segment, then the network segment management module will send a message to the supervisory module regarding the data which it is not able to re-route. .
- the supervisory module has an overview of the entire end-to-end route across the network, the QoS thresholds for the end-to-end route and the QoS thresholds assigned for each of the different network segments that the end-to-end route passes through.
- a segment management module will send a re-routing request to the supervisory module because the segment is unable to continue to transmit the data without breaching one or more of the QoS thresholds associated with that segment. If the supervisory module is able to determine that a number of the other segments in the end-to-end path are operating sufficiently below their respective thresholds then it may permit the network segment that sent the re-routing request to carry on transmitting data via the original route.
- the QoS threshold parameters, P a for each of the segment management modules can be stored within the network management database 310 and these parameters can be accessed by the supervisory module. If there is a small number of overloaded segments within a network route then it may be possible to vary these threshold parameters, P a , in order to decrease the number of handovers and thus provide more effective network usage.
- the supervisory module receives a request from a segment management module to initiate a handover, it will check the real-time performance of each of the network segments in the end-to-end network route to determine which segments, if any, are performing better than expected and are predicted to perform better than expected. If such segments are found then it is possible to adjust the QoS parameters for the overloaded segment, for example by a margin of ⁇ , so that the QoS parameters are defined by:
- the total of the QoS parameters across the end-to-end network route must remain constant, in order that pre-agreed service level agreements can be met. If not all of the QoS parameters for a given segment (or segments) are predicted to exceed their thresholds then it is not necessary to vary the margin for those parameters, for example if a segment is expected to underperform with respect to the delay threshold but is predicted to have an acceptable jitter performance then only the threshold for delay will be increased whilst the jitter threshold will remain unchanged.
- the variations in margin may be determined on the basis of a predetermined constant value, a percentage of the initial threshold value or may be determined by an algorithm that weights the margin value in accordance with the expected performance of a network segment or other factors.
- the QoS parameter values Once the QoS parameter values have been determined for the overloaded segment(s) then they will be updated in the network management database and will be transmitted to the relevant network segment management modules. These segment management modules will then apply the new QoS parameter values and thus if it is no longer necessary to re-route the data then the rerouting will not occur.
- the supervisory module may return to a segment management module which has reported that it needs to re-route data to another segment a list of adjacent network segments which are potential candidates to receive re-routed data.
- the supervisory module may remove unsuitable network segments, for example because they lack the security required by the data stream that is to be re-routed. By providing a restricted list of segments for re-routing then the effort required of the segment management module to re-route the data can be reduced.
- the supervisory module is only able to route traffic from overloaded segments to segments which have are under-loaded and which are performing better than had been predicted. If there are no under-loaded segments then re-routing traffic will only re-route overload conditions between different network segments. If the supervisory module permits data to be rerouted on a frequent basis then this may cause an alarm to be generated as it may indicate that the network is nearing its capacity and that the autonomous fixes provided by the supervisory module are no longer sufficient to address the problem.
- Figure 3 shows a schematic depiction of a communications network in which a number of supervisory management modules 320 each are responsible for communications with a subset of the segment management modules 300.
- the network operates as described above. If a request for a re-routing of traffic from one network segment to another segment is made, then this request will be made to the appropriate supervisory management module. That supervisory management module will attempt to adjust the QoS parameters for the overloaded segment based on the other segments that it is supervising which may be performing better than had been previously predicted.
- FIG. 4 shows a schematic depiction of a further example of a network being operated in accordance with the present invention.
- Figure 4 shows two segments of that network 200A, 200B which comprise, respectively, routers 210A 1; 210A 2 , 210A 3 , 210A 4 , 21 OB, , 210B 2 , 2 OB 3 , and 210B 4 and which are in communication with network segment management modules 300A and 300B respectively.
- Both network segments 20 ⁇ & 200B are within a region of the network controlled by a common supervisory management module (not shown for the sake of clarity).
- Table 1 Exemplary QoS data for network segment 200A
- the segment management module 300A will send a request to the supervisory management module that the VoIP session be routed outside of segment 20QA. In order to process this request, the supervisory module will have access to the following information:
- Figure 5 shows a flowchart which provides a graphical depiction of a method according to the present invention.
- the supervisory module compares the predicted performance of each of the network segments that comprise the end-to-end route against the respective QoS thresholds. If one or more of the network segments are predicted to have a performance that will be significantly better than their allocated thresholds then it may be possible to relax the QoS thresholds for network segment 200A. For example, a segment whose current average performance is at least two standard deviations below the threshold may be considered to be performing significantly better than their threshold.
- the impact of the breach of the QoS thresholds is assessed.
- the supervisory module will (S520) instruct the segment management module to ignore the breach of the QoS thresholds, either for the duration of the session in question or for as long as the QoS breach is predicted to occur for.
- the ignore instruction has been sent to the segment management module then at step S530 the data relating to this decision is stored and the process ends.
- the supervisory module will, at S540, determine by what extent the QoS thresholds for one or more other network segments can be varied. For example, it may be that one segment, for example segment 20 ⁇ , is performing significantly better than predicted such that the delay threshold for that segment could be reduced from 50ms to 20ms. This reduction in the delay threshold for that segment would allow the delay threshold for a further segment, for example segment 200A, to be relaxed to 80 ms. Alternatively, there may be three different segments for which the delay threshold could be reduced to 40ms and this would still allow segment 200A to have an increased delay threshold of 80ms.
- the new QoS parameters are then provided to the respective segment management nodes (S550), either by the supervisory module pushing the parameter values to the segment management nodes directly or by the supervisory module communicating the parameter values to the network management database and the segment management nodes polling the network management database to obtain the parameter values, or by some other method.
- step S530 the various changes for the different network elements will be recorded and the process ends.
- the supervisory module will poll the router immediately preceding the overloaded link (or any entity from which it can obtain up-to-date IP routes), which in the present case is router 210A 2 , to determine a list of next best hops which could replace the overloaded link.
- the supervisory module can access predicted performance data for each of the network elements in the segments that it supervises, it is possible for the viability of the next best hops to be assessed. For the network session described above with respect to Figure 4 it may be that the next best hop is from router 210A 2 to router 210B 2 , bypassing routers 210A 3 and 210B ! .
- the supervisory node will push data regarding the new route to the segment module 300A (and possibly also to segment module 300B) such that handover between the two segments can be negotiated, as described above. It may be necessary for a number of next best hops to be determined and for the VoIP data to be split and then re-routed across these different next best hops.
- FIG. 6 shows a schematic depiction of such a network re-routing, with the active communication links depicted by a dashed line and the now inactive communications links shown with a dotted line.
- a supervisory management module for each class of service, or a plurality of supervisory management modules, with each of the supervisory management modules managing one or more different classes of service.
- the supervisory module will issue an alarm to the network operator to indicate that it has not been possible to deal with the overloaded communications link, either by modifying the QoS thresholds for a plurality of network segments, or by re-routing data within the network.
- the present invention provides a communications network which is divided into a plurality of segments, with each segment comprising one or more routers and one or more communications links that connect the routers.
- Each of the segments also comprises a segment management module.
- Each of the segment management modules reports to a supervisory management module and the communications network may comprise one or more supervisory management modules. If a segment management module predicts that a QoS threshold will be breached then it may reroute a data flow within that segment. If such a re-route is not possible then it will send a request to its supervisory management module to initiate a re-routing to a further segment.
- segment management module and the supervisory management module may be implemented by executing computer code on a general purpose computing apparatus.
- structure of the general purpose computing apparatus is not critical as long as it is capable of executing the computer code which performs a method according to the present invention.
- Such computer code may be deployed to such a general purpose computing apparatus via download, for example via the internet, or on some physical media, for example, DVD, CD-ROM, USB memory stick, etc.
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Quality & Reliability (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
Description
Claims
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| EP11805910.4A EP2656548B1 (en) | 2010-12-24 | 2011-12-23 | Communications network management |
Applications Claiming Priority (3)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| EP10252222A EP2469756A1 (en) | 2010-12-24 | 2010-12-24 | Communications network management |
| PCT/GB2011/001772 WO2012085519A1 (en) | 2010-12-24 | 2011-12-23 | Communications network management |
| EP11805910.4A EP2656548B1 (en) | 2010-12-24 | 2011-12-23 | Communications network management |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| EP2656548A1 true EP2656548A1 (en) | 2013-10-30 |
| EP2656548B1 EP2656548B1 (en) | 2019-10-09 |
Family
ID=44201781
Family Applications (2)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| EP10252222A Ceased EP2469756A1 (en) | 2010-12-24 | 2010-12-24 | Communications network management |
| EP11805910.4A Active EP2656548B1 (en) | 2010-12-24 | 2011-12-23 | Communications network management |
Family Applications Before (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| EP10252222A Ceased EP2469756A1 (en) | 2010-12-24 | 2010-12-24 | Communications network management |
Country Status (3)
| Country | Link |
|---|---|
| US (1) | US11310152B2 (en) |
| EP (2) | EP2469756A1 (en) |
| WO (1) | WO2012085519A1 (en) |
Families Citing this family (36)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2014077306A1 (en) * | 2012-11-15 | 2014-05-22 | 日本電気株式会社 | Control apparatus, communication system, control information creating method and program |
| US10146611B2 (en) * | 2012-11-19 | 2018-12-04 | Siemens Corporation | Resilient optimization and control for distributed systems |
| US10540605B2 (en) | 2013-02-05 | 2020-01-21 | Cisco Technology, Inc. | Traffic-based inference of influence domains in a network by using learning machines |
| EP2843875A1 (en) | 2013-08-30 | 2015-03-04 | British Telecommunications public limited company | Determination and use of link performance measures |
| US9734457B2 (en) * | 2013-12-31 | 2017-08-15 | Cisco Technology, Inc. | Learning data processor for distributing learning machines across large-scale network infrastructures |
| US9473364B2 (en) * | 2014-01-06 | 2016-10-18 | Cisco Technology, Inc. | Learning machine-based granular segment/path characteristic probing technique |
| US9338065B2 (en) * | 2014-01-06 | 2016-05-10 | Cisco Technology, Inc. | Predictive learning machine-based approach to detect traffic outside of service level agreements |
| US9774522B2 (en) | 2014-01-06 | 2017-09-26 | Cisco Technology, Inc. | Triggering reroutes using early learning machine-based prediction of failures |
| US10873941B2 (en) | 2014-05-16 | 2020-12-22 | Huawei Technologies Co., Ltd. | System and method for joint transmission over licensed and unlicensed bands using fountain codes |
| US10548071B2 (en) * | 2014-05-16 | 2020-01-28 | Huawei Technologies Co., Ltd. | System and method for communicating traffic over licensed or un-licensed spectrums based on quality of service (QoS) constraints of the traffic |
| US10813043B2 (en) | 2014-05-16 | 2020-10-20 | Huawei Technologies Co., Ltd. | System and method for communicating wireless transmissions spanning both licensed and un-licensed spectrum |
| US10536386B2 (en) | 2014-05-16 | 2020-01-14 | Huawei Technologies Co., Ltd. | System and method for dynamic resource allocation over licensed and unlicensed spectrums |
| WO2017001618A1 (en) | 2015-06-30 | 2017-01-05 | British Telecommunications Public Limited Company | Local and demand driven qos models |
| WO2017001626A1 (en) | 2015-06-30 | 2017-01-05 | British Telecommunications Public Limited Company | Quality of service management in a network |
| US10700962B2 (en) | 2015-06-30 | 2020-06-30 | British Telecommunications Public Limited Company | Communications network |
| GB2539976A (en) | 2015-06-30 | 2017-01-04 | British Telecomm | Communications network |
| US11075843B2 (en) | 2015-06-30 | 2021-07-27 | British Telecommunications Public Limited Company | Model management in a dynamic QOS environment |
| US10855601B2 (en) * | 2015-06-30 | 2020-12-01 | British Telecommunications Public Limited Company | Model management in a dynamic QoS environment |
| WO2017001634A1 (en) | 2015-06-30 | 2017-01-05 | British Telecommunications Public Limited Company | Negotiating quality of service for data flows |
| EP3318015B1 (en) | 2015-06-30 | 2019-10-30 | British Telecommunications public limited company | Energy management in a network |
| WO2017001621A1 (en) | 2015-06-30 | 2017-01-05 | British Telecommunications Public Limited Company | Modifying quality of service treatment for data flows |
| US10454877B2 (en) | 2016-04-29 | 2019-10-22 | Cisco Technology, Inc. | Interoperability between data plane learning endpoints and control plane learning endpoints in overlay networks |
| US10091070B2 (en) | 2016-06-01 | 2018-10-02 | Cisco Technology, Inc. | System and method of using a machine learning algorithm to meet SLA requirements |
| US10630590B2 (en) * | 2016-07-14 | 2020-04-21 | Mellanox Technologies Tlv Ltd. | Credit loop deadlock detection and recovery in arbitrary topology networks |
| CN108173894A (en) * | 2016-12-07 | 2018-06-15 | 阿里巴巴集团控股有限公司 | The method, apparatus and server apparatus of server load balancing |
| US10977574B2 (en) * | 2017-02-14 | 2021-04-13 | Cisco Technology, Inc. | Prediction of network device control plane instabilities |
| US10963813B2 (en) | 2017-04-28 | 2021-03-30 | Cisco Technology, Inc. | Data sovereignty compliant machine learning |
| US10477148B2 (en) | 2017-06-23 | 2019-11-12 | Cisco Technology, Inc. | Speaker anticipation |
| US10608901B2 (en) | 2017-07-12 | 2020-03-31 | Cisco Technology, Inc. | System and method for applying machine learning algorithms to compute health scores for workload scheduling |
| US10091348B1 (en) | 2017-07-25 | 2018-10-02 | Cisco Technology, Inc. | Predictive model for voice/video over IP calls |
| US10867067B2 (en) | 2018-06-07 | 2020-12-15 | Cisco Technology, Inc. | Hybrid cognitive system for AI/ML data privacy |
| US10446170B1 (en) | 2018-06-19 | 2019-10-15 | Cisco Technology, Inc. | Noise mitigation using machine learning |
| WO2020115273A1 (en) * | 2018-12-07 | 2020-06-11 | Telefonaktiebolaget Lm Ericsson (Publ) | Predicting network communication performance using federated learning |
| WO2022018735A1 (en) * | 2020-07-22 | 2022-01-27 | Telefonaktiebolaget Lm Ericsson (Publ) | Network node and method for handling operations in a communications network |
| US11463365B1 (en) * | 2021-01-15 | 2022-10-04 | Cisco Technology, Inc. | Preempting time-based SLA violations in computer networks |
| TWI909157B (en) * | 2023-05-18 | 2025-12-21 | 緯創資通股份有限公司 | Variable configuration method and variable configuration device thereof |
Family Cites Families (34)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US5774669A (en) | 1995-07-28 | 1998-06-30 | The United States Of America As Represented By The Administrator Of The National Aeronautics And Space Administration | Scalable hierarchical network management system for displaying network information in three dimensions |
| US6308174B1 (en) | 1998-05-05 | 2001-10-23 | Nortel Networks Limited | Method and apparatus for managing a communications network by storing management information about two or more configuration states of the network |
| US6657954B1 (en) | 1999-03-31 | 2003-12-02 | International Business Machines Corporation | Adapting receiver thresholds to improve rate-based flow control |
| US6353902B1 (en) | 1999-06-08 | 2002-03-05 | Nortel Networks Limited | Network fault prediction and proactive maintenance system |
| US6609212B1 (en) | 2000-03-09 | 2003-08-19 | International Business Machines Corporation | Apparatus and method for sharing predictive failure information on a computer network |
| US7260635B2 (en) | 2000-03-21 | 2007-08-21 | Centrisoft Corporation | Software, systems and methods for managing a distributed network |
| US7225250B1 (en) | 2000-10-30 | 2007-05-29 | Agilent Technologies, Inc. | Method and system for predictive enterprise resource management |
| US7383191B1 (en) | 2000-11-28 | 2008-06-03 | International Business Machines Corporation | Method and system for predicting causes of network service outages using time domain correlation |
| US20020141342A1 (en) | 2000-12-07 | 2002-10-03 | Furman Elliot M. | Method and system for automatically directing data in a computer network |
| ATE413744T1 (en) | 2001-03-30 | 2008-11-15 | Nokia Corp | METHOD OF CONFIGURATION OF A NETWORK BY DEFINING CLUSTERS |
| FR2834409B1 (en) * | 2002-01-03 | 2005-01-14 | Cit Alcatel | SYSTEM FOR MANAGING TRANSPORT NETWORKS BASED ON THE ANALYSIS OF TRENDS OF DATA ACQUIRED ON THE NETWORK |
| US7145871B2 (en) | 2002-03-02 | 2006-12-05 | At&T Corp. | Automatic router configuration based on traffic and service level agreements |
| JP2004173136A (en) * | 2002-11-22 | 2004-06-17 | Fujitsu Ltd | Network management device |
| US7020087B2 (en) * | 2003-01-13 | 2006-03-28 | Motorola, Inc. | Segmented and distributed path optimization in a communication network |
| US7453864B2 (en) * | 2003-04-30 | 2008-11-18 | Harris Corporation | Predictive route maintenance in a mobile ad hoc network |
| US8041797B2 (en) * | 2004-03-31 | 2011-10-18 | International Business Machines Corporation | Apparatus and method for allocating resources based on service level agreement predictions and associated costs |
| US7570581B2 (en) | 2004-09-23 | 2009-08-04 | Motorola, Inc. | Dynamic reduction of route reconvergence time |
| US7103509B2 (en) | 2004-11-23 | 2006-09-05 | General Electric Company | System and method for predicting component failures in large systems |
| US8045453B2 (en) | 2005-01-20 | 2011-10-25 | Alcatel Lucent | Methods and systems for alleviating congestion in a connection-oriented data network |
| US20070174449A1 (en) | 2005-07-22 | 2007-07-26 | Ankur Gupta | Method and system for identifying potential adverse network conditions |
| JP4606333B2 (en) | 2005-09-20 | 2011-01-05 | 富士通株式会社 | Routing control method |
| US20070121509A1 (en) | 2005-10-12 | 2007-05-31 | Sbc Knowledge Ventures Lp | System and method for predicting updates to network operations |
| US7484132B2 (en) | 2005-10-28 | 2009-01-27 | International Business Machines Corporation | Clustering process for software server failure prediction |
| US8407176B2 (en) | 2006-05-05 | 2013-03-26 | British Telecommunications Plc | Data processing method for controlling a network |
| US7796532B2 (en) | 2006-05-31 | 2010-09-14 | Cisco Technology, Inc. | Media segment monitoring |
| US7948909B2 (en) | 2006-06-30 | 2011-05-24 | Embarq Holdings Company, Llc | System and method for resetting counters counting network performance information at network communications devices on a packet network |
| US8274905B2 (en) | 2006-08-22 | 2012-09-25 | Embarq Holdings Company, Llc | System and method for displaying a graph representative of network performance over a time period |
| US9398346B2 (en) | 2007-05-04 | 2016-07-19 | Time Warner Cable Enterprises Llc | Methods and apparatus for predictive capacity allocation |
| US20090028056A1 (en) | 2007-07-26 | 2009-01-29 | At&T Knowledge Ventures, L.P. | System and method for predicting a fault in a real-time transport protocol packet stream |
| US8861546B2 (en) * | 2009-03-06 | 2014-10-14 | Cisco Technology, Inc. | Dynamically and fairly allocating RF channel bandwidth in a wideband cable system |
| GB0905566D0 (en) | 2009-03-31 | 2009-05-13 | British Telecomm | Network |
| US20120020216A1 (en) | 2010-01-15 | 2012-01-26 | Telcordia Technologies, Inc. | Cognitive network load prediction method and apparatus |
| EP2375637A1 (en) | 2010-03-22 | 2011-10-12 | British Telecommunications Public Limited Company | Network routing adaptation based on failure prediction |
| US8788654B2 (en) | 2010-12-07 | 2014-07-22 | Cisco Technology, Inc. | System and method for allocating resources based on events in a network environment |
-
2010
- 2010-12-24 EP EP10252222A patent/EP2469756A1/en not_active Ceased
-
2011
- 2011-12-23 EP EP11805910.4A patent/EP2656548B1/en active Active
- 2011-12-23 US US13/997,485 patent/US11310152B2/en active Active
- 2011-12-23 WO PCT/GB2011/001772 patent/WO2012085519A1/en not_active Ceased
Non-Patent Citations (1)
| Title |
|---|
| See references of WO2012085519A1 * |
Also Published As
| Publication number | Publication date |
|---|---|
| US11310152B2 (en) | 2022-04-19 |
| US20130311673A1 (en) | 2013-11-21 |
| WO2012085519A1 (en) | 2012-06-28 |
| EP2656548B1 (en) | 2019-10-09 |
| EP2469756A1 (en) | 2012-06-27 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| EP2656548B1 (en) | Communications network management | |
| EP2656551B1 (en) | Communications network management | |
| EP2656549B1 (en) | Communications network management | |
| EP2656546B1 (en) | Communications network management | |
| US10805214B2 (en) | Traffic matrix prediction and fast reroute path computation in packet networks | |
| RU2667039C2 (en) | Partial replacement of the switch of the program-configurable network in ip networks | |
| JP4598640B2 (en) | Route selection method and apparatus in telecommunication network | |
| EP3047609B1 (en) | Systems and method for reconfiguration of routes | |
| KR102104047B1 (en) | Congestion control in packet data networking | |
| US9806991B2 (en) | Rendering network policy and monitoring compliance | |
| US7929440B2 (en) | Systems and methods for capacity planning using classified traffic | |
| Moravejosharieh et al. | A fuzzy logic approach to increase quality of service in software defined networking | |
| Beshley et al. | Adaptive flow routing model in SDN | |
| Nucci et al. | IGP link weight assignment for operational tier-1 backbones | |
| Bouzidi et al. | Online based learning for predictive end-to-end network slicing in 5G networks | |
| Golani et al. | Fault tolerant traffic engineering in software-defined WAN | |
| CN | A proactive flow admission and re-routing scheme for load balancing and mitigation of congestion propagation in SDN data plane | |
| Mohammadi et al. | EFSUTE: A novel efficient and survivable traffic engineering for software defined networks | |
| Bouzidi et al. | Online-based learning for predictive network latency in software-defined networks | |
| Nucci et al. | Increasing link utilization in IP over WDM networks | |
| Gausseran et al. | Poster: Don't interrupt me when you reconfigure my service function chains | |
| Lemeshko et al. | Advanced solution of the Fast ReRoute based on principles of Traffic Engineering and Traffic Policing | |
| van Eijl | Capacity planning for carrier-scale IP networks | |
| Biswas et al. | An Efficient Rerouting Approach in Software Defined Networks | |
| Tootaghaj et al. | Poster: a minimally disruptive network reconfiguration approach in SDN |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PUAI | Public reference made under article 153(3) epc to a published international application that has entered the european phase |
Free format text: ORIGINAL CODE: 0009012 |
|
| 17P | Request for examination filed |
Effective date: 20130524 |
|
| AK | Designated contracting states |
Kind code of ref document: A1 Designated state(s): AL AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HR HU IE IS IT LI LT LU LV MC MK MT NL NO PL PT RO RS SE SI SK SM TR |
|
| DAX | Request for extension of the european patent (deleted) | ||
| RAP1 | Party data changed (applicant data changed or rights of an application transferred) |
Owner name: BRITISH TELECOMMUNICATIONS PUBLIC LIMITED COMPANY |
|
| STAA | Information on the status of an ep patent application or granted ep patent |
Free format text: STATUS: EXAMINATION IS IN PROGRESS |
|
| 17Q | First examination report despatched |
Effective date: 20181001 |
|
| RIC1 | Information provided on ipc code assigned before grant |
Ipc: H04L 12/56 20181130ALI20120713BHEP Ipc: H04L 12/24 20060101AFI20120713BHEP |
|
| RIC1 | Information provided on ipc code assigned before grant |
Ipc: H04L 12/56 20060101ALI20120713BHEP Ipc: H04L 12/24 20060101AFI20120713BHEP |
|
| GRAP | Despatch of communication of intention to grant a patent |
Free format text: ORIGINAL CODE: EPIDOSNIGR1 |
|
| STAA | Information on the status of an ep patent application or granted ep patent |
Free format text: STATUS: GRANT OF PATENT IS INTENDED |
|
| INTG | Intention to grant announced |
Effective date: 20190510 |
|
| RIC1 | Information provided on ipc code assigned before grant |
Ipc: H04L 12/725 20130101ALI20190426BHEP Ipc: H04L 12/707 20130101ALI20190426BHEP Ipc: H04L 12/701 20130101ALI20190426BHEP Ipc: H04L 12/717 20130101ALI20190426BHEP Ipc: H04L 12/24 20060101AFI20190426BHEP |
|
| GRAS | Grant fee paid |
Free format text: ORIGINAL CODE: EPIDOSNIGR3 |
|
| GRAA | (expected) grant |
Free format text: ORIGINAL CODE: 0009210 |
|
| STAA | Information on the status of an ep patent application or granted ep patent |
Free format text: STATUS: THE PATENT HAS BEEN GRANTED |
|
| AK | Designated contracting states |
Kind code of ref document: B1 Designated state(s): AL AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HR HU IE IS IT LI LT LU LV MC MK MT NL NO PL PT RO RS SE SI SK SM TR |
|
| REG | Reference to a national code |
Ref country code: GB Ref legal event code: FG4D |
|
| REG | Reference to a national code |
Ref country code: CH Ref legal event code: EP |
|
| REG | Reference to a national code |
Ref country code: IE Ref legal event code: FG4D |
|
| REG | Reference to a national code |
Ref country code: DE Ref legal event code: R096 Ref document number: 602011062634 Country of ref document: DE |
|
| REG | Reference to a national code |
Ref country code: AT Ref legal event code: REF Ref document number: 1190095 Country of ref document: AT Kind code of ref document: T Effective date: 20191115 |
|
| REG | Reference to a national code |
Ref country code: NL Ref legal event code: MP Effective date: 20191009 |
|
| REG | Reference to a national code |
Ref country code: LT Ref legal event code: MG4D |
|
| REG | Reference to a national code |
Ref country code: AT Ref legal event code: MK05 Ref document number: 1190095 Country of ref document: AT Kind code of ref document: T Effective date: 20191009 |
|
| PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: PL Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20191009 Ref country code: LT Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20191009 Ref country code: BG Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20200109 Ref country code: NO Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20200109 Ref country code: SE Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20191009 Ref country code: LV Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20191009 Ref country code: NL Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20191009 Ref country code: ES Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20191009 Ref country code: PT Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20200210 Ref country code: AT Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20191009 Ref country code: FI Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20191009 Ref country code: GR Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20200110 |
|
| PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: IS Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20200224 Ref country code: RS Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20191009 Ref country code: HR Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20191009 |
|
| PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: AL Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20191009 |
|
| REG | Reference to a national code |
Ref country code: DE Ref legal event code: R097 Ref document number: 602011062634 Country of ref document: DE |
|
| PG2D | Information on lapse in contracting state deleted |
Ref country code: IS |
|
| PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: DK Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20191009 Ref country code: EE Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20191009 Ref country code: CZ Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20191009 Ref country code: RO Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20191009 Ref country code: IS Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20200209 |
|
| REG | Reference to a national code |
Ref country code: CH Ref legal event code: PL |
|
| PLBE | No opposition filed within time limit |
Free format text: ORIGINAL CODE: 0009261 |
|
| STAA | Information on the status of an ep patent application or granted ep patent |
Free format text: STATUS: NO OPPOSITION FILED WITHIN TIME LIMIT |
|
| REG | Reference to a national code |
Ref country code: BE Ref legal event code: MM Effective date: 20191231 |
|
| PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: MC Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20191009 Ref country code: IT Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20191009 Ref country code: SK Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20191009 Ref country code: SM Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20191009 |
|
| 26N | No opposition filed |
Effective date: 20200710 |
|
| PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: IE Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20191223 Ref country code: LU Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20191223 |
|
| PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: CH Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20191231 Ref country code: LI Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20191231 Ref country code: SI Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20191009 Ref country code: BE Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20191231 |
|
| PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: CY Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20191009 |
|
| PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: MT Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20191009 Ref country code: HU Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT; INVALID AB INITIO Effective date: 20111223 |
|
| REG | Reference to a national code |
Ref country code: DE Ref legal event code: R079 Ref document number: 602011062634 Country of ref document: DE Free format text: PREVIOUS MAIN CLASS: H04L0012240000 Ipc: H04L0041000000 |
|
| PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: TR Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20191009 |
|
| PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: MK Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20191009 |
|
| P01 | Opt-out of the competence of the unified patent court (upc) registered |
Effective date: 20230623 |
|
| PGFP | Annual fee paid to national office [announced via postgrant information from national office to epo] |
Ref country code: DE Payment date: 20251126 Year of fee payment: 15 |
|
| PGFP | Annual fee paid to national office [announced via postgrant information from national office to epo] |
Ref country code: GB Payment date: 20251119 Year of fee payment: 15 |
|
| PGFP | Annual fee paid to national office [announced via postgrant information from national office to epo] |
Ref country code: FR Payment date: 20251120 Year of fee payment: 15 |