Invention Application
- Patent Title: SCALABLE DEADLOCK-FREE DETERMINISTIC MINIMAL-PATH ROUTING FOR DRAGONFLY NETWORKS
-
Application No.: US15218028Application Date: 2016-07-24
-
Publication No.: US20180026878A1Publication Date: 2018-01-25
- Inventor: Eitan Zahavi , German Maglione-Mathey , Pedro Yebenes , Jesus Escudero-Sahuquillo , Pedro Javier Garcia , Francisco Jose Quiles
- Applicant: MELLANOX TECHNOLOGIES TLV LTD. , UNIVERSIDAD DE CASTILLA-LA MANCHA
- Main IPC: H04L12/721
- IPC: H04L12/721 ; H04L12/733 ; H04L12/751 ; H04L12/713

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.
Information query