WO2011035804A1 - Procédé et dispositif de traitement de données dans un réseau - Google Patents

Procédé et dispositif de traitement de données dans un réseau Download PDF

Info

Publication number
WO2011035804A1
WO2011035804A1 PCT/EP2009/062269 EP2009062269W WO2011035804A1 WO 2011035804 A1 WO2011035804 A1 WO 2011035804A1 EP 2009062269 W EP2009062269 W EP 2009062269W WO 2011035804 A1 WO2011035804 A1 WO 2011035804A1
Authority
WO
WIPO (PCT)
Prior art keywords
path computation
function
external
decision unit
path
Prior art date
Application number
PCT/EP2009/062269
Other languages
English (en)
Inventor
Chuanfu Du
Franz Rambach
Marco Hoffmann
Thomas Michaelis
Original Assignee
Nokia Siemens Networks Gmbh & Co. Kg
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 Nokia Siemens Networks Gmbh & Co. Kg filed Critical Nokia Siemens Networks Gmbh & Co. Kg
Priority to PCT/EP2009/062269 priority Critical patent/WO2011035804A1/fr
Publication of WO2011035804A1 publication Critical patent/WO2011035804A1/fr

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/28—Routing or path finding of packets in data switching networks using route fault recovery
    • 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/42—Centralised routing
    • 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/44—Distributed 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/06—Management of faults, events, alarms or notifications
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L43/00—Arrangements for monitoring or testing data switching networks
    • H04L43/08—Monitoring or testing based on specific metrics, e.g. QoS, energy consumption or environmental parameters
    • H04L43/0805—Monitoring or testing based on specific metrics, e.g. QoS, energy consumption or environmental parameters by checking availability
    • H04L43/0817—Monitoring or testing based on specific metrics, e.g. QoS, energy consumption or environmental parameters by checking availability by checking functioning
    • 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

