会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 91. 发明授权
    • DYNAMIC SPANNING TREE ROOT SELECTION
    • 动态开花树根选择
    • EP2868044B1
    • 2017-09-20
    • EP13810449.2
    • 2013-06-28
    • Sonos, Inc.
    • GOSSAIN, HrishikeshMILLINGTON, Nicholas A.J.PETERS, Jeffrey M.
    • H04L12/28H04L12/46H04L12/753
    • H04L45/48H04L12/2838H04L12/462H04L45/02
    • Systems, methods, apparatus, and articles of manufacture to provide root re-selection in a spanning tree protocol are disclosed. An example method includes transmitting, by a current root network device of a network, a first unicast message to a network router, wherein the network is organized according to a spanning tree protocol. If the current root network device determines that the first unicast message is not received by one or more other network devices, the current root network device remains the root device for the network and sends a second unicast message at a later time to the network router. If the first unicast message is received by one or more other network devices, the method comprises: receiving, by the current root network device, one or more responses from the one or more other network devices; determining, by the current root network device based on the received responses, that a particular network device that is different than the current root network device is a more optimal root of the network spanning tree than the current root network device; and sending, by the current root network device, a message to designate the identified particular network device as the new root network device.
    • 公开了在生成树协议中提供根重选的系统,方法,装置和制造物品。 示例方法包括从回放网络上的当前根设备向回放网络上的路由器发送查询消息。 该示例方法包括评估从当前根和路由器之间的至少一个中间设备接收到的响应,该至少一个中间设备将来自根的查询消息中继到路由器,并向当前根设备发回响应,指示 与该中间设备相关联的根路径成本。 示例方法包括基于接收到的根路径成本来确定用于回放网络的新根设备的更新指定。 该示例方法包括,如果新根设备不同于当前根设备,则交换当前根和新根之间的桥优先级。
    • 94. 发明公开
    • METHOD AND DEVICE FOR PROCESSING DATA CELL
    • VERFAHREN UND VORRICHTUNG ZUR DATENZELLENVERARBEITUNG
    • EP2648374A4
    • 2017-08-23
    • EP11853857
    • 2011-10-24
    • ZTE CORP
    • LIU JIANLIZENG MIN
    • H04L12/721
    • H04L45/02H04L45/16H04L45/245Y02D50/30
    • A method and device for processing data cells are disclosed. The method includes: configuring a unicast routing table which includes a corresponding relation between unicast destination addresses and port trunking (Trunks), and a multicast routing table which includes a corresponding relation between multicast group addresses and Trunks; receiving data cells; determining a corresponding Trunk according to types of the data cells, if the data cell is a unicast cell, extracting a destination address of the unicast cell, querying the unicast routing table, and obtaining a Trunk corresponding to the unicast cell; and if the data cell is a multicast cell, extracting a multicast group address of the multicast cell, querying the multicast routing table, and obtaining one or more Trunks corresponding to the multicast cell; and selecting an output link from the determined Trunks according to a preset load balancing policy, and sending data cells through the selected output link. In the present document, a service traffic balance of each link is guaranteed, and the delay of the data cell within the switched network is reduced at the meantime.
    • 公开了一种用于处理数据单元的方法和设备。 该方法包括:配置单播路由表,该单播路由表包括单播目的地址与端口汇聚(Trunks)之间的对应关系,以及包括组播地址与中继之间的对应关系的组播路由表; 接收数据信元; 根据所述数据小区的类型确定对应的中继,若所述数据小区为单播小区,则提取所述单播小区的目的地址,查询所述单播路由表,获得所述单播小区对应的中继线; 若所述数据单元为多播小区,则提取所述多播小区的多播组地址,查询所述多播路由表,并获取所述多播小区对应的一个或多个中继线; 以及根据预设的负载均衡策略从确定的中继线中选择输出链路,并通过所选择的输出链路发送数据单元。 在本文档中,保证了每条链路的业务流量平衡,同时减少了交换网络内数据单元的延迟。
    • 95. 发明公开
    • COMPILER FOR AND METHOD OF SOFTWARE DEFINED NETWORKING, STORAGE AND COMPUTE DETERMINING PHYSICAL AND VIRTUAL RESOURCES
    • 编译器和软件定义方法的定义网络,存储和计算确定物理和虚拟资源
    • EP3198798A1
    • 2017-08-02
    • EP15791787.3
    • 2015-09-21
    • Wolting Holding B.V.
    • WOLTING, Simon
    • H04L12/24H04L12/00H04L12/851H04L12/931H04L29/08H04L12/701
    • H04L45/02H04L41/12H04L49/252H04L49/70
    • Method of and a compiler for controlling a network based on a logical network model. The compiler determines physical and/or virtual resources, comprising of physical nodes and physical links, against which the logical model can be compiled. The network has known physical nodes, unknown physical nodes and logical nodes. The known physical nodes are “physical nodes” which are existing or still to be setup (virtual) nodes in the network. The known physical nodes are interconnected by physical links in accordance with a physical network layout. The logical network model has logical nodes indicated with a logical node name which refers to at least one known physical node or one unknown physical node in the network. The method uses a depth-mapping relation defining how the logical nodes are mapped to the known physical nodes and the unknown physical nodes. The term “unknown physical node” is used to define an imaginary physical node to which logical nodes can be mapped through depth-mappings and which are to be substituted by a physical node of the network of which the physical node name is stored. The method includes creating logical links between the logical nodes in dependence on the paths between the known physical nodes and/or the unknown physical nodes and on the depth-mapping relation. Known physical nodes are determined for unknown physical nodes and known physical paths are determined for unknown physical paths between unknown physical nodes by performing a search. The method uses edge-relationships between logical link, logical path, physical link, physical path and depth-mapping relations. Logical paths in the logical network are transformed into a physical path comprising of physical links between the physical nodes through recursive calculation and forwarding instructions are created for the physical nodes, in dependence on the edge-relationships and point-of-attachment names between physical links and physical nodes.
    • 基于逻辑网络模型的用于控制网络的方法和编译器。 编译器确定物理和/或虚拟资源,包括物理节点和物理链路,可以编译逻辑模型。 网络具有已知的物理节点,未知的物理节点和逻辑节点。 已知的物理节点是网络中现有的或仍将设置(虚拟)节点的“物理节点”。 已知的物理节点根据物理网络布局通过物理链路互连。 逻辑网络模型具有用逻辑节点名称指示的逻辑节点,该逻辑节点名称指网络中的至少一个已知物理节点或一个未知物理节点。 该方法使用定义如何将逻辑节点映射到已知物理节点和未知物理节点的深度映射关系。 术语“未知物理节点”用于定义虚拟物理节点,逻辑节点可通过深度映射映射到虚拟物理节点,并由存储物理节点名称的网络的物理节点替代。 该方法包括根据已知物理节点和/或未知物理节点之间的路径以及深度映射关系在逻辑节点之间创建逻辑链路。 对于未知的物理节点确定已知的物理节点,并且通过执行搜索来确定未知物理节点之间的未知物理路径的已知物理路径。 该方法使用逻辑链路,逻辑路径,物理链路,物理路径和深度映射关系之间的边缘关系。 通过递归计算将逻辑网络中的逻辑路径变换成包括物理节点之间的物理链路的物理路径,并且根据物理链路之间的边缘关系和附接点名称为物理节点创建转发指令 和物理节点。