Data processing: database and file management or data structures – Database design – Data structure types
Reexamination Certificate
2007-07-24
2007-07-24
Wong, Don (Department: 2163)
Data processing: database and file management or data structures
Database design
Data structure types
C707S793000, C707S793000
Reexamination Certificate
active
10833532
ABSTRACT:
Disclosed are, inter alia, methods, apparatus, data structures, computer-readable media, mechanisms, and means for defining, creating and using tree bitmap data structures, such as for, but not limited to their use in performing lookup operations (e.g., longest prefix matching, etc.). The data structure typically includes a tree bitmap for identifying for each node of multiple nodes within a stride of a number of tree levels greater than one whether each node is a prefix or vacant node, the multiple nodes representing multiple tree levels, a lowest level subset of the multiple nodes corresponding to a lowest level of the tree levels in the stride, the lowest level subset of the multiple nodes including two or more nodes. A child bitmap is typically used for identifying which trie paths emanate and which trie paths do not emanate from the lowest level subset of the multiple nodes.
REFERENCES:
patent: 5088032 (1992-02-01), Bosack
patent: 5528701 (1996-06-01), Aref
patent: 5574910 (1996-11-01), Bialkowski et al.
patent: 5627748 (1997-05-01), Baker et al.
patent: 5651099 (1997-07-01), Konsella
patent: 5721899 (1998-02-01), Namba
patent: 5740171 (1998-04-01), Mazzola et al.
patent: 5781431 (1998-07-01), Duret et al.
patent: 5781722 (1998-07-01), Wilkinson, III et al.
patent: 5787430 (1998-07-01), Doeringer et al.
patent: 5798762 (1998-08-01), Sfarti et al.
patent: 5809501 (1998-09-01), Noven
patent: 5829004 (1998-10-01), Au
patent: 5848416 (1998-12-01), Tikkanan
patent: 5856829 (1999-01-01), Gray et al.
patent: 5857196 (1999-01-01), Angle et al.
patent: 5884297 (1999-03-01), Noven
patent: 5920857 (1999-07-01), Rishe et al.
patent: 5920886 (1999-07-01), Feldmeier
patent: 5995971 (1999-11-01), Douceur et al.
patent: 6011795 (2000-01-01), Varghese et al.
patent: 6014659 (2000-01-01), Wilkinson et al.
patent: 6018524 (2000-01-01), Turner et al.
patent: 6041053 (2000-03-01), Douceur et al.
patent: 6044408 (2000-03-01), Engstrom et al.
patent: 6067574 (2000-05-01), Tzeng
patent: 6115716 (2000-08-01), Tikkanan et al.
patent: 6141738 (2000-10-01), Munter et al.
patent: 6185559 (2001-02-01), Brin et al.
patent: 6236658 (2001-05-01), Essbaum et al.
patent: 6237061 (2001-05-01), Srinivasan et al.
patent: 6243667 (2001-06-01), Kerr et al.
patent: 6289414 (2001-09-01), Feldmeier et al.
patent: 6295576 (2001-09-01), Ogura et al.
patent: 6298339 (2001-10-01), Bjornson
patent: 6334153 (2001-12-01), Boucher et al.
patent: 6341346 (2002-01-01), Benayoun et al.
patent: 6356951 (2002-02-01), Gentry, Jr.
patent: 6560610 (2003-05-01), Eatherton et al.
patent: 6564211 (2003-05-01), Andreev et al.
patent: 6725326 (2004-04-01), Patra et al.
patent: 6728732 (2004-04-01), Eatherton et al.
patent: 6741985 (2004-05-01), Green
William N. Eatherton, Hardware-Based Internet Protocol Prefix Lookups, Master's thesis, Sever Institute, Washington University, St. Louis, MO, May 1999, 109 pages.
Donald R. Morrison, “PATRICIA—Practical Algorithm to Retrieve Information Coded in Alphanumeric,” Journal of the ACM, vol. 15, No. 4, Oct. 1968, pp. 514-534.
Waldvogel et al., “Scalable High Speed IP Routing Lookups,” Proc. SIGCOMM '97, ACM, 1997, pp. 25-36.
Lampson et al., “IP Lookups Using Multiway and Multicolumn Search,” Proc. Infocom 98, Mar. 1998, 24 pages.
V. Srinivasan and George Varghese, “Faster IP Lookups using Controlled Prefix Expansion,” ACM Sigmetrics Performance Evaluation Review, vol. 26 No. 1, Jun. 1998, p. 1-10.
Stefan Nilsson and Gunnar Karlsson, “Fast Address Look-up for Internet Routers,” Proceedings of IEEE Broadband Communications, Apr. 1998, 12 pages.
Lampson et al., “IP Lookups Using Multiway and Multicolumn Search,” IEEE Transactions on Networking, vol. 7, No. 3, Jun. 1999, pp. 324-334.
Lockwood et al., “Field Programmable Port Extender (FPX) for Distributed Routing and Queuing,” Proceedings of the ACM/SIGDA international symposium on Field programmable gate arrays, Feb. 2000, pp. 137-144.
Ruiz-Sanches et al., “Survey and Taxonomy of IP Address Lookup Algorithms,” IEEE Network Magazine, vol. 15, No. 2, Mar./Apr. 2001, pp. 8-23.
Pankaj Gupta and Nick McKewon, “Algorithms for Packet Classification,” IEEE Network Magazine, vol. 15, No. 2, Mar./Apr. 2001, pp. 24-32.
Iyer et al., “ClassiP1: An Architecture for Fast and Flexible Packet Classification,” IEEE Network Magazine, vol. 15, No. 2, Mar./Apr. 2001, pp. 33-41.
Waldvogel et al., “Scalable High Speed Prefix Matching,” ACM Transactions on Computer Systems, vol. 19, No. 4, Nov. 2001, pp. 440-482.
Devavrat Shah and Pankaj Gupta, “Fast Incremental Updates on Ternary-CAMs for Routing Lookups and Packet Classification,” Proc. Hot Interconnects VIII, Aug. 2000, Stanford. IEEE Micro, vol. 21, No. 1, Jan./Feb. 2001, 9 pages.
Waldvogel et al., “Scalable Best Matching Prefix Lookups,” PODC 98, ACM 1998, 1 page.
Radia Perlman, Interconnections: Bridges, Routers, Switches, and Internetworking Protocols, Second Edition, Addison-Wesley, 2000, pp. 347-365.
Pankaj Gupta and Nick McKeown, “Algorithms for Packet Classification,” IEEE Network Special Issue, Mar./Aprl. 2001, vol. 15, No. 2, pp. 24-32 (reprint 29 pages).
Srinivasan et al., “Packet Classification Using Tuple Space Search,” ACM Computer Communication Review, 1999. ACM SIGCOMM'99, Sep. 1999 (12 pages).
Srinivasan et al., “Fast and Scalable Layer Four Switching,” ACM Computer Communication Review, 28(4):191-202, 1998. ACM SIGCOMM'98, Sep. 1998 (12 pages).
Stefan Nilsson and Gunnar Karlsson, “IP-Address Lookup Using LC-Tries,” IEEE Journal on Selected Areas in Communications, Jun. 1999 (12 pages).
Dittia Zubin D.
Eatherton William N.
Black Linh
The Law Office of Kirk D. Williams
Washington University
Wong Don
LandOfFree
Tree bitmap data structures and their use in performing... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Tree bitmap data structures and their use in performing..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Tree bitmap data structures and their use in performing... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3744279