Multiplex communications – Fault recovery – Bypass an inoperative channel
Reexamination Certificate
2011-01-11
2011-01-11
Vu, Huy D (Department: 2461)
Multiplex communications
Fault recovery
Bypass an inoperative channel
C242S225000, C242S248000
Reexamination Certificate
active
07869350
ABSTRACT:
A method is disclosed for determining a repair strategy for a data communication network. The data communication network has as components nodes and links. The method comprises a step of implementing a link repair strategy for an adjacent link to an adjacent node. The method further monitors for a probe packet to the adjacent node and, if such a packet is received, implements a node repair strategy.
REFERENCES:
patent: 4956835 (1990-09-01), Grover
patent: 5243592 (1993-09-01), Perlman et al.
patent: 5253248 (1993-10-01), Dravida et al.
patent: 5825772 (1998-10-01), Dobbins et al.
patent: 5959968 (1999-09-01), Chin et al.
patent: 5999286 (1999-12-01), Venkatesan
patent: 6002674 (1999-12-01), Takei et al.
patent: 6032194 (2000-02-01), Gai et al.
patent: 6044075 (2000-03-01), Le Boudec et al.
patent: 6098107 (2000-08-01), Narvaez-Guarnieri et al.
patent: 6111257 (2000-08-01), Shand et al.
patent: 6128750 (2000-10-01), Espy et al.
patent: 6148410 (2000-11-01), Baskey et al.
patent: 6185598 (2001-02-01), Farber et al.
patent: 6243754 (2001-06-01), Guerin et al.
patent: 6246669 (2001-06-01), Chevalier et al.
patent: 6256295 (2001-07-01), Callon
patent: 6295275 (2001-09-01), Croslin
patent: 6321271 (2001-11-01), Kodialam et al.
patent: 6343122 (2002-01-01), Andersson
patent: 6347078 (2002-02-01), Narvaez-Guarnieri et al.
patent: 6349091 (2002-02-01), Li
patent: 6356546 (2002-03-01), Beshai
patent: 6389764 (2002-05-01), Stubler et al.
patent: 6473421 (2002-10-01), Tappan
patent: 6507577 (2003-01-01), Mauger et al.
patent: 6535481 (2003-03-01), Andersson et al.
patent: 6578086 (2003-06-01), Regan et al.
patent: 6668282 (2003-12-01), Booth et al.
patent: 6690671 (2004-02-01), Anbiah et al.
patent: 6697325 (2004-02-01), Cain
patent: 6704320 (2004-03-01), Narvaez et al.
patent: 6711125 (2004-03-01), Walrand et al.
patent: 6714551 (2004-03-01), Le-Ngoc
patent: 6718382 (2004-04-01), Li et al.
patent: 6778531 (2004-08-01), Kodialam et al.
patent: 6829215 (2004-12-01), Tornar
patent: 6928484 (2005-08-01), Huai et al.
patent: 6944131 (2005-09-01), Beshai et al.
patent: 6950870 (2005-09-01), Beaulieu
patent: 6982951 (2006-01-01), Doverspike et al.
patent: 6996065 (2006-02-01), Kodialam et al.
patent: 7058016 (2006-06-01), Harper
patent: 7099286 (2006-08-01), Swallow
patent: 7113481 (2006-09-01), Elie-Dit-Cosaque et al.
patent: 7158486 (2007-01-01), Rhodes
patent: 7177295 (2007-02-01), Sholander et al.
patent: 7242664 (2007-07-01), Einstein et al.
patent: 7260645 (2007-08-01), Bays
patent: 7274654 (2007-09-01), Yang et al.
patent: 7274658 (2007-09-01), Bornstein et al.
patent: 7349427 (2008-03-01), Canning et al.
patent: 7420989 (2008-09-01), Liu et al.
patent: 7490165 (2009-02-01), Katukam et al.
patent: 2002/0021671 (2002-02-01), Quinlan
patent: 2002/0037010 (2002-03-01), Yamauchi
patent: 2002/0062388 (2002-05-01), Ogier et al.
patent: 2002/0093954 (2002-07-01), Weil et al.
patent: 2002/0112072 (2002-08-01), Jain
patent: 2002/0116669 (2002-08-01), Jain
patent: 2002/0131362 (2002-09-01), Callon
patent: 2002/0136223 (2002-09-01), Ho
patent: 2002/0171886 (2002-11-01), Wu et al.
patent: 2002/0172157 (2002-11-01), Rhodes
patent: 2003/0063613 (2003-04-01), Carpini et al.
patent: 2003/0079040 (2003-04-01), Jain et al.
patent: 2003/0117950 (2003-06-01), Huang
patent: 2003/0123457 (2003-07-01), Koppol
patent: 2003/0193958 (2003-10-01), Narayanan
patent: 2003/0193959 (2003-10-01), Lui et al.
patent: 2003/0210705 (2003-11-01), Seddigh et al.
patent: 2004/0001497 (2004-01-01), Sharma
patent: 2004/0001508 (2004-01-01), Zheng et al.
patent: 2004/0071089 (2004-04-01), Bauer et al.
patent: 2004/0085894 (2004-05-01), Wang et al.
patent: 2004/0117251 (2004-06-01), Shand
patent: 2004/0151181 (2004-08-01), Chu et al.
patent: 2005/0007950 (2005-01-01), Liu
patent: 2005/0013241 (2005-01-01), Beller et al.
patent: 2005/0031339 (2005-02-01), Qiao et al.
patent: 2005/0038909 (2005-02-01), Yoshiba et al.
patent: 2005/0071709 (2005-03-01), Rosenstock et al.
patent: 2005/0097219 (2005-05-01), Goguen et al.
patent: 2005/0265228 (2005-12-01), Fredette et al.
patent: 2006/0018253 (2006-01-01), Windisch et al.
patent: 2006/0221962 (2006-10-01), Previdi et al.
patent: 2006/0291446 (2006-12-01), Caldwell et al.
patent: 2007/0011284 (2007-01-01), Le Roux et al.
patent: 2007/0011351 (2007-01-01), Bruno et al.
patent: 2007/0038767 (2007-02-01), Miles et al.
patent: 2008/0025203 (2008-01-01), Tallet
patent: 2008/0089227 (2008-04-01), Guichard et al.
patent: 1440159 (2003-09-01), None
patent: WO 01/78278 (2001-10-01), None
patent: WO 02/06918 (2002-01-01), None
http://en.wikipedia.org/wiki/IP—protocol, Oct. 28, 2006.
http://en.wikipedia.org/wiki/Ping, Jan. 17, 2007.
Wang, Zheng et al., “Shortest Path First with Emergency Exits,” ACM 089791-405-8/90/0009/0166, 1990, pp. 166-176.
International Searching Authority, International Search Report, PCT/US04/33827, dated Mar. 28, 2005, 8 pages.
Current Claims, PCT/US04/33827, 6 pages.
Mikkel Thorup, “Fortifying OSPF/IS-IS against link-failure,” Sep. 7, 2001, pp. 1-10.
Notification of Transmittal of the International Search Report and the Written Opinion of the International Searching Authority, or the Declaration as received in corresponding International application No. PCT/US06/06238.
Pending claims in PCT/US06/06238.
International Searching Authority, “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/28083, Received Nov. 30, 2007, 11 pages.
Claims, international application No. PCT/US06/28083, 3 pages.
AU Examiner's First Report for foreign patent application No. 2004311004 dated Jun. 23, 2008 (1 pg).
AU Examiner's Second Report for foreign patent application No. 2004311004 dated Aug. 18, 2008 (1 pg).
Current claims for AU foreign patent application No. 2004311004 (6 pgs).
Office Action from CN for foreign application No. 200480033007.8 dated Apr. 11, 2008 (10 pgs) with English translation (11 pgs).
Current claims for CN foreign patent application No. 200480033007.8 (6 pgs).
European Patent Office, “Supplementary European Search Report”, application No. EP 04795045, May 27, 2009, 4 pages.
Claims, application No. EP 04795045, 4 pages.
Raju et al., “A New Approach to On-Demand Loop-Free Multipath Routing”, Computer Communications and Networks, 1999, IEEE, Oct. 1999, XP010359531, ISBN: 978-0-7803-5794-5, 6 pages.
State Intellectual Property Office of the People'S Republic of China, “The First Office Action”, filing No. 200680001652.0, May 8, 2009, 15 pages.
Claims, filing No. 200680001652.0, 4 pages.
European Patent Office, “Supplementary European Search Report”, application No. EP 06720965, dated Jul. 21, 2009, 6 pages.
Claims, application No. EP 06720965, 4 pages.
European Patent Office, “Communication pursuant to Article 94(3) EPC”, Application No. 04795045.6-2416, dated Sep. 7, 2009, 5 pages.
Current Claims, Application No. 04795045.6-2416, 5 pages.
Moy, J et al., “OSPF Version 2”, IETF Standard, Network Working Group, Internet Engineering Task Force, IETF, Apr. 1998, XP015008112, NFC 2328, 245 pages.
European Patent Office, “Supplementary Search Report”, application No. EP 04812468, dated May 27, 2010, 4 pages.
CLAIMS, application No. EP 04812468, 4 pages.
U.S. Appl. No. 10/719,003, filed Nov. 21, 2003, Office Action Mailing Date May 9, 2007.
Bryant Stewart Frederick
Miles Kevin George
Shand Ian Michael Charles
Chery Dady
Cisco Technology Inc.
Hickman Palermo & Truong & Becker LLP
Vu Huy D
LandOfFree
Method and apparatus for determining a data communication... 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 determining a data communication..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method and apparatus for determining a data communication... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-2739187