Implementation of constraints to ensure deadlock avoidance in networks
Number of patents in Portfolio can not be more than 2000
United States of America Patent
Stats
-
May 12, 2009
Grant Date -
Apr 22, 2004
app pub date -
Oct 14, 2003
filing date -
Oct 14, 2002
priority date (Note) -
In Force
status (Latency Note)
Importance
Abstract
A method of determining where to place routing constraints known as cuts in a network to result in a no-loop network, and a method of implementing such constraints in a hierarchical network; to avoid deadlocks. The method of determining where to place cuts in a network to result in a no-loop network comprises an algorithm for numbering the nodes within the network which is used to determine where the cuts are to be placed. The method of implementing constraints in a hierarchical network to result in a no-loop network comprises an algorithm for independently determining cuts and meta-cuts for each peer group, and imposing the necessary routing constraints in the network.
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