Multiplex communications – Data flow congestion prevention or control – Flow control of data transmission through a network
Reexamination Certificate
2006-05-16
2006-05-16
Pham, Brenda (Department: 2664)
Multiplex communications
Data flow congestion prevention or control
Flow control of data transmission through a network
C370S248000
Reexamination Certificate
active
07046634
ABSTRACT:
A method for selecting two maximally disjoint shortest paths between a source node and destination node in a network is provided. The method comprises determining a first explicit route between the source and destination nodes by using an original link cost for each link in the network, transforming the network by introducing conditional link costs, determining a second explicit route between the source and destination nodes in the transformed network taking into account the conditional link costs, and determining the two maximally disjoint shortest paths between the source and destination nodes by coalescing the first and second explicit routes. Beneficially, the step of introducing conditional link costs comprises adding additional parameters to links in the network and determining the conditional link costs depending on the position of each link relative to the first explicit route. Corresponding method for determining “N” maximally disjoint paths in a network, wherein “N” is equal or greater than two, is also provided.
REFERENCES:
patent: 5872773 (1999-02-01), Katzela et al.
patent: 6542469 (2003-04-01), Kelley et al.
patent: 6804199 (2004-10-01), Kelly et al.
patent: 6882627 (2005-04-01), Pieda et al.
“Dictionary of Algorithms and Data Structures”, Internet website: www.nist.gov/dads/.
R.G. Ogier, B. Bellur and N. Taft-Plotkin, “An Efficient Algorithm for Computing Shortest and Widest Maximally Disjoint Paths”, SRI International Technical Report ITAD-1616-TR-170, Nov. 1998.
N..Taft-Plotkin, B. Bellur and R. Ogier, “Quality-of-Service Routing Using Maximally Disjoint Paths”, Proceedings of International Workshop on Quality-of-Service, Jun. 1999.
J.W. Suurballe and R.E. Tarjan, “A Quick Method for Finding Shortest Pairs of Disjoint Paths”, published inNetworks, 14, 1984.
R. Bhandari, “Survivable Networks” Algorithms for Diverse Routing, Kluwer Academic Publishers, 1999.
Neustadter Udo Mircea
Pieda Peter Steven
Wong Vincent Chi Chiu
Pham Brenda
Tropic Networks Inc.
Victoria Donnelly
LandOfFree
Method and apparatus for selecting maximally disjoint... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Method and apparatus for selecting maximally disjoint..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method and apparatus for selecting maximally disjoint... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3547577