Multiplex communications – Data flow congestion prevention or control – Flow control of data transmission through a network
Reexamination Certificate
2008-01-29
2008-01-29
Shah, Chirag G. (Department: 2616)
Multiplex communications
Data flow congestion prevention or control
Flow control of data transmission through a network
C370S254000, C370S392000, C370S468000
Reexamination Certificate
active
07324453
ABSTRACT:
Method and apparatus for implementing a constraint-based shortest path first (“CSPF”) technique for dynamically switched optical transport networks are described. One embodiment comprises a traffic network element (“TNE”) in a network comprising a traffic engineering network database (“TEND”) that stores network topology information for the network and bandwidth availability information for links in the network; and a routing engine that receives a request for a label switched path (“LSP”) with specified constraints, processes network topology information from the TEND to create a network graph comprising links meeting the specified constraints, and computes a primary path through the network, wherein the primary path comprises links selected from the network graph.
REFERENCES:
patent: 4905233 (1990-02-01), Cain et al.
patent: 5067127 (1991-11-01), Ochiai
patent: 5088032 (1992-02-01), Bosack
patent: 6016306 (2000-01-01), Le Boudec et al.
patent: 6301244 (2001-10-01), Huang et al.
patent: 6633544 (2003-10-01), Rexford et al.
patent: 6785737 (2004-08-01), Lee et al.
patent: 6842463 (2005-01-01), Drwiega et al.
patent: 6925061 (2005-08-01), Lee et al.
patent: 2003/0118024 (2003-06-01), Lee et al.
patent: 2003/0185153 (2003-10-01), Kohler et al.
Rajagopalan, et al.; IP Over Optical Networks: Architectural Aspects; IEEE Communications Magazine; Sep. 2000; pp. 94-102; vol. 38, NR 9.
Kodialam, et al.; Restorable Dynamic Quality of Service Routing; IEEE Communications Magazine; Jun. 2000; pp. 72-81; vol. 40, NR 6.
Szviatovszki, et al.; Minimizing Re-Routing in MPLS Networks with Preemption-Aware Constraint-Based Routing; Computer Communications; Elsevier Science Publishers BV; Amsterdam, NL; Jul. 1, 2002; pp. 1076-1084; vol. 25, NR 11-12.
Papadimitriou, et al.; Inference of Shared Risk Link Groups; IETF Internet Working Group; Internet Draft; Jan. 2002; pp. 1-31.
J. Doyle, Routing TCP/IP, vol. 1, Macmillan Technical Publishing, 198, pp. 176-181.
Nortel, IP Traffic Engineering for Carrier Networks: Using Constraint-Based Routing to Deliver New Services, 1999, pp. 1-8.
Xiao, et al., Traffic Engineering with MPLS in the Internet, IEEE Network, Mar.-Apr. 2000, pp. 28-33, vol. 14, Issue 2.
Skoog Frederick H.
Wu Fuming
Alcatel Lucent
Shah Chirag G.
Slaton Bobby D.
Smith Jessica W.
LandOfFree
Constraint-based shortest path first method for dynamically... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Constraint-based shortest path first method for dynamically..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Constraint-based shortest path first method for dynamically... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-2808952