IP Library Granted Patent US 10,142,219
Granted Patent B2
US 10,142,219 · App. 15/114,722 · Granted Nov 27, 2018

Method to route packets in a distributed direct interconnect network

Inventors: Dan Oprea (Kanata, CA); Andrei Catana (Ottawa, CA); Udo Neustadter (Carp, CA)
Assignee: ROCKPORT NETWORKS INC.
H04L45/24H04L45/12H04L45/26H04L45/40H04L47/6225H04L45/34
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 10,142,219
App. No.
15/114,722
Granted
Nov 27, 2018
Kind
B2
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.

Claims (9)

1. A computer-implemented method of routing packets in a direct interconnect network from a source node to a destination node comprising the steps of:

discovering all nodes and all output ports on each node in a network topology;

including the discovered nodes and output ports in the network topology in a topology database in order to allow said nodes and ports to be included in shortest path routing computations;

calculating the shortest path from every output port on each node to every other node in the network topology based on those nodes and output ports contained in the topology database;

generating a source routing database on each node containing the shortest paths from every output port on said each node to all other nodes in the network topology;

receiving packets at the source node;

sending the received packets to the output ports of the source node in a round robin or weighted round robin manner, whereby each of said received packets is thereafter segmented into flits at the output port of the source node and distributed along the shortest path from the output port on the source node to the destination node, such that the packets are thereby distributed along alternate 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 form and order.

2. The computer-implemented method of claim 1 wherein the flits are forwarded to the destination node using wormhole switching.

Assignments (2)
SECURITY INTEREST Recorded Oct 17, 2023
From: ROCKPORT NETWORKS INC.
To: BDC CAPITAL INC.
Reel/Frame 065255/0618 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Oct 11, 2018
From: CATANA, ANDREI; NEUSTADTER, UDO; OPREA, DAN
To: ROCKPORT NETWORKS INC.
Reel/Frame 047138/0576 →
Continuity (2)
Provisional Application 61939487 · Feb 13, 2014
Related Publication 20160344618A1 · Nov 24, 2016
Cited By (2)
US 12,413,503 US 12,712,805