Method and apparatus for forwarding data in a data...

Multiplex communications – Fault recovery – Bypass an inoperative switch or inoperative element of a...

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C370S392000

Reexamination Certificate

active

07630298

ABSTRACT:
A method of forwarding data in a data communications network having a plurality of nodes comprises the steps, performed at a repairing node, of computing the repair path around a network component to a target node and forwarding data along the repair path. The computing step comprises the step of computing an intermediate node reachable by the repairing node and from which the target node can be reached. The forwarding step includes the step of constructing a Multi-Protocol Label Switching (MPLS) packet for forwarding to the intermediate node.

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: 6061650 (2000-05-01), Malkin et al.
patent: 6075631 (2000-06-01), Bala 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: 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: 6654361 (2003-11-01), Dommety 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: 6879594 (2005-04-01), Lee et al.
patent: 6895441 (2005-05-01), Shabtay et al.
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: 7046680 (2006-05-01), McDysan 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: 7209434 (2007-04-01), Kano 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: 7280472 (2007-10-01), Rigby et al.
patent: 7292581 (2007-11-01), Finn
patent: 7330440 (2008-02-01), Bryant et al.
patent: 7349427 (2008-03-01), Canning et al.
patent: 7490165 (2009-02-01), Katukam et al.
patent: 2002/0004843 (2002-01-01), Andersson et al.
patent: 2002/0021671 (2002-02-01), Quinlan
patent: 2002/0037010 (2002-03-01), Yamauchi
patent: 2002/0069292 (2002-06-01), Gaddis 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/0103449 (2003-06-01), Barsheshet et al.
patent: 2003/0110287 (2003-06-01), Mattson
patent: 2003/0193959 (2003-10-01), Lui et al.
patent: 2003/0210705 (2003-11-01), Seddigh et al.
patent: 2003/0223361 (2003-12-01), Hussain et al.
patent: 2004/0001497 (2004-01-01), Sharma
patent: 2004/0001508 (2004-01-01), Zheng et al.
patent: 2004/0017796 (2004-01-01), Lemieux et al.
patent: 2004/0038671 (2004-02-01), Trayford 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: 2004/0185777 (2004-09-01), Bryson
patent: 2005/0007950 (2005-01-01), Liu
patent: 2005/0031339 (2005-02-01), Qiao et al.
patent: 2005/0038909 (2005-02-01), Yoshiba et al.
patent: 2005/0047353 (2005-03-01), Hares
patent: 2005/0088965 (2005-04-01), Atlas et al.
patent: 2005/0097219 (2005-05-01), Goguen et al.
patent: 2005/0111351 (2005-05-01), Shen
patent: 2005/0281271 (2005-12-01), Beshai et al.
patent: 2006/0007929 (2006-01-01), Desai et al.
patent: 2006/0013125 (2006-01-01), Vasseur et al.
patent: 2006/0018253 (2006-01-01), Windisch et al.
patent: 2006/0080421 (2006-04-01), Hu
patent: 2006/0182117 (2006-08-01), Chen et al.
patent: 2006/0221962 (2006-10-01), Previdi et al.
patent: 2006/0291391 (2006-12-01), Vasseur et al.
patent: 2007/0011284 (2007-01-01), Le Roux et al.
patent: 2007/0038767 (2007-02-01), Miles et al.
patent: 2007/0248016 (2007-10-01), Ashwood Smith et al.
patent: 2007/0291790 (2007-12-01), Ue et al.
patent: 1440159 (2003-09-01), None
patent: WO 02/06918 (2002-01-01), None
patent: 0223832 (2002-03-01), None
Wikipedia, “List of IPv4 Protocol Numbers,” located on the internet at http://en.wikipedia.org/wiki/IP—protocol, retrieved on Feb. 1, 2007, 7 pages.
Wikipedia, “Ping,” located in the internet at <http://wikipedia.org/wiki/Ping>, retrieved on Feb. 1, 2007, 3 pages.
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.
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.
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).
Canadian Intellectual Property Office. Requisition. Method and Apparatus For Advertising a Link Cost In a Data Communications Network. Application No. 2509359. Mar. 26, 2008. pp. 1-3.

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

Method and apparatus for forwarding data in a data... 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 forwarding data in a data..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method and apparatus for forwarding data in a data... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-4085480

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