Explicit congestion notification in mixed fabric network communications
    1.
    发明授权
    Explicit congestion notification in mixed fabric network communications 有权
    混合网络通信中的显式拥塞通知

    公开(公告)号:US09106546B1

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

    申请号:US13559109

    申请日:2012-07-26

    IPC分类号: H04L12/801

    摘要: A method and apparatus are provided for communicating congestions that area detected in a communications network. According to the method and apparatus, a first Ethernet frame encapsulating a first PDU is transmitted across an Ethernet network. Congestion in the network is then detected, and an indication of the congestion is inserted in a predetermined header field of the first Ethernet frame. Once the first Ethernet frame is received by an endpoint in the network, the indication of congestion is transferred into a second PDU that is associated with the first PDU. The second PDU is then encapsulated in a second Ethernet frame and transmitted towards the sender of the first PDU.

    摘要翻译: 提供了一种用于传送在通信网络中检测到的区域的拥塞的方法和装置。 根据该方法和装置,封装第一PDU的第一以太网帧通过以太网发送。 然后检测网络中的拥塞,并且在第一以太网帧的预定报头字段中插入拥塞的指示。 一旦网络中的端点接收到第一个以太网帧,则拥塞的指示被传送到与第一PDU相关联的第二PDU中。 然后将第二PDU封装在第二以太网帧中,并向第一PDU的发送方发送。

    Networking systems with dynamically changing topologies
    2.
    发明授权
    Networking systems with dynamically changing topologies 有权
    网络系统具有动态变化的拓扑

    公开(公告)号:US09319264B1

    公开(公告)日:2016-04-19

    申请号:US13547949

    申请日:2012-07-12

    IPC分类号: H04L12/28 H04L29/08 H04L12/24

    摘要: Network performance may be improved by adjusting a logical network topology while avoiding attendant disruptions. By identifying an alternative logical topology, routing network traffic away from links that will be eliminated from the alternative logical topology, and updating a traffic routing plan upon the adoption of the alternative logical topology, a network may adopt a more efficient topology without misdirecting network traffic.

    摘要翻译: 通过调整逻辑网络拓扑同时避免服务中断,可以提高网络性能。 通过识别替代逻辑拓扑,将路由网络流量远离将从替代逻辑拓扑中消除的链路,并且在采用替代逻辑拓扑时更新流量路由计划,网络可采用更有效的拓扑,而不会误导网络流量 。

    Traffic distribution over multiple paths in a network
    4.
    发明授权
    Traffic distribution over multiple paths in a network 有权
    流量分布在网络中的多条路径上

    公开(公告)号:US08769148B1

    公开(公告)日:2014-07-01

    申请号:US13192658

    申请日:2011-07-28

    IPC分类号: G06F15/173

    摘要: System and methods for efficiently distributing data packets in a multi-path network having a plurality of equal cost paths each having the same number of hops are provided. In one aspect, a system and method includes reordering the entries in the routing table of one or more peer routing devices, such that succeeding equal cost next hop routing devices that are interconnected in a Clos formation to the peer routing devices received unbiased traffic from each of the peer routing devices, thus enabling the succeeding next hop routing devices to distribute data traffic evenly over additional equal cost multiple hops further into the network.

    摘要翻译: 提供了一种用于在具有多个具有相同跳数的等价成本路径的多路径网络中有效分配数据分组的系统和方法。 一方面,系统和方法包括重新排序一个或多个对等路由设备的路由表中的条目,使得在Clos形式中互连到对等路由设备的成功的等价成本下一跳路由设备从每个路由设备接收到无偏差业务 的对等路由设备,从而使后续的下一跳路由设备能够将数据流量均匀地分布到进一步进入网络的额外的等成本多跳中。

    Traffic distribution over multiple paths in a network while maintaining flow affinity

    公开(公告)号:US09716592B1

    公开(公告)日:2017-07-25

    申请号:US13157925

    申请日:2011-06-10

    IPC分类号: H04L9/32 H04L29/08

    摘要: System and methods for efficiently distributing data packets in a multi-path network while maintaining flow affinity are provided. In one aspect, a system and method includes calculating hash values for distributing different flows, or sets of flows, of data packets received at a routing device. The hash value is calculated not only using information in the data packets, but also based on additional information that is determined based on an N-bit derived from the data packets. In some cases, calculating a hash value based on the additional information increases the entropy of the hashing function, thus enabling a routing device to distribute different flows of data packets over a greater number of network paths. Each routing device can derive a different, and randomly generated N-bit key while maintaining flow affinity for each received data packet in a given flow of data packets.