Distributed semi-rearrangeable non-blocking algorithm for clos networks
Number of patents in Portfolio can not be more than 2000
United States of America Patent
Stats
-
Jul 5, 2005
Grant Date -
Oct 16, 2003
app pub date -
Apr 16, 2002
filing date -
Apr 16, 2002
priority date (Note) -
In Force
status (Latency Note)
Importance
Abstract
A marching algorithm for the selection of middle stage switch elements in a network uses an arbitrary but settled sequence in which middle stage switch elements are sampled. The sequence is applied in the forward direction to find an appropriate middle stage switch element during connection and in a reverse direction during disconnection to find an appropriate middle stage switch element for rearrangement. All of the input switch elements use the same marching sequence. The marching algorithm is applicable to both single rate and multi-rate connections. In the case of multi-rate connections, multiple rearrangements may occur at disconnect to match the capacity of the terminated connection.
First Claim
Family
International Classification(s)
Cited Art Landscape
Patent Citation Ranking
Advertisement
Advertisement
Advertisement
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