SCALABLE DEADLOCK-FREE DETERMINISTIC MINIMAL-PATH ROUTING FOR DRAGONFLY NETWORKS
Number of patents in Portfolio can not be more than 2000
United States of America Patent
Stats
-
N/A
Issued Date -
N/A
app pub date -
Jul 24, 2016
filing date -
Jul 24, 2016
priority date (Note) -
Published
status (Latency Note)
Importance
Abstract
A communication apparatus includes an interface and a processor. The interface is configured for connecting to a communication network, including multiple network switches divided into groups. The processor is configured to predefine a strictly monotonic order among the groups, to receive an indication of a flow of packets to be routed from a source endpoint served by a source network switch belonging to a source group to a destination endpoint served by a destination network switch belonging to a destination group, to assign a first Virtual Lane (VL) to the packets in the flow if the destination group succeeds the source group in the predefined order, to assign to the packets in the flow a second VL if the destination group does not succeed the source group in the predefined order, and to configure the network switches to route the packets of the flow in accordance with the assigned VL.
First Claim
Family
International Classification(s)
Cited Art Landscape
Patent Citation Ranking
Recipient Email Address
Recipient Email Address
Comment
Recipient Email Address
Add to Portfolio(s)
To add this patent to one, or more, of your portfolios, simply click the add button.
This Patent is in these Portfolios:
Add to additional portfolios:
Last Refreshed On:
Changes done successfully