Multiplex communications – Network configuration determination – Using a particular learning algorithm or technique
Reexamination Certificate
2000-12-08
2008-09-09
Pham, Chi H. (Department: 2616)
Multiplex communications
Network configuration determination
Using a particular learning algorithm or technique
C370S392000, C370S395310, C370S395700, C370S408000, C709S242000, C711S150000, C711S157000, C711S168000
Reexamination Certificate
active
07423981
ABSTRACT:
A method and apparatus for performing an incremental update of a lookup table while the lookup table is available for searching is presented. To add or delete a route, a second set of routes is stored in a second memory space in the lookup table, while access is provided to the first set of routes stored in a first memory space in the lookup table. Access is provided to the first memory space through a first pointer stored in a subtree entry. After storing the second set of routes in the second memory space, access is switched to the first set of routes in the first memory space by replacing the first pointer stored in the subtree entry with a second pointer to the second memory space.
REFERENCES:
patent: 4450525 (1984-05-01), Demuth et al.
patent: 4661658 (1987-04-01), Matyas
patent: 5202986 (1993-04-01), Nickel
patent: 5329618 (1994-07-01), Moati et al.
patent: 5359724 (1994-10-01), Earle
patent: 5384568 (1995-01-01), Grinberg et al.
patent: 5386413 (1995-01-01), McAuley et al.
patent: 5479401 (1995-12-01), Bitz et al.
patent: 5561786 (1996-10-01), Morse
patent: 5787151 (1998-07-01), Nakatsu et al.
patent: 5857196 (1999-01-01), Angle et al.
patent: 5946679 (1999-08-01), Ahuja et al.
patent: 6014659 (2000-01-01), Wilkinson et al.
patent: 6034958 (2000-03-01), Wicklund
patent: 6067574 (2000-05-01), Tzeng
patent: 6085188 (2000-07-01), Bachmann et al.
patent: 6141655 (2000-10-01), Johnson et al.
patent: 6189143 (2001-02-01), Simonyi
patent: 6223172 (2001-04-01), Hunter et al.
patent: 6247014 (2001-06-01), Ladwig et al.
patent: 6266706 (2001-07-01), Brodnik et al.
patent: 6338079 (2002-01-01), Kanamori et al.
patent: 6452908 (2002-09-01), Yamada et al.
patent: 6460112 (2002-10-01), Srinivasan et al.
patent: 6512766 (2003-01-01), Wilford
patent: 6526055 (2003-02-01), Perlman et al.
patent: 6553002 (2003-04-01), Bremer et al.
patent: 6563823 (2003-05-01), Przygienda et al.
patent: 6570866 (2003-05-01), Murase et al.
patent: 6658482 (2003-12-01), Chen et al.
patent: 6687247 (2004-02-01), Wilford et al.
patent: 6744775 (2004-06-01), Beshai et al.
patent: 2001/0056417 (2001-12-01), Cao et al.
patent: 2002/0091856 (2002-07-01), Brown
patent: 0453707 (1991-10-01), None
patent: WO 99/14606 (1999-03-01), None
patent: WO 99/14906 (1999-03-01), None
patent: WO 01/10097 (2001-02-01), None
Degermark Mikael et al., “Small Forwarding Tables for Fast Routing Lookups”, Department of Computer Science and Electrical Engineering, Luleå University of Technology, Sweden,SigComm '97 Cannes, Francepp. 3-14 (1997).
Hom Shick
McDonnell Boehnen & Hulbert & Berghoff LLP
Pham Chi H.
SAtech Group A.B. Limited Liability Company
LandOfFree
Method and apparatus for an incremental update of a longest... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Method and apparatus for an incremental update of a longest..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method and apparatus for an incremental update of a longest... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3989472