WO2012058914A1 - Method and system for realizing link automatic discovery - Google Patents

Method and system for realizing link automatic discovery 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
French (fr)
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/en

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00Routing 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.

Abstract

A method and a system for realizing link automatic discovery are disclosed in the present invention. The method includes the following steps: a first node receives TRACE information in the link reception direction; the first node transmits the TRACE information to a neighbor node; the neighbor node determines that the received TRACE information matches the TRACE information transmitted by the neighbor node, and then notifies the first node that the discovery is successful. With the present invention, the effect of saving bandwidth and system resources is achieved.

Description

自动发现的实现方法及系统 技术领域 本发明涉及通信领域, 具体而言, 涉及一种链路自动发现的实现方法及系 统。 背景技术 自动交换光网络 ( Automatically Switched Optical Network, 简称为 ASON ) 是基于通用多协议标志交换 ( Generalized Multi protocol label Switching, 简称 为 GMPLS ) 协议族的光网络控制平面, 实现了自动交换连接的建立和恢复功 能。 其基本功能包括资源自动发现、 路由功能、 信令功能等。 为了实现传送平 面资源的自动发现, 标准化组织提出了链路管理协议 ( Link Manage Protocol, 简称为 LMP )„ 在 ASON 中, LMP协议通过在邻居节点间发送检测消息来实现链路的自 动发现,具体的实现方法包括:对同步数字体系( Synchronous Digital Hierarchy, 简称为 SDH )接口, 在开销字节中发送全网唯一的 TRACE (跟踪) 信息, 在 邻居节点收到 LMP Test ( LMP测试) 消息后, 将该 LMP Test 4艮文中携带的 TRACE信息和节点从开销字节获取的 TRACE信息进行比较, 如果匹配, 则链 路发现成功; 如果都不匹配, 先发起节点应答 LMP TestStatusFailure ( LMP测 试状态失败) 消息; 对发现的发起节点, 如果是匿名校验方式, 则发起节点会 继续向其他邻居节点发起自动发现过程, 如果是非匿名校验方式, 则发现节点 会在发现周期定时器超时后, 重新发起校验。 在光网络中, 一个光口有收发两根光纤, 现有技术中, LMP 自动发现都是 节点在发起发方向进行主动发现, 如果发方向光纤是断的或者远端没有接入到 网元, 则会造成邻居节点发现失败, 这样, 对匿名方式, 节点继续向其他邻居 节点进行自动发现一样也会失败,浪费了系统资源和网络带宽;对非匿名方式, 定时器超时后,重新发起校验同样会失败,也同样浪费了系统资源和网络带宽。 发明内容 本发明的主要目的在于提供一种链路自动发现的实现方案, 以至少解决上 述的相关技术中进行链路的主动发现时容易产生带宽和资源浪费的问题。 为了实现上述目的, 根据本发明的一个方面, 提供了一种链路自动发现的 实现方法, 该方法包括: 第一节点在链路收方向上收到 TRACE信息; 第一节 点将 TRACE信息发送给邻居节点; 邻居节点确定接收到的 TRACE信息与邻 居节点发送的 TRACE信息相匹配, 通知第一节点发现成功。 第一节点将 TRACE信息发送给邻居节点包括: 第一节点向邻居节点发送 LMP Test消息, 其中, LMP Test消息中携带有 TRACE信息。 在邻居节点通知第一节点发现成功之后, 上述方法还包括: 第一节点保存 第一节点和邻居节点之间的链路为收方向链路。 在第一节点保存第一节点和邻居节点之间的链路为收方向链路之后, 上述 方法还包括: 第一节点向邻居节点发送 LMP Link Summary消息; 邻居节点保 存第一节点和邻居节点之间的链路为发方向链路。 如果邻居节点确定接收到的 TRACE信息与邻居节点发送的 TRACE信息 不匹配, 则邻居节点通知第一节点发现失败; 第一节点逐个地向其他邻居节点 发送 TRACE信息, 直到接收到其他邻居节点发送的发现成功的消息。 为了实现上述目的, 根据本发明的另一方面, 提供了一种链路自动发现的 实现系统, 该系统包括: 第一节点和邻居节点, 其中, 第一节点, 设置为在链 路收方向上收到 TRACE信息, 并将 TRACE信息发送给邻居节点; 邻居节点, 设置为确定接收到的 TRACE信息与邻居节点发送的 TRACE信息相匹配, 并 通知第一节点发现成功。 第一节点设置为向邻居节点发送 LMP Test消息, 其中, LMP Test消息中 携带有 TRACE信息。 第一节点还设置为在邻居节点通知第一节点发现成功之后, 保存第一节点 和邻居节点之间的链路为收方向链路。 第一节点还设置为向邻居节点发送 LMP Link Summary消息; 邻居节点还 设置为保存第一节点和邻居节点之间的链路为发方向链路。 邻居节点还设置为在确定接收到的 TRACE 信息与邻居节点发送的 TRACE 信息不匹配时, 通知第一节点发现失败; 第一节点还设置为逐个地向 其他邻居节点发送 TRACE信息, 直到接收到其他邻居节点发送的发现成功的 消息。 通过本发明, 釆用节点在收方向发起链路的自动发现的方式, 解决了相关 技术中进行链路的主动发现时容易产生带宽和资源浪费的问题, 进而达到了节 省带宽和系统资源的效果。 附图说明 此处所说明的附图用来提供对本发明的进一步理解, 构成本申请的一部 分, 本发明的示意性实施例及其说明用于解释本发明, 并不构成对本发明的不 当限定。 在附图中: 图 1是根据本发明实施例的链路自动发现的实现方法的流程图; 图 2是 居本发明实施例的发起节点处理的流程图; 图 3是 居本发明实施例的邻居节点处理的流程图; 图 4是根据本发明实施例四的链路自动发现的组网示意图; 图 5是根据本发明实施例五的链路自动发现的组网示意图; 图 6是根据本发明实施例的链路自动发现的实现系统的结构框图。 具体实施方式 下文中将参考附图并结合实施例来详细说明本发明。 需要说明的是, 在不 冲突的情况下, 本申请中的实施例及实施例中的特征可以相互组合。 实施例一 本发明实施例提供了一种链路自动发现的实现方法, 图 1是根据本发明实 施例的链路自动发现的实现方法的流程图, 如图 1所示, 该方法包括: 步骤 S 102 , 第一节点在链路收方向上收到 TRACE信息; 步骤 S 104, 该第一节点将该 TRACE信息发送给邻居节点; 例如, 第一节点可以通过向邻居节点发送 LMP Test ( LMP测试) 消息将 TRACE信息传递给邻居节点。 步骤 S 106,该邻居节点判断接收到的 TRACE信息与本节点发送的 TRACE 信息是否匹配, 如果匹配, 则通知第一节点发现成功。 在本实施例, 是由收方向的节点发起链路的自动发现的, 该节点既然能够 接收到 TRACE信息, 则必然有一个节点发送了该信息, 从而提高了自动发现 的准确性。 并且, 相对于现有技术由发起方发起链路自动发现的方式, 本实施 例避免了对未建立成功的链路的重复发现的过程, 达到了节省带宽和系统资源 的效果。 在本发明实施例的一个优选的实例中,邻居节点通知第一节点发现成功之 后,第一节点可以将第一节点和邻居节点之间的链路保存为收方向链路。然后, 通知邻居节点保存第一节点和邻居节点之间的链路为发方向链路。 在本发明实施例的另一个优选的实例中, 如果步骤 S 106 中邻居节点判断 的结果为接收到的 TRACE信息与本节点发送的 TRACE信息不匹配, 则邻居 节点可以通知第一节点链路发现失败; 然后, 第一节点将逐个地向其他邻居节 点发送 TRACE信息, 直到接收到其他邻居节点发送的发现成功的消息。 其中, 其他邻居节点在接到 TRACE信息后, 也会进行与步骤 S 106相同的判断, 并在 判断结果为是的情况下, 向第一节点发送发现成功的消息, 否则, 发送发现失 败的消息, 然后, 第一节点再向下一个邻居节点发送 TRACE信息。 需要说明 的是, 第一节点也可以一次性的向所有邻居节点发送 TRACE信息, 以便邻居 节点对该 TRACE信息进行匹配, 但是这种方法相对于逐个发送的方式, 会占 用较多的带宽。 实施例二 本实施例提供了一种基于收方向自动发现的方法, 以解决相关技术中自动 发现失败而带来的系统资源浪费的问题。 本发明实施例中, 节点先检查链路收方向有没有收到 TRACE信息, 如果 没有收到 TRACE信息, 则不启动自动发现; 如果有收到 TRACE信息, 则启 动该链路的自动发现。 该节点在 LMP Test消息中携带收方向的 TRACE信息, 并将其发送给邻居节点, 邻居节点在收到 LMP Test消息后, 取出该 LMP Test 消息中的 TRACE信息, 将其和本点发送的 TRACE信息进行比较, 如果匹配, 则发现成功, 并向发起节点应答发现成功。 发起节点在收到邻居节点的成功应 答后, 保存该链路信息为收方向的链路发现信息, 然后, 继续后续协议流程, 发送 LMP Link Summary 消息给该邻居节点, 该邻居节点在收到 LMP Link Summary消息后, 保存结果为发方向的链路发现信息。 如果邻居节点进行 TRACE信息比较时,匹配失败,则向发起节点发送 LMP TestStatusFailure ( LMP测试状态失败), 然后, 发起节点会继续向其他邻居发 送 LMP Test消息。 因为发起节点链路收方向有收到 TRACE信息, 这说明肯定 有节点发送了该信息, 所以在和其他邻居进行自动发现时, 肯定会有一个邻居 发现成功, 最终自动发现成功。 下面对本实施例的自动发现的流程进行分类描述(其中涉及到协议的协议 流程时, 只描述关键协议 4艮文处理): 正常流程 第一步: 在进行链路自动发现时, 检查链路收方向 TRACE信息是否存在, 如果收方向 TRACE信息存在, 则启动自动发现, 并发送 LMP Test消息给邻居 节点, 其中, LMP Test消息中携带有收到的 TRACE信息。 第二步: 邻居节点收到该 LMP Test消息后, 将其中的 TRACE信息和本节 点发送的 TRACE信息进行比较, 如果匹配, 则发送应答成功给发起节点。 第三步: 发起节点收到邻居节点的成功, 然后, 将发起节点和邻居节点之 间的链路保存为收方向链路发现信息,并发送 LMP Link Summary给邻居节点。 第四步: 邻居节点在收到 LMP Link Summary消息后, 保存发现结果为发 方向链路发现信息。 异常流程一 在第一步中, 如果链路收方向的 TRACE信息不存在, 则不启动链路自动 发现。 异常流程二 在第二步中, 如果邻居节点进行 TRACE 匹配失败, 则应答 LMP TestStatusFailure消息(即, 失败应答)给发起节点, 发起节点在收到该消息后, 转到第一步, 继续和下一个邻居节点进行自动发现。 本实施例通过链路收方向的自动发现, 确保每次自动发现都能够成功, 尤 其是在有链路光纤断或者远端没有接入到网元等原因造成邻居节点发现失败 的情况下, 可以避免周期性多个邻居节点之间无效的自动发现过程, 提高了自 动发现的效率, 降低了邻居节点之间的协议报文交互, 减少了对系统资源和网 络带宽的浪费。 实施例三 本实施例分别对发起节点和邻居节点的处理过程进行说明。 图 2是 居本 发明实施例的发起节点处理的流程图, 如图 2所示, 该方法包括: 步骤 S201 , 发起节点判断链路收方向 TRACE是否存在, 如果是, 则进行 步 4聚 S202, 否则, 流程结束。 步骤 S202, 发起节点启动自动发现过程, 向邻居节点发送 LMP Test消息, 其中, LMP Test消息携带有发起节点接收到的 TRACE信息。 步骤 S203 , 发起节点收到的邻居节点的应答是成功还是失败, 如果是成功 应答, 则进行步骤 S204, 否则, 返回步骤 S202, 进行下一个邻居的发现。 步骤 S204 , 发起节点保存链路发现信息, 并向邻居节点发送 LMP Link Summary消息。 然后, 发起节点关于该链路发现的流程结束。 图 3是 居本发明实施例的邻居节点处理的流程图, 如图 3所示, 该方法 包括: 步骤 S301 , 邻居节点收到发起节点发送的 LMP Test消息后, 判断该消息 中的 TRACE信息与该邻居节点发送的 TRACE信息是否匹配, 如果是, 则进 行步骤 S302, 否则, 进行步骤 S304。 步骤 S302, 邻居节点应答发现成功给发起节点。 步骤 S303 , 邻居节点接收到发起节点发送的 LMP Link Summary消息, 保 存链路发现结果。 步骤 S304, 邻居节点发送发现失败消息给发起节点。 实施例四 图 4是根据本发明实施例四的链路自动发现的组网示意图, 如图 4所示, 以三个点的组网为例, 对匿名方式下 A点链路自动发现情况进行说明。 如图 4 所示, A点有 2条链路, 端口 1. 1 , 收方向 TRACE为" 2"; 端口 1.2, 收方向 TRACE为" 4"。 端口 1.1的发现过程包括: 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 (ASON) 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. In order to realize automatic discovery of transport plane resources, the standardization organization proposes a Link Management Protocol (LMP). In ASON, 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. If it is in the non-anonymous verification mode, the node will be re-initiated after the discovery period timer expires. In the optical network, one optical port has two transceivers. In the prior art, 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. In order to achieve the above object, according to an aspect of the present invention, a method for implementing automatic link discovery is provided, the method 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. After the neighboring node notifies the first node that the discovery is successful, the method further includes: the first node saves the link between the first node and the neighboring node as a downlink link. After the first node saves the link between the first node and the neighbor node as the directional 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. If the neighbor node determines that the received TRACE information does not match the TRACE information sent by the neighboring node, the neighboring node notifies the first node that the discovery fails; the first node sends the TRACE information to other neighboring nodes one by one until receiving the sending by other neighboring nodes. Found a message of success. In order to achieve the above object, according to another aspect of the present invention, an implementation system for automatic link discovery is provided, the system 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. Through the invention, 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. . BRIEF DESCRIPTION OF THE DRAWINGS The accompanying drawings, which are set to illustrate,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,, BRIEF DESCRIPTION OF THE DRAWINGS 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 Hereinafter, the present invention will be described in detail with reference to the accompanying drawings. It should be noted that the embodiments in the present application and the features in the embodiments may be combined with each other without conflict. Embodiment 1 The embodiment of the present invention provides a method for implementing automatic link discovery. 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. In step S104, the first node sends the TRACE information to the neighbor node. For example, 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. In this embodiment, 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. This embodiment avoids the process of repeatedly discovering the link that is not successfully established, and achieves the effect of saving bandwidth and system resources. In a preferred example of the embodiment of the present invention, after the neighbor node notifies the first node that the discovery is successful, 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. In another preferred example of the embodiment of the present invention, if the result of the neighbor node determination in step S106 is that the received TRACE information does not match the TRACE information sent by the local node, the neighbor node may notify the first node of the link discovery. Failure; Then, 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. 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. In the embodiment of the present invention, 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. 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 following describes the classification process of the automatic discovery process in this embodiment (in the case of the protocol protocol of the protocol, only the key protocol is described): 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. In the first step, if the TRACE information in the link receiving direction does not exist, the link auto discovery is not started. In the second step, if the neighbor node fails the TRACE match, the LMP TestStatusFailure message (ie, the failure response) is sent to the initiating node. After receiving the message, the initiating node goes to the first step, continues and A neighbor node performs automatic discovery. In this embodiment, 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. Otherwise, the process ends. 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. Step S204: The initiating node saves the link discovery information, and sends an LMP Link Summary message to the neighboring node. Then, the originating node ends the process of discovering the link. 3 is a flowchart of a neighbor node process according to an embodiment of the present invention. As shown in FIG. 3, 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. Embodiment 4 FIG. 4 is a schematic diagram of networking for automatic link discovery according to Embodiment 4 of the present invention. As shown in FIG. 4, 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:
A点检查到端口 1. 1的) 方向 TRACE存在, 则 A点启动端口 1.1的自动 发现, 并向邻居节点 B发送 LMP Test消息, 该消息中携带 TRACE信息为 "2"。 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".
B点收到 A点发送过来的 LMP Test消息,从消息中取出 TRACE信息" 2" , 在本节点中查找发送 TRACE是" 2"的链路, 匹配成功, 端口为 2.1。 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.
B点应答 A点 LMP TestStatusSuccess ( LMP 测试状态成功, 即, 成功应 答), 发现成功 B点接口为 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.
A点收到 B点成功应答, 确认发现成功, 收方向 1.1端口对应 B点 2.1端 口, 然后, A点保存该发现结果, 链路发现成功, 链路为收方向, 本地接口为 A点 1.1 , 远端接口为 B点 2. 1。 然后, A点发送 LMP Link Summary给 B点。 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.
B点收到 A点发送的 LMP Link Summary, 保存发现结果, 链路为发方向, 本地接口为 2.1 , 远端接口为 A点的 1. 1。 端口 1.2的发现过程包括: 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点检查端口 1.2的收方向 TRACE存在, 则 A点启动端口 1.2的自动发 现, 向邻居节点 B发送 LMP Test消息, 该消息中携带 TRACE信息为 "4"。 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".
B点收到 A点发送过来的 LMP Test消息,从该消息中取出 TRACE信息" 4", 在本节点中查找发送 TRACE是" 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.
B点应答 A点 LMP TestStatusFailure„ Point B Answer A point LMP TestStatusFailure„
A点收到 B点失败应答, 向邻居节点 C发送 LMP Test消息, 消息中携带 TRACE信息为 "4"。 C点收到 A点发送过来的 LMP Test消息,从消息中取出 TRACE信息" 4", 在本节点中查找发送 TRACE是" 4"的链路, 匹配成功, 端口为 3.1。 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.
C点应答 A点 LMP TestStatusSuccess, 发现成功的 C点接口为 3.1 Point C responds to point A. LMP TestStatusSuccess, found that the successful C-point interface is 3.1.
A点收到 C点发送的成功应答, 确定发现成功, 收方向 1.2端口对应 C点 3.1端口, A点保存该发现结果, 链路发现成功, 链路为收方向, 本地接口为 A 点 1.2, 远端接口 WieC点 3.1 ; 然后, A点发送 LMP Link Summary给 C点。 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. The remote interface WieC point 3.1; Then, point A sends the LMP Link Summary to point C.
C点收到 A点发送的 LMP Link Summary, 保存发现结果, 链路为发方向, 本地接口为 3.1 , 远端接口为 A点的 1.2。 实施例五 图 5是根据本发明实施例五的链路自动发现的组网示意图, 如图 5所示, 当 A点的 1.1端口的发方向光纤断时, 如果釆用相关技术的自动发现方式, 在 匿名方式下, A点进行 1.1端口的自动发现, 需要先向邻居 B点发送校验消息 ( 包括 Begin Verify、 Begin VerifyAck、 Test、 TestStatusFailure、 EndVerify , EndVerifyAck ) 等消息, 由于光纤已断, A点发现 B点失败, 然后, A点再和 C点进行端口 1.1的自动发现, 再次发送校 -险消息, 由于光纤已断, 和 C点也 会发现失败。 在和 2个邻居节点都进行自动发现失败后, A点进行周期性的自 动发现(这种自动发现周期比发现成功后的维护发现周期要快很多, 一般要快 3倍), 重复上面的过程。 在非匿名方式下, 因为 1.1端口的邻居是 B点, 则 A 点只会和 B进行周期性的自动发现。 而在本实施例中, 对匿名方式下, A点启动 1.1端口收方向的自动发现, 这时, 会发现成功, 其中, A点 1.1为收方向, 远端是 B点 2.1为发方向, 从 而进入发现维护状态。 而 B点发现端口 2.1的收方向 TRACE信息不存在 (或 者是 error状态), 则 B点不启动端口 2.1的自动发现。 对非匿名方式, 发现过 程和匿名方式相同。 由此可见, 相对于相关技术, 本实施例在存在光纤异常的情况下, 不会周 期性的自动发现, 在附图中 3个节点的情况下, 自动发现的报文数量在匿名方 式下会少于相关技术中的方式的 1/6 (邻居节点越多, 4艮文减少的数量越多); 非匿名方式下少于原有方式的 1/3; 这样, 大大提高了自动发现的效率, 减少 了系统报文处理, 降低了对网络带宽的占用。 本发明实施例还提供了一种链路自动发现的实现系统, 图 6是根据本发明 实施例的链路自动发现的实现系统的结构框图, 如图 6所示, 该系统包括: 第 一节点 62 和邻居节点 64 , 其中, 第一节点 62 , 设置为在链路收方向上收到 TRACE信息, 并将 TRACE信息发送给邻居节点 64; 邻居节点 64 , 设置为确 定接收到的 TRACE信息与邻居节点 64发送的 TRACE信息相匹配, 并通知第 一节点 62发现成功。 在本发明实施例的一个优选实例中, 第一节点 62可以通过向邻居节点 64 发送 LMP Test消息的方式将 TRACE信息发送给邻居节点 64。 在本发明实施例的另一个优选实例中, 第一节点 62在邻居节点 64通知第 一节点 62发现成功之后, 保存第一节点 62和邻居节点 64之间的链路为收方 向链路。 然后, 第一节点 62向邻居节点 64发送 LMP Link Summary消息; 邻 居节点 64保存第一节点 62和邻居节点 64之间的链路为发方向链路。 优选地, 邻居节点 64还设置为在确定接收到的 TRACE信息与邻居节点 64发送的 TRACE信息不匹配时, 通知第一节点 62发现失败; 第一节点 62还 设置为逐个地向其他邻居节点发送 TRACE信息, 直到接收到其他邻居节点发 送的发现成功的消息。 综上所述, 本发明实施例的节点在收方向发起链路的自动发现, 解决了相 关技术中进行链路的主动发现时容易产生带宽和资源浪费的问题, 进而达到了 节省带宽和系统资源的效果。 显然, 本领域的技术人员应该明白, 上述的本发明的各模块或各步骤可以 用通用的计算装置来实现, 它们可以集中在单个的计算装置上, 或者分布在多 个计算装置所组成的网络上, 可选地, 它们可以用计算装置可执行的程序代码 来实现, 从而, 可以将它们存储在存储装置中由计算装置来执行, 并且在某些 情况下, 可以以不同于此处的顺序执行所示出或描述的步骤, 或者将它们分别 制作成各个集成电路模块, 或者将它们中的多个模块或步骤制作成单个集成电 路模块来实现。 这样, 本发明不限制于任何特定的硬件和软件结合。 以上所述仅为本发明的优选实施例而已, 并不用于限制本发明, 对于本领 域的技术人员来说, 本发明可以有各种更改和变化。 凡在本发明的 ^"神和原则 之内, 所作的任何修改、 等同替换、 改进等, 均应包含在本发明的保护范围之 内。 At point C, the LMP Link Summary sent by point A is received, and the result is saved. The link is in the sending direction, the local interface is 3.1, and the remote interface is 1.2 of point A. Embodiment 5 FIG. 5 is a schematic diagram of networking for automatic link discovery according to Embodiment 5 of the present invention. As shown in FIG. 5, when the optical fiber of the 1.1 port of the A point is broken, if the automatic discovery method of the related technology is used, In the anonymous mode, 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. 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. . In the non-anonymous mode, since the neighbor of port 1.1 is point B, point A will only periodically and automatically discover with B. In this embodiment, in the anonymous mode, 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. At 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. For non-anonymous methods, 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. 6, 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. In a preferred embodiment of the embodiment of the present invention, 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. In another preferred embodiment of the embodiment of the present invention, 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. Preferably, 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. TRACE information, until the message of discovery success sent by other neighbor nodes is received. In summary, 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. Obviously, those skilled in the art should understand that 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. The steps shown or described are performed, or they are separately fabricated into individual integrated circuit modules, or a plurality of modules or steps are fabricated as a single integrated circuit module. Thus, the invention is not limited to any specific combination of hardware and software. The above is only the preferred embodiment of the present invention, and is not intended to limit the present invention, and various modifications and changes can be made to the present invention. Any modifications, equivalent substitutions, improvements, etc. made within the scope of the present invention are intended to be included within the scope of the present invention.

