Protection of hierarchical tunnel head-end nodes

Multiplex communications – Data flow congestion prevention or control

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Reexamination Certificate

active

07920466

ABSTRACT:
In one embodiment, a point of local repair (PLR) for a child tunnel establishes a backup tunnel to a hierarchical tunnel head-end node's (grooming node's) downstream hierarchical tunnel neighbor (merge point) and learns a corresponding backup tunnel label. The PLR then stores a label stack having at least i) the backup tunnel label, ii) a hierarchical tunnel label for the merge point, and iii) a child tunnel label as advertised by an hierarchical tunnel tail-end node. Upon failure of the grooming node, the PLR pushes the stored label stack onto traffic for the child tunnel, and reroutes the traffic with the pushed label stack onto the backup tunnel toward the merge point (e.g., so the merge point may receive the traffic with a proper/expected label stack).

REFERENCES:
patent: 6778492 (2004-08-01), Charny et al.
patent: 6895441 (2005-05-01), Shabtay et al.
patent: 6978394 (2005-12-01), Charny et al.
patent: 2003/0126287 (2003-07-01), Charny et al.
patent: 2003/0233595 (2003-12-01), Charny et al.
patent: 2005/0083928 (2005-04-01), Sivabalan et al.
patent: 2005/0097219 (2005-05-01), Goguen et al.
patent: 2005/0259664 (2005-11-01), Vasseur et al.
patent: 2006/0031490 (2006-02-01), Provine et al.
patent: 2007/0091911 (2007-04-01), Watanabe et al.
Awduche, D. et al., Request for Comments 3209, “RSVP-TE: Extensions to RSVP for LSP Tunnels”, IETF, Network Working Group, Dec. 2001, pp. 1-57.
Smit, H. et al., Request for Comments 3784, “Intermediate System to Intermediate System (IS-IS) Extensions for Traffic Engineering (TE)”, IETF, Network Working Group, Jun. 2004, pp. 1-13.
Katz, D. et al., Request for Comments 3630, “Traffic Engineering (TE) Extensions to OSPF Version 2”, IETF, Network Working Group, Sep. 2003, pp. 1-14.
Braden, R. et al., Request for Comments 2205, “Resource ReSerVation Protocol (RSVP)—Version 1 Functional Specification”, IETF, Network Working Group, Sep. 1997, pp. 1-105.
Vasseur, JP. et al., Internet Draft, “Path Computation Element (PCE) Communication Protocol (PCEP)-Version 1 (draft-ietf-pce-pcep-03.txt)”, IETF, Network Working Group, Oct. 2006, pp. 1-61.
Berger, L., Request for Comments 3473, “Generalized Multi-Protocol Label Switching (GMPLS) Signalling Resource ReserVation Protocol-Traffic Engineering (RSVP-TE) Extensions”, IETF, Network Working Group, Jan. 2003, pp. 1-40.
Farrel, A. et al., Request for Comments 4420, “Encoding of Attributes for Multiprotocol Label Switching (MPLS) Label Switched Path (LSP) Establishment Using Resource ReserVation Protocol-Traffic Engineering (RSVP-TE)”, IETF, Network Working Group, Feb. 2006, pp. 1-20.
Mannie, E., Request for Comments 3945, “Generalized Multi-Protocol Label Switching (GMPLS) Architecture”, IETF, Network Working Group, Oct. 2004, pp. 1-65.
Mannie, E., Request for Comments 3946, “Generalized Multi-Protocol Label Switching (GMPLS) Extensions for Synchronous Optical Network (SONET) and Synchronous Digital Hierarchy (SDH) Control”, IETF, Network Working Group, Oct. 2004, pp. 1-25.
U.S. Appl. No. 11/589,600, entitled Dynamically and Efficiently Forming Hierarchical Tunnels, by Vasseur et al., on Oct. 30, 2006, 33 pgs.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Protection of hierarchical tunnel head-end nodes does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Protection of hierarchical tunnel head-end nodes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Protection of hierarchical tunnel head-end nodes will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-2723982

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.