Electrical computers and digital processing systems: multicomput – Computer network managing
Reexamination Certificate
2004-03-29
2009-02-24
Dollinger, Tonia L (Department: 2443)
Electrical computers and digital processing systems: multicomput
Computer network managing
C709S224000, C370S229000, C370S254000
Reexamination Certificate
active
07496650
ABSTRACT:
One or more sets of routing information are maintained. A network topology change indication of a progressive series of network changes is received, with at least one more associated network topology change indication of the progressive series of network changes expected to be received in the future. An updated set of routing information is computed based on the network topology change indication, and a determination is made as to whether or not the updated set of routing information changes nexthop information for one or more routes. In response to determining that the new set of routing information does not change nexthop information for said one or more routes and given the expectation of at least one more associated network topology change indication of the progressive series of network changes is expected to be received in the future, the routing information is not updated based on the updated set of routing information.
REFERENCES:
patent: 5243592 (1993-09-01), Perlman et al.
patent: 5253248 (1993-10-01), Dravida et al.
patent: 5999286 (1999-12-01), Venkatesan
patent: 6347078 (2002-02-01), Narvaez-Guarnieri et al.
patent: 6535481 (2003-03-01), Andersson et al.
patent: 6668282 (2003-12-01), Booth, III et al.
patent: 2002/0093954 (2002-07-01), Weil et al.
patent: 2005/0078610 (2005-04-01), Previdi et al.
patent: 2005/0078656 (2005-04-01), Bryant et al.
patent: WO 2005/039109 (2005-04-01), None
U.S. Appl. No. 10/340,371, filed Jan. 9, 2003, Filsfils et al.
U.S. Appl. No. 10/346,051, filed Jan. 15, 2003, Bryant et al.
U.S. Appl. No. 10/442,589, filed May 20, 2003, Bryant et al.
U.S. Appl. No. 10/685,621, filed Oct. 14, 2003, Bryant et al.
U.S. Appl. No. 10/685,622, filed Oct. 14, 2003, Previdi et al.
U.S. Appl. No. 10/848,669, filed May 18, 2004, Filsfils et al.
“MPLS Traffic Engineering Fast Reroute—Link Protection,” Release No. 12.0(10)ST, Cisco Systems, Inc., Jan. 16, 2003.
Demetrescu et al., “Oracles for Distances Avoiding a Link-Failure,” Symposium on Discrete Algorithms, Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 838-843, 2002.
Mikkel Throup, “Fortifying OSPF/IS-IS Against Link Failure,” AT&T Labs Research, Shannon Laboratory, Florham Park, NJ 07932, U.S.A., Sep. 2001.
Kai-Yeung Siu et al., “Fault-Tolerant Routing in the Internet Without Flooding,” Kluwer Academic Publishers, Boston, 2000.
Zheng et al., “Shortest Path First With Emergency Exits,” ACM 089791-405-8/90/0009/0166, pp. 166-176, 1990.
Srinivas Vutukury, “Multipath Routing Mechanisms for Traffic Engineering and Quality of Service in the Internet,” Thesis for Doctor of Philosophy in Computer Science, University of California, Santa Cruz, Mar. 2001.
“Information technology—Telecommunications and information exchange between systems—Intermediate System to Intermediate System intra-domain routeing (sic) information exchange protocol for use in conjunction with the protocol for providing the connectionless-mode network service (ISO 8473),” ISO/IEC 10589, 2002.
Filsfils Clarence
Previdi Stefano Benedetto
Scudder John Galen
Ward David Delano
Cisco Technology Inc.
Dollinger Tonia L
Sikri Anish
The Law Office of Kirk D. Williams
LandOfFree
Identifying and suppressing transient routing updates does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Identifying and suppressing transient routing updates, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Identifying and suppressing transient routing updates will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-4081186