Claims

权 利 要 求 书 Claim
1. 一种链路自动发现的实现方法, 包括: 1. An implementation method for automatic link discovery, including:
第一节点在链路收方向上收到跟踪 TRACE信息;  The first node receives the tracking TRACE information in the link receiving direction;
所述第一节点将所述 TRACE信息发送给邻居节点;  Sending, by the first node, the TRACE information to a neighbor node;
所述邻居节点确定接收到的所述 TRACE信息与所述邻居节点发送 的 TRACE信息相匹配, 通知所述第一节点发现成功。  The neighboring 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.
2. 根据权利要求 1所述的方法, 其中, 所述第一节点将所述 TRACE信息 发送给邻居节点包括: 2. The method according to claim 1, wherein the sending, by the first node, the TRACE information to the neighboring node comprises:
所述第一节点向所述邻居节点发送链路关系协议测试 LMP Test 消 息, 其中, 所述 LMP Test消息中携带有所述 TRACE信息。  The first node sends a link relationship protocol test LMP Test message to the neighbor node, where the LMP Test message carries the TRACE information.
3. 根据权利要求 1所述的方法, 其中, 在所述邻居节点通知所述第一节点 发现成功之后, 所述方法还包括: The method according to claim 1, wherein, after the neighboring node notifies the first node that the discovery is successful, the method further includes:
所述第一节点保存所述第一节点和所述邻居节点之间的链路为收方 向链路。  The first node saves a link between the first node and the neighbor node as a receiving link.
4. 根据权利要求 3所述的方法, 其中, 在所述第一节点保存所述第一节点 和所述邻居节点之间的链路为收方向链路之后, 所述方法还包括: 所述第一节点向所述邻居节点发送链路关系协议 LMP 链路概述 LMP Link Summary消息; The method according to claim 3, wherein after the first node saves the link between the first node and the neighbor node as a downlink link, the method further includes: The first node sends a link relationship protocol LMP link summary LMP Link Summary message to the neighbor node;
所述邻居节点保存所述第一节点和所述邻居节点之间的链路为发方 向链路。  The neighbor node saves a link between the first node and the neighbor node as a sending direction link.
5. 根据权利要求 1至 4中任一项所述的方法, 其中, The method according to any one of claims 1 to 4, wherein
如果所述邻居节点确定接收到的所述 TRACE信息与所述邻居节点 发送的 TRACE信息不匹配, 则所述邻居节点通知所述第一节点发现失 败;  If the neighbor node determines that the received TRACE information does not match the TRACE information sent by the neighbor node, the neighbor node notifies the first node that the failure is found;
所述第一节点逐个地向其他邻居节点发送所述 TRACE信息, 直到 接收到所述其他邻居节点发送的发现成功的消息。  The first node sends the TRACE information to other neighbor nodes one by one until receiving a successful discovery message sent by the other neighbor nodes.
6. —种链路自动发现的实现系统, 包括: 第一节点和邻居节点, 其中, 所述第一节点, 设置为在链路收方向上收到跟踪 TRACE信息, 并 将所述 TRACE信息发送给所述邻居节点; 6. An implementation system for automatic link discovery, comprising: a first node and a neighbor node, where The first node is configured to receive tracking TRACE information in a link receiving direction, and send the TRACE information to the neighbor node;
所述邻居节点, 设置为确定接收到的所述 TRACE信息与所述邻居 节点发送的 TRACE信息相匹配, 并通知所述第一节点发现成功。  The neighboring node is configured to determine that the received TRACE information matches the TRACE information sent by the neighboring node, and notify the first node that the discovery is successful.
7. 根据权利要求 6所述的系统, 其中, 所述第一节点设置为向所述邻居节 点发送链路关系协议测试 LMP Test消息, 其中, 所述 LMP Test消息中 携带有所述 TRACE信息。 The system according to claim 6, wherein the first node is configured to send a link relationship protocol test LMP Test message to the neighbor node, where the LMP Test message carries the TRACE information.
8. 根据权利要求 6所述的系统, 其中, 所述第一节点还设置为在所述邻居 节点通知所述第一节点发现成功之后, 保存所述第一节点和所述邻居节 点之间的链路为收方向链路。 8. The system according to claim 6, wherein the first node is further configured to save between the first node and the neighbor node after the neighbor node notifies the first node that the discovery is successful. The link is a receive link.
9. 根据权利要求 8所述的系统, 其中, 9. The system of claim 8 wherein
所述第一节点还设置为向所述邻居节点发送链路关系协议 LMP 链 路既述 LMP Link Summary消息;  The first node is further configured to send, to the neighboring node, a link relationship protocol LMP link, an LMP Link Summary message;
所述邻居节点还设置为保存所述第一节点和所述邻居节点之间的链 路为发方向链路。  The neighboring node is further configured to save a link between the first node and the neighboring node as a directional link.
10. 根据权利要求 6至 9中任一项所述的系统, 其中, The system according to any one of claims 6 to 9, wherein
所述邻居节点还设置为在确定接收到的所述 TRACE信息与所述邻 居节点发送的 TRACE信息不匹配时, 通知所述第一节点发现失败; 所述第一节点还设置为逐个地向其他邻居节点发送所述 TRACE信 息, 直到接收到所述其他邻居节点发送的发现成功的消息。  The neighboring node is further configured to notify the first node that the discovery fails when the received TRACE information does not match the TRACE information sent by the neighboring node; the first node is further configured to go to other one by one The neighbor node sends the TRACE information until receiving a message that the other neighbor nodes send the discovery success.
PCT/CN2011/073841 2010-11-04 2011-05-09 Method and system for realizing link automatic discovery WO2012058914A1 (en)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201010531951.3 2010-11-04
CN201010531951.3A CN102469005B (en) 2010-11-04 2010-11-04 The implementation method of chain-link automatic finding and system

