Self-routing permutation networks based on de Bruijn digraphs
US6721311B1 · kind B1 · utility
4Cited by
5References
19Claims
0Family size
Assignee
Inventors
Key dates
| Filing date | Aug 1, 2000 |
| Grant date | Apr 13, 2004 |
| Priority date | — |
| Expiry date | Sep 25, 2022 |
Classification
- Technology area (CPC H)Electricity
- CPC primaryH04L49/3009
- WIPO fieldDigital communication
- WIPO sectorElectrical engineering
Abstract
Permutation networks based on de Bruijn digraphs exhibit constant control complexity (wide sense non-blocking) and constant control complexity (self-routing). The cost in terms of the cross-points used for such networks is an optimal O(N log N). This non-blocking network uses fast algorithms to control in the Terabit bandwidth while providing for cost-effective switching. The network has expandable (i.e., scalable) architecture, i.e., the network can be built by interconnecting smaller non-blocking networks (e.g., small crossbars).
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.