WO2012058914A1 - Procédé et système pour réaliser une recherche automatique de liaison - Google Patents

Procédé et système pour réaliser une recherche automatique de liaison Download PDF

Info

Publication number
WO2012058914A1
WO2012058914A1 PCT/CN2011/073841 CN2011073841W WO2012058914A1 WO 2012058914 A1 WO2012058914 A1 WO 2012058914A1 CN 2011073841 W CN2011073841 W CN 2011073841W WO 2012058914 A1 WO2012058914 A1 WO 2012058914A1
Authority
WO
WIPO (PCT)
Prior art keywords
node
link
trace information
discovery
neighbor
Prior art date
Application number
PCT/CN2011/073841
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 WO2012058914A1 publication Critical patent/WO2012058914A1/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

Definitions

  • the present invention relates to the field of communications, and in particular to a method and system for implementing automatic link discovery.
  • the Automatically Switched Optical Network is an optical network control plane based on the Generalized Multi-Protocol Label Switching (GMPLS) protocol family, which implements the establishment of an automatic switched connection. Restore function. Its basic functions include automatic resource discovery, routing functions, signaling functions, and so on.
  • GPLS Generalized Multi-Protocol Label Switching
  • LMP Link Management Protocol
  • the LMP protocol implements automatic discovery of links by sending detection messages between neighbor nodes.
  • the implementation method includes: sending a TRACE (tracking) information of the entire network in the overhead byte to the Synchronous Digital Hierarchy (SDH) interface, and after the neighbor node receives the LMP Test message, The TRACE information carried in the LMP Test 4 message is compared with the TRACE information obtained by the node from the overhead byte. If the match is successful, the link discovery succeeds; if none matches, the node is first replied to the LMP TestStatusFailure (the LMP test status fails) The initiating node of the discovery, if it is the anonymous verification mode, the initiating node will continue to initiate the automatic discovery process to other neighboring nodes.
  • TRACE tracking
  • SDH Synchronous Digital Hierarchy
  • the node will be re-initiated after the discovery period timer expires.
  • the LMP auto-discovery is the active discovery of the node in the originating direction. If the transmitting fiber is broken or the remote end does not access the NE, the neighbor node fails to be discovered. In the anonymous mode, the node continues to automatically discover other neighbor nodes, which also wastes system resources and network bandwidth. In the non-anonymous mode, after the timer expires, re-initiating the verification will also fail, and the system resources are also wasted.
  • the main purpose of the present invention is to provide an implementation scheme for automatic link discovery, so as to at least solve the problem that bandwidth and resource waste are easily generated when the active discovery of the link in the related art is performed.
  • a method for implementing automatic link discovery comprising: receiving, by a first node, TRACE information in a link receiving direction; and transmitting, by the first node, TRACE information to The neighbor node determines that the received TRACE information matches the TRACE information sent by the neighboring node, and notifies the first node that the discovery is successful.
  • the first node sends the TRACE information to the neighboring node, where the first node sends the LMP Test message to the neighboring node, where the LMP Test message carries the TRACE information.
  • the method further includes: the first node saves the link between the first node and the neighboring node as a downlink link.
  • the method further includes: the first node sends an LMP Link Summary message to the neighbor node; the neighbor node saves the first node and the neighbor node The link between the links is the outgoing link.
  • an implementation system for automatic link discovery comprising: a first node and a neighbor node, wherein the first node is set to be in a link receiving direction The TRACE information is received, and the TRACE information is sent to the neighbor node.
  • the neighbor node is configured to determine that the received TRACE information matches the TRACE information sent by the neighbor node, and notify the first node that the discovery is successful.
  • the first node is configured to send an LMP Test message to the neighbor node, where the LMP Test message carries the TRACE information.
  • the first node is further configured to save the link between the first node and the neighbor node as a downlink link after the neighbor node notifies the first node that the discovery is successful.
  • the first node is further configured to send an LMP Link Summary message to the neighbor node; the neighbor node is further configured to save the link between the first node and the neighbor node as a transmission direction link.
  • the neighbor node is further configured to notify the first node that the failure is found when the received TRACE information does not match the TRACE information sent by the neighbor node; the first node is further configured to send the TRACE information to other neighbor nodes one by one until receiving other The success message sent by the neighbor node.
  • the node automatically initiates the automatic discovery of the link in the receiving direction, and solves the problem that the bandwidth and the resource are easily generated when the active discovery of the link is performed in the related art, thereby achieving the effect of saving bandwidth and system resources. .
  • FIG. 1 is a flow chart of a method for implementing automatic link discovery according to an embodiment of the present invention
  • FIG. 2 is a flowchart of an initiating node process according to an embodiment of the present invention
  • FIG. 4 is a schematic diagram of networking for automatic link discovery according to Embodiment 4 of the present invention
  • FIG. 5 is a schematic diagram of networking for automatic link discovery according to Embodiment 5 of the present invention; A structural block diagram of an implementation system for automatic link discovery according to an embodiment of the invention. BEST MODE FOR CARRYING OUT THE INVENTION
  • FIG. 1 is a flowchart of a method for implementing automatic link discovery according to an embodiment of the present invention. As shown in FIG. 1, the method includes: S102: The first node receives the TRACE information in the link receiving direction.
  • the first node sends the TRACE information to the neighbor node.
  • the first node may send the LMP test to the neighbor node.
  • the message passes the TRACE information to the neighbor node.
  • Step S106 The neighbor node determines whether the received TRACE information matches the TRACE information sent by the local node, and if yes, notifies the first node that the discovery is successful.
  • the automatic discovery of the link is initiated by the node in the receiving direction. Since the node can receive the TRACE information, a node must send the information, thereby improving the accuracy of the automatic discovery. Moreover, the method for initiating the automatic discovery of the link by the initiator is different from the prior art.
  • the first node may save the link between the first node and the neighbor node as a downlink link. Then, the neighboring node is notified to keep the link between the first node and the neighboring node as the outgoing link.
  • the neighbor node may notify the first node of the link discovery.
  • the first node will send TRACE information to other neighbor nodes one by one until receiving a successful discovery message sent by other neighbor nodes.
  • the other neighbor nodes After receiving the TRACE information, the other neighbor nodes also perform the same judgment as step S106, and if the judgment result is yes, send a message indicating that the discovery is successful to the first node, otherwise, send a message that the discovery fails. Then, the first node sends TRACE information to the next neighbor node. It should be noted that the first node may also send TRACE information to all neighbor nodes at one time, so that the neighbor node matches the TRACE information, but this method takes up more bandwidth than the method of sending one by one.
  • Embodiment 2 This embodiment provides a method for automatic discovery based on the direction of reception to solve the problem of system resource waste caused by automatic discovery failure in the related art.
  • the node first checks whether the TRACE information is received in the link receiving direction, and if the TRACE information is not received, the automatic discovery is not started; if the TRACE information is received, the automatic discovery of the link is started.
  • the node carries the TRACE information in the LMP Test message and sends it to the neighbor node. After receiving the LMP Test message, the neighbor node extracts the TRACE information in the LMP Test message and sends it to the TRACE. The information is compared. If it matches, the success is found, and the response to the initiating node is found to be successful.
  • the initiating node After receiving the success response of the neighboring node, the initiating node saves the link information as the link discovery information in the receiving direction, and then continues the subsequent protocol process.
  • the LMP Link Summary message is sent to the neighboring node. After receiving the LMP Link Summary message, the neighboring node saves the link discovery information in the sending direction. If the neighbor node fails to match the TRACE information, the LMP TestStatusFailure is sent to the initiating node. Then, the initiating node continues to send LMP Test messages to other neighbors. Because the originating node receives the TRACE information in the receiving direction, this indicates that some nodes have sent the information. Therefore, when auto-discovering with other neighbors, one neighbor will definitely find the success, and the automatic discovery will succeed.
  • the normal process is the first step: When the link automatic discovery is performed, the link is checked. Whether the direction TRACE information exists, if the receiving direction TRACE information exists, the automatic discovery is started, and the LMP Test message is sent to the neighboring node, where the LMP Test message carries the received TRACE information. Step 2: After receiving the LMP Test message, the neighbor node compares the TRACE information with the TRACE information sent by the local node. If it matches, the response is sent to the initiating node.
  • Step 3 The initiating node receives the success of the neighboring node, and then saves the link between the initiating node and the neighboring node as the inbound link discovery information, and sends the LMP Link Summary to the neighboring node.
  • Step 4 After receiving the LMP Link Summary message, the neighboring node saves the discovery result as the link direction discovery information.
  • the first step if the TRACE information in the link receiving direction does not exist, the link auto discovery is not started.
  • the LMP TestStatusFailure message ie, the failure response
  • the initiating node goes to the first step, continues and A neighbor node performs automatic discovery.
  • the automatic discovery of the link receiving direction ensures that each automatic discovery can be successful, especially in the case that the neighboring node fails to be discovered due to the link fiber break or the remote end does not access the network element.
  • the automatic automatic discovery process between multiple neighboring nodes is avoided, the efficiency of automatic discovery is improved, the protocol packet exchange between neighboring nodes is reduced, and the waste of system resources and network bandwidth is reduced.
  • Embodiment 3 This embodiment describes the processing procedure of the initiating node and the neighboring node, respectively. 2 is a flowchart of the process of the initiating node in the embodiment of the present invention. As shown in FIG. 2, the method includes: Step S201: The initiating node determines whether the link receiving direction TRACE exists, and if yes, performs step 4, S202.
  • Step S202 The initiating node initiates an automatic discovery process, and sends an LMP Test message to the neighboring node, where the LMP Test message carries the TRACE information received by the initiating node.
  • Step S203 The response of the neighboring node received by the initiating node is a success or a failure. If the response is successful, the process proceeds to step S204. Otherwise, the process returns to step S202 to perform the discovery of the next neighbor.
  • 3 is a flowchart of a neighbor node process according to an embodiment of the present invention.
  • the method includes: Step S301: After receiving a LMP Test message sent by an initiating node, the neighboring node determines the TRACE information in the message. Whether the TRACE information sent by the neighbor node matches, if yes, proceed to step S302, otherwise, proceed to step S304. Step S302, the neighbor node response is found successfully to the initiating node. Step S303: The neighbor node receives the LMP Link Summary message sent by the initiating node, and saves the link discovery result. Step S304, the neighbor node sends a discovery failure message to the initiating node.
  • FIG. 4 is a schematic diagram of networking for automatic link discovery according to Embodiment 4 of the present invention. As shown in FIG.
  • the network of three points is taken as an example to perform automatic discovery of the A-point link in the anonymous mode. Description. As shown in Figure 4, there are 2 links at point A, port 1.1, and the direction TRACE is "2"; port 1.2, the direction TRACE is "4".
  • the discovery process for port 1.1 includes:
  • Point A checks to the port 1. 1) Direction TRACE exists, then point A initiates automatic discovery of port 1.1, and sends an LMP Test message to neighbor node B, which carries TRACE information as "2".
  • Point B receives the LMP Test message sent from point A, and takes the TRACE message "2" from the message. In this node, it searches for the link that sends TRACE is "2". The match is successful and the port is 2.1.
  • Point B answers A point LMP TestStatusSuccess (LMP test status is successful, ie, successful response), found successful B point interface is 2. 1.
  • Point A receives a successful response from point B, and confirms that the discovery is successful.
  • the destination port is corresponding to port 1.1 on port 2.1. Then, point A saves the discovery result.
  • the link is found successfully.
  • the link is in the receiving direction.
  • the local interface is point A 1.1.
  • the remote interface is point B 2.1. Then, point A sends the LMP Link Summary to point B.
  • Point B receives the LMP Link Summary sent by point A, and saves the discovery result.
  • the link is in the sending direction.
  • the local interface is 2.1 and the remote interface is 1.
  • the discovery process for port 1.2 includes:
  • a point check port 1.2 receives the direction TRACE exists, then point A initiates the automatic discovery of port 1.2, and sends an LMP Test message to neighbor node B, which carries TRACE information as "4".
  • Point B receives the LMP Test message sent from point A, and extracts the TRACE message "4" from the message. In this node, it looks for the link that sends TRACE is "4", and the matching fails.
  • Point B Answer A point LMP TestStatusFailure
  • Point A receives the B-point failure response and sends an LMP Test message to the neighboring node C.
  • the message carries the TRACE message as "4".
  • Point C receives the LMP Test message sent from point A, and takes the TRACE message "4" from the message. In this node, it looks for the link that sends TRACE is "4", the matching is successful, and the port is 3.1.
  • Point C responds to point A.
  • LMP TestStatusSuccess found that the successful C-point interface is 3.1.
  • Point A receives the successful response sent by point C, and determines that the discovery is successful.
  • the receiving port is in the direction of port 1.2 corresponding to point C of port C.
  • Point A saves the result of the discovery.
  • the link is found successfully, the link is in the receiving direction, and the local interface is point A 1.2.
  • FIG. 5 is a schematic diagram of networking for automatic link discovery according to Embodiment 5 of the present invention. As shown in FIG.
  • the A point performs the automatic discovery of port 1.1, and needs to send a check message (including Begin Verify, Begin VerifyAck, Test, TestStatusFailure, EndVerify, EndVerifyAck) to the neighbor B point, because the fiber is broken, A Point finds that point B fails. Then, point A and point C perform automatic discovery of port 1.1, and send the school-risk message again. Since the fiber is broken, and point C will also find failure.
  • a check message including Begin Verify, Begin VerifyAck, Test, TestStatusFailure, EndVerify, EndVerifyAck
  • A After automatic discovery failure with both neighbor nodes, A automatically performs periodic automatic discovery (this automatic discovery cycle is much faster than the maintenance discovery cycle after successful discovery, generally 3 times faster), and repeats the above process. .
  • point B since the neighbor of port 1.1 is point B, point A will only periodically and automatically discover with B.
  • the automatic discovery of the 1.1 port in the receiving direction is started at point A. In this case, the success is found.
  • the point A is 1.1 for the receiving direction, and the far end is the point B for point 2.1. Enter the discovery maintenance status.
  • point B it is found that the TRACE information of the receiving direction of port 2.1 does not exist (or is in the error state), and point B does not initiate automatic discovery of port 2.1.
  • the discovery process is the same as anonymous. It can be seen that, in the case that there is an abnormality of the optical fiber, the present embodiment does not automatically discover periodically. In the case of three nodes in the figure, the number of automatically discovered packets will be in an anonymous manner. Less than 1/6 of the methods in the related art (the more neighbor nodes, the greater the number of 4 ⁇ )); the non-anonymous mode is less than 1/3 of the original mode; thus, the efficiency of automatic discovery is greatly improved. , reducing system message processing and reducing the occupation of network bandwidth.
  • the embodiment of the present invention further provides an implementation system for automatic link discovery.
  • FIG. 6 is a structural block diagram of an implementation system for automatic link discovery according to an embodiment of the present invention. As shown in FIG.
  • the system includes: 62 and a neighbor node 64, wherein the first node 62 is configured to receive TRACE information in the link receiving direction, and send the TRACE information to the neighbor node 64; the neighbor node 64 is configured to determine the received TRACE information and the neighbor.
  • the TRACE information sent by the node 64 matches, and the first node 62 is notified that the discovery is successful.
  • the first node 62 may send the TRACE information to the neighbor node 64 by sending an LMP Test message to the neighbor node 64.
  • the first node 62 saves the link between the first node 62 and the neighbor node 64 as a downlink link after the neighbor node 64 notifies the first node 62 that the discovery is successful. Then, the first node 62 sends an LMP Link Summary message to the neighbor node 64; the neighbor node 64 saves the link between the first node 62 and the neighbor node 64 as a directional link.
  • the neighbor node 64 is further configured to notify the first node 62 that the failure is found when the received TRACE information does not match the TRACE information sent by the neighbor node 64; the first node 62 is further configured to send to the other neighbor nodes one by one.
  • the node in the embodiment of the present invention initiates the automatic discovery of the link in the receiving direction, which solves the problem that the bandwidth and the resource are easily generated when the active discovery of the link is performed in the related art, thereby achieving bandwidth saving and system resources. Effect.
  • the above modules or steps of the present invention can be implemented by a general-purpose computing device, which can be concentrated on a single computing device or distributed over a network composed of multiple computing devices. Alternatively, they may be implemented by program code executable by the computing device, such that they may be stored in the storage device by the computing device and, in some cases, may be different from the order herein.

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 système permettant de réaliser une recherche automatique de liaison. Le procédé comprend les étapes suivantes : un premier noeud reçoit des informations TRACE dans la direction de réception de liaison; le premier noeud transmet les informations TRACE à un nœud voisin; le nœud voisin détermine que les informations TRACE reçues correspondent aux informations TRACE transmises par lui-même, et notifie ensuite au premier nœud que la recherche a réussi. Selon la présente invention, l'effet de sauvegarde de largeur de bande et de ressources système est atteint.
PCT/CN2011/073841 2010-11-04 2011-05-09 Procédé et système pour réaliser une recherche automatique de liaison WO2012058914A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201010531951.3 2010-11-04
CN201010531951.3A CN102469005B (zh) 2010-11-04 2010-11-04 链路自动发现的实现方法及系统

