公开(公告)号：WO2015120539A8

公开(公告)日：2016-08-11

申请号：PCT/CA2015000081

申请日：2015-02-13

Applicant: ROCKPORT NETWORKS INC

Inventor： OPREA DAN ,  CATANA ANDREI ,  NEUSTADTER UDO

IPC: H04L12/733 ,  H04L12/751 ,  H04L12/863 ,  H04L12/951

CPC classification number: H04L45/24 ,  H04L45/12 ,  H04L45/26 ,  H04L45/34 ,  H04L45/40 ,  H04L47/6225

Abstract: The present invention provides a method and apparatus to route data packets across a torus or higher radix topology that has low latency, increased throughput and traffic distribution to avoid hot spots development. Disclosed is a method of routing packets in a distributed direct interconnect network from a source node to a destination node comprising the steps of: discovering all nodes and associated ports; updating the database to include the nodes and ports in the network topology; calculating the shortest path from every output port on each node to every other node in the topology; segmenting each packet into flits at the output port of the source node; as the flits are segmented, distributing said flits along the shortest path from each output port on the source node to the destination node using wormhole switching, whereby the packets are distributed along alternate maximum disjoint routes in the network topology; and re-assembling and re-ordering the packets at the destination node so that the packets accord with their original order/form.

Abstract translation: 本发明提供了一种方法和装置，用于跨越具有低延迟，增加的吞吐量和业务分布的环形或更高基数拓扑来路由数据分组以避免热点开发。 公开了一种在分布式直接互连网络中从源节点到目的地节点路由分组的方法，包括以下步骤：发现所有节点和相关联的端口; 更新数据库以将节点和端口包括在网络拓扑中; 计算每个节点上每个输出端口到拓扑中每个其他节点的最短路径; 在源节点的输出端口将每个分组分段成flit; 当分组时，从源节点上的每个输出端口到目的地节点的最短路径分配所述飞行器使用虫洞切换，由此分组沿网络拓扑中的备选最大不相交路由分布; 并重新组合和重新排序目的地节点上的数据包，使数据包符合其原始顺序/格式。