Reduced-overhead protocol for discovering new neighbor nodes...

Multiplex communications – Communication over free space – Having a plurality of contiguous regions served by...

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C370S351000, C370S401000, C370S439000

Reexamination Certificate

active

07031288

ABSTRACT:
A protocol for discovering a new neighbor node and detecting the loss of an existing neighbor node in a network is described. A node receives a neighbor discovery message from a neighbor node. The node receiving the neighbor discovery message periodically transmits a predetermined number of neighbor discovery messages in response to the received neighbor discovery message. Each neighbor discovery message includes an identity of the neighbor node. After transmitting the predetermined number of neighbor discovery messages, the node transmits neighbor discovery messages that omit the identity of the neighbor node until another neighbor discovery message is received from the neighbor node that indicates a change in a communications state associated with the neighbor node.

REFERENCES:
patent: 5056085 (1991-10-01), Vu
patent: 5079767 (1992-01-01), Perlman
patent: 5506838 (1996-04-01), Flanagan
patent: 5572528 (1996-11-01), Shuen
patent: 5574860 (1996-11-01), Perlman et al.
patent: 5657317 (1997-08-01), Mahany et al.
patent: 5732086 (1998-03-01), Liang et al.
patent: 5805818 (1998-09-01), Perlman et al.
patent: 5844900 (1998-12-01), Hong et al.
patent: 6023461 (2000-02-01), Raychaudhuri et al.
patent: 6026077 (2000-02-01), Iwata
patent: 6044062 (2000-03-01), Brownrigg et al.
patent: 6058422 (2000-05-01), Ayanoglu et al.
patent: 6088730 (2000-07-01), Kato et al.
patent: 6097707 (2000-08-01), Hodzic et al.
patent: 6104712 (2000-08-01), Robert et al.
patent: 6178172 (2001-01-01), Rochberger
patent: 6192053 (2001-02-01), Angelico et al.
patent: 6212188 (2001-04-01), Rochberger et al.
patent: 6304556 (2001-10-01), Haas
patent: 6385174 (2002-05-01), Li
patent: 6456599 (2002-09-01), Elliott
patent: 6556574 (2003-04-01), Pearce et al.
patent: 6621805 (2003-09-01), Kondylis et al.
patent: 6625124 (2003-09-01), Fan et al.
patent: 6704293 (2004-03-01), Larsson et al.
patent: 6856627 (2005-02-01), Saleh et al.
patent: 2003/0037167 (2003-02-01), Garcia-Luna-Aceves et al.
patent: 0 944 210 (1999-09-01), None
“IP Mobility Support,” C. Perkins, Editor, IBM, Oct. 1996, http://www.ietf.org/rfc/rfc2002.txt, printed Oct. 4, 2000, 56 pages.
“IPv6—the Next Generation Internet Protocol,” Jack McCann, UNIX Internet Engineering, Digital Equipment Corporation, May 13, 1998, http://www.bblisa.org/docs/May—98/sld001.htm, printed Sep. 6, 2000, 45 pages.
“An Ipv6 Aggregatable Global Unicast Address Format,” P, Hinden, Nokia; M. O'Dell, UUNET; S. Deering, Cisco, Jul. 1998, http://www.ietf.org/rfc/rfc2374.txt?number=2374, printed Oct. 10, 2000, 9 pages.
“IP Version 6 Addressing Architecture,” R. Hinden, Nokia, S. Deering, Cisco Systems, Jul. 1998, http://www.ietf.org/rfc/rfc2373.txt?number=2373, printed Oct. 17, 2000, 19 pages.
“Internet Protocol, Version 6 (IPv6) Specification,” S. Deering, Cisco; R. Hinden, Nokia, Dec. 1998, http://www.ietf.org/rfc/rfc2460.txt?number=2460, printed Oct. 10, 2000, 28 pages.
“A Reliable, Efficient Topology Broadcast Protocol for Dynamic Networks,” by Bhargav Bellur and Richard G. Ogier, Appeared in IEEE INFOCOM '99 Proceedings.
“IP Network Address Translator (NAT) Terminology and Considerations,” P. Srisuresh, M. Holdrege, Lucent Technologies, Aug. 1999, http://www.ietf.org/rfc/rfc2663.txt, printed Oct. 11, 2000, 26 pages.
“Mobile IP Network Access Identifier Extension for IPv4,” P. Calhoun, Sun Microsystems Laboratories, C. Perkins, Nokia Research Center, Mar. 2000, http://www.ietf.org/rfc/rfc2794.txt, printed Oct. 4, 2000, 7 pages.
“Guidelines For 64-Bit Global Identifier (EUI-64) Registration Authority,” http://standards.ieee.org/regauth/oui/tutorials/EUI64.html, printed Nov. 3, 2000, 2 pages.
International Search Report dated Oct. 7, 2002 for corresponding application, PCT/US01/28466.
Tsirtsis et al. (Feb. 2000) “Network Address Translation—Protocol Translation (NAT-PT)”, Request for Comments: 2766, Campio Communications, 16 pgs.
Gilligan et al. (Mar. 13, 1999) “Transition Mechanisms for Ipv6 Host and Routers”, Internet Draft Online!, retrieved from the Internet on Jan. 14, 2002: <URL:http://www.ietf.org/proceedings/99jul/I-D/draft-ietf-ngtrans-mech-04/txt>, pp. 1-24.
Hinden et al. (Jul. 1998) “An Ipv6 Aggregatable Global Unicast Address Format”, Internet Draft Online!, retrieved from the Internet on Jan. 14, 2002: <URL:http://www.faqs.org/rfcs/rfc2374.html>, pp. 1-8.
Templin (Mar. 2000) “An Ipv6-Ipv4 Compatibility Aggregatable Global Unicast Address Format”, Internet Draft Online!, retrieved from the Internet on Jan. 15, 2002: <URL:http://alternic.net/drafts/drafts-t-u/draft-templin-ngtrans-v6v4compat-00.txt>, pp. 1-12.
Templin (Sep. 22, 2000) “An Ipv6-Ipv4 Compatibility Aggregatable Global Unicast Address Format for Incremental Deployment of Ipv6 Nodes within Predominantly Ipv4-based Intranets”, Internet Draft Online!, retrieved from the Internet on Jan. 14, 2002: <URL:http://www.join.uni-muenster.de/drafts/draft-templin-ngtrans-v6v4compat-01.txt>, pp. 1-14.
“A Multicast Routing Protocol for Multihop Wireless Networks,” Chunhung Richard Lin and Shiang-Wei Chao, Global Telecommunications Conference—Globecomm '99, p. 235-239.

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

Reduced-overhead protocol for discovering new neighbor nodes... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Reduced-overhead protocol for discovering new neighbor nodes..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Reduced-overhead protocol for discovering new neighbor nodes... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-3592411

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