EP1395003B1 - Procédé de routage selon le plus court chemin à base de contraintes pour des réseaux optiques de transport commutés dynamiquement - Google Patents

Procédé de routage selon le plus court chemin à base de contraintes pour des réseaux optiques de transport commutés dynamiquement Download PDF

Info

Publication number
EP1395003B1
EP1395003B1 EP03018815A EP03018815A EP1395003B1 EP 1395003 B1 EP1395003 B1 EP 1395003B1 EP 03018815 A EP03018815 A EP 03018815A EP 03018815 A EP03018815 A EP 03018815A EP 1395003 B1 EP1395003 B1 EP 1395003B1
Authority
EP
European Patent Office
Prior art keywords
network
path
links
network graph
primary
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.)
Expired - Lifetime
Application number
EP03018815A
Other languages
German (de)
English (en)
Other versions
EP1395003A3 (fr
EP1395003A2 (fr
Inventor
Fuming Wu
Frederick H. Skoog
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Alcatel Lucent SAS
Original Assignee
Alcatel Lucent SAS
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Alcatel Lucent SAS filed Critical Alcatel Lucent SAS
Publication of EP1395003A2 publication Critical patent/EP1395003A2/fr
Publication of EP1395003A3 publication Critical patent/EP1395003A3/fr
Application granted granted Critical
Publication of EP1395003B1 publication Critical patent/EP1395003B1/fr
Anticipated expiration legal-status Critical
Expired - Lifetime legal-status Critical Current

Links

Images

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/50—Routing or path finding of packets in data switching networks using label swapping, e.g. multi-protocol label switch [MPLS]
    • 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/02—Topology update or discovery
    • 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/02—Topology update or discovery
    • H04L45/03—Topology update or discovery by updating link state protocols
    • 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

Definitions

  • the present invention generally relates to dynamically switched optical transport networks and in particular to a constraint-based shortest path first method for such networks. More particularly, the present invention is directed to a traffic network element for a network according to the preamble of claim 1 and to a method of computing an explicit route through a network according to the preamble of claim 5.
  • TE Traffic Engineering
  • GMPLS Generalized Multi-Protocol Label Switch
  • a signaling entity in an ingress transport network element signals the creation of a Label Switched Path ("LSP") on a predetermined strict explicit route using a network resource reservation protocol, such as RSVP-TE or LDP.
  • LSP Label Switched Path
  • a path selection algorithm that can be initiated in an on-demand basis must be implemented in each TNE in the GMPLS transport domain.
  • the determined strict explicit route must fulfill traffic demands, including level of service and diversity requirements, and route specifications, including the ingress and egress TNE addresses.
  • the transport network resource availability and its topological information are critical for successful setup of the corresponding LSP and are maintained and frequently updated in the TE network database ("TEND") by a TE Internet Gateway Protocol ("TE-IGP"), such as OSPF-TE or ISIS-TE.
  • TE-IGP TE Internet Gateway Protocol
  • OSPF-TE or ISIS-TE TE Internet Gateway Protocol
  • Constraint-based routing in the GMPLS control plane domain is one of the main processes required for on-demand service provisioning, or "bandwidth-on-demand", and for dynamic service restoration, which are considered two of the main incentives for the use of GMPLS in optical transport networks (“OTNs").
  • CBR is defined as the mechanism for computing a feasible network path from a source, or ingress, TNE traffic bearing port to a destination, or egress, TNE traffic bearing port on a network demand, which includes a set of traffic description parameters and a set of service constraint parameters for the desired connection path.
  • CBR Cost-to-Value
  • QoS Quality of Service
  • the present invention advantageously provides method and apparatus for implementing a constraint-based shortest path first ("CSPF”) technique for dynamically switched optical transport networks.
  • CSPF constraint-based shortest path first
  • One embodiment comprises a traffic network element ("TNE”) in a network comprising a traffic engineering network database (“TEND”) that stores network topology information for the network and bandwidth availability information for links in the network; and a routing engine that receives a request for a label switched path (“LSP”) with specified constraints, processes network topology information from the TEND to create a network graph comprising links meeting the specified constraints, and computes a primary path through the network, wherein the primary path comprises links selected from the network graph.
  • TNE traffic network element
  • TEND traffic engineering network database
  • LSP label switched path
  • Another embodiment comprises a method of computing an explicit route through a network comprising receiving a path setup request message for a new traffic flow in the network, wherein the path setup request message includes specified constraints on the path; generating a network graph from network information stored in a traffic engineering network database (“TEND"), wherein links not meeting the specified constraints for the path are eliminated from the graph; and calculating a primary explicit route through the network from the generated network graph.
  • TID traffic engineering network database
  • TNE traffic network element
  • the TNE comprising-means for storing network topology information for the network and bandwidth availability information for links in the network; and means for processing information from the TEND to create a network graph comprising links meeting specified constraints in a request for a label switched path (“LSP”) and calculating a primary explicit route through the network, wherein the primary explicit route comprises links selected from the network graph.
  • LSP label switched path
  • FIG. 1 is a block diagram of a GMPLS optical transport network (“OTN") 100 in accordance with one embodiment.
  • the OTN 100 comprises a plurality of transport network elements (“TNEs”), or nodes, represented in FIG. 1 by TNEs 102, interconnected by links comprising an IP network 103.
  • TNEs transport network elements
  • Each TNE 102 includes a GMPLS routing engine (“GMRE”) 104, which will be described in greater detail with reference to FIG. 2 .
  • GMRE GMPLS routing engine
  • each GMRE 104 comprises a set of subsystems, including a Routing Manager (“RM”) 200, a Signaling Manager (“SM”) 202, and a Path Selection Component (“PSC”) 204 for implementing a CSPF technique 205 of one embodiment.
  • the SM 202 is responsible for signaling the creation of Label Switched Paths ("LSPs").
  • LSPs Label Switched Paths
  • an ideal method for the SM is to assign a new Resource Reservation Protocol Traffic Engineering Extension (“RSVP-TE”) session for each end-to-end traffic flow on the ingress TNE 102.
  • the SM 202 relies on a number of extensions of the RSVP.
  • a predetermined Explicit Route Object (“ERO") enables an RSVP PATH message to request that intermediate TNEs provide a label binding for the LSP that it is establishing.
  • the Label Object enables RSVP to support the distribution of Labels from upstream TNEs to downstream TNEs via an RSVP PATH message.
  • the PSC 204 is connected to and functions independently from the SM 202.
  • the function of the PSC 204 is to determine the ERO(s) for each end-to-end traffic flow by applying the CSPF technique 205 to the information residing in a Traffic Engineering Network Database ("TEND") 206 on the ingress TNE 102.
  • TEND 206 forms a part of and is maintained by an IP-based Interior Gateway Protocol (“IGP") component 208.
  • IGP IP-based Interior Gateway Protocol
  • the TNEs 102 share network topology information among themselves using the IGP, which in the embodiment illustrated in FIG. 2 is OSPF, but may be another IGP, such as IS-IS.
  • the network topology information maintained in the TEND 206 is made available to the PSC 205 to enable a path calculation process as described hereinbelow.
  • the CSPF technique 205 is a path calculation method that takes into account a set of specific restrictions, or constraints, when calculating the shortest path across the OTN 100.
  • the CSPF technique 205 is capable of producing up to two EROs for each path calculation request message from the SM 202. This is primarily due to the fact that the information about the available resources of the OTN 100 is based on the allocation status; that is, the unreserved bandwidth of TE links change with the same time-scale as the LSP arrival/departure process.
  • the TEND 206 in a TNE 102 may not always timely reflect the exact status of the available resources in the OTN 100. The existence of an ERO may not guarantee that the ERO is workable until the LSP is actually established.
  • the primary ERO is the least expensive (defined in terms of the sum of the link metrics of all of the TE links included in the ERO) ERO that meets all of the specified constraints.
  • the backup ERO is the most competitive path among the EROs that meet all of the specified constraints that is link-diverse, node-diverse and/or SRLG-diverse with the primary ERO.
  • the CSPF technique 205 also considers the load-balancing issue, in that the TE link with the maximum unreserved bandwidth will be chosen if there are two or more TE links between a pair of TNEs 102 with the same minimal cost. This strategy also decreases the probability of failure of the corresponding signaling session.
  • the OTN 100 comprises only one autonomous system or OSPF area and that all of the connections are bi-directional, although the network topology is modeled as a directed graph, since unidirectional connections can also be. supported.
  • path calculation request messages (“CSPF_Calculate_Path_Req") issued by the SM 202 to the PSC 204 can only be processed in a serial manner. This means that the issuer of a path calculation request must wait for a path calculation response message (“CSPF_Calculate_Path_Resp") from the CSPF component 204a of the PSC 204 before processing the next request.
  • CSPF_Calculate_Path_Resp path calculation response message
  • the SM 202 Upon receiving the primary ERO and/or the backup ERO from the PSC 204, the SM 202 will first attempt to invoke the primary ERO to a new RSVP session. The back up ERO is used for the RSVP session if the primary ERO fails.
  • the traffic engineering extension of the OSPF component 208 is the network information gathering component in the RM 200.
  • the OSPF component 208 builds the topological map augmented with information about network resource availability, e.g., link protection scheme, unreserved bandwidth, minimal LSP bandwidth, maximal LSP bandwidth, link metric, and Shared Risk Link Group ("SRLG"), and switching capability information for each link. All of the information is maintained in the TEND 206 of the OSPF component 208.
  • network resource availability e.g., link protection scheme, unreserved bandwidth, minimal LSP bandwidth, maximal LSP bandwidth, link metric, and Shared Risk Link Group ("SRLG")
  • the PSC 204 collects the information required as input to the CSPF technique 205 at the time it receives a path calculation request from the SM 202.
  • This information includes the route specification (i.e., the source and destination TNE addresses), traffic demands (i.e., service level and diversity requirements); and network resource availability information. Based on this information, the PSC 204 performs a calculation by executing the CSPF technique 205 and returns the resulting ERO(s) to the SM 202 in the form of a CSPF_Calculate_Path_Resp message.
  • link protection type includes unprotected, dedicated 1+1, dedicated 1:1, and AnyType.
  • a data-bearing link is said to be "unprotected” if there is no backup link for traffic being carried on the link.
  • a data-bearing link is said to be "dedicated 1+1” if a disjoint backup data-bearing link is reserved and dedicated for protecting the primary data-bearing link. This backup data-bearing link is not shared by any other connection and traffic is duplicated and carried simultaneously over both links.
  • a data-bearing link is said to be "dedicated 1:1” if a disjoint backup data-bearing link of type "Extra Traffic” is reserved for protecting the primary link.
  • a disjoint backup data-bearing link of type "Extra Traffic” is reserved for protecting the primary link.
  • the LSP is to be routed over any available links.
  • Supported diversity types include shared risk link group ("SRLG"), node, and link.
  • a set of data-bearing links is said to constitute an SRLG if they share a resource whose failure will affect all links in the set.
  • An SRLG can be identified by its identifier, which is global unique.
  • a data-bearing link may belong to multiple SRLGs.
  • the SRLG set of a given data-bearing link is the union of the SRLG identifiers that correspond to the SRLGs to which the data-bearing link belongs.
  • Two LSPs are said to be node diverse if they share no common intermediate node(s).
  • Two LSPs are said to be link diverse if there is no data-bearing link pairs from the different LSPs that belong to the same TE link.
  • ERO1 and ERO2 are the primary EROs that correspond respectively to LSP1 and LSP2
  • LSP1 is link diverse with LSP2
  • ERO1 and ERO2 have no common TE link; that is, the set of all TE links belonging to ERO1 and the set of all TE links belonging to ERO2 are disjoint.
  • the CSPF technique. 205 selects the primary ERO and/or the backup ERO capable of satisfying the specified constraints (i.e., protection and diversity requirements) while at the same time attempting to minimize the total cost of ERO hops.
  • the cost of an ERO hop is measured by the link metric of the selected TE link.
  • An ERO calculated by the CSPF technique 205 consists of a sequence of TE links that represent the ordered series of hops of the ERO. For each hop, the CSPF technique 205 specifies a pair (node ID, interface ID) followed by the SRLG information of the hop.
  • the "node ID” is the address of the local TNE and the "interface ID” is the outgoing interface ID of the corresponding TE link.
  • the SRLG information of the hop is provided by the SRLG set of the corresponding TE link.
  • a CSPF_Calculate_Path_Req message is sent from the SM 202 to the PSC 204 to request calculation of one or two strict EROs for a traffic demand.
  • the CSPF_Calculate_Path_Req message is graphically represented in FIG. 3 and designated by a reference numeral 300. As illustrated in FIG.
  • the message 300 includes a transactionID field 302, the contents of which indicate the transaction identifier of the request; a requestType field 304, the contents of which indicate the number of EROs that need to be calculated for the request; an srcNode field 306, the contents of which indicate the IP address of the source TNE; a dstNode field 308, the contents of which indicate the IP address of the destination TNE; a protectionType field 310, the contents of which indicate the requested protection type of the resulting ERO; a nodeSet field 312, the contents of which indicate the list of TNEs with which a resulting ERO is diverse; a linkSet field 314, the contents of which indicate the list of TE links with which a resulting ERO is diverse; and an srlgSet field 316, the contents of which indicate a list of SRLG identities with which a resulting ERO is diverse.
  • a CSPF_Calculate_Path_Resp message is sent from the PSC 204 to the SM 202 to request calculation of one or two strict EROs for a traffic demand.
  • the CSPF_Calculate_Path_Resp message is graphically represented in FIG. 4 and designated by a reference numeral 400. As illustrated in FIG.
  • the message 400 includes a transactionID field 402, the contents of which indicate the transaction identifier of the request; a pStatus field 404, the contents of which indicate the calculation status of the primary ERO; a primaryEro field 406, the contents of which provide the complete information of the primary ERO; a bStatus field 408, the contents of which indicate the calculation status of the backup ERO (if required); and a backupEro field 410, the contents of which indicate the complete information of the backup ERO (if required).
  • an embodiment of the invention will be described with reference to an OTN comprising 30 nodes, represented in FIG. 1 by the six nodes 102; however, it should be recognized that the size of an OTN in which the invention described herein is implemented, in terms of provisioned nodes and interconnection links, may be larger or smaller.
  • one embodiment of the CSPF method comprises four functional steps, including building a network graph (step 500), calculating the primary ERO using the network graph (step 502), pruning the network graph (step 504), and calculating the backup ERO from the pruned network graph (step 506).
  • steps 500-506 will be described in greater detail below.
  • step 500 network topology and resource availability information is read from the TEND 206 and produces a network graph by eliminating the TE links that do not have the protection type indicated in the field 310 of the CSPF_Calculate_Path_Req message 300 and are not diverse with the SRLG set indicated in the field 316 of the CSPF_Calculate_Path_Req message.
  • the TE links between a pair of TNEs are inserted into the network graph in increasing order of increasing link metric.
  • TE links with the same link metric are inserted in decreasing order of unreserved bandwidth metric.
  • the primary ERO is obtained by applying an SPF algorithm, such as Dijkstra's SPF, to the network graph developed in step 500.
  • step 504 if a backup ERO has been requested, as indicated by the contents of the field 302 of the CSPF_Calculate_Path_Req message 300, is required, the network graph developed in step 500 is pruned to meet the diversity requirement with respect to the primary ERO, as specified by the contents of the field 316 of the CSPF_Calculate_Path_Req message. Specifically, all TE links in the network graph that are not diverse with primary ERO are pruned from the network graph to create a pruned network graph.
  • step 506 the backup ERO is determined by applying a SPF algorithm, such as Dijkstra's SPF algorithm, to the pruned network graph determined in step 504.
  • a SPF algorithm such as Dijkstra's SPF algorithm
  • the CSPF method has been designed with the ability to calculate a primary ERO and an optional backup ERO for each traffic demand. Simulations have demonstrated that the time required to calculate the backup ERO is quite small as compared to that required to build the network graph and calculate the primary ERO. Specifically, more than 80% of the total time to calculate both EROs is used in building the network graph. However, by using both the primary and backup EROs, the failure probability of establishing an LSP decreases significantly. Stated alternatively, the probability of establishing a successful connection through the OTN is greatly improved through use of both the primary and backup EROs.
  • Another advantage of calculating both a primary ERO and a backup ERO is that the backup ERO can be used to' protect the primary ERO in case of critical data transfer. It is worth mentioning that the CSPF method takes the load-balancing issue into account, thereby improving the possibility of successfully establishing the LSP by using either the primary ERO or the backup ERO.
  • the present invention advantageously provides a constraint-based method of calculating a shortest path between a pair of nodes in an OTN.

Claims (10)

  1. Élément de réseau de trafic TNE (102) pour un réseau, le TNE comprenant :
    une base de données de réseau de gestion du trafic TEND (206) conçue pour stocker des informations de réseau pour le réseau ;
    un moteur de routage (200) conçu pour recevoir un message de demande d'établissement d'un trajet pour un trajet commuté balisé à travers le réseau avec un premier champ (310) se rapportant à un type de protection de liaison et un deuxième champ (316) se rapportant à un groupe de liaisons à risque partagé ;
    le moteur de routage étant conçu pour traiter les informations de réseau provenant du TEND pour créer un graphique du réseau, les liaisons qui ne possèdent par le type de protection de liaison du premier champ (310) du message de demande d'établissement de trajet étant éliminées du graphique du réseau et les liaisons qui ne sont pas différentes du groupe de liaisons à risque partagé du deuxième champ (316) du message de demande d'établissement de trajet étant éliminées du graphique du réseau ;
    et le moteur de routage étant en plus conçu pour calculer un trajet primaire à travers le réseau, le trajet primaire comprenant des liaisons sélectionnées parmi le graphique du réseau.
  2. TNE selon la revendication 1, le moteur de routage étant conçu pour élaguer le graphique de réseau afin d'en éliminer les liaisons comprenant le trajet primaire.
  3. TNE selon la revendication 2, le moteur de routage étant conçu pour calculer un trajet de secours à travers le réseau, le trajet de secours comprenant des liaisons sélectionnées dans le graphique de réseau élagué.
  4. TNE selon la revendication 2, le moteur de routage étant conçu pour calculer le trajet de secours en appliquant un premier algorithme de trajet le plus court au graphique de réseau élagué.
  5. Procédé de calcul d'un trajet explicite à travers un réseau, caractérisé par les étapes suivantes :
    Réception d'un message de demande d'établissement d'un trajet pour un trajet commuté balisé à travers le réseau, le message de demande d'établissement de trajet comprenant un premier champ (310) se rapportant à un type de protection de liaison et un deuxième champ (316) se rapportant à un groupe de liaisons à risque partagé ;
    Génération (500) d'un graphique à partir des informations de réseau stockées dans une base de données de réseau de gestion du trafic, les liaisons qui ne possèdent par le type de protection de liaison du premier champ (310) du message de demande d'établissement de trajet étant éliminées du graphique du réseau et les liaisons qui ne sont pas différentes du groupe de liaisons à risque partagé du deuxième champ (316) du message de demande d'établissement de trajet étant éliminées du graphique du réseau ; et
    Calcul (502) d'un trajet explicite primaire à travers le réseau à partir du graphique du réseau généré.
  6. Procédé selon la revendication 5, une liaison ayant un nombre maximum de canaux supports de données étant choisie pour être incluse dans le trajet explicite primaire dans un cas où deux liaisons ou plus ont le même coût.
  7. Procédé selon la revendication 5, comprenant en plus ;
    Régénération du graphique du réseau en éliminant du graphique du réseau les liaisons qui se trouvent dans le trajet explicite primaire ; et
    Calcul d'un trajet explicite de secours à partir du graphique de réseau régénéré.
  8. Procédé selon la revendication 5, comprenant en plus ;
    Régénération du graphique du réseau en éliminant du graphique du réseau toutes les liaisons connectées aux noeuds qui se trouvent dans les liaisons du trajet explicite primaire ; et
    Calcul d'un trajet explicite de secours à partir du graphique de réseau régénéré.
  9. Procédé selon la revendication 5, comprenant en plus ;
    Régénération du graphique du réseau en éliminant du graphique du réseau les liaisons se trouvant dans le même groupe de risque partagé qu'une liaison dans le trajet explicite primaire ; et
    Calcul d'un trajet explicite de secours à partir du graphique de réseau régénéré.
  10. Procédé selon l'un des revendications 7 à 9, le calcul d'un trajet explicite primaire et le calcul d'un trajet explicite de secours étant effectués en utilisant une analyse du moindre coût.
EP03018815A 2002-08-30 2003-08-19 Procédé de routage selon le plus court chemin à base de contraintes pour des réseaux optiques de transport commutés dynamiquement Expired - Lifetime EP1395003B1 (fr)

Applications Claiming Priority (4)

Application Number Priority Date Filing Date Title
US320286 1994-10-11
US40709402P 2002-08-30 2002-08-30
US407094P 2002-08-30
US10/320,286 US7324453B2 (en) 2002-08-30 2002-12-16 Constraint-based shortest path first method for dynamically switched optical transport networks

Publications (3)

Publication Number Publication Date
EP1395003A2 EP1395003A2 (fr) 2004-03-03
EP1395003A3 EP1395003A3 (fr) 2004-03-31
EP1395003B1 true EP1395003B1 (fr) 2008-10-08

Family

ID=31498186

Family Applications (1)

Application Number Title Priority Date Filing Date
EP03018815A Expired - Lifetime EP1395003B1 (fr) 2002-08-30 2003-08-19 Procédé de routage selon le plus court chemin à base de contraintes pour des réseaux optiques de transport commutés dynamiquement

Country Status (6)

Country Link
US (1) US7324453B2 (fr)
EP (1) EP1395003B1 (fr)
CN (1) CN100493210C (fr)
AT (1) ATE410863T1 (fr)
DE (1) DE60323912D1 (fr)
ES (1) ES2315447T3 (fr)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8085688B2 (en) 2008-12-23 2011-12-27 At&T Intellectual Property I, Lp Methods and systems for determining a network data path

Families Citing this family (89)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2004055615A2 (fr) * 2002-12-17 2004-07-01 Saraph Girish P Logique d'acheminement sur la base d'une representation d'espace virtuel
US8605647B2 (en) 2004-02-03 2013-12-10 Telefonaktiebolaget Lm Ericsson (Publ) Shared risk group handling within a media gateway
DE602004002672T2 (de) * 2003-02-03 2007-08-30 Telefonaktiebolaget Lm Ericsson (Publ) Shared-risk-gruppenhandhabung in einem media-gateway
GB2400266B8 (en) * 2003-04-02 2006-06-15 Cisco Tech Ind Data Networking
US7146091B2 (en) * 2003-05-15 2006-12-05 Internatioanal Business Machines Corporation Method and system for automated simulation of cable failure in a network
US7467180B2 (en) * 2003-05-29 2008-12-16 International Business Machines Corporation Automatically segmenting and populating a distributed computing problem
US20050025058A1 (en) * 2003-07-30 2005-02-03 Siddheswar Chaudhuri Method for stochastic selection of improved cost metric backup paths in shared-mesh protection networks
US7643467B2 (en) * 2003-12-23 2010-01-05 Nortel Networks Limited Source-implemented constraint based routing with source routed protocol data units
US7606235B1 (en) 2004-06-03 2009-10-20 Juniper Networks, Inc. Constraint-based label switched path selection within a computer network
CN100502528C (zh) 2004-06-08 2009-06-17 华为技术有限公司 实现自动交换光网络中光连接间的关联的方法
US7801048B1 (en) * 2004-06-23 2010-09-21 Cisco Technology, Inc. Concurrent path computation using virtual shortest path tree
US7567512B1 (en) 2004-08-27 2009-07-28 Juniper Networks, Inc. Traffic engineering using extended bandwidth accounting information
US7804790B1 (en) 2004-08-30 2010-09-28 Juniper Networks, Inc. Aggregate multicast trees for virtual private local area network (LAN) service multicast
US7558199B1 (en) * 2004-10-26 2009-07-07 Juniper Networks, Inc. RSVP-passive interfaces for traffic engineering peering links in MPLS networks
US8068411B2 (en) * 2004-12-29 2011-11-29 Cisco Technology, Inc. Method and apparatus to compute local repair paths taking into account link resources and attributes
US7623461B2 (en) * 2005-02-09 2009-11-24 Cisco Technology, Inc. Trigger for packing path computation requests
CN100550899C (zh) * 2005-02-21 2009-10-14 华为技术有限公司 光网络中扩散链路状态信息的实现方法
CN100396040C (zh) * 2005-02-22 2008-06-18 华为技术有限公司 智能光网络中路径选择的方法
CN100454830C (zh) * 2005-05-20 2009-01-21 华为技术有限公司 网络域中实现路径计算的方法
CN100440864C (zh) * 2005-07-22 2008-12-03 中兴通讯股份有限公司 一种获得智能光网络约束路由的方法
US7990965B1 (en) 2005-07-28 2011-08-02 Juniper Networks, Inc. Transmission of layer two (L2) multicast traffic over multi-protocol label switching networks
US9166807B2 (en) * 2005-07-28 2015-10-20 Juniper Networks, Inc. Transmission of layer two (L2) multicast traffic over multi-protocol label switching networks
US7564803B1 (en) 2005-08-29 2009-07-21 Juniper Networks, Inc. Point to multi-point label switched paths with label distribution protocol
US7710901B2 (en) * 2005-10-14 2010-05-04 Nortel Networks Limited GMPLS control of ethernet
CN100438503C (zh) * 2005-10-26 2008-11-26 华为技术有限公司 一种选择路径的方法
FR2895624B1 (fr) * 2005-12-23 2008-05-02 Alcatel Sa Noeud de reseau de transport, a adjonction de donnees temporelles a des donnees d'ingenierie de trafic
US8270395B2 (en) * 2006-01-30 2012-09-18 Juniper Networks, Inc. Forming multicast distribution structures using exchanged multicast optimization data
US7839850B2 (en) * 2006-01-30 2010-11-23 Juniper Networks, Inc. Forming equal cost multipath multicast distribution structures
US7787380B1 (en) 2006-06-30 2010-08-31 Juniper Networks, Inc. Resource reservation protocol with traffic engineering point to multi-point label switched path hierarchy
US7742482B1 (en) * 2006-06-30 2010-06-22 Juniper Networks, Inc. Upstream label assignment for the resource reservation protocol with traffic engineering
US7839862B1 (en) 2006-06-30 2010-11-23 Juniper Networks, Inc. Upstream label assignment for the label distribution protocol
US7684354B2 (en) * 2006-08-04 2010-03-23 Schlumberger Technology Corporation Method and system for analyzing the topology of a multiprotocol label switching (MPLS)/virtual private network (VPN) network
US8169912B2 (en) * 2006-08-31 2012-05-01 Futurewei Technologies, Inc. System for dynamic bandwidth adjustment and trading among peers
CN101163090B (zh) * 2006-10-09 2010-08-04 华为技术有限公司 一种业务路径的计算方法
US7831700B2 (en) * 2006-10-16 2010-11-09 Futurewei Technologies, Inc. Distributed PCE-based system and architecture in multi-layer network
CN1996858A (zh) 2006-12-26 2007-07-11 华为技术有限公司 一种预付费帐户计费的方法、系统以及服务器
EP2203911A4 (fr) * 2007-10-25 2011-12-28 Trilliant Networks Inc Gazomètre ayant un matériau magnétique ultrasensible reconfiguré sur un cadran de compteur et procédé d'utilisation de la reconfiguration du compteur
US8332055B2 (en) 2007-11-25 2012-12-11 Trilliant Networks, Inc. Energy use control system and method
CA2705021A1 (fr) * 2007-11-25 2009-05-28 Trilliant Networks, Inc. Utilisation d'un serveur mandataire dans un reseau maille
CA2705091A1 (fr) 2007-11-25 2009-05-28 Trilliant Networks, Inc. Methode et systeme d'avis de panne et de retablissement de courant dans un reseau d'infrastructure a mesurage avance
US20090138617A1 (en) * 2007-11-25 2009-05-28 Michel Veillette Method and system for creating and managing association and balancing of a mesh device in a mesh network
CN101453407B (zh) * 2007-12-03 2011-06-08 华为技术有限公司 路由器及路径消息处理的方法
US7733786B2 (en) * 2008-05-15 2010-06-08 Telefonaktiebolaget L M Ericsson (Publ) Method and apparatus for performing a constraint shortest path first computation
US7990877B2 (en) * 2008-05-15 2011-08-02 Telefonaktiebolaget L M Ericsson (Publ) Method and apparatus for dynamically runtime adjustable path computation
US8699377B2 (en) 2008-09-04 2014-04-15 Trilliant Networks, Inc. System and method for implementing mesh network communications using a mesh network protocol
US8289182B2 (en) 2008-11-21 2012-10-16 Trilliant Networks, Inc. Methods and systems for virtual energy management display
US8959245B2 (en) * 2008-11-25 2015-02-17 Broadcom Corporation Multiple pathway session setup to support QoS services
US8077726B1 (en) 2008-12-10 2011-12-13 Juniper Networks, Inc. Fast reroute for multiple label switched paths sharing a single interface
US9246801B1 (en) 2008-12-12 2016-01-26 Juniper Networks, Inc. Transmitting packet label contexts within computer networks
US8619553B2 (en) * 2009-01-08 2013-12-31 Ciena Corporation Methods and systems for mesh restoration based on associated hop designated transit lists
EP2406778A4 (fr) * 2009-03-11 2014-06-25 Trilliant Networks Inc Procédé, dispositif et système de mappage de transformateurs à des compteurs et de localisation de pertes de ligne non techniques
CN101651625B (zh) * 2009-09-03 2011-09-21 中兴通讯股份有限公司 多业务恢复的选路装置及选路方法
CN102033970B (zh) * 2009-09-30 2013-08-14 林定伟 一种两点间或者多点间的多线程网络智能选径方法
US8681654B2 (en) * 2009-10-14 2014-03-25 At&T Intellectual Property I, L.P. Methods and apparatus to design a survivable internet protocol link topology
KR101304793B1 (ko) * 2009-12-21 2013-09-05 한국전자통신연구원 Ｔｅｄ 정확성을 보장하는 ｔｅｄ 관리 방법 및 시스템
US8422514B1 (en) 2010-02-09 2013-04-16 Juniper Networks, Inc. Dynamic configuration of cross-domain pseudowires
CA2809034A1 (fr) 2010-08-27 2012-03-01 Randy Frei Systeme et procede pour l'operation sans interference d'emetteurs-recepteurs cositues
WO2012037055A1 (fr) 2010-09-13 2012-03-22 Trilliant Networks Procédé de détection du vol d'énergie
EP2641137A2 (fr) 2010-11-15 2013-09-25 Trilliant Holdings, Inc. Système et procédé pour une communication sécurisée dans de multiples réseaux à l'aide d'un seul système radioélectrique
WO2012097204A1 (fr) 2011-01-14 2012-07-19 Trilliant Holdings, Inc. Processus, dispositif et système permettant une optimisation volt/var
WO2012103072A2 (fr) 2011-01-25 2012-08-02 Trilliant Holdings, Inc. Agrégation de rapports de pannes de puissance/de restauration de puissance en temps réel (rtpor) dans un réseau maillé sécurisé
EP3288236B1 (fr) 2011-02-10 2020-04-01 Trilliant Holdings, Inc. Dispositif et procédé pour faciliter des communications sécurisées sur un réseau cellulaire
WO2012122310A1 (fr) 2011-03-08 2012-09-13 Trilliant Networks, Inc. Système et procédé de gestion de la distribution de charge sur un réseau électrique
US9246838B1 (en) 2011-05-27 2016-01-26 Juniper Networks, Inc. Label switched path setup using fast reroute bypass tunnel
US8634418B2 (en) * 2011-07-01 2014-01-21 Juniper Networks, Inc. Providing extended administrative groups in computer networks
US9001787B1 (en) 2011-09-20 2015-04-07 Trilliant Networks Inc. System and method for implementing handover of a hybrid communications module
CN102413391B (zh) * 2011-12-28 2014-07-02 烽火通信科技股份有限公司 一种实现分组和otn信号联合自路由的方法及装置
CN103188096A (zh) * 2011-12-29 2013-07-03 中兴通讯股份有限公司 一种trill网络中路径保护的方法及装置
US8787400B1 (en) 2012-04-25 2014-07-22 Juniper Networks, Inc. Weighted equal-cost multipath
US9071541B2 (en) 2012-04-25 2015-06-30 Juniper Networks, Inc. Path weighted equal-cost multipath
US8837479B1 (en) 2012-06-27 2014-09-16 Juniper Networks, Inc. Fast reroute between redundant multicast streams
US9049148B1 (en) 2012-09-28 2015-06-02 Juniper Networks, Inc. Dynamic forwarding plane reconfiguration in a network device
US8953500B1 (en) 2013-03-29 2015-02-10 Juniper Networks, Inc. Branch node-initiated point to multi-point label switched path signaling with centralized path computation
US9577925B1 (en) 2013-07-11 2017-02-21 Juniper Networks, Inc. Automated path re-optimization
US9832102B2 (en) * 2013-08-07 2017-11-28 Telefonaktiebolaget L M Ericsson (Publ) Automatic establishment of redundant paths with cautious restoration in a packet network
US9276716B2 (en) * 2013-09-09 2016-03-01 Cisco Technology, Inc. Sensor data transport and consolidation within communication nodes in a network
US9450858B2 (en) 2013-10-30 2016-09-20 Cisco Technology, Inc. Standby bandwidth aware path computation
JP6583287B2 (ja) * 2014-12-24 2019-10-02 日本電気株式会社 マルチレイヤネットワークシステムおよびマルチレイヤネットワークにおけるパス設定方法
US9806895B1 (en) 2015-02-27 2017-10-31 Juniper Networks, Inc. Fast reroute of redundant multicast streams
US9967179B2 (en) * 2015-05-19 2018-05-08 Futurewei Technologies, Inc. Constrained shortest path first for temporal tunnel services
US10547543B2 (en) 2015-06-24 2020-01-28 Futurewei Technologies, Inc. Elegant temporal label switched path tunnel service controller
US10200280B2 (en) 2015-06-25 2019-02-05 Futurewei Technologies, Inc. Software-defined network for temporal label switched path tunnels
US10498640B2 (en) 2015-09-04 2019-12-03 Futurewei Technologies, Inc. PCE for temporal tunnel services
US10958559B2 (en) 2016-06-15 2021-03-23 Juniper Networks, Inc. Scaled inter-domain metrics for link state protocols
US10348610B2 (en) * 2017-05-25 2019-07-09 Alcatel Lucent Method and apparatus for minimum label bandwidth guaranteed path for segment routing
CN110661628B (zh) 2018-06-30 2021-12-14 华为技术有限公司 一种实现数据组播的方法、装置和系统
US10999183B2 (en) 2019-08-12 2021-05-04 Juniper Networks, Inc. Link state routing protocol adjacency state machine
CN111064661B (zh) * 2019-12-26 2020-10-16 杭州初灵信息技术股份有限公司 一种分组化设备中具有备份路径的路由协议数据传输方法
CN114697772A (zh) * 2020-12-31 2022-07-01 华为技术有限公司 一种业务的配置方法及装置

Family Cites Families (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US4905233A (en) 1987-11-23 1990-02-27 Harris Corporation Multiple path routing mechanism for packet communications network
US5088032A (en) 1988-01-29 1992-02-11 Cisco Systems, Inc. Method and apparatus for routing communications among computer networks
JPH03108845A (ja) 1989-09-21 1991-05-09 Toshiba Corp 輻輳回避制御方式
KR100218624B1 (ko) 1993-12-24 1999-09-01 포만 제프리 엘 정보 네트워크에 있어서 경로배정 대역폭-예약 접속
US6633544B1 (en) * 1998-06-24 2003-10-14 At&T Corp. Efficient precomputation of quality-of-service routes
US6301244B1 (en) 1998-12-11 2001-10-09 Nortel Networks Limited QoS-oriented one-to-all route selection method for communication networks
US7633873B1 (en) * 2000-03-15 2009-12-15 Koehler Stefan Method and system for communication of data via an optimum data path in a network
US6842463B1 (en) * 2000-07-14 2005-01-11 Nortel Networks Limited Automated and adaptive management of bandwidth capacity in telecommunications networks
US6785737B2 (en) * 2001-07-31 2004-08-31 Tropic Networks Inc. Network resource allocation methods and systems
US7187652B2 (en) * 2001-12-26 2007-03-06 Tropic Networks Inc. Multi-constraint routing system and method
US6925061B2 (en) * 2001-12-26 2005-08-02 Tropic Network Inc. Multi-constraint routing system and method

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8085688B2 (en) 2008-12-23 2011-12-27 At&T Intellectual Property I, Lp Methods and systems for determining a network data path

Also Published As

Publication number Publication date
CN1529518A (zh) 2004-09-15
EP1395003A3 (fr) 2004-03-31
CN100493210C (zh) 2009-05-27
ATE410863T1 (de) 2008-10-15
US7324453B2 (en) 2008-01-29
EP1395003A2 (fr) 2004-03-03
US20040042406A1 (en) 2004-03-04
DE60323912D1 (de) 2008-11-20
ES2315447T3 (es) 2009-04-01

Similar Documents

Publication Publication Date Title
EP1395003B1 (fr) Procédé de routage selon le plus court chemin à base de contraintes pour des réseaux optiques de transport commutés dynamiquement
US7689693B2 (en) Primary/restoration path calculation in mesh networks based on multiple-cost criteria
US8867333B2 (en) Restoration path calculation considering shared-risk link groups in mesh networks
US7545736B2 (en) Restoration path calculation in mesh networks
US7451340B2 (en) Connection set-up extension for restoration path establishment in mesh networks
US8296407B2 (en) Calculation, representation, and maintenance of sharing information in mesh networks
EP1460808B1 (fr) Procédé de routage selon le plus court chemin à base de contraintes pour supporter le routage hiérarchique dans des réseaux optiques de transport, multi-domaines et interconnectés
US7852758B2 (en) Route control method of label switch path
US7948996B2 (en) Communicating constraint information for determining a path subject to such constraints
CA2380426C (fr) Procede et dispositif de reacheminement rapide dans un reseau oriente connexion
US8320254B2 (en) Method and system for efficient management and transport of traffic over a network
EP2685685B1 (fr) Procédé et appareil associé pour établir des chemins de trafic à liens divers dans un réseau de télécommunications
US20130232193A1 (en) Control-Plane Interface Between Layers in a Multilayer Network
US20040004938A1 (en) Routing bandwidth guaranteed paths with local restoration in label switched networks
EP1592183A1 (fr) Procede d'etablissement d'itineraire de transfert multidiffusion, et procede de commutation d'etiquette multidiffusion permettant de mettre en oeuvre le procede susmentionne
JP2010045439A (ja) 通信ネットワークシステム、パス計算装置、通信路確立制御方法
WO2007062608A1 (fr) Procede pour la realisation d'acheminements separes reliant des domaines
CN110099002B (zh) 一种路径计算方法及装置
CN105634941A (zh) 一种跨域路径的计算方法及装置
JP2008252439A (ja) 通信ネットワークシステム
US20070140233A1 (en) Resource sharing among network
Bhatia et al. Bandwidth guaranteed routing with fast restoration against link and node failures
Oki et al. Generalized traffic engineering protocol for multi-layer GMPLS networks
Matsuura et al. Hierarchically distributed PCE for backup strategies on an optical network
Du et al. A New Shared-Path Restoration Algorithm with SRLG Constraint in ASON

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

PUAL Search report despatched

Free format text: ORIGINAL CODE: 0009013

AK Designated contracting states

Kind code of ref document: A2

Designated state(s): AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HU IE IT LI LU MC NL PT RO SE SI SK TR

AX Request for extension of the european patent

Extension state: AL LT LV MK

AK Designated contracting states

Kind code of ref document: A3

Designated state(s): AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HU IE IT LI LU MC NL PT RO SE SI SK TR

AX Request for extension of the european patent

Extension state: AL LT LV MK

RIN1 Information on inventor provided before grant (corrected)

Inventor name: SKOOG, FREDERICK H.

Inventor name: WU, FUMING

17P Request for examination filed

Effective date: 20040925

R17P Request for examination filed (corrected)

Effective date: 20040924

AKX Designation fees paid

Designated state(s): AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HU IE IT LI LU MC NL PT RO SE SI SK TR

17Q First examination report despatched

Effective date: 20050425

17Q First examination report despatched

Effective date: 20050425

RAP1 Party data changed (applicant data changed or rights of an application transferred)

Owner name: ALCATEL LUCENT

GRAP Despatch of communication of intention to grant a patent

Free format text: ORIGINAL CODE: EPIDOSNIGR1

GRAS Grant fee paid

Free format text: ORIGINAL CODE: EPIDOSNIGR3

GRAA (expected) grant

Free format text: ORIGINAL CODE: 0009210

AK Designated contracting states

Kind code of ref document: B1

Designated state(s): AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HU IE IT LI LU MC NL PT RO SE SI SK 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

REF Corresponds to:

Ref document number: 60323912

Country of ref document: DE

Date of ref document: 20081120

Kind code of ref document: P

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

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

REG Reference to a national code

Ref country code: ES

Ref legal event code: FG2A

Ref document number: 2315447

Country of ref document: ES

Kind code of ref document: T3

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

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

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

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

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

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

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

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

Ref country code: BE

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

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

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

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

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

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

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

26N No opposition filed

Effective date: 20090709

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

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

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 NON-PAYMENT OF DUE FEES

Effective date: 20090831

REG Reference to a national code

Ref country code: CH

Ref legal event code: PL

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: LI

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20090831

Ref country code: CH

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20090831

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

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

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

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: LU

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20090819

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

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

Effective date: 20090409

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

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

REG Reference to a national code

Ref country code: GB

Ref legal event code: 732E

Free format text: REGISTERED BETWEEN 20130926 AND 20131002

REG Reference to a national code

Ref country code: FR

Ref legal event code: GC

Effective date: 20131018

REG Reference to a national code

Ref country code: FR

Ref legal event code: RG

Effective date: 20141016

REG Reference to a national code

Ref country code: FR

Ref legal event code: CA

Effective date: 20150521

REG Reference to a national code

Ref country code: FR

Ref legal event code: CA

Effective date: 20150521

REG Reference to a national code

Ref country code: FR

Ref legal event code: PLFP

Year of fee payment: 13

REG Reference to a national code

Ref country code: FR

Ref legal event code: PLFP

Year of fee payment: 14

REG Reference to a national code

Ref country code: FR

Ref legal event code: PLFP

Year of fee payment: 15

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: IT

Payment date: 20170828

Year of fee payment: 15

Ref country code: ES

Payment date: 20170928

Year of fee payment: 15

REG Reference to a national code

Ref country code: FR

Ref legal event code: PLFP

Year of fee payment: 16

REG Reference to a national code

Ref country code: GB

Ref legal event code: 732E

Free format text: REGISTERED BETWEEN 20190429 AND 20190502

Ref country code: NL

Ref legal event code: PD

Owner name: PROVENANCE ASSET GROUP LLC; US

Free format text: DETAILS ASSIGNMENT: CHANGE OF OWNER(S), ASSIGNMENT; FORMER OWNER NAME: ALCATEL LUCENT

Effective date: 20190325

REG Reference to a national code

Ref country code: DE

Ref legal event code: R082

Ref document number: 60323912

Country of ref document: DE

Representative=s name: MENZIETTI WETZEL, DE

Ref country code: DE

Ref legal event code: R081

Ref document number: 60323912

Country of ref document: DE

Owner name: PROVENANCE ASSET GROUP LLC, PITTSFORD, US

Free format text: FORMER OWNER: ALCATEL LUCENT, PARIS, FR

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: IT

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20180819

REG Reference to a national code

Ref country code: ES

Ref legal event code: FD2A

Effective date: 20190918

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: NL

Payment date: 20190821

Year of fee payment: 17

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: ES

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20180820

REG Reference to a national code

Ref country code: FR

Ref legal event code: PLFP

Year of fee payment: 18

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: GB

Payment date: 20200909

Year of fee payment: 18

Ref country code: DE

Payment date: 20200901

Year of fee payment: 18

Ref country code: FR

Payment date: 20200831

Year of fee payment: 18

REG Reference to a national code

Ref country code: NL

Ref legal event code: MM

Effective date: 20200901

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: NL

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20200901

REG Reference to a national code

Ref country code: DE

Ref legal event code: R119

Ref document number: 60323912

Country of ref document: DE

GBPC Gb: european patent ceased through non-payment of renewal fee

Effective date: 20210819

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: GB

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20210819

Ref country code: FR

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20210831

Ref country code: DE

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20220301