Dragonfly Plus: Communication Over Bipartite Node Groups Connected by a Mesh Network
    1.
    发明申请
    Dragonfly Plus: Communication Over Bipartite Node Groups Connected by a Mesh Network 有权
    Dragonfly Plus:通过网状网络连接的双向节点组进行通信

    公开(公告)号:US20160028613A1

    公开(公告)日:2016-01-28

    申请号:US14337334

    申请日:2014-07-22

    CPC classification number: H04L45/122 H04L45/14

    Abstract: A communication network includes multiple nodes, which are arranged in groups such that the nodes in each group are interconnected in a bipartite topology and the groups are interconnected in a mesh topology. The nodes are configured to convey traffic between source hosts and respective destination hosts by routing packets among the nodes on paths that do not traverse any intermediate hosts other than the source and destination hosts.

    Abstract translation: 通信网络包括多个节点,这些节点被分组布置,使得每个组中的节点以二分之一拓扑互连,并且组以网状拓扑互连。 节点被配置为通过在不经过源主机和目的主机之外的任何中间主机的路径上的节点之间路由分组来在源主机和相应的目的主机之间传送流量。

    Ad-hoc allocation of in-network compute-resources

    公开(公告)号:US11973694B1

    公开(公告)日:2024-04-30

    申请号:US18192688

    申请日:2023-03-30

    CPC classification number: H04L47/76 H04L47/829

    Abstract: In one embodiment, an in-network compute resource assignment system includes a network device to receive a request to select resources to perform a processing job, wherein the request includes at least one resource requirement of the processing job, and end point devices assigned to perform the processing job, a memory to store a state of in-network compute-resources indicating resource usage of the in-network compute-resources by other processing jobs, and a processor to manage the stored state, and responsively to receiving the request, selecting ones of the in-network compute-resources to perform the processing job based on: (a) a network topology of a network including the in-network compute-resources; (b) the state of the in-network compute-resources; and (c) the at least one resource requirement of the processing job.

    Deadlock-free local rerouting for handling multiple local link failures in hierarchical network topologies

    公开(公告)号:US11870682B2

    公开(公告)日:2024-01-09

    申请号:US17353869

    申请日:2021-06-22

    CPC classification number: H04L45/22 H04L41/0654 H04L45/28

    Abstract: A method for communication includes partitioning local links in a subnetwork of a packet data network into at least first and second groups. For each local link that connects a first upper-tier switch to a first lower-tier switch in the subnetwork, a corresponding detour route is defined, passing through a first local link belonging to the first group from the first upper-tier switch to a second lower-tier switch, and from the second lower-tier switch over a second local link to a second upper-tier switch, and from the second upper-tier switch over a third local link belonging to the second group to the first lower-tier switch. Upon a failure of the local link connecting the first upper-tier switch to the first lower-tier switch, data packets arriving from the network at the first upper-tier switch are rerouted to pass via the corresponding detour route to the first lower-tier switch.

    Deadlock-free local rerouting for handling multiple local link failures in hierarchical network topologies

    公开(公告)号:US20220407796A1

    公开(公告)日:2022-12-22

    申请号:US17353869

    申请日:2021-06-22

    Abstract: A method for communication includes partitioning local links in a subnetwork of a packet data network into at least first and second groups. For each local link that connects a first upper-tier switch to a first lower-tier switch in the subnetwork, a corresponding detour route is defined, passing through a first local link belonging to the first group from the first upper-tier switch to a second lower-tier switch, and from the second lower-tier switch over a second local link to a second upper-tier switch, and from the second upper-tier switch over a third local link belonging to the second group to the first lower-tier switch. Upon a failure of the local link connecting the first upper-tier switch to the first lower-tier switch, data packets arriving from the network at the first upper-tier switch are rerouted to pass via the corresponding detour route to the first lower-tier switch.

Patent Agency Ranking