Storing and searching a hierarchy of policies and...

Details Storing and searching a hierarchy of policies and... Storing and searching a hierarchy of policies and...

2005-11-13

2009-02-17

Robinson, Greta L (Department: 2169)

Data processing: database and file management or data structures

Database design

Data structure types

C711S101000

Reexamination Certificate

active

07493328

ABSTRACT:
Mechanisms for storing and searching a hierarchy of policies and associations thereof are disclosed which may be particularly useful for implementing security protocols, such as, but not limited to Internet Protocol security (IPsec). For example, a hierarchy of policies is stored in a search priority order in an associative memory, with each association of a particular policy stored higher in the search priority than its associated policy and after any other policy. Therefore, a lookup operation on the associative memory will identify a matching association, if one, else its matching policy. A match of a policy instead of an association may result in a corresponding association being added in the appropriate location. For IPsec implementations, the lookup word is typically derived from the packet, with this packet being typically processed based on the identified policy or association.

REFERENCES:
patent: 3648264 (1972-03-01), Beausoleil
patent: 4296475 (1981-10-01), Nederlof et al.
patent: 4791606 (1988-12-01), Threewitt et al.
patent: 4996666 (1991-02-01), Duluk, Jr.
patent: 5339076 (1994-08-01), Jiang
patent: 5383146 (1995-01-01), Threewitt
patent: 5404482 (1995-04-01), Stamm et al.
patent: 5428565 (1995-06-01), Shaw
patent: 5440715 (1995-08-01), Wyland
patent: 5450351 (1995-09-01), Heddes
patent: 5684954 (1997-11-01), Kaiserswerth et al.
patent: 5802567 (1998-09-01), Liu et al.
patent: 5841874 (1998-11-01), Kempke et al.
patent: 5852569 (1998-12-01), Srinivasan et al.
patent: 5956336 (1999-09-01), Loschke et al.
patent: 5978885 (1999-11-01), Clark, II
patent: 6038560 (2000-03-01), Wical
patent: 6041389 (2000-03-01), Rao
patent: 6047369 (2000-04-01), Colwell et al.
patent: 6069573 (2000-05-01), Clark, II et al.
patent: 6081440 (2000-06-01), Washburn et al.
patent: 6134135 (2000-10-01), Andersson
patent: 6137707 (2000-10-01), Srinivasan et al.
patent: 6154384 (2000-11-01), Nataraj et al.
patent: 6175513 (2001-01-01), Khanna
patent: 6181698 (2001-01-01), Hariguchi
patent: 6199140 (2001-03-01), Srinivasan et al.
patent: 6240003 (2001-05-01), McElroy
patent: 6246601 (2001-06-01), Pereira
patent: 6307855 (2001-10-01), Hariguchi
patent: 6374326 (2002-04-01), Kansal et al.
patent: 6389506 (2002-05-01), Ross et al.
patent: 6470332 (2002-10-01), Weschler
patent: 6526474 (2003-02-01), Ross
patent: 6535951 (2003-03-01), Ross
patent: 6546391 (2003-04-01), Tsuruoka
patent: 6567812 (2003-05-01), Garrecht et al.
patent: 6606681 (2003-08-01), Uzun
patent: 6651096 (2003-11-01), Gai et al.
patent: 6658002 (2003-12-01), Ross et al.
patent: 6658458 (2003-12-01), Gai et al.
patent: 6687144 (2004-02-01), Batson et al.
patent: 6715029 (2004-03-01), Trainin et al.
patent: 6717946 (2004-04-01), Hariguchi et al.
patent: 6725326 (2004-04-01), Patra et al.
patent: 6738862 (2004-05-01), Ross et al.
patent: 6775737 (2004-08-01), Warkhede et al.
patent: 6862281 (2005-03-01), Chandrasekaran
patent: 6871262 (2005-03-01), Oren et al.
patent: 6871265 (2005-03-01), Oren et al.
patent: 7107464 (2006-09-01), Shapira et al.
patent: 7158519 (2007-01-01), Kanakubo
patent: 2001/0042204 (2001-11-01), Blaker et al.
patent: 2003/0028804 (2003-02-01), Noehring et al.
patent: 2003/0229636 (2003-12-01), Mattausch et al.
patent: 2003/0231631 (2003-12-01), Pullela
patent: 2004/0024757 (2004-02-01), Park et al.
patent: 2004/0030802 (2004-02-01), Eatherton et al.
patent: 2004/0030803 (2004-02-01), Eatherton et al.
S. Kent and R. Atkinson, “Security Architecture for the Internet Protocol,” RFC 2401, Nov. 1998, 66 pages, Internet Engineering Task Force, www.ietf.org.
Jon P. Wade and Charles G. Sodini, “A Ternary Content Addressable Search Engine,” IEEE Journal of Solid-State Circuits, vol. 24, No. 4, Aug. 1989, pp. 1003-1013.
Teuvo Kohonen, Content-Addressable Memories, 1987, pp. 128-129 and 142-144, Springer-Verlang, New York.
Brian Dipert, ed., “Special-purpose SRAMs Smooth the Ride,” EDN, Jun. 24, 1999, pp. 93-104.
“What is a CAM (Content-Addressable Memory)?.” Application Brief AB-N6, Rev. 2a, Music Semiconductors, Milpitas, CA, Sep. 30, 1998, 4 pages.
“Reading Out the Valid LANCAM Memory Entries.” Application Brief AB-N4, Rev. 1a, Music Semiconductors, Milpitas. CA, Sep. 30, 1998, 4 pages.
“Extending the LANCAM Comparand,” Application Brief AB-N3, Rev. 1.0a Draft, Music Semiconductors, Milpitas, CA, Sep. 30, 1998, 4 pages.
“Advantages of CAM in ASIC-Based Network Address Processing,” Application Brief AB-N11, Rev. 1.2a Draft, Music Semiconductors, Milpitas, CA, Sep. 30, 1998, 4 pages.
“Virtual Memory Applications of the MU9C1480A LANCAM,” Application Note AN-N3, Rev. 1a, Music Semiconductors, Milpitas, CA, Sep. 30, 1998, 12 pages.
“Using the MU9C1965A LANCAM MP for Data Wider than 128 Bits,” Application Note AN-N19, Rev. 1a, Music Semiconductors, Milpitas, CA, Sep. 30, 1998, 16 pages.
“Fast IPv4 and IPv4 CIDR Address Translation and Filtering Using the MUAC Routing CoProcessor (RCP),” Application Note AN-N25, Rev. 0a, Music Semiconductors, Milpitas, CA, Oct. 1, 1998, 16 pages.
“Using Music Devices and RCPs for IP Flow Recognition,” Application Note AN-N27, Rev. 0, Music Semiconductors, Milpitas, CA, Oct. 21, 1998, 20 pages.
“Wide Ternary Searches Using Music CAMs and RCPs,” Application Note AN-N31, Rev. 0, Music Semiconductors, Milpitas, CA, Apr. 13, 1999, 8 pages.
Anthony McAuley and Paul Francis, “Fast Routing Table Lookup Using CAMs,” Networking: Foundation for the Future, Proceedings of the Annual Joint Conference of the Computer and Communications Societies, Los Alamitos, Mar. 28, 1993, pp. 1382-1391, vol. 2, Conf 12.
Tong-Bi Pei and Charles Zukowski, “VLSI Implementation of Routing Tables: Tries and CAMS,” Networking in the Nineties, Proceedings of the Annual Joint Conference of the Computer and Communications Societies, New York, Apr. 7, 1991, pp. 515-524, vol. 2, Conf. 10.
Zao et al, Domain Based Internet Security Policy Management, DARPA Information Survivability Conference and Exposition, 2000. DISCEX '00. Proceedings vol. 1, 25-27, Jan. 2000, pp. 41-53.

Affiliated with

Also associated with

Rating

Storing and searching a hierarchy of policies and... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Storing and searching a hierarchy of policies and..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Storing and searching a hierarchy of policies and... will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-4057514