Multiplex communications – Data flow congestion prevention or control – Flow control of data transmission through a network
Reexamination Certificate
2008-05-15
2010-06-08
Trost, IV, William (Department: 2472)
Multiplex communications
Data flow congestion prevention or control
Flow control of data transmission through a network
C370S230100
Reexamination Certificate
active
07733786
ABSTRACT:
A method and apparatus for performing a constrained shortest path first (CSPF) computation is described. In one embodiment of the invention, the network element receives a request with one or more exclusion constraints or a path re-optimization request. The network element marks one or more attribute bits in a traffic engineering data structure based on the request. If an exclusion bit is set for a link, that link is skipped during CSPF computation. If a re-optimization bit is set for a link, the allocated bandwidth of the link is added to the advertised bandwidth of the link to form a re-optimization comparison value, which is used for a bandwidth comparison during path re-optimization.
REFERENCES:
patent: 6301244 (2001-10-01), Huang et al.
patent: 6628649 (2003-09-01), Raj et al.
patent: 7324453 (2008-01-01), Wu et al.
patent: 7512063 (2009-03-01), Vasseur et al.
patent: 7515529 (2009-04-01), Vasseur et al.
patent: 2003/0118024 (2003-06-01), Lee et al.
patent: 2006/0126496 (2006-06-01), Filsfils et al.
patent: 2006/0291391 (2006-12-01), Vasseur et al.
patent: 2007/0070909 (2007-03-01), Reeve
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
Maglo Emmanuel
Telefonaktiebolaget L M Ericsson (Publ)
Trost, IV William
LandOfFree
Method and apparatus for performing a constraint shortest... 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 performing a constraint shortest..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method and apparatus for performing a constraint shortest... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-4155723