Publications (1)

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

Family

ID=46023966

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2011/073841 WO2012058914A1 (en) 2010-11-04 2011-05-09 Method and system for realizing link automatic discovery

Country Status (2)

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

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2008074192A1 (en) * 2006-12-21 2008-06-26 Zte Corporation A method and apparatus for verifying connectivity of a data
CN101217338A (en) * 2007-01-06 2008-07-09 华为技术有限公司 Detection message transmitting method, network element device
CN101394677A (en) * 2007-09-19 2009-03-25 烽火通信科技股份有限公司 Method and device for verifying link attribute in node of ASON

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2008074192A1 (en) * 2006-12-21 2008-06-26 Zte Corporation A method and apparatus for verifying connectivity of a data
CN101217338A (en) * 2007-01-06 2008-07-09 华为技术有限公司 Detection message transmitting method, network element device
CN101394677A (en) * 2007-09-19 2009-03-25 烽火通信科技股份有限公司 Method and device for verifying link attribute in node of ASON

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 (en) 2012-05-23
CN102469005B (en) 2016-04-13

Similar Documents

Publication Publication Date Title
EP2041930B1 (en) Mobile ad-hoc network (manet) and method for implementing multiple paths for fault tolerance
EP2472795B1 (en) Method and system for re-building single ring network topology
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 (en) Switching method and router
WO2009055995A1 (en) Maintaining method for automatic switched optical network system when operation engenders alarm
WO2012071909A1 (en) Method and device for service recovery
WO2011134240A1 (en) Method and device for solving resource allocation conflict
US8868967B2 (en) Method and system for connection-error handling of service in an automatically switched optical network
WO2011140873A1 (en) Data transport method and apparatus for optical transport layer
WO2022042207A1 (en) Resource configuration method and communication device
CN109041167A (en) A method of support EIGRP agreement to carry out link single-direction and dual-direction state-detection
WO2012058914A1 (en) Method and system for realizing link automatic discovery
WO2015154583A1 (en) Method, device and system for updating protocol state of control channel
Perelló et al. An analytical study of control plane failures impact on GMPLS ring optical networks
KR100772191B1 (en) System and method for connectivity verification of upper layers by the link management protocol
CN101176280B (en) Automatic discovering method for automatic exchange optical network controlling entity topology
US20220255806A1 (en) Method for achieving network communication based on neighbor negotiation and device
CN1889397B (en) Method for establishing business path in intelligent optical network
CN113169939B (en) Method, network equipment and system for establishing service path
WO2016065754A1 (en) Method and apparatus for reducing message quantity in lmp
Zhao et al. Dual Routing Architecture in Multi-layer and Multi-domain GMPLS/ASON Networks

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