WO2012119522A1 - Procédé et appareil pour le traitement d'un défaut de liaison - Google Patents

Procédé et appareil pour le traitement d'un défaut de liaison Download PDF

Info

Publication number
WO2012119522A1
WO2012119522A1 PCT/CN2012/071780 CN2012071780W WO2012119522A1 WO 2012119522 A1 WO2012119522 A1 WO 2012119522A1 CN 2012071780 W CN2012071780 W CN 2012071780W WO 2012119522 A1 WO2012119522 A1 WO 2012119522A1
Authority
WO
WIPO (PCT)
Prior art keywords
link
neighbor
node
fault
normal
Prior art date
Application number
PCT/CN2012/071780
Other languages
English (en)
Chinese (zh)
Inventor
荆慧
滕晓
Original Assignee
华为技术有限公司
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 华为技术有限公司 filed Critical 华为技术有限公司
Publication of WO2012119522A1 publication Critical patent/WO2012119522A1/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/02—Topology update or discovery
    • H04L45/028—Dynamic adaptation of the update intervals, e.g. event-triggered updates
    • 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

Definitions

  • the present invention relates to the field of network communication technologies, and in particular, to a link failure processing method and apparatus. Background technique
  • the BFD (Bidirectional Failure Detection) protocol is an international standard protocol for fast detection.
  • the timeout period for detection can reach milliseconds (usually 30ms), which provides a solution to the above problems.
  • the BFD protocol itself does not have a neighbor discovery mechanism. It is mainly associated with other routing protocols, such as the Open Shortest Path First (0SPF) protocol to implement the detection function. After the other routing protocols, such as the 0SPF protocol, establish a neighbor relationship, the neighbor information is advertised to the BFD protocol. Then, the BFD protocol establishes a session based on the received neighbor information. After the session is established, the BFD protocol periodically periodically between the two neighbors. Send a test packet. When the link is faulty, the BFD protocol first detects the link fault. Then, the BFD protocol removes the established session and notifies the 0SPF protocol that the neighbor connected to the link is unreachable. Then the 0SPF protocol interrupts the neighbor relationship.
  • the other routing protocols such as the 0SPF protocol
  • the RSP (which can also be RTB or RTC) is the 0SPF protocol.
  • the neighbor unreachable notification of the BFD protocol is received first, and then the 0SPF protocol of the RTA interrupts the neighbor relationship with the RTD. Since the link returns to the normal connection state in a short time, the RTA is super in the He 110 mechanism.
  • the OSPF Hellot packet of the RTD can still be received normally during the time, and then the RTA re-establishes the interrupted neighbor relationship.
  • the router Since the router performs the initial synchronization link state database, modifies the topology and floods the topology change information to other routers in the network, and recalculates the routing table when the neighbor relationship is reestablished, the router is repeatedly removed and the router is repeatedly removed. Rebuilding the neighbor relationship will cause these operations to be performed repeatedly, which will not only overload the router CPU (Centra l Proces s ing Uni t, CPU), but also generate a large number of LSAs in a short time (Link State Adver ti sement , link state notification), resulting in a large amount of network bandwidth. Summary of the invention
  • the embodiment of the invention provides a link fault processing method and device for solving the problem that the router CPU is overloaded and the network bandwidth is occupied in a large amount during the link detection process.
  • a link fault processing method includes: receiving a neighbor unreachable notification, where the neighbor unreachable notification is generated by the link fault detection protocol after detecting a link fault of the neighbor node; and notifying the normal neighbor node of the occurrence link The faulty neighbor node is in a fault state; if the normal neighbor node of the routing protocol reports that the neighbor node that has the link fault returns to the normal state.
  • a link fault processing apparatus includes: a receiving module, configured to receive a neighbor unreachable notification, where the neighbor unreachable notification is generated by the link fault detection protocol after detecting a link fault of the neighboring node; And the neighboring node is configured to notify the neighboring node that the link fault is in a fault state; the second notification module is configured to receive the neighbor discovery report sent by the neighboring node that has the link fault in the timeout period of the routing protocol At the time of the message, the normal neighbor node is notified that the neighbor node that has a link failure returns to a normal state.
  • the router after receiving the neighbor unreachable notification generated by the link fault detection protocol, the router still maintains the neighbor relationship with the neighbor node where the link fault occurs, that is, The neighboring node is not removed, and only the normal neighbor node (ie, the node in the network that is adjacent to the local node except the neighbor node where the link failure occurs) is notified of the occurrence chain.
  • the neighbor node of the road fault is in a fault state. If the neighbor discovery packet sent by the neighbor node that has failed the link failure is received within the timeout period, the neighbor node is directly notified to the normal neighbor node that the neighbor node that has failed the link is restored to the normal state.
  • Figure 1 is a schematic diagram of a network including four 0SPF protocol routers
  • FIG. 2 is a flowchart of a link fault processing method according to Embodiment 1 of the present invention.
  • FIG. 3 is a block diagram of a link fault processing apparatus according to Embodiment 1 of the present invention.
  • FIG. 5 is a block diagram of a link failure processing apparatus according to Embodiment 2 of the present invention. detailed description
  • the link failure processing method will be described in detail below with reference to FIG. 2, which includes the following steps.
  • 201. Receive a neighbor unreachable notification, where the neighbor unreachable notification is generated by the link fault detection protocol after detecting a link fault of the neighboring node.
  • the execution body of the link fault processing method is a router that supports the 0SPF protocol, and the router performs fast link fault detection through the BFD protocol.
  • the BFD protocol detects a neighbor After a link fault occurs on a node, a neighbor unreachable notification is generated.
  • the router does not remove the neighbor node that has failed the link according to the prior art, but maintains the neighbor relationship with the neighbor node where the link fault occurs, and only The neighboring node adjacent to the router notifies that the neighboring node that is faulty in the link is in a fault state, so that the normal neighboring node bypasses the neighboring node where the link fault occurs when forwarding the message.
  • the normal neighbor node includes a node in the network that is adjacent to the router except the neighbor node where the link failure occurs.
  • the router After the router notifies the normal neighbor node that the neighbor node that is in the fault of the link is in a fault state, it waits for the timeout period of the Hello mechanism in the 0SPF protocol, and the HEL lo mechanism is used to support the inter-router discovery and establish the neighbor of the 0SPF protocol. relationship. If the router receives the Hello message (that is, the neighbor discovery packet) sent by the neighboring node that has failed the link, the link of the neighbor node that has failed the link is restored. The normal neighbor node is notified that the neighboring node that has failed the link has returned to the normal state, so that the normal neighboring node can normally use the neighboring node that has the link fault to forward the packet.
  • the Hello message that is, the neighbor discovery packet
  • the router after receiving the neighbor unreachable notification generated by the link fault detection protocol, the router still maintains the neighbor relationship with the neighbor node where the link fault occurs, that is, does not remove the neighbor relationship.
  • a neighboring node that has a link failure only informs the normal neighboring node that the neighboring node that has failed the link is in a fault state, and then, if the neighbor discovery packet sent by the neighboring node that has failed the link is received within the timeout period, Directly reporting to the normal neighbor node that the neighbor node that has failed the link returns to the normal state. Therefore, when the link is unstable (that is, intermittently in a short time), the router repeatedly performs the interrupt and performs the interrupt in a short time. The operation of reestablishing the neighbor relationship causes the router CPU to be overloaded and the network bandwidth to be occupied a lot.
  • the embodiment further provides a link fault processing device.
  • the device includes: The receiving module 31 is configured to receive a neighbor unreachable notification, where the neighbor unreachable notification is generated by the link fault detection protocol after detecting that the neighbor node has a link fault; the first notification module 32 is configured to notify the normal neighbor node The neighboring node that is in the fault of the link is in a fault state; the second notification module 33 is configured to: when receiving the neighbor discovery packet sent by the neighboring node that has the link fault in the timeout period of the routing protocol, to the normal The neighbor node notifies that the neighbor node that has failed the link is restored to the normal state.
  • the link fault processing apparatus after receiving the neighbor unreachable notification generated by the link fault detection protocol by the receiving module 31, still maintains the neighbor relationship with the neighbor node where the link fault occurs, that is, The neighbor node is removed, and only the first notification module 32 notifies the normal neighbor node that the neighbor node that has failed the link is in a fault state, and then, if the super-two notification module 33 directly reports the neighbor node to the neighbor that has failed the link.
  • the node returns to the normal state. Therefore, when the link is unstable (that is, intermittently in a short time), the router repeatedly performs the operation of tearing down the neighbor node and reestablishing the neighbor relationship in a short time, resulting in the router CPU load. Overweight and network bandwidth is heavily occupied.
  • the timeout period is not limited to the timeout period of the Hel lo mechanism in the 0SPF protocol.
  • the timeout period can be set according to the specific provisions of the protocol. For example, in RIP (Routing Information Protocol), the router sends a refresh message every 30s to discover and establish a neighbor relationship. When 180s does not receive the refresh message fed back from a network neighbor. , the network neighbor is considered unreachable, so the timeout period can be set to 180s.
  • 180s is only an example, and a person skilled in the art can also define a timeout period for determining whether to receive a neighbor discovery message according to a specific situation.
  • 401 Receive a neighbor unreachable notification, where the neighbor unreachable notification is determined by a link failure detection protocol. Generated after detecting a link failure on the neighbor node.
  • the execution body of the link fault processing method is a router that supports the 0SPF protocol, and the router performs fast link fault detection through the BFD protocol. After the link fault is detected on a neighboring node, the BFD protocol generates a neighbor unreachable notification.
  • the router after receiving the neighbor unreachable notification, the router does not remove the neighbor node that has failed the link according to the prior art, but maintains the neighbor relationship with the neighbor node where the link fault occurs.
  • the neighboring node that generates the link fault generates a first routing table for the fault state, and then generates and sends a first link state advertisement to the normal neighboring node according to the first routing table, to be adjacent to the router.
  • the node outside the neighbor node of the road fault notifies that the neighbor node with the link fault is in a fault state, so that the normal neighbor node bypasses the neighbor node where the link fault occurs when forwarding the message.
  • the method for notifying the normal neighboring node that the neighboring node that is in the fault of the link is in a fault state may include, but is not limited to: generating a first routing table by using the neighboring node in which the link fault occurs as a fault state; A routing table generates and issues a first link state advertisement to the normal neighbor node. For a router that supports other router protocols, the corresponding neighboring node can be notified to the normal neighbor node according to the specific provisions of the protocol that the neighbor node with the link failure is in a fault state.
  • the foregoing first routing table is generated by using the neighboring node in which the link failure occurs as a fault state
  • the first routing table is generated by using the neighboring node in which the link fault occurs as a fault state, which is specifically:
  • the records in the table regarding the neighbor node where the link failure occurs are deleted to form the first routing table.
  • the second routing table is generated by the neighboring node that has the link fault as the fault state.
  • the method further includes: increasing the cost of the link connected to the neighbor node where the link fault occurs in the current routing table.
  • a value to generate the first routing table That is, the record of the neighbor node where the link failure occurs is still retained in the current routing table, and only the cost value of the link connected to the neighbor node where the link failure occurs is increased.
  • the cost value is the metric of the best path obtained by calculating the bandwidth of the link.
  • the router usually selects the path with the lowest cost to forward the packet. When the cost of the link connected to the neighboring node where the link is faulty is increased, the message forwarded by the router may be prevented from passing through the neighbor node where the link is faulty. This cost value can be set to the maximum cost value.
  • the router notifies the neighboring node that the link fault is in the fault state, and waits for the timeout period of the Hello mechanism in the 0SPF protocol.
  • the Hel lo mechanism is used to support the router of the 0SPF protocol to discover and establish a neighbor relationship.
  • the timeout period is not limited to the timeout period of the Hello mechanism in the 0SPF protocol.
  • the timeout period can be set according to the specific provisions of the protocol.
  • the router sends a refresh packet every 30s to discover and establish a neighbor relationship.
  • 180s does not receive the refresh packet from a network neighbor.
  • the network neighbor is considered unreachable, so the timeout period can be set to 180s.
  • 180s is only an example, and a person skilled in the art can also define a timeout period for determining whether to receive a neighbor discovery message according to a specific situation.
  • the Hello packet that is, the neighbor discovery packet
  • the neighbor node that is faulty with the link is still faulty.
  • the state can be determined that the fault is not caused by the link instability. Therefore, the current router interrupts the neighbor relationship with the neighbor node where the link fault occurs, that is, the neighbor node that has failed the link is removed, so as to ensure the network. normal operation.
  • the normal neighbor node is notified that the neighbor node that has failed the link is restored to the normal state.
  • the Hello packet sent by the neighboring node that has a link failure is received within the timeout period of the Hello mechanism, it indicates that the link of the neighboring node that has failed the link has returned to normal, and the current router is normal.
  • the neighboring node notifies that the neighboring node that has failed the link has returned to the normal state, so that the normal neighboring node can use the neighboring node that has failed the link to forward the packet.
  • the method for notifying the normal neighboring node of the neighboring node that the link fault is restored to the normal state includes: but is not limited to: generating a second routing table by using the neighboring node in which the link fault occurs as a normal state; according to the second route The table generates and advertises a second link state advertisement to the normal neighbor node.
  • the neighboring node that has failed the link can be notified of the normal state of the neighboring node that has failed the link according to the specific provisions of the protocol.
  • the implementation manner of generating the second routing table is corresponding to the implementation manner of generating the first routing table.
  • the implementation manner of generating the second routing table is as follows: According to the topology information of the router Perform route calculation to obtain a second routing table. Since the topology information of the router does not change within the timeout period of the hel lo mechanism, the second routing table calculated according to the topology information is before the failure of the neighbor node where the link fault occurs (that is, when it is in a normal state) Routing table.
  • the implementation of the second routing table is: recalculating and generating the chain The cost value of the link connected to the neighbor node of the road fault is restored to the recalculated value of the link cost value of the first routing table connected to the neighbor node where the link fault occurs to generate a second routing table.
  • the router after receiving the neighbor unreachable notification generated by the link fault detection protocol, the router still maintains the neighbor relationship with the neighbor node where the link fault occurs, that is, does not remove the neighbor relationship.
  • the neighbor node not only informs the normal neighbor node that the neighbor node that has failed the link is in a fault state, and then receives the neighbor that has failed the link within the timeout period.
  • the neighbor discovery packet sent by the node directly reports to the normal neighbor node that the neighbor node that has failed the link is restored to the normal state, if the neighbor discovery packet sent by the neighboring node that has failed the link failure is not received within the timeout period, It is determined that the neighbor node in which the link failure occurs is in a fault state and interrupts the neighbor relationship. Therefore, when the link is unstable (that is, intermittently in a short time), the router repeatedly performs the interruption and the short time in a short time. The operation of reestablishing the neighbor relationship causes the router CPU to be overloaded and the network bandwidth to be occupied a lot.
  • the embodiment further provides a link fault processing apparatus.
  • the apparatus includes: a receiving module 51, configured to receive a neighbor unreachable notification, where the neighbor unreachable notification is detected by the link fault detection protocol.
  • the neighboring node generates a link fault
  • the first notification module 52 is configured to notify the normal neighbor node that the neighbor node that is faulty in the link is in a fault state
  • the second notification module 53 is configured to use the timeout period of the routing protocol.
  • the normal neighbor node is notified that the neighbor node that has failed the link is restored to the normal state.
  • the first notification module 52 may include: a first calculating unit 521, configured to generate a first routing table by using the neighboring node that has a link failure as a fault state; and the first advertising unit 522 is configured to use, according to the first The routing table generates and issues a first link state advertisement to the normal neighbor node.
  • the first computing unit 521 can generate a first routing table in the following manner: The first computing unit deletes records in the current routing table for the neighbor node that has failed the link to form the first routing table.
  • the first calculating unit 521 can also generate a first routing table in the following manner: the first computing unit increases an overhead value of a link connected to the neighbor node where the link failure occurs in the current routing table to generate a The first routing table is described.
  • the link fault processing apparatus may further include: a determining module 54 configured to determine, in the routing module, the interrupting module 55, before the reporting to the normal neighboring node that the neighboring node that has failed the link is in a normal state
  • the determining module determines that the timeout period of the routing protocol is not received.
  • the second notification module notifies the normal neighbor node of the link failure when the determining module determines that the neighbor discovery message sent by the neighbor node that has the link failure is received within the timeout period of the routing protocol.
  • the neighbor node returns to a normal state.
  • the second notification module 53 may include: a second calculating unit 531, configured to generate a second routing table by using the neighboring node that has a link failure as a normal state; and a second advertising unit 532, configured to use the second routing The table generates and advertises a second link state advertisement to the normal neighbor node.
  • the link fault processing apparatus after receiving the neighbor unreachable notification generated by the link fault detection protocol by the receiving module 51, still maintains the neighbor relationship with the neighbor node where the link fault occurs, that is, The neighboring node is removed, and only the first neighboring module 52 notifies the normal neighboring node that the neighboring node that has failed the link is in a fault state, and then if the determining module 54 receives the neighboring node that has failed the link, the timeout period is sent. If the neighbor discovers the packet, the second notification module 53 directly informs the normal neighbor node that the neighbor node that has failed the link is restored to the normal state. Therefore, the link is unstable (that is, intermittently in a short time). When the router repeatedly performs the operation of tearing down the neighbor node and reestablishing the neighbor relationship in a short time, the router CPU is overloaded and the network bandwidth is occupied a lot.
  • the foregoing router protocol is not limited to the 0SPF protocol, and may also be other router protocols;
  • the link fault detection protocol is not limited to the BFD protocol, and may be other link failure detection protocols, as long as the link failure detection protocol is used.
  • the method and apparatus provided by the embodiments of the present invention can be used to solve the problem.
  • the present invention can be implemented by means of software plus necessary general hardware, and of course, by hardware, but in many cases, the former is a better implementation. .
  • the technical solution of the present invention which is essential or contributes to the prior art, can be embodied in the form of a software product.
  • the computer software product is stored in a readable storage medium, such as a floppy disk, a hard disk or an optical disk of a computer, and includes a plurality of instructions for causing a computer device (which may be a personal computer, a server, or a network device, etc.) to perform the present invention.
  • a computer device which may be a personal computer, a server, or a network device, etc.
  • Embodiments of the invention may be used in a router.

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 appareil pour le traitement d'un défaut de liaison. Le procédé comprend les étapes suivantes : lors de la réception d'une notification inaccessible de voisinage générée par le protocole de détection de défaut de liaison, un routeur maintient une relation de voisinage avec un nœud de voisinage avec le défaut de liaison ; et en cas de réception d'un paquet de découverte de voisinage envoyé par le nœud de voisinage avec le défaut de liaison avant un délai de temporisation, le routeur notifie à un nœud de voisinage normal que le nœud de voisinage avec le défaut de liaison est revenu à l'état normal. Le procédé et l'appareil pour le traitement d'un défaut de liaison décrits dans le mode de réalisation de l'invention résolvent les problèmes de charge excessive d'unité centrale de routeur et de bande passante élevée de réseau lorsque la liaison est instable en raison du routeur qui sans cesse interrompt et rétablit les relations de voisinage.
PCT/CN2012/071780 2011-03-10 2012-02-29 Procédé et appareil pour le traitement d'un défaut de liaison WO2012119522A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN2011100583853A CN102136947A (zh) 2011-03-10 2011-03-10 链路故障处理方法及装置
CN201110058385.3 2011-03-10

