Compact packet operation device and method

Multiplex communications – Communication over free space – Having a plurality of contiguous regions served by...

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C370S351000, C370S352000, C370S355000, C370S356000, C370S395310, C370S389000, C370S397000, C370S491000, C370S393000, C455S418000, C455S419000, C455S420000, C455S422100, C455S450000, C709S240000

Reexamination Certificate

active

07869411

ABSTRACT:
A network device and a method of handling a frame in a network device defining a common header for each rule in a rules table of a search engine, wherein the common header comprises a source port specifying a corresponding rule to be applied to a port or ports, and a frame format specifying a format applied to the corresponding rule. A port receives a frame, with the frame having multiple field values. A pre-parser parses the received frame to obtain the field values and corresponding slices. A search engine receives the slices and determines matches between the slices and the common header of each rule in the rules table. A policy table performs indexing based on the determined matches to obtain an action entry. An action resolution takes an action based on the obtained action entry.

REFERENCES:
patent: 5414704 (1995-05-01), Spinney
patent: 5423015 (1995-06-01), Chung
patent: 5473607 (1995-12-01), Hausman et al.
patent: 5555398 (1996-09-01), Raman
patent: 5610905 (1997-03-01), Murthy et al.
patent: 5644784 (1997-07-01), Peek
patent: 5761424 (1998-06-01), Adams et al.
patent: 5802052 (1998-09-01), Venkataraman
patent: 5802287 (1998-09-01), Rostoker et al.
patent: 5831980 (1998-11-01), Varma et al.
patent: 5878043 (1999-03-01), Casey
patent: 5892922 (1999-04-01), Lorenz
patent: 5898689 (1999-04-01), Kumar et al.
patent: 5909686 (1999-06-01), Muller et al.
patent: 5940596 (1999-08-01), Rajan et al.
patent: 5951651 (1999-09-01), Lakshman et al.
patent: 6011795 (2000-01-01), Varghese et al.
patent: 6041053 (2000-03-01), Douceur et al.
patent: 6119196 (2000-09-01), Muller et al.
patent: 6154775 (2000-11-01), Coss et al.
patent: 6173384 (2001-01-01), Weaver et al.
patent: 6246680 (2001-06-01), Muller et al.
patent: 6259699 (2001-07-01), Opalka et al.
patent: 6272516 (2001-08-01), Angle et al.
patent: 6289013 (2001-09-01), Lakshman et al.
patent: 6335935 (2002-01-01), Kadambi et al.
patent: 6341130 (2002-01-01), Lakshman et al.
patent: 6553005 (2003-04-01), Skirmont et al.
patent: 6591299 (2003-07-01), Riddle et al.
patent: 6606681 (2003-08-01), Uzun
patent: 6651099 (2003-11-01), Dietz et al.
patent: 6704794 (2004-03-01), Kejriwal et al.
patent: 6775245 (2004-08-01), Ishida et al.
patent: 6807179 (2004-10-01), Kanuri et al.
patent: 6904057 (2005-06-01), Sarkinen et al.
patent: 6977930 (2005-12-01), Epps et al.
patent: 7002965 (2006-02-01), Cheriton
patent: 7095738 (2006-08-01), Desanti
patent: 7167443 (2007-01-01), Dantu et al.
patent: 7170893 (2007-01-01), Rajan et al.
patent: 7187694 (2007-03-01), Liao
patent: 7200144 (2007-04-01), Terrell et al.
patent: 7233597 (2007-06-01), Kumar et al.
patent: 7317723 (2008-01-01), Guru et al.
patent: 7406088 (2008-07-01), Magd et al.
patent: 7464181 (2008-12-01), Corl et al.
patent: 7606263 (2009-10-01), Parker
patent: 2001/0021189 (2001-09-01), Shiota
patent: 2002/0116526 (2002-08-01), Brown
patent: 2003/0053414 (2003-03-01), Akahane et al.
patent: 2003/0076830 (2003-04-01), Asano
patent: 2003/0152078 (2003-08-01), Henderson et al.
patent: 2003/0156586 (2003-08-01), Lee et al.
patent: 2003/0225881 (2003-12-01), Saxena et al.
patent: 2004/0062267 (2004-04-01), Minami et al.
patent: 2004/0100950 (2004-05-01), Basu et al.
patent: 2004/0215870 (2004-10-01), Chow et al.
patent: 2004/0215917 (2004-10-01), Lambeth et al.
patent: 2005/0105912 (2005-05-01), Laufer
patent: 2005/0125424 (2005-06-01), Herriott et al.
patent: 2005/0135399 (2005-06-01), Baden et al.
patent: 2005/0226235 (2005-10-01), Kumar et al.
patent: 2006/0187919 (2006-08-01), Lee et al.
patent: 2008/0049774 (2008-02-01), Swenson et al.
patent: 199900944 (1999-01-01), None
Non Final Office Action for U.S. Appl. No. 10/985,033 mailed on Sep. 26, 2008, 16 pages.
Final Office Action for U.S. Appl. No. 10/985,033 mailed on May 29, 2008, 14 pages.
Non Final Office Action for U.S. Appl. No. 10/985,033 mailed on Jan. 8, 2008, 12 pages.
Non Final Office Action for U.S. Appl. No. 11/165,495 mailed on Dec. 1, 2008, 20 pages.
Non Final Office Action for U.S. Appl. No. 11/165,495 mailed on Jun. 19, 2008, 23 pages.
Office Action for U.S. Appl. No. 11/165,495, mailed on Aug. 5, 2009, 16 pages.
Office Action for U.S. Appl. No. 11/165,495, mailed on Mar. 5, 2010, 26 pages.
Advisory Action for U.S. Appl. No. 10/985,033, mailed on Oct. 22, 2009, 3 pages.
Office Action for U.S. Appl. No. 10/985,033, mailed on Feb. 4, 2010, 29 pages.
Office Action for U.S. Appl. No. 10/985,033, mailed on Jul. 21, 2009, 27 pages.
Advisory Action for U.S. Appl. No. 10/985,033, mailed on Aug. 26, 2008, 3 pages.
Office Action for U.S. Appl. No. 11/340,586, mailed on Feb. 22, 2010, 16 pages.
Office Action for U.S. Appl. No. 11/340,586, mailed on May 27, 2009, 15 pages.
Office Action for U.S. Appl. No. 11/341,643, mailed on Feb. 4, 2010, 20 pages.
Office Action for U.S. Appl. No. 11/341,643, mailed on Jun. 12, 2009, 25 pages.
U.S. Appl. No. 10/985,033 Notice of Allowance mailed Jun. 28, 2010, 25 pages.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Compact packet operation device and method does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Compact packet operation device and method, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Compact packet operation device and method will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-2701327

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.