System for scheduling scans of interior nodes of a network...

Multiplex communications – Network configuration determination

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C370S395400, C370S401000

Reexamination Certificate

active

07969907

ABSTRACT:
An arrangement for scheduling scans of internal network nodes for reachability events by a border node of a network domain, schedules the scans according to the rate at which reachability notifications are received by the node. As the rate at which notifications are received increases, the interval between scans also increases. Conversely, as the rate of notifications decreases, the interval also decreases.

REFERENCES:
patent: 4910733 (1990-03-01), Sommani et al.
patent: 5276680 (1994-01-01), Messenger
patent: 5400329 (1995-03-01), Tokura et al.
patent: 5917820 (1999-06-01), Rekhter
patent: 6006016 (1999-12-01), Faigon et al.
patent: 6101194 (2000-08-01), Annapareddy et al.
patent: 6269099 (2001-07-01), Borella et al.
patent: 6339595 (2002-01-01), Rekhter et al.
patent: 6463061 (2002-10-01), Rekhter et al.
patent: 6553423 (2003-04-01), Chen
patent: 6628614 (2003-09-01), Okuyama et al.
patent: 6987728 (2006-01-01), Deshpande
patent: 6990070 (2006-01-01), Aweya et al.
patent: 7006821 (2006-02-01), Tee
patent: 7263078 (2007-08-01), Krantz et al.
patent: 7280537 (2007-10-01), Roy
patent: 2002/0044549 (2002-04-01), Johansson et al.
patent: 2002/0177910 (2002-11-01), Quarterman et al.
patent: 2003/0023701 (2003-01-01), Norman et al.
patent: 2003/0043796 (2003-03-01), Okuyama et al.
patent: 2003/0156603 (2003-08-01), Rakib et al.
patent: 2003/0202501 (2003-10-01), Jang
patent: 2004/0120278 (2004-06-01), Krantz et al.
patent: 2005/0068968 (2005-03-01), Ovadia et al.
patent: 2005/0074001 (2005-04-01), Mattes et al.
patent: 2005/0074003 (2005-04-01), Ball et al.
patent: 2006/0126495 (2006-06-01), Guichard et al.
patent: 2006/0180438 (2006-08-01), Mosli et al.
patent: 2006/0182038 (2006-08-01), Nalawade et al.
patent: 06 71 9874 (2009-05-01), None
Y. Rekhter and T. Li, RFC 1171, entitled a Border Gateway Protocol 4 (BGP-4), pp. 1-54, Mar. 1995.
Perlman, Radia, Interconnections: Bridges and Routers, Section 10.2.3, pp. 323-329, Addison Wesley longman, Inc., 1992.
Rekhter, Y., et al., Internet Draft, entitled a Border Gateway Protocol 4 (BGP-4) (draft-ietf-idr-bgp4-20.txt, Mar. 1995, pp. 1-86.
http://www.cisco.com/un d/cc/t...s120/12cgcr
pl—c/lcprt1/lcbgp.htm, “Configuring BGP” Copyright 1989-1999 pp. 1-44.
Tanenbaum, Andrew S., “Computer Networks” Third Edition; Chapter 1, Section 1.4.2, “The TCP/IP Reference Model”; Prentice Hall PTR, 1996, New Jersey, pp. 35-38.
Bates, T. et al., Internet Draft, entitled Multiprotocol Extensions for BGP-4 (draft-ietf-idr-bgp4-multiprotocol-v2.02.txt), Aug. 1999, pp. 1-10.
Chandra, R. et al., Internet Draft, entitled Capabilities Negotiation with BGP-4 (draft-ietf-idr-bgp4-cap-neg-03.txt), pp. 1-4.
Notification of Transmittal of the International Search Report or the Declaration and Written Opinion of the International Searching Authority, Mailed on Jan. 31, 2007, International Application No. PCT/US06/03221, International Filing Date Jan. 30, 2006, 11 pages.
White, Russ, “High Availability in Routing”, The Internet Protocol Journal, Cisco Systems, Mar. 2004, pp. 2-14.

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

System for scheduling scans of interior nodes of a network... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with System for scheduling scans of interior nodes of a network..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and System for scheduling scans of interior nodes of a network... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-2630760

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