Multiplex communications – Pathfinding or routing – Through a circuit switch
Reexamination Certificate
2008-11-05
2011-10-25
Mattis, Jason E (Department: 2461)
Multiplex communications
Pathfinding or routing
Through a circuit switch
C370S471000
Reexamination Certificate
active
08045545
ABSTRACT:
The present invention relates to systems and methods for eliminating unnecessary link state database exchanges and processes when two OSPF routers are forming a full adjacency. In particular, the invention provides methods and mechanisms for deducing information about unreachable routers from link state changes received, recording the information about the unreachable routers for a given period of time, constructing a neighbor database summary list that does not contain the LSAs that the neighbor has through using the information about the unreachable routers and reachable routers, and determining whether the neighbor router is restarted after it becomes unreachable. In addition, the present invention provides a few of options to deduce and use the information about the unreachable routers and the information in the link state database for eliminating unnecessary link state database exchanges and processes.
REFERENCES:
patent: 6757258 (2004-06-01), Pillay-Esnault
patent: 7333827 (2008-02-01), Biddiscombe et al.
patent: 2007/0019647 (2007-01-01), Roy et al.
patent: 2007/0253434 (2007-11-01), Oswal et al.
patent: 2008/0008104 (2008-01-01), Previdi et al.
patent: 1744567 (2006-03-01), None
patent: 1870503 (2006-11-01), None
patent: 101087250 (2007-12-01), None
Moy, J., 1998, The Internet Society, RFC 2328, OSPF Version 2.
Coltun, R. et al., “OSPF for IPv6,” The Internet Society, RFC 2740, 75 pages, Dec. 1999.
Moy, J., “OSPF Version 2,” The Internet Society, RFC 2328, 204 pages, Apr. 1998.
Ogier, R., “OSPF Database Exchange Summary List Optimization,” The IETF Trust, RFC 5243, 5 pages, May 2008.
International Application No. PCT/CN2008/073597, International Search Report and Written Opinion, 9 pages, Mar. 26, 2009.
Moy, J., “OSPF Version 2,” RFC 2328, Network Working Group, Standards Track, Apr. 1998, 244 pages.
Coltun, R., “The OSPF Opaque LSA Option,” RFC 2370, Network Working Group, Standards Track, Jul. 1998, 14 pages.
Murphy, P., “The OSPF Not-So-Stubby Area (NSSA) Option,” RFC 3101, Network Working Group, Standards Track, Jan. 2003, 34 pages.
Katz, D., et al. “Traffic Engineering (TE) Extensions to OSPF Version 2,” RFC 3630, Network Working Group, Standards Track, Sep. 2003, 13 pages.
Ogier, R., “OSPF Database Exchange Summary List Optimization,” OSPF Working Group, Internet-Draft, Jan. 2, 2007, 6 pages.
Ishiguro, K., et al., “Traffic Engineering Extensions to OSPF version 3,” Network Working Group, Standards Track, Jan. 3, 2007, 17 pages.
Baig Adnan
FutureWei Technologies, Inc.
Mattis Jason E
Slater & Matsil L.L.P.
LandOfFree
Intelligent database exchange for 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 Intelligent database exchange for OSPF, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Intelligent database exchange for OSPF will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-4269576