会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 42. 发明公开
    • METHOD AND APPARATUS FOR RAPIDLY RESTORING SPANNING TREE BACKUP PORT
    • VERFAHREN UND VORRICHTUNG ZUR SCHNELLEN WIEDERHERSTELLUNG EINES SPANNING-TREE-SICHERUNGSPORTS
    • EP2922247A4
    • 2016-01-20
    • EP13807157
    • 2013-08-29
    • ZTE CORP
    • JIA SHURUI
    • H04L12/703
    • H04L45/22H04L45/28H04L45/48H04L49/30
    • Disclosed is a fast recovery method for a Spanning Tree Protocol (STP) based backup port, and the method includes: it is detected that a failure occurs on a port of an STP-based device; and it is determined whether there is a backup port taking a failed port as a master port, and when it is determined that there is such a backup port, said backup port is changed to a master port; further disclosed is a fast recovery device for an STP based backup port. By means of the technical solutions of the disclosure, it is possible to shorten significantly recovery time of a backup port, and improve greatly performance of link recovery.
    • 公开了一种基于生成树协议(STP)的备份端口的快速恢复方法,该方法包括:检测到基于STP的设备的端口发生故障; 并且确定是否存在将故障端口作为主端口的备份端口,并且当确定存在这样的备份端口时,所述备份端口被改变为主端口; 进一步公开了一种用于基于STP的备份端口的快速恢复设备。 通过本公开的技术方案,可以缩短备份端口的显着恢复时间,提高链路恢复的性能。
    • 45. 发明公开
    • TOPOLOGY GRADING METHOD AND APPARATUS, AND FLOODING PROCESSING METHOD AND APPARATUS
    • VORRICHTUNG的地球物理学家协会
    • EP2863595A4
    • 2016-01-06
    • EP13852964
    • 2013-03-29
    • HUAWEI TECH CO LTD
    • LI JIANFEIWANG RONG
    • H04L12/715H04L12/24H04L12/721H04L12/741H04L12/747H04L12/751H04L12/753H04L29/12
    • H04L45/745H04L45/02H04L45/32H04L45/48H04L61/103H04L61/2015H04L61/6022
    • Embodiments of the present invention disclose a topology stratification method and apparatus, and a flooding processing method and apparatus. The method includes the following: First, a controller receives a data packet that is reported by a switch connected to a source host; then the controller searches a local MAC address table of physical addresses of devices to determine whether a destination address of the data packet exists, and the controller acquires a destination port if no destination address of the data packet exists, where the destination port is a port of a switch connected to a destination host, and the destination host is another host different from the source host; and finally, the controller uses the destination port as a destination address to generate a routing table, and sends the routing table to the switch connected to the source host, so that the switch connected to the source host forwards the data packet according to the routing table. The present invention is applicable to the field of communications systems.
    • 本发明的实施例公开了一种拓扑分层方法和装置,以及一种泛洪处理方法和装置。 该方法包括:首先,控制器接收由连接到源主机的交换机报告的数据包; 那么控制器在本地MAC地址表中搜索设备的物理地址表,以确定数据包的目的地址是否存在,如果不存在数据包的目的地址,则控制器获取目的地端口,其中目的地端口是端口 连接到目的主机的交换机,目的主机是与源主机不同的另一主机; 最后,控制器使用目的端口作为目的地址生成路由表,并将路由表发送到连接到源主机的交换机,以便连接到源主机的交换机根据路由转发数据包 表。 本发明可应用于通信系统领域。
    • 47. 发明公开
    • TECHNIQUES FOR FLOODING OPTIMIZATION FOR LINK STATE PROTOCOLS IN A NETWORK TOPOLOGY
    • VERFAHREN ZURSPÜLUNGSOPTIMIERUNGFÜRVERKNÜPFUNGSSTATUSPROTOKOLLEIN EINER NETZWERKTOPOLOGIE
    • EP2883334A1
    • 2015-06-17
    • EP13750997.2
    • 2013-08-05
    • Cisco Technology, Inc.
    • MIRTORABI, SinaROY, Abhay
    • H04L12/721H04L12/751H04L12/753H04L12/703
    • H04L45/32H04L45/02H04L45/18H04L45/28H04L45/48
    • Techniques are provided for generating efficient flooding tree paths in a network. At a node device in a network, a unicast message is sent to a plurality of node devices in the network. The node device obtains an identifier associated with each of the node devices in the network. The identifier contains information indicating node connectivity for each of the node devices. A selected node device is then identified. The selected node device is one of the node devices in the network that has a lowest identifier value indicating a lowest number of connected node devices to the selected node device in the network. The selected node device is classified as a root flooding tree node device. A flooding tree is generated by performing a shortest path first operation from the selected node device to the plurality of node devices in the network.
    • 提供了用于在网络中生成有效的洪泛树路径的技术。 在网络中的节点设备处,单播消息被发送到网络中的多个节点设备。 节点设备获得与网络中的每个节点设备相关联的标识符。 标识符包含指示每个节点设备的节点连接性的信息。 然后识别所选择的节点设备。 所选择的节点设备是网络中具有最低标识符值的节点设备之一,其指示网络中所选节点设备的连接节点设备的最少数量。 所选择的节点设备被分类为根洪泛树节点设备。 通过从所选择的节点设备到网络中的多个节点设备执行最短路径第一操作来生成洪泛树。
    • 50. 发明公开
    • METHOD FOR MANAGING TREE STRUCTURE, INFORMATION PROCESSING SYSTEM, AND PROGRAM
    • VERFAHREN ZUR VERWALTUNG EINER BAUMSTRUKTUR,INFORMATIONSVERARBEITUNGSSYSTEM UND PROGRAMM
    • EP2871578A1
    • 2015-05-13
    • EP12881107.2
    • 2012-07-09
    • Murakumo Corporation
    • YAMADA, Hiroyuki
    • G06F12/00
    • H04L12/44G06F17/30575H04L41/0816H04L41/0883H04L45/02H04L45/48H04L49/90
    • A technique of enabling nodes to migrate reliably without impairing the consistency in a system in which large volume of messages are transmitted within a tree structure is provided. In the tree structure, a migrating node forms a connection with a parent node of a migration destination, the migrating node transmits a migration request to a root node, and the root node distributes a reply to the migration request according to the tree structure, upon receiving the reply, the parent node of the migration destination transmits a message, which is received later than the reply, to the migrating node via the formed connection, the migrating node stores in a queue messages which are received later than the reply received via the formed connection, upon receiving a reply distributed according to the tree structure, the migrating node reconstructs the distributed message, based on a message which is received earlier than the reply received from the parent node before migration and a message which is received later than the reply stored in the queue.
    • 提供了使节点可靠地迁移而不损害在树结构内传输大量消息的系统中的一致性的技术。 在树结构中,迁移节点与迁移目的地的父节点形成连接,迁移节点向根节点发送迁移请求,根节点根据树结构向迁移请求分配回复,根据树结构 接收到该回复时,迁移目的地的父节点经由形成的连接将经过该应答后接收到的消息发送到迁移节点,迁移节点存储在比经由 形成的连接,在接收到根据树结构分发的应答时,迁移节点基于在迁移之前从父节点接收的回复早于接收到的消息和接收晚于该回复的消息来重建分布式消息 存储在队列中。