Publications (1)

Publication Number Publication Date
WO2012058914A1 true WO2012058914A1 (fr) 2012-05-10

Family

ID=46023966

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2011/073841 WO2012058914A1 (fr) 2010-11-04 2011-05-09 Procédé et système pour réaliser une recherche automatique de liaison

Country Status (2)

Country Link
CN (1) CN102469005B (fr)
WO (1) WO2012058914A1 (fr)

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2008074192A1 (fr) * 2006-12-21 2008-06-26 Zte Corporation Procédé et dispositif de vérification de connectivité de données
CN101217338A (zh) * 2007-01-06 2008-07-09 华为技术有限公司 一种检测消息的传送方法、网元设备
CN101394677A (zh) * 2007-09-19 2009-03-25 烽火通信科技股份有限公司 在自动交换光网络的节点中验证链路属性的方法和装置

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2008074192A1 (fr) * 2006-12-21 2008-06-26 Zte Corporation Procédé et dispositif de vérification de connectivité de données
CN101217338A (zh) * 2007-01-06 2008-07-09 华为技术有限公司 一种检测消息的传送方法、网元设备
CN101394677A (zh) * 2007-09-19 2009-03-25 烽火通信科技股份有限公司 在自动交换光网络的节点中验证链路属性的方法和装置

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
J. LANG AND D. PAPADIMITRIOUS: "Network Working Group RFC4207;Synchronous Optical Network (SONET)/Synchronous Digital Hierarchy (SDH) Encoding for Link Management Protocol (LMP) Test Messages; Network Working Group; Category", IETF, 31 October 2005 (2005-10-31) *

