Method and system to calculate multiple shortest path first trees
    1.
    发明授权
    Method and system to calculate multiple shortest path first trees 有权
    计算多个最短路径第一树的方法和系统

    公开(公告)号:US09264312B2

    公开(公告)日:2016-02-16

    申请号:US14042347

    申请日:2013-09-30

    CPC classification number: H04L41/12 H04L45/122 H04L45/16 H04L45/48

    Abstract: An example method is provided in accordance with one embodiment and includes identifying distances for a sub-tree of a leaf node of a plurality of leaf nodes in a network. The method can also include applying the distances for the sub-tree of the leaf node to a plurality of root nodes connected to the leaf node. Additionally, the method can include establishing a plurality of shortest path distances for the plurality of root nodes using the distances for the sub-tree.

    Abstract translation: 提供了根据一个实施例的示例性方法,并且包括识别网络中多个叶节点的叶节点的子树的距离。 该方法还可以包括将叶节点的子树的距离应用于连接到叶节点的多个根节点。 另外,该方法可以包括使用子树的距离为多个根节点建立多个最短路径距离。

    Convergence of multi-destination traffic in a network environment
    2.
    发明授权
    Convergence of multi-destination traffic in a network environment 有权
    网络环境中多目标流量的收敛

    公开(公告)号:US09203744B2

    公开(公告)日:2015-12-01

    申请号:US14038525

    申请日:2013-09-26

    CPC classification number: H04L45/48 H04L45/16

    Abstract: An example method for convergence of multi-destination traffic in a network environment is provided and includes receiving a first type-length-value (TLV) message from a true broadcast root in a Transparent Interconnection of Lots of Links (TRILL) network, where the first TLV message indicates a first subset of multi-destination trees in the TRILL network, receiving a second TLV message from the true broadcast root indicating a second subset of multi-destination trees in the TRILL network, such that a union of the first subset and the second subset indicates at least one inactive multi-destination tree in the TRILL network, and deleting the inactive tree from a hash table of active trees.

    Abstract translation: 提供了一种用于在网络环境中的多目的地业务的收敛的示例性方法,并且包括在多个链路(TRILL)网络的透明互连中从真实广播根接收第一类型长度值(TLV)消息,其中 第一TLV消息指示TRILL网络中的多目的地树的第一子集,从真实广播根接收指示TRILL网络中的多目的地树的第二子集的第二TLV消息,使得第一子集和 第二子集指示TRILL网络中的至少一个非活动多目的地树,以及从活动树的哈希表中删除不活动树。

    System and method for providing N-way link-state routing redundancy without peer links in a network environment
    3.
    发明授权
    System and method for providing N-way link-state routing redundancy without peer links in a network environment 有权
    在网络环境中提供无对等链路的N路链路状态路由冗余的系统和方法

    公开(公告)号:US08902794B2

    公开(公告)日:2014-12-02

    申请号:US13629587

    申请日:2012-09-27

    CPC classification number: H04L12/44 H04L45/48

    Abstract: A method is provided in one example and includes broadcasting a switching node identifier associated with a first link-state protocol enabled switching node to a plurality of link-state protocol enabled switching nodes. The plurality of link-state protocol enabled switching nodes are in communication with one another by a link-state protocol cloud. The method further includes broadcasting a priority associated with the first link-state protocol enabled switching node to the plurality of link-state protocol enabled switching nodes. The method further includes broadcasting connectivity information of the first link-state protocol enabled switching node to the plurality of link-state protocol enabled switching nodes using the link-state protocol cloud. The connectivity information includes connectivity of the first link-state protocol enabled switching node with at least one spanning tree protocol enabled switching node.

    Abstract translation: 在一个示例中提供了一种方法,并且包括将与启用第一链路状态协议的交换节点相关联的交换节点标识广播到多个支持链路状态协议的交换节点。 多个链路状态协议使能的交换节点通过链路状态协议云彼此通信。 该方法还包括将与启用第一链路状态协议的交换节点相关联的优先级广播到多个支持链路状态协议的交换节点。 该方法还包括使用链路状态协议云将具有第一链路状态协议的交换节点的连接信息广播到使用多个链路状态协议的交换节点。 连通性信息包括启用第一链路状态协议的交换节点与至少一个支持生成树协议的交换节点的连通性。

    Least Disruptive AF Assignments in TRILL LAN Adjacencies
    6.
    发明申请
    Least Disruptive AF Assignments in TRILL LAN Adjacencies 审中-公开
    TRILL LAN邻域中的最小破坏性AF分配

    公开(公告)号:US20150229566A1

    公开(公告)日:2015-08-13

    申请号:US14691542

    申请日:2015-04-20

    CPC classification number: H04L47/125 H04L12/4641 H04L45/02 H04L45/66 H04L49/45

    Abstract: A methodology is described for achieving efficient forwarder appointments. Such efficient appointment may provide an equal load on each participating routing bridge in the TRILL LAN. Load may be viewed as the number of VLANs for which a given node is an appointed forwarder. Furthermore, efficient appointment may be executed with a minimum of traffic disruption. Minimal disruption may be ensured by forwarder appointments by moving a minimum number of VLANs to ensure an equal load on each participating routing bridge.

    Abstract translation: 描述了一种方法来实现高效的代理约定。 这种有效的约会可以在TRILL LAN中的每个参与的路由桥上提供相等的负载。 负载可以被视为指定节点是指定转发器的VLAN数。 此外,可以以最少的交通中断来执行有效的任命。 可以通过转发器约定来确保最小的中断,通过移动最小数量的VLAN来确保每个参与的路由桥上的负载相等。

    Least Disruptive AF Assignments in TRILL LAN Adjacencies
    7.
    发明申请
    Least Disruptive AF Assignments in TRILL LAN Adjacencies 有权
    TRILL LAN邻域中的最小破坏性AF分配

    公开(公告)号:US20140226480A1

    公开(公告)日:2014-08-14

    申请号:US13767451

    申请日:2013-02-14

    CPC classification number: H04L47/125 H04L12/4641 H04L45/02 H04L45/66 H04L49/45

    Abstract: A methodology is described for achieving efficient forwarder appointments. Such efficient appointment may provide an equal load on each participating routing bridge in the TRILL LAN. Load may be viewed as the number of VLANs for which a given node is an appointed forwarder. Furthermore, efficient appointment may be executed with a minimum of traffic disruption. Minimal disruption may be ensured by forwarder appointments by moving a minimum number of VLANs to ensure an equal load on each participating routing bridge.

    Abstract translation: 描述了一种方法来实现高效的代理约定。 这种有效的约会可以在TRILL LAN中的每个参与的路由桥上提供相等的负载。 负载可以被视为指定节点是指定转发器的VLAN数。 此外,可以以最少的交通中断来执行有效的任命。 可以通过转发器约定来确保最小的中断,通过移动最小数量的VLAN来确保每个参与的路由桥上的负载相等。

    Utilizing Network Analytics for Service Provisioning

    公开(公告)号:US20210075853A1

    公开(公告)日:2021-03-11

    申请号:US16565048

    申请日:2019-09-09

    Abstract: This disclosure describes techniques for collecting network parameter data for network switches and/or physical servers and provisioning virtual resources of a service on physical servers based on network resource availability. The network parameter data may include network resource availability data, diagnostic constraint data, traffic flow data, etc. The techniques include determining network switches that have an availability of network resources to support a virtual resource on a connected physical server. A scheduler may deploy virtual machines to particular servers based on the network parameter data in lieu of, or in addition to, the server utilization data of the physical servers (e.g., CPU usage, memory usage, etc.). In this way, a virtual resource may be deployed to a physical server that has an availability of the server resources, but also is connected to a network switch with the availability of network resources to support the virtual resource.

    Least disruptive AF assignments in TRILL LAN adjacencies
    10.
    发明授权
    Least disruptive AF assignments in TRILL LAN adjacencies 有权
    TRILL局域网邻接中的最小破坏性AF分配

    公开(公告)号:US09014202B2

    公开(公告)日:2015-04-21

    申请号:US13767451

    申请日:2013-02-14

    CPC classification number: H04L47/125 H04L12/4641 H04L45/02 H04L45/66 H04L49/45

    Abstract: A methodology is described for achieving efficient forwarder appointments. Such efficient appointment may provide an equal load on each participating routing bridge in the TRILL LAN. Load may be viewed as the number of VLANs for which a given node is an appointed forwarder. Furthermore, efficient appointment may be executed with a minimum of traffic disruption. Minimal disruption may be ensured by forwarder appointments by moving a minimum number of VLANs to ensure an equal load on each participating routing bridge.

    Abstract translation: 描述了一种方法来实现高效的代理约定。 这种有效的约会可以在TRILL LAN中的每个参与的路由桥上提供相等的负载。 负载可以被视为指定节点是指定转发器的VLAN数。 此外,可以以最少的交通中断来执行有效的任命。 可以通过转发器约定来确保最小的中断,通过移动最小数量的VLAN来确保每个参与的路由桥上的负载相等。

Patent Agency Ranking