Electrical computers and digital processing systems: multicomput – Computer-to-computer data routing – Least weight routing
Reexamination Certificate
2005-03-04
2010-10-12
Chang, Jungwon (Department: 2454)
Electrical computers and digital processing systems: multicomput
Computer-to-computer data routing
Least weight routing
C370S238000
Reexamination Certificate
active
07814227
ABSTRACT:
A technique calculates a shortest path for a traffic engineering (TE) label switched path (LSP) from a head-end node in a local domain to a tail-end node of a remote domain in a computer network. The novel path calculation technique determines a set of different remote domains through which the TE-LSP may traverse to reach the tail-end node (e.g., along “domain routes”). Once the set of possible routes is determined, the head-end node sends a path computation request to one or more path computation elements (PCEs) of its local domain requesting a computed path for each domain route. Upon receiving path responses for each possible domain route, the head-end node selects the optimal (shortest) path, and establishes the TE-LSP accordingly.
REFERENCES:
patent: 5519704 (1996-05-01), Farinacci et al.
patent: 5600638 (1997-02-01), Bertin et al.
patent: 6256309 (2001-07-01), Daley et al.
patent: 6370119 (2002-04-01), Basso et al.
patent: 6473421 (2002-10-01), Tappan
patent: 6542469 (2003-04-01), Kelley et al.
patent: 6553423 (2003-04-01), Chen
patent: 6600724 (2003-07-01), Cheng
patent: 6603756 (2003-08-01), Tappan
patent: 6765880 (2004-07-01), Hillard et al.
patent: 6982975 (2006-01-01), Aramaki et al.
patent: 6993593 (2006-01-01), Iwata
patent: 7319700 (2008-01-01), Kompella
patent: 2002/0145981 (2002-10-01), Klinker et al.
patent: 2003/0021232 (2003-01-01), Duplaix et al.
patent: 2004/0081154 (2004-04-01), Kouvelas
patent: 2004/0090913 (2004-05-01), Scudder et al.
patent: 2004/0148150 (2004-07-01), Ashar et al.
patent: 2004/0196827 (2004-10-01), Xu et al.
patent: 2006/0209716 (2006-09-01), Previdi et al.
patent: 06 73 6187.3 (2009-03-01), None
Vasseur, et al. “RSVP Path computation reuest and reply messages” draft-vasseur-mpls-computation-rsvp-Jun. 3, 2002, IETF Internet Draft.
Vasseur et al., U.S. Appl. No. 10/767,574, filed Sep. 18, 2003 entitled Computing Inter-Autonomous Systems MPLS Traffic Engineering LSP Paths.
Vasseur et al., U.S. Appl. No. 10/983,280, filed Nov. 5, 2004 entitled Technique for Selecting a Path Computation Element.
Vasseur et al., U.S. Appl. No. 11/049,587, filed Feb. 2, 2005 entitled Inter-Domain Path Computation Technique.
Walton, Daniel., et al., Network Working Group Internet Draft entitled Advertisement of Multiple Paths in BGP (draft-walton-bgp-add-paths-01.txt), Nov. 2002, pp. 1-11.
Vasseur, J. P., et al., Network Working Group Internet Draft, entitled RSVP Path Computation Request and Reply Messages (draft-vasseur-mpls-computation-rsvp-05.txt), Jul. 2004, pp. 1-31.
Vasseur, J. P. et al., OSPF Work Working Group Internet Draft, entitled OSPF MPLS Traffic Engineering Capabilities (draft -vasseur-ospf-te-caps-00.txt), Jul. 2004, pp. 1-14.
Callon, R., RFC 1195, entitled Use of OSI ISIS for routing in TCP/IP and Dual Environments, Dec. 1990, pp. 1-80.
Rekhter, Y., RFC 1771, entitled A Border Gateway Protocol 4 (BGP-4), Mar. 1995, pp. 1-28.
Braden, R. et al., RFC 2205, entitled Resource ReSerVation Protocol (RSVP), Version 1 Functional Specification, Sep. 1997, pp. 1-112.
Moy, J., RFC 2328; entitled OSPF Version 2, Apr. 1998, pp. 1-183.
Awduche, D. et al., RFC 3209, entitled RSVP-TE: Extensions to RSVP for LSP Tunnels Dec. 2001, pp. 1-43.
Berger, L., RFC 3473, entitled Generalized Multi-Protocol Label Switching (GMPLS) Signaling Resource ReserVation Protocol—Traffic Engineering (RSVP-TE) Extensions, Jan. 2003, pp. 1-40.
Katz, D. et al., RFC 3630, entitled Traffic Engineering (TE) Extensions to OSPF Version 2, Sep. 2003, pp. 1-14.
Smit, H., RFC 3784, entitled Intermediate-System-to-Intermediate-System (IS-IS) Extensions for Traffic Engineering (TE), Jun. 2004, pp. 1-13.
Mannie, E., RFC 3945, entitled Generalized Multi-Protocol Label Switching (GMPLS) Architecture, Oct. 2004, pp. 1-65.
Mannie, E., RFC 3946, entitled Generalized Multi-Protocol Label Switching (GMPLS) Extensions for Synchronous Optical Network (SONET) and Synchronous Digital Hierarchy (SDH) Control, Oct. 2004, pp. 1-25.
Perlman, Radia, Interconnections Second Edition: Bridges, Routers, Switches, and Internetworking Protocols, Addison Wesley, 1999, Section 12.2.4, pp. 317-319.
Notification of Transmittal of the International Search Report and the Written Opinion of the International Searching Authority, or the Declaration, International Application No. PCT/US06/06811, International Filing Date: Feb. 27, 2006, Date of Mailing: Apr. 3, 2007, 12 pages
Dachille, A., et al., “Diverse Inter-Region Path Setup / Establishment (draft-dachille-diverse-inter-region-path-setup-01.txt)”, IEFT, CCamp Working Group Internet Draft, Oct. 1, 2004, 28 pages.
Adrian, F., et al., “A Framework for Inter-Domain MPLS Traffic Engineering (draft-ietf-ccamp-inter-domain-framework-01.txt)”, IEFT, Network Working Group Internet Draft, Feb. 1, 2005, 20 pages.
Previdi Stefano B.
Vasseur Jean-Philippe
Cesari and McKenna LLP
Chang Jung-won
Cisco Technology Inc.
LandOfFree
Computation of a shortest inter-domain TE-LSP across a set... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Computation of a shortest inter-domain TE-LSP across a set..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Computation of a shortest inter-domain TE-LSP across a set... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-4212314