Multiplex communications – Data flow congestion prevention or control – Flow control of data transmission through a network
Reexamination Certificate
2011-08-02
2011-08-02
Vu, Huy D (Department: 2461)
Multiplex communications
Data flow congestion prevention or control
Flow control of data transmission through a network
C370S395210
Reexamination Certificate
active
07990877
ABSTRACT:
A method and apparatus for performing a dynamically runtime adjustable constrained shortest path first (CSPF) computation of a label switched path (LSP) is described. In one embodiment of the invention, a network element acting as a source of the LSP receives a request to compute the LSP which includes one or more traffic engineering constraints. If the request includes at least one additive constraint, the network element performs a CSPF calculation. If the request does not include an additive constraint, the network element prunes each link that does not satisfy each of the constraints, and prunes those links whose paths converge at an intermediary network element according to cost, calculates a path to the destination according to cost. Other methods and apparatuses are also described.
REFERENCES:
patent: 6301244 (2001-10-01), Huang et al.
patent: 6956821 (2005-10-01), Szviatovszki et al.
patent: 7324453 (2008-01-01), Wu et al.
patent: 2003/0118024 (2003-06-01), Lee et al.
patent: 2007/0280117 (2007-12-01), Katz et al.
Arshad, Muhammad Taimur, “Routing Traffic Reliably (RTR) A CSPF Algorithm,” Mar. 26, 2003, 8 pages.
Liu, Gang and Ramakrishnan, K.G., “A*Prune: An Algorithm for Finding K Shortest Paths Subject to Multiple Constraints,” IEEE INFOCOM 2001, 0-7803-7016-3/01 © 2001 IEEE, pp. 743-749.
Jabbari, Bijan, et al., “On Constraints for Path Computation in Multi-layer Switched Networks,” IEICE Trans. Commun., vol. Exx-B, No. xx XXXX 200x, Final manuscript received Mar. 9, 2007, pp. 1-6.
“Information Technology—Telecommunications and Information Exchange between Systems—Intermediate System to Intermediate System Intra-domain Routeing Information Exchange Protocol for use in Conjunction with the Protocol for Providing the Connectionless-mode Network Service (ISO 8473),” International Standard, ISO/IEC 10589, Second Edition, Nov. 15, 2002, Reference No. ISO/IEC 10589:2002(E), Geneva, Switzerland, pp. 1-210.
“Implementing a Constraint-based Shortest Path First Algorithm in Intelligent Optical Networks,” MAHI Networks, Copyright © 2003 Mahi Networks, Inc., pp. 1-11.
Farrel, A., et al., “A Path Computation Element (PCE)-Based Architecture,” Request for Comments (RFC) 4655, Aug. 2006, pp. 1-40.
Moy, J., “OSPF Version 2,” Request for Comments: 2328, Apr. 1998, pp. 1-244.
Blakely , Sokoloff, Taylor & Zafman LLP
Lamont Benjamin
Telefonaktiebolaget L M Ericsson (publ)
Vu Huy D
LandOfFree
Method and apparatus for dynamically runtime adjustable path... 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 dynamically runtime adjustable path..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method and apparatus for dynamically runtime adjustable path... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-2622831