Also Published As

Publication number Publication date
CN102469005A (zh) 2012-05-23
CN102469005B (zh) 2016-04-13

Similar Documents

Publication Publication Date Title
EP2041930B1 (fr) Réseau mobile ad-hoc (manet) et procédé destiné à implémenter de multiples chemins pour une tolérance aux pannes
EP2472795B1 (fr) Procédé et système pour reconstruire la topologie d un réseau à anneau unique
US7233991B2 (en) Self-healing tree network
US7940678B2 (en) Method for triggering failure detection in bidirectional forwarding detection
US7778204B2 (en) Automatic maintenance of a distributed source tree (DST) network
US20070211623A1 (en) Failure recovery method, network device, and program
US20120014246A1 (en) Method and system for setting up path through autonomous distributed control, and communication device
WO2012048585A1 (fr) Procédé de commutation et routeur
WO2009055995A1 (fr) Procédé de maintien pour système de réseau optique à commutation automatique lorsqu'un fonctionnement engendre une alarme
WO2012071909A1 (fr) Procédé et dispositif de récupération de services
WO2011134240A1 (fr) Procédé et dispositif permettant de résoudre un conflit d'allocation de ressources
US8868967B2 (en) Method and system for connection-error handling of service in an automatically switched optical network
WO2011140873A1 (fr) Procédé et appareil de transport de données pour une couche de transport optique
WO2022042207A1 (fr) Procédé de configuration de ressources et dispositif de communication
CN109041167A (zh) 一种支持eigrp协议进行链路单双向状态检测的方法
WO2012058914A1 (fr) Procédé et système pour réaliser une recherche automatique de liaison
WO2015154583A1 (fr) Procédé, dispositif et système pour mettre à jour un état de protocole d'un canal de commande
KR100772191B1 (ko) 링크 관리 프로토콜을 확장한 상위 계층 연결성 검증시스템 및 방법
CN101176280B (zh) 一种自动交换光网络控制实体拓扑的自动发现方法
US20220255806A1 (en) Method for achieving network communication based on neighbor negotiation and device
CN1889397B (zh) 一种智能光网络中的业务路径建立方法
CN113169939B (zh) 一种业务路径建立的方法、网络设备和系统
WO2016065754A1 (fr) Procédé et appareil de réduction de la quantité de messages dans un protocole lmp
Zhao et al. Dual Routing Architecture in Multi-layer and Multi-domain GMPLS/ASON Networks
Jayabal et al. Improving distribution network utilization in Optical Flow Switching

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

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

Country of ref document: EP

Kind code of ref document: A1