Publications (1)

Publication Number Publication Date
WO2012119522A1 true WO2012119522A1 (fr) 2012-09-13

Family

ID=44296608

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2012/071780 WO2012119522A1 (fr) 2011-03-10 2012-02-29 Procédé et appareil pour le traitement d'un défaut de liaison

Country Status (2)

Country Link
CN (1) CN102136947A (fr)
WO (1) WO2012119522A1 (fr)

Families Citing this family (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102136947A (zh) * 2011-03-10 2011-07-27 华为技术有限公司 链路故障处理方法及装置
CN102904817B (zh) * 2012-10-24 2015-05-20 福建星网锐捷网络有限公司 链路状态通告发送方法、ospf设备及网络系统
CN104378287B (zh) * 2014-08-26 2018-02-09 新华三技术有限公司 一种拓扑计算方法和装置
CN108683528B (zh) * 2018-04-26 2021-07-20 深圳银澎云计算有限公司 一种数据传输方法、中心服务器、服务器及数据传输系统
CN112422428B (zh) * 2020-11-09 2022-05-17 迈普通信技术股份有限公司 链路状态获取方法、装置、电子设备及可读存储介质
CN112565080B (zh) * 2020-12-02 2022-01-25 北京邮电大学 开放式最短路径优先的邻居建立方法及装置
CN114338505B (zh) * 2021-12-01 2023-06-27 杭州迪普科技股份有限公司 一种路由计算方法、装置、存储介质和计算机设备

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101222486A (zh) * 2007-01-12 2008-07-16 北京邮电大学 自动交换光网络中节点故障后路由重启恢复的控制方法
CN101459549A (zh) * 2007-12-14 2009-06-17 华为技术有限公司 链路故障处理方法及数据转发装置
CN102136947A (zh) * 2011-03-10 2011-07-27 华为技术有限公司 链路故障处理方法及装置

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101087207B (zh) * 2006-06-09 2010-05-12 华为技术有限公司 一种多节点通信故障的处理方法
CN101483548B (zh) * 2009-02-26 2011-01-19 中国人民解放军信息工程大学 一种距离向量路由协议自愈的方法和系统

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101222486A (zh) * 2007-01-12 2008-07-16 北京邮电大学 自动交换光网络中节点故障后路由重启恢复的控制方法
CN101459549A (zh) * 2007-12-14 2009-06-17 华为技术有限公司 链路故障处理方法及数据转发装置
CN102136947A (zh) * 2011-03-10 2011-07-27 华为技术有限公司 链路故障处理方法及装置

Also Published As

Publication number Publication date
CN102136947A (zh) 2011-07-27

Similar Documents

Publication Publication Date Title
US9344325B2 (en) System, method and apparatus providing MVPN fast failover
WO2012119522A1 (fr) Procédé et appareil pour le traitement d'un défaut de liaison
EP2222023B1 (fr) Procédé de traitement de défaut de liaison et dispositif de transfert de données
Sharma et al. OpenFlow: Meeting carrier-grade recovery requirements
US8923112B2 (en) Technique for controlling data forwarding in computer networks
US7804770B2 (en) Method and apparatus for performing a graceful restart in a NSF-capable router without enhancing link state routing protocols
US9178756B2 (en) Method and device for processing location information of fault point
JP5913635B2 (ja) 冗長ネットワーク接続
US7471636B2 (en) Methods and apparatus based on message transmission times
US20090252173A1 (en) Method For Improving Efficiency Of Redundancy Protocols
WO2020135395A1 (fr) Procédé et dispositif de notification pour un identifiant de préfixe de protocole de passerelle interne transversal
WO2012000234A1 (fr) Procédé, appareil et système de commutation rapide entre des liaisons
WO2008046358A1 (fr) Procédé et dispositif destinés à réaliser une pénétration d'un statut de liaison de réseau point à multipoint
WO2012167667A1 (fr) Procédé, dispositif et dispositif de nœud de traitement de dégradation de signal
WO2012171378A1 (fr) Procédé et routeur pour prévenir une interruption de flux provoquée par basculement de vpls vers l3
WO2008014696A1 (fr) Méthode et dispositif pour effectuer un transfert de communications
WO2021027828A1 (fr) Procédé et appareil de traitement d'informations d'état de liaison
WO2014090083A1 (fr) Procédé et appareil de support de services pendant l'interconnexion de réseau résiliente distribuée
JP2014064252A (ja) ネットワークシステム、伝送装置、及び障害情報通知方法
WO2017036165A1 (fr) Procédé et appareil de détection de défaillance de liaison
WO2012122817A1 (fr) Procédé et système de commutation de protection de tunnel de multidiffusion p2mp
JP4871815B2 (ja) パケット交換ネットワーク、障害管制装置およびパケット交換装置
EP3627779A1 (fr) Procédé d'effacement de données de trajet, et procédé et appareil de transfert de message

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

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

Country of ref document: EP

Kind code of ref document: A1