Multiplex communications – Network configuration determination – Using a particular learning algorithm or technique
Reexamination Certificate
2011-03-08
2011-03-08
Ton, Dang T (Department: 2475)
Multiplex communications
Network configuration determination
Using a particular learning algorithm or technique
C714S018000
Reexamination Certificate
active
07903583
ABSTRACT:
A method and apparatus for managing network communication that operate on the idea that if a new neighboring node is already reachable as represented in a shortest path data structure that the local node consults, there is no urgency in doing a full database synchronization between the local node and the neighboring node. The present invention delays database synchronization as long as possible to reduce unnecessary OSPF packets traversing communication links between nodes of the network. Since unsynchronized neighbors remain in 2-way state, OSPF updates are not flooded over the corresponding interfaces.
REFERENCES:
patent: 6295541 (2001-09-01), Bodnar et al.
patent: 6418476 (2002-07-01), Luciani
patent: 6590868 (2003-07-01), Shen
patent: 6721899 (2004-04-01), Narvaez-Guarnieri et al.
patent: 7366099 (2008-04-01), Shand
patent: 2004/0139235 (2004-07-01), Rashid et al.
patent: 2006/0166689 (2006-07-01), Phillips
patent: 2006/0198346 (2006-09-01), Liu et al.
J. Moy, “OSPF Version 2,” RFC 2328, Network Working Group, pp. 1-187, Apr. 1998.
Lindem, III Alfred C.
Roy Abhay
Cesari and McKenna LLP
Cisco Technology Inc.
Ton Dang T
Zhao Wei
LandOfFree
Unsynchronized adjacencies in OSPF does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Unsynchronized adjacencies in OSPF, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Unsynchronized adjacencies in OSPF will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-2674095