Electrical computers and digital processing systems: multicomput – Computer-to-computer data routing – Alternate path routing
Reexamination Certificate
2003-09-26
2008-08-05
Pwu, Jeffrey (Department: 2146)
Electrical computers and digital processing systems: multicomput
Computer-to-computer data routing
Alternate path routing
C709S241000
Reexamination Certificate
active
07409459
ABSTRACT:
Systems and methods for provisioning QoS paths with restoration in a network. In one embodiment, one system includes: (1) a primary path generator configured to identify a suitable primary path between source and destination nodes in a network, (2) an auxiliary graph generator, associated with the primary path generator, configured to construct a directed auxiliary graph from an undirected graph representing the network by reversing each link in a primary QoS path of the undirected graph and replacing each other link in the undirected graph by two directed links, (3) a walk identifier, associated with the auxiliary graph generator, configured to identify a walk in the auxiliary directed graph corresponding to a set of bridges in the network and (4) a bridge identifier, associated with the walk identifier, configured to identify a set of bridges in the network such that at least one link of the primary path is protected by a bridge.
REFERENCES:
patent: 6377543 (2002-04-01), Grover et al.
patent: 2004/0205236 (2004-10-01), Atkinson et al.
patent: 2004/0205239 (2004-10-01), Doshi et al.
Iraschko, et al., “A Highly Efficient Path-Restoration Protocol for Management of Optical Network Transport Integrity;” IEEE Journal on Selected Areas in Communications, 18(5):779-793; May 2000.
Orda, “Routing With End to End QoS Guarantees in Broadband Networks;” IEEE/ACM Transactions on Networking; 7(3):365-374; Jun. 1999.
Kodialam, et al. “Restorable Dynamic QoS Routing;” IEEE Communications Magazine, 40(6):72-81; Jun. 2002.
Ergun, et al., “An Improved FPTAS for Restricted Shortest Path;” Information Processing Letters; 83(5):237-293; Sep. 2002.
Hassin, “Approximation Schemes for the Restricted Shortest Path Problem;” Mathematics of Operations Research; 17(1):36-42; Feb. 1992.
Lorenz, et al., “A Simple Efficient Approximation Scheme for the Restricted Shortest Path Problem;” Operations Research Letters; 28(5):213-219; Jun. 2001.
Suurballe, “Disjoint Path in Networks;” Networks, 4:125-145; 1974.
Bejerano Yigal
Breitbart Yuri J.
Orda Ariel
Rastogi Rajeev
Sprintson Alexander
Bruckart Benjamin R
Lucent Technologies - Inc.
Pwu Jeffrey
LandOfFree
System and method for provisioning QoS paths with... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with System and method for provisioning QoS paths with..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and System and method for provisioning QoS paths with... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-4006027