Multiplex communications – Fault recovery
Reexamination Certificate
2011-07-12
2011-07-12
Yao, Kwang B (Department: 2473)
Multiplex communications
Fault recovery
C370S235000
Reexamination Certificate
active
07978594
ABSTRACT:
In one embodiment, a method for supporting recovery from failure of a link in a network of nodes interconnected by links. An intermediate node between an ingress point and an egress point of the network is selected to minimize the sum of (i) a capacity constraint between the ingress point and the intermediate node and (ii) a capacity constraint between the intermediate node and the egress point. The selection identifies two path structures, each comprising a primary path and one or more link backup detours protecting each link on the primary path, with a first path structure between the ingress point and the intermediate node, and a second path structure between the intermediate node and the egress point. To maximize network throughput, packets are routed in two phases, first to the intermediate node via the first path structure in predetermined proportions, and then from the intermediate node to the final destination via the second path structure.
REFERENCES:
patent: 4974224 (1990-11-01), Boone
patent: 5392344 (1995-02-01), Ash et al.
patent: 5506848 (1996-04-01), Drakopoulos et al.
patent: 6021113 (2000-02-01), Doshi et al.
patent: 6130876 (2000-10-01), Chaudhuri
patent: 6141319 (2000-10-01), Dighe et al.
patent: 6314093 (2001-11-01), Mann et al.
patent: 6347078 (2002-02-01), Narvaez-Guarnieri et al.
patent: 6538991 (2003-03-01), Kodialam et al.
patent: 6556538 (2003-04-01), Croslin
patent: 6728205 (2004-04-01), Finn et al.
patent: 6741572 (2004-05-01), Graves et al.
patent: 6771651 (2004-08-01), Beshai et al.
patent: 7180853 (2007-02-01), Petajisto
patent: 7295510 (2007-11-01), Johri
patent: 7308198 (2007-12-01), Chudak et al.
patent: 7395351 (2008-07-01), Nucci et al.
patent: 2002/0133328 (2002-09-01), Bowman-Amuah
patent: 2002/0191545 (2002-12-01), Pieda et al.
patent: 2003/0048749 (2003-03-01), Stamatelakis et al.
patent: 2003/0099194 (2003-05-01), Lee et al.
patent: 2003/0227877 (2003-12-01), Kar et al.
patent: 2004/0004938 (2004-01-01), Buddhikot et al.
patent: 2004/0042473 (2004-03-01), Park et al.
patent: 2004/0136379 (2004-07-01), Liao et al.
patent: 2004/0170173 (2004-09-01), Pan et al.
patent: 2004/0184603 (2004-09-01), Pearson et al.
patent: 2004/0202111 (2004-10-01), Beshai et al.
patent: 2004/0203820 (2004-10-01), Billhartz
patent: 2004/0213247 (2004-10-01), Seki et al.
patent: 2005/0036486 (2005-02-01), Sahinoglu et al.
patent: 2005/0038909 (2005-02-01), Yoshiba et al.
patent: 2005/0053007 (2005-03-01), Bernhardt et al.
patent: 2005/0188242 (2005-08-01), Rabbat et al.
patent: 2006/0149852 (2006-07-01), Schollmeier et al.
patent: 2006/0165070 (2006-07-01), Hall et al.
Meisel et al. “Multi-objective Scheme over Multi-tree routing in Multicast MPLS Networks” Oct. 2003, paper read at La Paz, Bolivia.
Meisel et al. paper “Multi-objective scheme over multi-tree routing in multicast MPLSnetworks”, Conference LANC, Oct. 2003, pp. 59 through 71.
“Analytical Framework for Dynamic Traffic Partitioning in MPLS Networks,” by Esmael Dinan et al., 2000 IEEE International Conference on Communications, vol. 3 of 3, Jun. 18, 2000, pp. 1604-1608, XP1208682.
“Faster and Simpler Algorithms for Multicommodity Flow and other Fractional Packing Problems,” by Naveen Garg, et al., 1998 IEEE Comput. Soc, US, Nov. 8, 1998, pp. 300-309, XP10318887.
“A Constrained Multipath Traffic Engineering Scheme for MPLS Networks,” by Lee et al., 2001, 5 pages.
Non-Final Office Action received in U.S. Appl. No. 11/141,257, filed May 31, 2005 dated Nov. 28, 2008.
Non-Final Office Action received in U.S. Appl. No. 11/141,257, filed May 31, 2005 dated May 13, 2009.
Final Office Action received in U.S. Appl. No. 11/141,257, filed May 31, 2005 dated Dec. 2, 2009.
Non-Final Office Action received in U.S. Appl. No. 11/141,257, filed May 31, 2005 dated Aug. 4, 2010.
Non-Final Office Action received in U.S. Appl. No. 11/141,705, filed May 31, 2005 dated Apr. 29, 2008.
Non-Final Office Action received in U.S. Appl. No. 11/141,705, filed May 31, 2005 dated May 13, 2009.
Final Office Action received in U.S. Appl. No. 11/141,705, filed May 31, 2005 dated Nov. 24, 2009.
Non-Final Office Action received in U.S. Appl. No. 11/141,705, filed May 31, 2005 dated Jun. 29, 2010.
Non-Final Office Action received in U.S. Appl. No. 11/106,410, filed Apr. 14, 2005 dated May 28, 2008.
Non-Final Office Action received in U.S, Appl. No. 11/106,410, filed Apr. 14, 2005 dated Dec. 10, 2008.
Non-Final Office Action received in U.S. Appl. No. 11/106,410, filed Apr. 14, 2005 dated May 27, 2009.
Non-Final Office Action received in U.S. Appl. No. 11/106,410, filed Apr. 14, 2005 dated Dec. 3, 2009.
Final Office Action received in U.S. Appl. No. 11/106,410, filed Apr. 14, 2005 dated Jun. 8, 2010.
Kodialam Muralidharan S.
Lakshman Tirunell V.
Sengupta Sudipta
Alcatel-Lucent USA Inc.
Bokhari Syed M
Mendelsohn, Drucker & Associates
Yao Kwang B
LandOfFree
Efficient and robust routing of potentially-variable traffic... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Efficient and robust routing of potentially-variable traffic..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Efficient and robust routing of potentially-variable traffic... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-2682739