WO2021103782A1 - 一种零配置ztp状态的切换方法、实现设备及存储介质 - Google Patents

一种零配置ztp状态的切换方法、实现设备及存储介质 Download PDF

Info

Publication number
WO2021103782A1
WO2021103782A1 PCT/CN2020/116827 CN2020116827W WO2021103782A1 WO 2021103782 A1 WO2021103782 A1 WO 2021103782A1 CN 2020116827 W CN2020116827 W CN 2020116827W WO 2021103782 A1 WO2021103782 A1 WO 2021103782A1
Authority
WO
WIPO (PCT)
Prior art keywords
node
ztp
state
configuration
neighbor
Prior art date
Application number
PCT/CN2020/116827
Other languages
English (en)
French (fr)
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 WO2021103782A1 publication Critical patent/WO2021103782A1/zh

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/08—Configuration management of networks or network elements
    • H04L41/0803—Configuration setting
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/08—Configuration management of networks or network elements
    • H04L41/0876—Aspects of the degree of configuration automation
    • H04L41/0886—Fully automatic configuration

Definitions

  • This application relates to the field of communications, and in particular, to a method, implementation device, and storage medium for ZTP state switching.
  • fat tree topology Routing in fat tree (RIFT) technology is on the rise. It is a routing protocol designed for fat tree topology. This topology is widely used in data center networks and is gradually being used in metropolitan area networks and bearer networks. . Compared with traditional routing protocols, the RIFT protocol has the following advantages: natural anti-loop; support Zero Touch Provisioning (ZTP); easy to deploy and support network self-test; can greatly reduce the number of routing tables of the underlying equipment; support a high degree Equal-Cost Multipath Routing (ECMP) and so on. These advantages make the RIFT protocol subject to more and more research.
  • ZTP Zero Touch Provisioning
  • ECMP Equal-Cost Multipath Routing
  • the ZTP feature is an automatic learning method. It learns system ID (SystemID), node level (Level), point of delivery (PoD) and other configuration information from the current node or neighbor nodes, and does not require human operations. It greatly improves the convenience of network deployment, but it will also cause some network shocks due to individual node failures or malicious attacks, which increases deployment risks. In particular, Level relearning caused by the level change of neighbor nodes may cause temporary abnormalities in the entire network communication.
  • the intermediate node Node and the bottom node Leaf learn their own Levels through ZTP.
  • the top node (Top of Fabric) 1 (ToF1) and ToF2 specify the Level as 10
  • the Level is 9
  • the Leaf learns through ZTP the Level is 8.
  • Node111 and ToF1 and Node111 and ToF2 all fail. At this time, the highest level among Node111's neighbors changes to 9 (Node112), and the level of Node111 changes to 8, the neighbors connected to it must be rebuilt, and the route must be republished;
  • ToF2 misoperation changes the Level to 11. At this time, the highest Level among all Node's neighbors becomes 11 (ToF2), then the Level of Node becomes 10, the Level of Leaf becomes 9, and the entire network must be rebuilt;
  • a new device connected to Node111 sends a spoofed packet to Node111. If the level is 12, the highest level among Node111's neighbors becomes 12, the level of Node111 becomes 11, and then the levels of other Nodes and Leafs in Pod1 change. And rebuild neighbors. Such spoofed packets can easily cause network shock or even failure.
  • a zero-configuration ZTP state switching method which includes: after a first node enters the ZTP enabled state, the first node learns configuration information in the ZTP enabled state
  • the first node is a non-top TOF node; when a preset condition is met, the first node switches to a ZTP stable state; in the ZTP stable state, the first node stops learning configuration information; wherein ,
  • the preset condition includes at least one of the following conditions: the first node completes the learning of the configuration information after the preset time is exceeded.
  • a device for implementing zero-configuration ZTP state switching including: a memory, a processor, and a computer program stored in the memory and running on the processor, wherein the processing The implementation method of zero-configuration ZTP state switching is realized when the device executes the program.
  • a computer-readable storage medium is provided, and computer-executable instructions are stored, and the computer-executable instructions are used to implement the aforementioned zero-configuration ZTP state switching implementation method.
  • Figure 1 is a schematic diagram according to the RIFT topology
  • Fig. 2 is a flowchart of a zero-configuration ZTP state switching method according to an embodiment of the present application.
  • Embodiment 1 of the present application may be executed in a mobile terminal, a computer terminal or a similar computing device.
  • Embodiment 1 of the present application provides a zero-configuration ZTP state switching method.
  • FIG. 1 is a flowchart of the method. As shown in FIG. 1, the process includes the following steps.
  • Step S101 After the first node enters the ZTP enabled state, the first node learns configuration information in the ZTP enabled state.
  • the first node cannot be the top TOF node, because the TOF node is the top node in the topology, and it has no north neighbors and cannot learn through the ZTP function in the RIFT protocol; when the first node is a non-TOF node, RIFT The protocol enables the ZTP mode, and enters the ZTP state when the first node is powered on.
  • the first node In the ZTP enabled state, the first node is allowed to obtain configuration information through the ZTP mechanism, including but not limited to Level, PoD, SystemID, etc.; enter the first node Before the ZTP is enabled, the first node will receive a link information element LIE message.
  • the LIE message contains the Level information or the delivery point Pod information of the node that sent the LIE message.
  • Step S102 When a preset condition is met, the first node switches to a ZTP stable state; in the ZTP stable state, the first node stops learning configuration information.
  • the preset condition includes at least one of the following conditions: the first node completes the learning of the configuration information when the preset time is exceeded; when the preset condition is that the preset time is exceeded, the ZTP enabled state is entered at the first node After that, a ZTP timeout timer is started. When the ZTP timeout timer expires, the first node switches to a stable state.
  • the ZTP timeout timer timeout refers to the time set for the ZTP enabled state. When the ZTP timeout timer expires, After the timer times out, the first node switches to a stable state.
  • the first node switches to a stable state.
  • the first node finds a new northbound neighbor, it will reset the ZTP timeout timer, and the first node will re-enter the ZTP enabled state and start learning configuration information; if there is a northbound neighbor
  • the first node After the first node switches to a stable state, if it is found that the state of the neighbor node of the first node has changed, the first node re-enters the ZTP enabled state, specifically, the state of the neighbor node of the first node has changed Refers to: the neighbor nodes of the first node are all disconnected; or, when the ratio of disconnection of neighbor nodes of the first node exceeds a first threshold; or, the state of neighbor nodes of the highest level LEVEL of the first node changes ; Or, find a neighbor node with a higher LEVEL.
  • the management node After the first node switches to a stable state, if the management node sends a control message to the first node, the first node re-enters the ZTP enabled state; the management node may be an authenticated trusted node or a node designated by a script.
  • the management node may also be called a super node, which can notify the first node to re-enter the ZTP enabled state through an LIE message when the first node is in the ZTP stable state, where the LIE message can also be replaced with a KV-TIE message.
  • Embodiment 2 of the present application may be executed in a mobile terminal, a computer terminal or a similar computing device.
  • Embodiment 1 of the present application provides a zero-configuration ZTP state switching method.
  • Fig. 2 is a schematic diagram of the RIFT topology, which is explained with reference to Fig. 2:
  • the PoD of Node111 and Node112 is 1, ToF1 and ToF2 are enabled first, Node111 and Node112 are enabled later, Leaf111 and Leaf112 are enabled last; since the behaviors of nodes at the same level are the same, only Node111 and Node112 are described. Behavior of Leaf111. After Node111 is enabled, it enters the ZTP enabled state and starts the ZTP timeout timer; Node111 learns that the highest level in the neighbor is 10 through the ToF1 or ToF2 LIE link information element message, and sets its own Level to 9 through the ZTP mechanism.
  • Leaf111 After Leaf111 is enabled, it enters the ZTP enabled state and starts the ZTP timeout timer; Leaf111 learns that the highest level in the neighbor is 9 through the LIE message link information element of Node111 or Node112, and uses the ZTP mechanism to set its own Level Set to 8, learn that PoD is 1; Node111's ZTP timeout timer expires, Node111 enters a stable state; Leaf111's ZTP timeout timer expires, Leaf111 enters a stable state.
  • the topology shown in Fig. 2 assumes that TOF1 is configured as a super node (management node). After Node111 has completed the learning of ZTP, TOF1 sends a LIE message to Node111 at this time to notify that its LEVEL has changed. After Node111 receives the LIE message, it re-enters the ZTP enabled state. Among them, a KV-TIE message type can also be added. When the super node TOF1 wants a node in the network to reset the ZTP enabled state, it will send a reset message to all nodes in the network in the KV-TIE message format. After receiving the text, the node re-enters the ZTP enabled state.
  • the embodiment of the present application also provides an electronic device, including a memory and a processor, the memory is stored with a computer program, and the processor is configured to run the computer program to execute the steps in any of the foregoing method embodiments.
  • the above-mentioned electronic device may further include a transmission device and an input-output device, wherein the transmission device is connected to the above-mentioned processor, and the input-output device is connected to the above-mentioned processor.
  • the above-mentioned processor may be configured to execute the following steps through a computer program.
  • the first node switches to a ZTP stable state; in the ZTP stable state, the first node stops learning configuration information; wherein, the preset condition includes at least one of the following One condition: the first node completes the learning of the configuration information after the preset time is exceeded.
  • the embodiment of the present application also provides a storage medium in which a computer program is stored, wherein the computer program is configured to execute the steps in any one of the foregoing method embodiments when running.
  • the above-mentioned storage medium may be configured to store a computer program for executing the following steps.
  • the first node switches to a ZTP stable state; in the ZTP stable state, the first node stops learning configuration information; wherein, the preset condition includes at least one of the following One condition: the first node completes the learning of the configuration information after the preset time is exceeded.
  • This application sets different conditions for nodes to perform ZTP learning to prevent nodes from learning wrong information due to deception or changes in neighbor nodes, and this solution solves the problem of wrong learning in conventional ZTP learning.
  • the above-mentioned storage medium may include, but is not limited to: U disk, Read-Only Memory (Read-Only Memory, ROM for short), Random Access Memory (RAM for short), mobile hard disk, magnetic disk Various media that can store computer programs such as discs or optical discs.
  • the method according to the above embodiment can be implemented by means of software plus the necessary general hardware platform, of course, it can also be implemented by hardware, but in many cases the former is Better implementation.
  • the technical solution of this application essentially or the part that contributes to the existing technology can be embodied in the form of a software product, and the computer software product is stored in a storage medium (such as ROM/RAM, magnetic disk, The optical disc) includes several instructions to enable a terminal device (which can be a mobile phone, a computer, a server, or a network device, etc.) to execute the method described in each embodiment of the present application.
  • modules or steps of this application can be implemented by a general computing device, and they can be concentrated on a single computing device or distributed in a network composed of multiple computing devices.
  • they can be implemented with program codes executable by a computing device, so that they can be stored in a storage device for execution by the computing device, and in some cases, they can be different from this Perform the steps shown or described in the order of the locations, or fabricate them into individual integrated circuit modules separately, or fabricate multiple modules or steps of them into a single integrated circuit module for implementation.
  • this application is not limited to any specific combination of hardware and software.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Automation & Control Theory (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

本申请提供了一种零配置ZTP状态的切换方法，包括如下步骤：第一节点进入ZTP使能状态后，所述第一节点在所述ZTP使能状态中进行配置信息的学习；所述第一节点为非顶部TOF节点；当满足预设条件时，所述第一节点切换为ZTP稳定状态；在所述ZTP稳定状态中，所述第一节点停止配置信息的学习；其中，所述预设条件包括以下至少之一条件：超过预设时间、所述第一节点完成配置信息的学习。

Description

一种零配置ZTP状态的切换方法、实现设备及存储介质
相关申请的交叉引用
本申请要求享有2019年11月26日提交的名称为“一种零配置ZTP状态的切换方法、实现设备及存储介质”的中国专利申请CN201911175882.4的优先权，其全部内容通过引用并入本文中。
技术领域
本申请涉及通信领域，具体而言，涉及一种ZTP状态切换的方法、实现设备及存储介质。
背景技术
目前，胖树拓扑Routing in fat tree(RIFT)技术正在兴起，是为胖树拓扑设计的一种路由协议，这种拓扑广泛用于数据中心网络，且逐渐在城域网、承载网等领域使用。和传统路由协议相比，RIFT协议具有以下优势：天然防环；支持零配置Zero Touch Provisioning(ZTP)；部署方便且支持网络自检；可以极大减少底层设备的路由表数量；支持很高程度的网络等价路径Equal-Cost Multipath Routing(ECMP)等。这些优势使得RIFT协议受到越来越多的研究。
其中，ZTP特性为一种自动学习的方法，从本节点或邻居节点学习到系统ID(SystemID)、节点层级(Level)、交货点(PoD)等配置信息，且不需要人为操作，这样极大的提高了网络部署的便捷性，但也会由于个别节点故障或恶意攻击导致部分网络震荡，增加部署风险。特别是由于邻居节点Level变化造成的Level重新学习可能造成整个网络通讯短暂异常。
例如在图1所示网络中，中间节点Node和底层节点Leaf通过ZTP学习自己的Level。假设顶部节点(Top of Fabric)1(ToF1)和ToF2指定Level为10，则Node通过ZTP学习后，Level为9，Leaf通过ZTP学习后，Level为8。下为LEVEL变化给整个拓扑带来的影响：
1、Node111和ToF1、Node111和ToF2之间的链路都发生故障。这时Node111的邻居中最高的Level变为9(Node112)，则Node111的Level变为8，与其相连的邻居都要重建，路由要重新发布；
2、ToF2误操作把Level改为了11。这时所有Node的邻居中最高的Level变为11(ToF2)，则Node的Level变为10，Leaf的Level变为9，整个网络都要重建；
3、新增一台连接Node111的设备向Node111发送欺骗报文，Level为12，则Node111的邻居中最高Level变为12，Node111的Level变为11，继而Pod1中其他Node和Leaf的Level都变化并重建邻居。这种欺骗报文很容易造成网络震荡甚至失效。
发明内容
本申请通过设置节点的ZTP学习条件，避免了节点错误变更配置信息或受到非法设备的欺骗。
根据本申请的一个实施例，提供了一种零配置ZTP状态的切换方法，包括：第一节点进入ZTP使能状态后，所述第一节点在所述ZTP使能状态中进行配置信息的学习；所述第一节点为非顶部TOF节点；当满足预设条件时，所述第一节点切换为ZTP稳定状态；在所述ZTP稳定状态中，所述第一节点停止配置信息的学习；其中，所述预设条件包括以下至少一个条件：超过预设时间、所述第一节点完成配置信息的学习。
根据本申请提供的另一个实施例，提供了一种零配置ZTP状态切换的实现设备，包括：存储器、处理器及存储在存储器上并可在处理器上运行的计算机程序，其中，所述处理器执行所述程序时实现上述零配置ZTP状态切换的实现方法。
根据本申请提供的另一个实施例，提供了一种计算机可读存储介质，存储有计算机可执行指令，所述计算机可执行指令用于执行上述零配置ZTP状态切换的实现方法。
附图说明
此处所说明的附图用来提供对本申请的进一步理解，构成本申请的一部分，本申请的示意性实施例及其说明用于解释本申请，并不构成对本申请的不当限定。在附图中：
图1是根据RIFT拓扑的示意图；
图2是根据本申请实施例的一种零配置ZTP状态切换方法的流程图。
具体实施方式
下文中将参考附图并结合实施例来详细说明本申请。需要说明的是，在不冲突的情况下，本申请中的实施例及实施例中的特征可以相互组合。
需要说明的是，本申请的说明书和权利要求书及上述附图中的术语“第一”、“第二” 等是用于区别类似的对象，而不必用于描述特定的顺序或先后次序。
实施例1
本申请实施例1所提供的方法实施例可以在移动终端、计算机终端或者类似的运算装置中执行。本申请实施例1提供了一种零配置ZTP状态的切换方法，图1是该方法的流程图，如图1所示，该流程包括如下步骤。
步骤S101，第一节点进入ZTP使能状态后，所述第一节点在所述ZTP使能状态中进行配置信息的学习。
在步骤S101中，第一节点不能是顶部TOF节点，因为TOF节点是拓扑中最顶端的节点，没有北向邻居，无法通过RIFT协议中的ZTP功能进行学习；第一节点为非TOF节点时，RIFT协议使能ZTP模式，在第一节点上电时进入ZTP状态，在ZTP使能状态中允许第一节点通过ZTP机制获取配置信息，包括但不限于Level、PoD、SystemID等；在第一节点进入ZTP使能状态之前，第一节点会收到一个链路信息元素LIE报文，LIE报文包含发送所述LIE报文的节点的Level信息或交货点Pod信息。
步骤S102，当满足预设条件时，所述第一节点切换为ZTP稳定状态；在所述ZTP稳定状态中，所述第一节点停止配置信息的学习。
在步骤S102中，预设条件包括以下至少之一条件：超过预设时间、所述第一节点完成配置信息的学习；当预设条件为超过预设时间，在第一节点进入ZTP使能状态后，启动一个ZTP超时定时器，当ZTP超时定时器超时后，所述第一节点切换为稳定状态，ZTP超时定时器超时指的是超过为ZTP使能状态所设置的时间，当ZTP超时定时器超时后，第一节点切换为稳定状态。当预设条件是超过预设时间且第一节点完成配置信息的学习时，当ZTP超时定时器超时且第一节点完成配置信息的学习时，第一节点切换为稳定状态。当第一节点切换为稳定状态后，如果第一节点发现新的北向邻居，那么就重置ZTP超时定时器，第一节点重新进入ZTP使能状态，开始配置信息的学习；在存在北向邻居的情况下，也可以先不启动ZTP超时定时器，先等发现了北向邻居后再启动ZTP超时定时器，在这种情况下，可以直接将超时定时器的超时时间设为0，表示立即超时并进入ZTP稳定状态。
当第一节点切换为稳定状态后，如果发现第一节点的邻居节点的状态发生了变化，则第一节点重新进入ZTP使能状态，具体而言，第一节点的邻居节点的状态发生了变化指的是：第一节点的邻居节点全部断开；或，所述第一节点的邻居节点断开比例超过第一阈值时；或，所述第一节点的最高层级LEVEL的邻居节点状态发生变化；或，发现更高LEVEL的邻居节点。
当第一节点切换为稳定状态后，如果管理节点向第一节点发送控制消息，则第一节点重新进入所述ZTP使能状态；管理节点可以为经过认证的可信任节点或脚本指定的节点。 管理节点也可以称为超级节点，其可以在第一节点处于ZTP稳定状态时通过LIE报文通知第一节点重新进入ZTP使能状态，其中LIE报文也可以替换为KV-TIE报文。
必须说明的是，前述技术方案不仅适用于RIFT协议，也适用于其他支持ZTP功能的协议。
实施例2
本申请实施例2所提供的方法实施例可以在移动终端、计算机终端或者类似的运算装置中执行。本申请实施例1提供了一种零配置ZTP状态的切换方法，图2是RIFT拓扑的示意图，借助图2加以说明：
假设ToF1和ToF2的Level是10，Node111和Node112的PoD为1，ToF1和ToF2先使能，Node111、Node112后使能，Leaf111和Leaf112最后使能；由于相同层级的节点行为一致，只描述Node111和Leaf111的行为。Node111使能后进入ZTP使能状态，并启动ZTP超时定时器；Node111通过ToF1或ToF2的LIE链路信息元素报文学习到邻居中最高Level为10，通过ZTP机制，把自己的Level设置为9；Leaf111使能后进入ZTP使能状态，并启动ZTP超时定时器；Leaf111通过Node111或Node112的LIE报文链路信息元素报文学习到邻居中最高Level为9，通过ZTP机制，把自己的Level设置为8，学习到PoD为1；Node111的ZTP超时定时器超时，Node111进入稳定状态；Leaf111的ZTP超时定时器超时，Leaf111进入稳定状态。
假设网络中存在一台非法设备，发送Level为20的LIE报文。Node111这时已经进入了稳定状态，Level不会发生变化；假设ToF1和ToF2连接Node111的链路故障，和Node111之间邻居断链，Node111这时已经进入了稳定状态，Level不会发生变化。
在一种实施方案中，如图2所示拓扑，假设将TOF1配置成超级节点(管理节点)。Node111已完成了ZTP的学习后，TOF1此时向Node111发送一个LIE报文，通告自己的LEVEL发生了变化，Node111收到该LIE报文后，重新进入ZTP使能状态。其中，也可以新增一种KV-TIE报文类型，当超级节点TOF1希望网络中的节点重置ZTP使能状态时，则以KV-TIE的报文格式向网络中所有节点发送重置报文，节点收到后重新进入ZTP使能状态。
实施例3
本申请的实施例还提供了一种电子装置，包括存储器和处理器，该存储器中存储有计算机程序，该处理器被设置为运行计算机程序以执行上述任一项方法实施例中的步骤。
在一种实施方案中，上述电子装置还可以包括传输设备以及输入输出设备，其中，该传输设备和上述处理器连接，该输入输出设备和上述处理器连接。
在一种实施方案中，在本实施例中，上述处理器可以被设置为通过计算机程序执行以 下步骤。
S1，第一节点进入ZTP使能状态后，所述第一节点在所述ZTP使能状态中进行配置信息的学习；所述第一节点为非顶部TOF节点。
S2，当满足预设条件时，所述第一节点切换为ZTP稳定状态；在所述ZTP稳定状态中，所述第一节点停止配置信息的学习；其中，所述预设条件包括以下至少之一条件：超过预设时间、所述第一节点完成配置信息的学习。
在一种实施方案中，本实施例中的具体示例可以参考上述实施例及可选实施方式中所描述的示例，本实施例在此不再赘述。
实施例4
本申请的实施例还提供了一种存储介质，该存储介质中存储有计算机程序，其中，该计算机程序被设置为运行时执行上述任一项方法实施例中的步骤。
在一种实施方案中，在本实施例中，上述存储介质可以被设置为存储用于执行以下步骤的计算机程序。
S1，第一节点进入ZTP使能状态后，所述第一节点在所述ZTP使能状态中进行配置信息的学习；所述第一节点为非顶部TOF节点。
S2，当满足预设条件时，所述第一节点切换为ZTP稳定状态；在所述ZTP稳定状态中，所述第一节点停止配置信息的学习；其中，所述预设条件包括以下至少之一条件：超过预设时间、所述第一节点完成配置信息的学习。
本申请通过设置节点进行ZTP学习的不同条件，防止节点因受到欺骗或邻居节点变化而导致学习到错误的信息，通过本方案解决常规ZTP学习中存在的错误学习的问题。
在本实施例中，上述存储介质可以包括但不限于：U盘、只读存储器(Read-Only Memory，简称为ROM)、随机存取存储器(Random Access Memory，简称为RAM)、移动硬盘、磁碟或者光盘等各种可以存储计算机程序的介质。
通过以上的实施方式的描述，本领域的技术人员可以清楚地了解到根据上述实施例的方法可借助软件加必需的通用硬件平台的方式来实现，当然也可以通过硬件，但很多情况下前者是更佳的实施方式。基于这样的理解，本申请的技术方案本质上或者说对现有技术做出贡献的部分可以以软件产品的形式体现出来，该计算机软件产品存储在一个存储介质(如ROM/RAM、磁碟、光盘)中，包括若干指令用以使得一台终端设备(可以是手机，计算机，服务器，或者网络设备等)执行本申请各个实施例所述的方法。
显然，本领域的技术人员应该明白，上述的本申请的各模块或各步骤可以用通用的计算装置来实现，它们可以集中在单个的计算装置上，或者分布在多个计算装置所组成的网络上，在一种实施方案中，它们可以用计算装置可执行的程序代码来实现，从而，可以将 它们存储在存储装置中由计算装置来执行，并且在某些情况下，可以以不同于此处的顺序执行所示出或描述的步骤，或者将它们分别制作成各个集成电路模块，或者将它们中的多个模块或步骤制作成单个集成电路模块来实现。这样，本申请不限制于任何特定的硬件和软件结合。
以上所述仅为本申请的优选实施例而已，并不用于限制本申请，对于本领域的技术人员来说，本申请可以有各种更改和变化。凡在本申请的原则之内，所作的任何修改、等同替换、改进等，均应包含在本申请的保护范围之内。

Claims (10)

  1. 一种零配置ZTP状态的切换方法，包括：
    第一节点进入ZTP使能状态后，所述第一节点在所述ZTP使能状态中进行配置信息的学习；所述第一节点为非顶部TOF节点；
    当满足预设条件时，所述第一节点切换为ZTP稳定状态；在所述ZTP稳定状态中，所述第一节点停止配置信息的学习；
    其中，所述预设条件包括以下至少一个条件：超过预设时间、所述第一节点完成配置信息的学习。
  2. 如权利要求1所述的方法，包括：
    当所述第一节点进入ZTP使能状态后，启动ZTP超时定时器；
    在所述ZTP超时定时器超时的情况下，确定满足所述预设条件；
    或，在所述ZTP超时定时器超时，且所述第一节点完成配置信息的学习的情况下，确定满足所述预设条件。
  3. 如权利要求2所述的方法，当所述ZTP超时定时器超时后，还包括：
    当所述第一节点发现北向邻居时，则重置所述ZTP超时定时器，所述第一节点重新进入所述ZTP使能状态。
  4. 如权利要求1所述的方法，在所述第一节点切换为ZTP稳定状态后，还包括：
    当所述第一节点的邻居节点的状态发生变化时，所述第一节点重新进入所述ZTP使能状态。
  5. 如权利要求4所述的方法，所述第一节点的邻居节点的状态发生变化，包括以下任一种情况：
    所述第一节点的邻居节点全部断开；
    或，所述第一节点的邻居节点断开比例超过第一阈值时；
    或，所述第一节点的最高层级Level的邻居节点状态发生变化；
    或，发现更高Level的邻居节点。
  6. 如权利要求1或2所述的方法，在所述第一节点切换为ZTP稳定状态后，还包括：
    当管理节点向所述第一节点发送控制消息后，所述第一节点重新进入所述ZTP使能状态。
  7. 如权利要求6所述的方法，所述管理节点为以下之一：
    经过认证的可信任节点或脚本指定的节点。
  8. 如权利要求1所述的方法，在所述第一节点进入ZTP使能状态前，还包括：
    所述第一节点收到链路信息元素LIE报文，其中，所述LIE报文包含发送所述LIE报文的节点的Level信息或交货点Pod信息。
  9. 一种零配置ZTP状态切换的实现设备，包括：存储器、处理器及存储在存储器上并可在处理器上运行的计算机程序，其中，所述处理器执行所述程序时实现如权利要求1-8中任意一项所述零配置ZTP状态切换的实现方法。
  10. 一种计算机可读存储介质，存储有计算机可执行指令，所述计算机可执行指令用于执行权利要求1-8中任意一项所述零配置ZTP状态切换的实现方法。
PCT/CN2020/116827 2019-11-26 2020-09-22 一种零配置ztp状态的切换方法、实现设备及存储介质 WO2021103782A1 (zh)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201911175882.4 2019-11-26
CN201911175882.4A CN112865991A (zh) 2019-11-26 2019-11-26 一种零配置ztp状态的切换方法、实现设备及存储介质

Publications (1)

Publication Number Publication Date
WO2021103782A1 true WO2021103782A1 (zh) 2021-06-03

Family

ID=75984925

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2020/116827 WO2021103782A1 (zh) 2019-11-26 2020-09-22 一种零配置ztp状态的切换方法、实现设备及存储介质

Country Status (2)

Country Link
CN (1) CN112865991A (zh)
WO (1) WO2021103782A1 (zh)

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109672550A (zh) * 2017-10-17 2019-04-23 丛林网络公司 用于多级网络结构的简化配置
US10277353B1 (en) * 2017-12-19 2019-04-30 Juniper Networks, Inc. Wavelength provisioning for customer premise equipment (CPE) in dense wavelength-division multiplex (DWDM) networks

Family Cites Families (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7545755B2 (en) * 2000-03-03 2009-06-09 Adtran Inc. Routing switch detecting change in session identifier before reconfiguring routing table
CN101621852B (zh) * 2009-08-07 2012-04-18 杭州华三通信技术有限公司 Mesh网络无线接入点重接入方法及无线接入点设备
US20120030150A1 (en) * 2010-07-29 2012-02-02 Telcordia Technologies, Inc. Hybrid Learning Component for Link State Routing Protocols
CN104579728B (zh) * 2013-10-17 2019-02-26 中兴通讯股份有限公司 网元设备配置和管理方法、装置及网元设备
CN106330606B (zh) * 2016-08-23 2019-09-06 杭州迪普科技股份有限公司 一种检测链路单通的方法和装置
CN107733727B (zh) * 2017-11-29 2021-08-24 瑞斯康达科技发展股份有限公司 一种零配置方法、装置及设备
US10616220B2 (en) * 2018-01-30 2020-04-07 Hewlett Packard Enterprise Development Lp Automatic onboarding of end devices using device profiles
CN109120446B (zh) * 2018-08-22 2022-02-15 迈普通信技术股份有限公司 一种零配置启动方法及设备

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109672550A (zh) * 2017-10-17 2019-04-23 丛林网络公司 用于多级网络结构的简化配置
US10277353B1 (en) * 2017-12-19 2019-04-30 Juniper Networks, Inc. Wavelength provisioning for customer premise equipment (CPE) in dense wavelength-division multiplex (DWDM) networks

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
Z. ZHANG JUNIPER NETWORKS J. TANTSURA APSTRA, INC D. FEDYK INDIVIDUAL: "SRIFT: Segment Routing In Fat Trees; draft-zzhang-rift-sr-01.txt", SRIFT: SEGMENT ROUTING IN FAT TREES; DRAFT-ZZHANG-RIFT-SR-01.TXT; INTERNET-DRAFT: RIFT, INTERNET ENGINEERING TASK FORCE, IETF; STANDARDWORKINGDRAFT, INTERNET SOCIETY (ISOC) 4, RUE DES FALAISES CH- 1205 GENEVA, SWITZERLAND, no. 01, 25 April 2019 (2019-04-25), Internet Society (ISOC) 4, rue des Falaises CH- 1205 Geneva, Switzerland, pages 1 - 6, XP015132702 *

Also Published As

Publication number Publication date
CN112865991A (zh) 2021-05-28

Similar Documents

Publication Publication Date Title
CN110912780B (zh) 一种高可用集群检测方法、系统及受控终端
US10257265B2 (en) Redundancy network protocol system
KR101822778B1 (ko) 조명 디바이스를 이용하는 네트워크 자동 복구 방법 및 시스템
KR100812374B1 (ko) 클러스터 시스템에서 프로토콜 네트워크 장애 관리 시스템및 방법
WO2018188425A1 (zh) Vxlan单归和双归混合接入方法、装置、pe设备和存储介质
US20140313975A1 (en) White listing for binding in ad-hoc mesh networks
US8521877B2 (en) Method for configuring access rights, control point, device and communication system
EP3316555B1 (en) Mac address synchronization method, device and system
US20170242815A1 (en) Sas system, sas system traversal method, and apparatus
CN102006189A (zh) 用于双机冗余备份的主用接入服务器确定方法及装置
CN106059793A (zh) 一种基于平滑重启的路由信息处理方法及装置
US9609590B2 (en) Eco-friendly power over ethernet
US9497104B2 (en) Dynamic update of routing metric for use in routing return traffic in FHRP environment
EP3700258A1 (en) Method and apparatus for processing link establishment failure, and computer storage medium
KR101075462B1 (ko) 서브넷에서 마스터 노드를 선출하는 방법
CN102932249B (zh) 一种vrrp报文的传输方法和装置
WO2021103782A1 (zh) 一种零配置ztp状态的切换方法、实现设备及存储介质
US10637748B2 (en) Method and apparatus for establishing interface between VNFMS, and system
CN114221902A (zh) 一种按照指定序列进行vrrp主备切换的方法
US10250497B1 (en) Avoiding false duplicate network address detection in virtual router redundancy protocol (VRRP) scenarios
US20220360519A1 (en) Method and device for packet forwarding
CN106921576B (zh) 基于虚拟化系统的数据网与管理网的流量分离方法及装置
CN106411730B (zh) 一种报文转发方法及装置
US20150215169A1 (en) Guaranteeing Bandwidth For Dual-Homed Hosts In Fabric Extender Topologies
CN109194592B (zh) 一种解决multi-link网络中孤岛问题的方法和系统

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

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

Country of ref document: EP

Kind code of ref document: A1

32PN Ep: public notification in the ep bulletin as address of the adressee cannot be established

Free format text: NOTING OF LOSS OF RIGHTS PURSUANT TO RULE 112(1) EPC (EPO FORM 1205 DATED 23/02/2023)

122 Ep: pct application non-entry in european phase

Ref document number: 20893306

Country of ref document: EP

Kind code of ref document: A1