Definitions

  • the invention relates to a method and to a device for proc ⁇ essing data in a network and to a communication system comprising such device.
  • a Generalized Multi-Protocol Label Switching (GMPLS) archi- tecture refers to a set of protocols, including routing pro ⁇ tocols (OSPF-TE or ISIS-TE) , link management protocols (LMP) , and a reservation/label distribution protocols (RSVP-TE, CR- LDP) .
  • the GMPLS architecture is based on IETF RFC 3945.
  • a Path Computation Element (PCE) is an entity that is capable of computing a path through a network or a portion thereof.
  • the PCE may preferably be deployed in a centralized manner. Hence, the PCE comprises a central (ized) path computation function within a network domain.
  • PCECP PCE communication protocol
  • the PCE computes the resources to be allocated (i.e., the "path") for a (virtual) circuit between several (virtual) circuit endpoints.
  • the PCECP may be based on IETF RFC 5440.
  • the central (ized) path computation function may be realized as dedicated hardware and/or software and thus may process more complex or specialized algorithms compared to a decen- tralized path computation function.
  • the path computation conducted at the PCE may in particular consider
  • DWDM nonlinear transmission effects on a DWDM layer
  • - multiple technology layers e.g., MPLS and DWDM
  • Domains may usually be set up encapsulating a collection of network elements, control functions or switching functions and in particular hiding their internal structure to the out ⁇ side world, be it for privacy, scalability or other reasons.
  • the problem to be solved is to overcome the disadvantages de ⁇ scribed above and in particular to provide a cost-efficient approach for utilizing a PCE for providing a routing functionality.
  • the problem of migration is allevi- ated or solved in case a centralized path computation func ⁇ tion, e.g., via a PCE, is added to an existing network.
  • a method for processing data in a network element, wherein a decision unit of the network element utilizes a local path computation function or an external path computation function.
  • the path computation function could be re ⁇ ferred to as a routing function.
  • Such routing function may in particular determine a path across a network, a domain or a portion thereof.
  • the routing function could in particular comprise a Constraint Shortest Path First (CSPF) algorithm.
  • CSPF Constraint Shortest Path First
  • the local path computation function can be implemented at the network element and the external path computation function is accessible via an external element. Such access towards the external element could be provided via messaging utilizing a communication protocol.
  • the external path computation function can be provided by a centralized path computation ele ⁇ ment (PCE) .
  • PCE centralized path computation ele ⁇ ment
  • the approach presented in particular provides a cost-efficient resilience mechanism when migrating from a local CSPF-based to a PCE-enabled path computation.
  • a second instance of the cen ⁇ tral (path computation) function (or element) as the local (path computation) function may provide such backup function- ality.
  • the decision unit is realized as a switch, in particular a PCE/CSPF switch.
  • the switch decides whether to choose path computation via a centralized PCE or via a local algorithm, e.g., the CSPF al ⁇ gorithm.
  • decision unit may be implemented in hardware and/or software. It may be deployed with the network element or it may be associated with the network element.
  • the external path computation function is provided by an external element, in particular by a cen- tralized external element.
  • the external element is a path com ⁇ putation element that is accessible to several network ele ⁇ ments .
  • the PCE may communicate with the network element via a PCECP.
  • the network element may in particular comprise a path compu- tation client (PCC) for communicating with the PCE via the PCECP.
  • PCC path compu- tation client
  • the decision unit utilizes the local path computation function or the external path computation function dependent on at least one of the following:
  • the decision unit can be configured or set up or it may adjust to different events, messages, trigger, informa ⁇ tion, policies or parameters.
  • the network element may be configured and/or to decide whether to choose the external or the local path computation function. It is noted that these events, trigger, etc. may be temporary and may indicate, e.g., an outage of the centralized external computation function.
  • the network element may process routing re ⁇ quests by utilizing either the local or the external path computation function.
  • the network element may, however, further process configuration information that can be used to adjust the decision unit.
  • the configuration information may comprise information regarding the network and/or elements of the network, information regarding the element providing the external path computation function or other information, e.g., parameters or guidelines issued by operators.
  • the decision unit is adapted or adjusts itself depending on external events, triggers or messages from other network elements and/or from the network management system. It is noted that the network management system may configure the decision unit, in particular the PCE/CSPF switch by, e.g., sending messages to the decision unit.
  • the decision unit utilizes the local path computation function as a fallback procedure for the external path computation function.
  • the decision unit utilizes the external path computation function as a fallback proce- dure for the local path computation function.
  • the decision unit utilizes the lo ⁇ cal path computation function in case a fast computation of a path is required.
  • a path is computed by utiliz ⁇ ing at least partially the local path computation function and at least partially the external path computation func ⁇ tion, wherein the local path computation function and the ex- ternal path computation function may be utilized substantially in parallel or substantially in succession or in com ⁇ binations thereof.
  • the decision unit may utilize both, the local and the external path computation function in parallel or after one another.
  • load sharing may be appli ⁇ cable between the local and the external path computation function.
  • the decision unit may in particular be aware (e.g., by previous measurements) about processing performance of the local and the external computation functions and thus apply the respective computation function, in particular if a path needs to be computed fast.
  • the network element is a
  • a device compris- ing or being associated with a processing unit that is arranged such that the method as described herein is executable thereon .
  • Said processing unit may comprise at least one of the follow- ing: a processor, a microcontroller, a hard-wired circuit, an ASIC, an FPGA, a logic device.
  • the device is a network ele ⁇ ment, in particular a node of a communication network, wherein said node is in particular a portion of a communica ⁇ tion path.
  • Fig.l shows a block diagram visualizing a GMPLS approach with a GMPLS network element comprising a local rout ⁇ ing functionality CSPF and further modules, wherein routing is conducted by the local routing functional ⁇ ity CSPF;
  • Fig.2 shows a block diagram visualizing routing via a centralized PCE, wherein a GMPLS network element comprises a local routing functionality CSPF, further modules and a PCC 204, wherein the PCC communicates with a centralized component PCE via a PCECP; shows a block diagram visualizing a combined approach with a GMPLS network element comprising a local rout ⁇ ing functionality CSPF, further modules, a PCE/CSPF switch as decision unit and a PCC, wherein the PCC communicates with a centralized component PCE via a PCECP; shows a block diagram of an exemplary embodiment of a PCE/CSPF switch comprising an information receiver that is connected to an evaluator and an evaluator controller
  • a decision unit also referred to as "switch” that decides whether to utilize an external routing function or an internal routing function.
  • the decision unit can be provided with a network element.
  • the external routing function may be provided by a centralized network element, e.g., a PCE.
  • the routing function could be an algorithm used for computing a path through a network or a portion thereof.
  • the routing function could in particular comprise a Constraint Shortest Path First (CSPF) algorithm.
  • CSPF Constraint Shortest Path First
  • the network element to which the decision unit is associated may comprise an internal routing function that could be used as a fallback for the external routing function.
  • the external routing function acts as a fallback for the internal routing function.
  • the decision unit can be realized by software and/or by hard ⁇ ware .
  • CSPF algorithm is referred to herein as an exemplary routing algorithm, wherein other routing algorithms may be applicable as well.
  • different control plane protocols and/or path computation algorithms like CSPF are running.
  • the network ele- ment does no longer have to utilize its local CSPF algorithm for route computation purposes, but may forward a correspond ⁇ ing request to the PCE.
  • a decision unit also referred to as "switch" or
  • PCE/CSPF switch is introduced at the network node, which may use either the PCE or the local routing algorithm for path computation purposes.
  • This decision unit may forward a path computation request depending on its configuration or depending on status information or depending on input parame- ters, events or triggers, in particular on messages to either the PCE or to the local CSPF algorithm.
  • the switching may also depend on policies, which are described hereinafter.
  • the local (path computation) function can be used, if the path requested can be computed without invoking the central (path computation) function (no special requirements/constraints may be requested; a virtual topology of the PCC ' s layer provides enough resources to supply the requested "path") .
  • the local (path computation) function may preferably be used in case delay occurs when invoking the cen ⁇ tral (path computation) function (in particular in case of restoration and/or rerouting, which may be susceptible to delay) .
  • policies could be defined of wide scope, e.g., to switch from one centralized (path computation) function to another (e.g., hitless software upgrade, time-dependent path computation etc.) or to select between different central (path computation) functions.
  • the decision unit may decide to select the PCE routing func ⁇ tionality or the local routing functionality based on various parameters, in particular parameters that are input to the decision unit.
  • Such input parameters may be transmitted via at least one of the following messages:
  • the configuration can be provided by using SNMP messages; based on such messages, a local policy of the decision unit can be configured.
  • RSVP-TE may be extended such that it supports signaling towards the network element in- dicating that the network element need to use a PCE and/or that it should use its local routing algo ⁇ rithm.
  • the PCE may notify the network element (PCC) in case, e.g., the PCE is over- loaded. This information is taken into account by the decision unit and the network element may thus util ⁇ ize its local routing algorithm.
  • PCC network element
  • Fig.l shows a block diagram visualizing a GMPLS approach; here, a GMPLS network element 101 comprises a local routing functionality CSPF 102 and further modules 103. Routing is conducted by the local routing functionality CSPF 102, in Fig.l no centralized component is present.
  • the further mod- ules 103 may include additional GMPLS protocols like OSPF-TE, RSVP-TE, etc. and further entities like resource management, MIB manager, Route Selection Manager, which may be used in said GMPLS network element 101.
  • Fig.2 shows a block diagram visualizing routing via a centralized PCE.
  • a GMPLS network element 201 comprises a local routing functionality CSPF 202, further modules 203 and a PCC 204.
  • the PCC 204 communicates with a centralized PCE 205 via a PCECP.
  • the local routing func ⁇ tionality CSPF 202 does not provide any path computation functionality as all path computation is done by this exter ⁇ nal PCE 205.
  • Path computation requests are forwarded from the GMPLS network element 201 toward the PCE 205 and routing in- formation is conveyed back to the GMPLS network element 201.
  • Fig.3 shows a block diagram visualizing a combined approach with a GMPLS network element 301 comprising a local routing functionality CSPF 302, further modules 303, a PCE/CSPF switch 306 as decision unit and a PCC 304.
  • the PCC 304 commu ⁇ nicates with a centralized component PCE 305 via a PCECP.
  • the further modules 303 may include additional GMPLS proto ⁇ cols like OSPF-TE, RSVP-TE, etc. and further entities like resource management, MIB manager, Route Selection Manager, which may be used in said GMPLS network element 301.
  • the PCE/CSPF switch 306 decides if a path computation request should be calculated by the PCE 305 or by the local routing functionality CSPF 302. Depending on the application, the computed paths may be sent either directly to the further modules 303 or they are sent first to the PCE/CSPF switch 306, wherein then the PCE/CSPF switch 306 itself may forward the computed paths to the further modules 303.
  • Decision Unit Exemplary Implementation of a RCE/CSPF Switch
  • the PCE/CSPF switch may reside in a GMPLS network node or it may be associated with such. Each path computation request generated at the GMPLS network node may first be forwarded to the PCE/CSPF switch. According to the configuration of the PCE/CSPF switch, it may decide whether the local routing algorithm or the remote PCE will be used and forward the re ⁇ quest accordingly.
  • Fig.4 shows a block diagram of an exemplary embodiment of a PCE/CSPF switch 401 comprising an information receiver 402 that is connected to an evaluator 403 and an evaluator controller 404.
  • the evaluator 403 is connected to a request sender 405.
  • the information receiver 402 receives requests from the other modules of the GMPLS node like from a Route
  • the information receiver 402 may receive configura ⁇ tion information that is conveyed from the other mod- ules of the GMPLS node.
  • This configuration informa ⁇ tion may come from, e.g., the PCE and is forwarded via the PCC to the information receiver 402.
  • SNMP messages can also be used by a network management system (NMS) for configuration purposes.
  • NMS network management system
  • the SNMP messages are processed by the corre ⁇ sponding module which implements SNMP and the corre ⁇ sponding configuration information is sent to the information receiver 402.
  • an extended RSVP-TE message indicates that a loose hop can only be extended via a PCE . This can be necessary if a path-key mechanism is used for inter-domain path computation (as indicated in IETF RFC 5520) .
  • GMPLS node may send the according information to the information receiver 402.
  • the configuration information received is forwarded to the evaluator controller 404.
  • the evaluator controller 404 is con- figured via the information receiver 402.
  • the evaluator controller 404 may also configure the evaluator 403 such that single requests are forwarded to the PCC . This may be of advantage in case an extension of loose hops is only admissible by using the PCE. Such information is provided by a RSVP-TE message and is for ⁇ warded via the information receiver 402 to the evaluator controller 404.
  • the evaluator 403 may also indicate to the request sender 405 for each request if this request should be sent to the PCE or to the local routing algo- rithm. This decision may be based, e.g., on the configu ⁇ ration of the evaluator 403.
  • the evaluator 403 is configured via the evaluator controller 404.
  • the evaluator 403 may consider whether a request is forwarded to the PCC/PCE or to the local routing algorithm in particular based on at least one of the following details (poli ⁇ cies) :
  • a status of the PCE which may indicate, e.g., if the PCE is overloaded, down (e.g., during maintenance) or in normal operation.
  • a type of the request which may indicate, e.g., if an unprotected path or a protected path is requested.
  • Constraints of a request which indicate, e.g., if the local routing algorithm or the PCE need to be used in order to successfully handle such con ⁇ straints .
  • a requirement and/or a priority of the request indi ⁇ cating e.g., if it is not allowed to send the rout ⁇ ing request to a PCE of other networks in case the path is requested for restoration reasons.
  • the policy which entity to choose for rout ⁇ ing purposes may change over time or it may be adapted.
  • the policy may in particular adapt itself according to different network types, topologies or the like.
  • the CSPF algorithm is already implemented in the NE and can be efficiently utilized by this approach. This CSPF algorithm may thus be used during a migration scenario. Hence, only minor changes are required to be applied to the NE . In particular, the decision unit may have to be implemented with the NE .
  • a communication between the local rout ing algorithm and the PCE both may utilize the PCECP that is already available for communication between the PCC of the NE and the PCE .
  • Utilizing the path computation via the local CSPF algorithm may accelerate the overall path computation proc ⁇ ess since the overhead of the communication between the PCC and the PCE can be avoided (in particular with regard to certain circumstances and scenarios) .
  • the local routing algorithm may be chosen by the decision unit of the NE .
  • the same NE can be used in networks with or without a PCE deployment.
  • the only change of the NE may affect the configuration of the decision unit, e.g., the PCE/CSPF switch: If the NE is used in a network without a PCE, the PCE/CSPF switch forwards all requests to the local routing algorithm.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

L'invention concerne un procédé et un dispositif de traitement de données dans un élément réseau, une unité de décision de l'élément réseau utilisant une fonction locale de calcul d'itinéraire ou une fonction extérieure de calcul d'itinéraire. En outre, un système de communication comprenant ledit dispositif est proposé.
PCT/EP2009/062269 2009-09-22 2009-09-22 Procédé et dispositif de traitement de données dans un réseau WO2011035804A1 (fr)

Priority Applications (1)

Application Number Priority Date Filing Date Title
PCT/EP2009/062269 WO2011035804A1 (fr) 2009-09-22 2009-09-22 Procédé et dispositif de traitement de données dans un réseau

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/EP2009/062269 WO2011035804A1 (fr) 2009-09-22 2009-09-22 Procédé et dispositif de traitement de données dans un réseau

Publications (1)

Publication Number Publication Date
WO2011035804A1 true WO2011035804A1 (fr) 2011-03-31

Family

ID=41279406

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/EP2009/062269 WO2011035804A1 (fr) 2009-09-22 2009-09-22 Procédé et dispositif de traitement de données dans un réseau

Country Status (1)

Country Link
WO (1) WO2011035804A1 (fr)

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2014206180A1 (fr) * 2013-06-26 2014-12-31 华为技术有限公司 Procédé d'acquisition de chemin, élément de calcul de chemin, client de calcul de chemin et système
WO2015048239A3 (fr) * 2013-09-26 2015-06-11 Cisco Technology, Inc. Coexistence d'un protocole de routage distribué et d'un calcul de trajets centralisé pour les réseaux sans fil déterministes
CN104767682A (zh) * 2014-01-08 2015-07-08 腾讯科技（深圳）有限公司 路由方法和系统以及分发路由信息的方法和装置

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20060171320A1 (en) * 2005-02-02 2006-08-03 Jean-Philippe Vasseur Inter-domain path computation technique
US20090182894A1 (en) * 2008-01-11 2009-07-16 Jean-Philippe Vasseur Dynamic path computation element load balancing with backup path computation elements

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20060171320A1 (en) * 2005-02-02 2006-08-03 Jean-Philippe Vasseur Inter-domain path computation technique
US20090182894A1 (en) * 2008-01-11 2009-07-16 Jean-Philippe Vasseur Dynamic path computation element load balancing with backup path computation elements

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
FARREL OLD DOG CONSULTING J-P VASSEUR CISCO SYSTEMS A ET AL: "A Path Computation Element (PCE)-Based Architecture; rfc4655.txt", IETF STANDARD, INTERNET ENGINEERING TASK FORCE, IETF, CH, 1 August 2006 (2006-08-01), XP015047407, ISSN: 0000-0003 *

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2014206180A1 (fr) * 2013-06-26 2014-12-31 华为技术有限公司 Procédé d'acquisition de chemin, élément de calcul de chemin, client de calcul de chemin et système
US10230618B2 (en) 2013-06-26 2019-03-12 Huawei Technologies Co., Ltd. Path acquisition method, path computation element, path computation client and system
WO2015048239A3 (fr) * 2013-09-26 2015-06-11 Cisco Technology, Inc. Coexistence d'un protocole de routage distribué et d'un calcul de trajets centralisé pour les réseaux sans fil déterministes
US9882804B2 (en) 2013-09-26 2018-01-30 Cisco Technology, Inc. Co-existence of a distributed routing protocol and centralized path computation for deterministic wireless networks
CN104767682A (zh) * 2014-01-08 2015-07-08 腾讯科技（深圳）有限公司 路由方法和系统以及分发路由信息的方法和装置

Similar Documents

Publication Publication Date Title
US9559947B2 (en) Recovery in connection-oriented network
US7110356B2 (en) Pre-provisioning a light path setup
US7451340B2 (en) Connection set-up extension for restoration path establishment in mesh networks
Sengupta et al. From network design to dynamic provisioning and restoration in optical cross-connect mesh networks: An architectural and algorithmic overview
US8296407B2 (en) Calculation, representation, and maintenance of sharing information in mesh networks
US8335154B2 (en) Method and system for providing fault detection and notification for composite transport groups
US20130232193A1 (en) Control-Plane Interface Between Layers in a Multilayer Network
US20040190445A1 (en) Restoration path calculation in mesh networks
US20040205239A1 (en) Primary/restoration path calculation in mesh networks based on multiple-cost criteria
US20050188100A1 (en) Method for local protection of label-switching paths with resource sharing
EP1802985A2 (fr) Mecanismes de protection efficaces servant a proteger un trafic multidiffusion dans un reseau a topologie en anneau utilisant des protocoles a commutation d'etiquettes
CA2557678A1 (fr) Recuperation suivant des interruptions du plan de controle dans des reseaux de communication
Velasco et al. GMPLS-based multidomain restoration: Analysis, strategies, policies and experimental assessment
US20120210005A1 (en) Method and device for processing data in a network domain
WO2005125056A1 (fr) Procede permettant d'etablir une connexion de service et protection de reprise de service dans un reseau optique
JP4852499B2 (ja) ノード装置及び通信網及びパス設定方法及びプログラム
EP1146682A2 (fr) Protection d'anneaux locaux hybribes à deux étages avec restauration de chemins rapide à travers des réseaux maillés
US20140040476A1 (en) Method and system for network restructuring in multilayer network
US20030043427A1 (en) Method of fast circuit recovery using local restoration
US20080320153A1 (en) Resource Management Device For a Communications Network With Inter-Node Connections Associated With Shared Resource Preemption Rights and Resource Access Priority Rights
WO2011035804A1 (fr) Procédé et dispositif de traitement de données dans un réseau
Zhang et al. Applicability of a Stateful Path Computation Element (PCE)
WO2012062386A1 (fr) Procédé et système de gestion d'échecs de connectivité de transit dans un réseau ip/mpls, et noeud d'accès pour un tel système
EP2854351A1 (fr) Procédé et système permettant de restaurer et de récupérer du trafic dans des réseaux de communication multicouche après deux ou plusieurs défaillances et dispositif de commande virtuelle
US20090040943A1 (en) Method for controlling routing in a packet network supported by a transport network

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 09783289

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 09783289

Country of ref document: EP

Kind code of ref document: A1