Self-routing permutation networks based on de Bruijn digraphs
Number of patents in Portfolio can not be more than 2000
United States of America Patent
Stats
-
Apr 13, 2004
Grant Date -
N/A
app pub date -
Aug 1, 2000
filing date -
Aug 10, 1999
priority date (Note) -
Expired
status (Latency Note)
Importance
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).
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