Multiplex communications – Fault recovery
Reexamination Certificate
2011-06-07
2011-06-07
Yao, Kwang B (Department: 2473)
Multiplex communications
Fault recovery
C370S235000
Reexamination Certificate
active
07957266
ABSTRACT:
A scheme for routing packets of traffic to their destination after ensuring that they pass through one or more pre-determined intermediate nodes, thereby permitting all permissible traffic patterns to be handled without knowledge of the traffic matrix, subject to edge-link capacity constraints. In one embodiment, a request for a path with a service demand for routing data between the ingress point and the egress point is received. A set of two or more intermediate nodes between the ingress point and the egress point is selected. Based on a bandwidth of the network, respective fractions of the data to send from the ingress point to each node of the set of intermediate nodes are determined. The data is routed in the determined respective fractions from the ingress point to each node of the set of intermediate nodes, and routed from each node of the set of intermediate nodes to the egress point.
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.
patent: 2004048330 (2004-02-01), None
patent: 2004147060 (2004-05-01), None
“Analytical Framework for Dynamic Traffic Partitioning in MPLS Networks,” by Dinan, E., et al., 2000 IEEE International Conference on Communications, vol. 3 of 3, Jun. 18, 2000, pp. 1604-1608.
“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.
“A Constrained Multipath Traffic Engineering Scheme for MPLS Networks,” by Lee et al., 2001, 5 pages.
“Multi-Objective Scheme Over Multi-Tree Routing in Multicast MPLS Networks” by Meisel et al., Oct. 2003, paper read at La Paz, Bolivia, pp. 59-71.
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, 200 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/141,372, filed May 31, 2005 dated Apr. 25, 2008.
Non-Final Office Action received in U.S. Appl. No. 11/141,372, filed May 31, 2005 dated Dec. 10, 2008.
Non-Final Office Action received in U.S. Appl. No. 11/141,372, filed May 31, 2005 dated May 27, 2009.
Final Office Action received in U.S. Appl. No. 11/141,372, filed May 31, 2005 dated Dec. 9, 2009.
Non-Final Office Action received in U.S. Appl. No. 11/141,372, filed May 31, 2005 dated Jun. 11, 2010.
Takeda, Tomonori et al., “A Dynamic Load Balancing Method Considering Fairness In Core Networks”, The Transaction of The Institute of Electronics, Information and Communication Engineers, IEICE, Feb. 1, 2003, vol. 186-B, No. 2, pp. 174-186.
Japanese Examiner's Office Letter dated Feb. 3, 2011 for Japanese Patent application No. 2005-155178, mail date Feb. 9, 2011.
Haga, F. et al., “Development of Route Design Support Function on MPLS Network Management System”, Technical Report of The Institute of Electronics, Information and Communication Engineers, IEICE, Nov. 15, 2001, vol. 101, No. 442, pp. 25-28.
Advisory Action received in U.S. Appl. No. 11/141,257 (Filing Date: May 31, 2005) dated Feb. 23, 2010.
Final Office Action received in U.S. Appl. No. 11/141,257 (Filing Date: May 31, 2005) dated Jan. 6, 2011.
Non Final Office Action received in U.S. Appl. No. 11/141,705 (Filing Date: May 31, 2005) dated Nov. 25, 2008.
Non Final Office Action received in U.S. Appl. No. 11/141,705 (Filing Date: May 31, 2005) dated Dec. 14, 2010.
Advisory Action received in U.S. Appl. No. 11/141,372 (Filing Date: May 31, 2005) dated Feb. 23, 2010.
Notice of Allowability received in U.S. Appl. No. 11/141,372 (Filing Date: May 31, 2005) dated Nov. 29, 2010.
Supplemental Notice of Allowability received in U.S. Appl. No. 11/141,372 (Filing Date: May 31, 2005) dated Jan. 13, 2011.
Kodialam Muralidharan S.
Lakshman Tirunell V.
Sengupta Sudipta
Alcatel-Lucent USA Inc.
Bokhari Syed M
Mendolsohn, Drucker & Associates, P.C.
Yao Kwang B
LandOfFree
Efficient and robust routing independent of traffic pattern... 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 independent of traffic pattern..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Efficient and robust routing independent of traffic pattern... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-2641438