Multiplex communications – Data flow congestion prevention or control – Flow control of data transmission through a network
Reexamination Certificate
2003-10-14
2009-06-30
Pham, Brenda (Department: 2416)
Multiplex communications
Data flow congestion prevention or control
Flow control of data transmission through a network
C370S400000
Reexamination Certificate
active
07554921
ABSTRACT:
A method and apparatus are disclosed for generating routing information in a data communications network. A first network element (such as a router) receives information relating to a second network element, such as another node or a network link. In response, the first network element determines whether the information relating to the second network element indicates a change in the network. When information relating to a second network element indicates a change in the network, the first network element determines a new shortest path through the network from the first network element for each network element in the network. After a delay, the first network element updates routing information for the first network element based on the new shortest path for the first network element. Preferably the delay is proportional to the distance of the first network element from the second network element.
REFERENCES:
patent: 4987536 (1991-01-01), Humblet
patent: 5243592 (1993-09-01), Perlman et al.
patent: 5253248 (1993-10-01), Dravida et al.
patent: 5265092 (1993-11-01), Soloway et al.
patent: 5754543 (1998-05-01), Seid
patent: 5825772 (1998-10-01), Dobbins 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: 6075631 (2000-06-01), Bala et al.
patent: 6098107 (2000-08-01), Narvaez-Guarnieri 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: 6256295 (2001-07-01), Callon
patent: 6321271 (2001-11-01), Kodialam et al.
patent: 6356546 (2002-03-01), Beshai
patent: 6389764 (2002-05-01), Stubler et al.
patent: 6449279 (2002-09-01), Beiser 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: 6697325 (2004-02-01), Cain
patent: 6704320 (2004-03-01), Narvaez et al.
patent: 6711125 (2004-03-01), Walrand 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: 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: 7016313 (2006-03-01), Harper
patent: 7058016 (2006-06-01), Harper
patent: 7065059 (2006-06-01), Zinn
patent: 7099286 (2006-08-01), Swallow
patent: 7113481 (2006-09-01), Elie-Dit-Cosaque et al.
patent: 7158486 (2007-01-01), Rhodes
patent: 7248579 (2007-07-01), Friedman
patent: 7292581 (2007-11-01), Finn
patent: 7330440 (2008-02-01), Bryant et al.
patent: 2002/0037010 (2002-03-01), Yamauchi
patent: 2002/0093954 (2002-07-01), Weil et al.
patent: 2002/0116669 (2002-08-01), Jain
patent: 2002/0172157 (2002-11-01), Rhodes
patent: 2003/0079040 (2003-04-01), Jain et al.
patent: 2003/0110287 (2003-06-01), Mattson
patent: 2004/0038671 (2004-02-01), Trayford 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/0031339 (2005-02-01), Qiao et al.
patent: 2005/0038909 (2005-02-01), Yoshiba et al.
patent: 2006/0018253 (2006-01-01), Windisch et al.
patent: 2006/0221962 (2006-10-01), Previdi et al.
patent: 2007/0011284 (2007-01-01), Le Roux et al.
patent: 2007/0038767 (2007-02-01), Miles et al.
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.
U.S. Appl. No. 10/323,358, filed Dec. 17, 2002, Michael Shand.
U.S. Appl. No. 10/442,589, filed May 20, 2003, Stewart Bryant et al.
Fortz, Bernard, et al., “Optimizing OSPF/IS-IS Weights in a Changing World,” IEEE JSAC Special Issue on Advances in Fundamentals of Network Management, Spring 2002, pp. 1-31.
Thorup, Mikkel, “Fortifying OSPF/IS-IS Against Link-failure,” AT&T Labs-Research, Shannon Laboratory, Florham Park, NJ, Sep. 7, 2001, pp. 1-10.
Thorup, Mikkel, et al., “Avoiding Ties in Shortest Path First Routing,” AT&T Labs-Research, Shannon Laboratory, Florham Park, NJ, pp. 1-13.
Thorup, Mikkel, “OSPF Areas Considered Harmful,” AT&T Labs-Research, Florham Park, NJ, Apr. 22, 2003, pp. 1-9.
Doyle J, CCIE Professional Development: Routing TCP/IP vol. 1, p. 501-507, Cisco Press 1998.
Dijkstra E.W., “A note on two problems in connexion with graphs, ” Numerische Mathematik, 1 (1959), S. 269-271.
ISO/IEC 10589: “Information technology—Telecommunications and information exchange between systems—Intermediate System to Intermediate System intra-domain routeing information exchange protocol for use in conjunction with the protocol for providing the connectionless-mode network service”, (ISO 8473), Second edition, Nov. 15, 2002, 208 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/us2006/28083, Received Nov. 30, 2007, 11 pages.
Claims, international application No. pct/us2006/28083, 3 pages.
Thorup, Michael, “Fortifying OSPF/IS-IS against link-failure”, Sep. 2007, 10 pages.
Wang, Zheng et al., “Shortest Path First with Emergency Exists”, ACM, 1990, 10 pages.
Karn, “Improving Round Trip Time Estimates in Reliable Transport Protocols”, ACM, Transaction on Computer Systems, 1987, 8 pages.
State Intellectual Property Office of the People's Republic of China, “The First Office Action”, (Non-translated copy included as well), filling No. 200480026214.0, dated Jan. 9, 2009, 7 pages.
Current Claims, for foreign application No. PCT/US2004/033827, 5 pages.
Filsfils Clarence
Previdi Stefano Benedetto
Cisco Technology Inc.
Hickman Palermo & Truong & Becker LLP
Pham Brenda
LandOfFree
Method and apparatus for generating routing information in a... 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 generating routing information in a..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method and apparatus for generating routing information in a... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-4107501