PATENT APPLICATION SERIAL NO.
`
`U.S. DEPARTMENT OF COMMERCE|
`PATENT AND TRADEMARK OFFICE
`FEE RECORD SHEET |
`
`PTO-1556 |
`
`-
`
`"
`
`*U‘S. Goverment Printing Office: 2002-489-267/69033
`
`_ 06/27/2087 HMARZT1 @a8B0B43 11821620
`"BL FCs1611
`368.68op
`@2FCsiii1 =| Sap9 gp
`@3 FCsi3i1
`aaa eg op
`@4 FC:i@ei
`.
`758.88 OP.
`85FC31262
`568 OP.
`
`.
`
`INTEL Ex.1002.001
`INTEL Ex.1002.001
`
`

`

`PTO/SBN6 (02-07)
`Approved for use through 02/28/2007. OMB 0651-0032
`U.S. Patent and Trademark Office: U.S. DEPARTMENT OF COMMERCE
`.
`.
`persons are required to respond to a collection of information unless it displays a valid OMB control number.
`Underthe Paperwork Reduction Act of 1995. no
`
`
`
`
`PATENT APPLICATION FEE DETERMINATION RECORD
`
`Substitute for Form PTO-875
`
`
`APPLICATIONASFILED — PART|
`(Columa 1)
`(Column 2)
`NUMBER FILED
`
`OR.
`
`OTHER THAN
`SMALL ENTITY
`RATE ($
`
`
`
`
`
`
`(0). oF (c
`
`NIA
`
`
`
`
`
`
`
`* if the difference in column 1 is less than zero, enter “0” in column 2.. QO:
`
`
`
`APPLICATION AS AMENDED-— PARTII
`
`
`
`
`a 5 TOTAL ©
`
`gti
`ADO'L FEE
`
`
`(37 CFR 1.16(h)) fermen[me
`AMENDMENTB
`
`
`
`BASIC FEE
`37 CFR 1,16{a).
`SEARCH FEE
`(37 CFR 1. t6(k), (0). of (mm)
`EXAMINATION FEE
`(37 CFR 1.16(0). (p). or (q))
`x “"ais 4
`TOTAL CLAIMS
`
`(37 CFR 1.16(i)) minus 20 =|°e /
`
`(37 CFR 1,16(h))
`.
`
`{f the’specification and drawings exceed 100
`
`APPLICATION SIZE
`
`sheets of paper, the application size fee due
`
`FEE
`is $250 ($125 for small entity) for each
`
`
`
`. additional 50 sheets or fraction thereof. See
`(37 CFR 1,16(s))
`
`.16(S).
`35 U.S.C. 41(a)(1
`
`MULTIPLE DEPENDENT CLAIM PRESENT (37 CFR 1.169)
`:
`7
`
`,°a
`
`+8
`
`
`
`
`OTHER THAN
`
`SMALL ENTITY
`
`
`
`ADDI-
`"TIONAL
`
`
`RATE($)
`
`x$60 =
`
`
`
`(Column 1)
`CLAIMS
`
`REMAINING
`
`
`_ AFTER’
`AMENDMENT
`
`
`
`
`
`(Cotumn 3)
`
`PRESENT
`EXTRA
`
`=
`
`1
`
`AODI-
`TIONAL
`$
`
`.
`
`.
`
`{Column 2)
`HIGHEST
`
`
`NUMBER
`PREVIOUSLY
`PAID FOR
`
`
`
`
`
`
`
`
`
`<
`b
`>
`Total
`Wi].
`Sf 7 cre tren
`g|ser ae $200
`Zl TcFR i.s6m)
`uw
`S| Application Size Fee (37 CFR 1.16(s))|$260|
`<
`FIRST PRESENTATION OF MULTIPLE DEPENDENT CLAIM (37 CFR 1.16(j))
`+369 a PO
`
`(Column 1)
`CLAIMS
`
`REMAINING
`
`
`AFTER
`AMENDMENT
`
`
`(97 CFR 1.160)
`independent
`
`(Column 2)
`HIGHEST
`NUMBER
`PREVIOUSLY
`P
`
`(Column 3)
`"
`PRESENT
`EXTRA
`
`ADOI-
`
`
`TIONAL
`
` Application Size Fee (37 CFR 1.16(s))
`FIRST PRESENTATION OF MULTIPLE DEPENDENT CLAIM (37 CFR 1.16())
`
`
`
`ADO'L FEE
`ADD'L FEE
`
`
`
`
`
`* Ifthe entry in column1 is less than the entry in column 2,write “0” in column 3.
`** if the “HighestNumber Previously Paid For" IN THIS SPACE isless than 20, enter °20".
`
`*** If the “Highest Number Previously Paid For’ IN THIS SPACE is tess than 3, enter “3".
`
`
`;
`The “Highest NumberPreviously Paid For" (Total or Independent) is the highest number foundin the appropriate box in column 1.
`
`
`This collection of information is required by 37 CFR 1.16. The information is required to obtain or retain a benefit by the public which is to file (and by the
`USPTOto process) an application. Confidentiality is governed by35 U.S.C. 122 and 37 CFR 1.14. This collection is estimated to take 12 minutes to complete,
`inctuding gathering, preparing. and submitting the completed application form to the USPTO.Timewill vary depending uponthe individual case. Any comments
`on the amount of time you require to complete this form and/or suggestions for reducing this burden, should be sent to the Chief Information Officer, U.S. Patent
`and Trademark Office, U.S. Department of Commerce, P.O. Box 1450, Alexandria, VA 22313-1450. OO NOT SEND FEES OR COMPLETED FORMS TO THIS
`ADDRESS. SEND TO: Commissionerfor Patents, P.O. Box 1450, Alexandria, VA 22313-1450.
`
`ifyou needassistance in completing the form,call1-809-PTO-9199 and select option 2.
`
`INTEL Ex.1002.002
`INTEL Ex.1002.002
`
`

`

`7) 18351 U.S. PTO
`
`IN
`062507
`“UTILITY PATENT APPLICATION TRANSMITTAL
`
`U.S. PTO
`11/821820
`06/25/2007
`
`_ ALA-006K
`
`Attorney Docket No.
`
`TO THE COMMISSIONER FOR PATENTS:
`
`Transmitted herewith is a patent application identified as follows:
`First-named inventor: Laurence B. Boucher
`Assignee: Alacritech, Inc.
`Filing Date: September 27, 2002
`Title: FAST-PATH APPARATUS FOR TRANSMITTING DATA CORRESPONDING TO A TCP CONNECTION
`
`This application claims the benefit under 35 USC §120 of(is a continuation of):
`
`“Fast-Path Apparatus For Receiving Data Corresponding to a TCP Connection”
`Serial No.: 10/260,112
`Filing Date: September 27, 2002
`Atty. Docket: ALA-006G
`Examiner: Jude Jean Gilles
`
`This application claims the benefit under 35 USC §120 of Application Serial No. 10/260,112, filed
`September 27, 2002, which in turn claims the benefit under 35 USC §120 of Application Serial No. 10/092,967,
`filed March 6, 2002, which in turn claims the benefit under 35 USC §120 of Application Serial No. 10/023,240,
`filed December 15, 2001, which in turn claims the benefit under 35 USC §120 of Application Serial No.
`09/464,283, filed December 15, 1999, which in turn claims the benefit under 35 USC §120 of Application Serial
`No. 09/439,603, filed November 12, 1999, which in turn claims the benefit under 35 USC §120 of Application
`Serial No. 09/067,544, filed April 27, 1998, which in turn claims the benefit under 35 USC §119 of Provisional
`Application Serial No. 60/061,809, filed October 14, 1997.
`
`This application also claims the benefit under 35 USC §120 of Application Serial No. 09/384,792, filed
`August 27, 1999, which in turn claims the benefit under 35 USC §120 of Application Serial No. 09/141,713, filed
`August 28, 1998, which in turn claims the benefit under 35 USC §119 of Provisional Application Serial No.
`60/098,296,filed August 27, 1998.
`
`This application also claims the benefit under 35 U.S.C. §120 of the following:
`. Patent Application Serial No.
`09/416,925 (ALA-005), filed October 13, 1999;
`_ 09/514,425 (ALA-007), filed February 28, 2000;
`. Patent Application Serial No
`. Patent Application Serial No.
`09/675,484 (ALA-010A), filed September 29, 2000;
`09/675,700 (ALA-010B),filed September 29, 2000;
`. Patent Application Serial No.
`. Patent Application Serial No.
`09/789,366 (ALA-013), filed February 20, 2001;
`. Patent Application Serial No.
`09/801,488 (ALA-011), filed March 7, 2001;
`09/802,551 (ALA-012), filed March 9, 2001;
`. Patent Application Serial No.
`09/802,426 (ALA-014), filed March 9, 2001;
`. Patent Application Serial No.
`09/802,550 (ALA-015), filed March 9, 2001;
`. Patent Application Serial No.
`09/855,979 (ALA-016), filed March 14, 2001; and
`. Patent Application Serial No.
`. 09/970, 124 (ALA-020), filed October 2, 2001.
`. Patent Application Serial No
`
`“
`
`The specification contains a statement claimingpriority under 35 USC § 120 and claiming the benefit under
`35 U.S.C. §119.
`The entire disclosure of each of the prior applications (10/092,967; 10/023,240; 09/464,283; 09/439,603;
`09/067,544; 09/384,792; 09/141,713; 09/416,925; 09/514,425; 09/675,484; 09/675,700; 09/789,366;
`09/80 1,488; 09/802,551; 09/802,426; 09/802,550; 09/855,979; 09/970,124) is considered as being part of the
`disclosure of the accompanying application and is hereby incorporated by reference therein.
`The entire disclosure of each of the prior provisional applications (60/061 ,809; 60/098,296) is considered as
`being part of the disclosure of the accompanying application and is hereby incorporated by reference therein.
`
`(X)
`
`INTEL Ex.1002.003
`INTEL Ex.1002.003
`
`

`

`Enclosedare:
`
`pages Specification
`145
`pages Claims
`4
`page Abstract
`1
`89—spages Drawings
`4
`pages Declaration/Power of Attorney from prior
`application 10/092,967 (signed - copy)
`pages Declaration/Power of Attorney from prior
`application 10/092,967 (signed - copy)
`page CD Appendix Transmittal Letter
`CD Appendix (two copies) |
`A checkforfiling fee ($1800.00)
`
`tN
`xX
`Xx
`
`4
`
`Newly Executed Declaration Not Required:
`A newly executed declaration is not filed in this application because, under 37 CFR 1.63(d)(1), a newly executed
`declaration is not required because: prior application contained a declaration as prescribed by 37 CFR 1.63;
`the
`continuation application (this application) is filed by all of the inventors named in the prior application; the specification
`and drawings in the continuation application (this application) contain no matter that would have been new matter in the
`prior application; and a copy of the executed declaration (there were two) in the prior application is being submitted in the
`continuation application (this application).
`
`The filing fee is calculated as follows:
`
`‘
`
`
`
`
`CLAIMSAS FILED
`NO. FILED
`NO. EXTRA
`Total Claims pt $50.00
`
`
`Po
`Independent Claims
`$200.00
`
`
`‘| Multiple Dependent Claims(if applicable
`
`Basic Filing Fee
`
`
`
`[UtilitySearchFee$500.00|
`
`
`
`
`
`
`
`$ 50.00
`$ 0.00
`$0.00
`$300.00
`
`I hereby certify that this is being deposited with the U.S. Postal
`Service “Express Mail Post Office to Addressee” service under.
`37 CFR § 1.10 on the date indicated below andis addressed to:
`
`MS Patent Application
`Commissionerfor Patents
`P.O. Box 1450
`:
`Alexandria, VA 22313-1450
`By: EE
`Typed Name: Mark Lauer
`
`Respectfully submitted,
`
`By:
`
`
`Mark Lauer
`Reg. No. 36,578
`6601 Koll Center Parkway
`Suite 245
`Pleasanton, CA 94566
`Phone:
`(925) 484-9295
`Fax:
`(925) 484-9291
`Date: Buz 5yw 7
`
`Express Mail Label No.: EV 406928085 US
`Date ofDeposit:BYE? ,
`
`Correspondence Address:
`CUSTOMERNO.24501
`
`INTEL Ex.1002.004
`INTEL Ex.1002.004
`
`

`

`TO THE ASSISTANT COMMISSIONERFOR PATENTS:
`
`Inventors:
`
`Laurence B. Boucher,et al.
`
`Atty Docket: ALA-006K
`
`Filing Date:
`
`June 25, 2007
`
`Serial No...
`
`Unknown
`
`Title:
`
`FAST-PATH APPARATUSFOR RECEIVING DATA CORRESPONDING TO
`A TCP CONNECTION
`
`Compact Disk Transmittal Letter per 37 CFR 1.52(e)3(i))
`
`Sir:
`
`Transmitted herewith are:
`
`Two Labeled Compact Discs — Recordable (CD-R) — “Copy 1” and “Copy 2,” each in a
`
`CDcase and contained in a padded envelope.
`
`The content on the two discs is identical
`
`The machine format is: IBM-PC
`
`The operating system is: MS-Windows
`
`- The creation date of the CDs is: June 21, 2007
`
`The name, date andsize ofthe files on the CDsare listed below:
`
`There are three folders on each disc: 1) CD Appendix A,
`
`2) CD Appendix B, and
`
`3) CD Appendix C.
`
`Folder Appendix A contains twofiles:
`
`CD Appendix A Title Page.txt. Its size is 370 bytes. It was created 6/21/07.
`
`Rev.v. Its size is 84.4KB. It was created (written to disc) 6/21/07.
`
`Folder Appenidix B contains twofiles:
`
`CD Appendix B Title Page.txt. Its size is 495 bytes. It was created 6/21/07.
`
`Microcode.txt. Its size is 105 KB.
`
`It was created (written to disc) 6/21/07.
`
`Express Mail No. EV 406928085 US
`
`,
`
`1
`
`INTEL Ex.1002.005
`INTEL Ex.1002.005
`
`

`

`Folder Appendix C containsthree files:
`
`CD Appendix C Title Page.txt. Its size is 416 bytes. It was created 6/21/07.
`
`atcpsource.wrd.txt. Its size is 778 KB.
`
`It was created (written to disc) 6/21/07.
`
`simbasource.wrd.txt. Its size is 262 KB. It was created (written to disc) 6/21/07.
`
`CERTIFICATE OF MAILING
`
`Respectfully submitted,
`
`I hereby certify that this correspondenceis being deposited with
`the United States Postal Service as Express Mail Label No.
`EV406928085US in an envelope addressed to: Box PATENT
`APPLICATION, Assistant Commissionerfor Patents,
`
`Mark Lauer
`Reg. No. 36,578
`Silicon Edge Law Group LLP
`6601 Koll Center Parkway
`Suite 245
`Pleasanton, CA 94566
`Date:6257
`Tel:
`(925) 484-9295
`Fax:
`(925) 484-9291
`Mark Lauer
`
`Washington, D.C. 20231, on June 25, 2007.
`
`Express Mail No. EV 406928085 US
`
`INTEL Ex.1002.006
`INTEL Ex.1002.006
`
`

`

`ALA-006K
`
`Express Mail No. EV 406928085 US
`
`FAST-PATH APPARATUS FOR TRANSMITTING DATA
`
`CORRESPONDING TO A TCP CONNECTION
`
`Laurence B. Boucher
`
`Stephen E. J. Blightman
`
`Peter K. Craft
`
`David A. Higgen
`
`Clive M. Philbrick
`
`_ Daryl D. Starr
`
`10
`
`CROSS-REFERENCE TO RELATED APPLICATIONS
`This application claimsthe benefit under 35 U.S.C. §120of(is a continuation of) U.S.
`Patent Application Serial No. 10/260,112, entitled “FAST-PATH APPARATUS FOR
`RECEIVING DATA CORRESPONDING TO A TCP CONNECTION,”filed September 27,
`2002, by Laurence B. Boucheretal., which in turn claims the benefit under 35 U.S.C. §120 of
`
`(is a continuation of) U.S. Patent Application Serial No. 10/092,967, entitled “FAST-PATH
`
`APPARATUSFOR RECEIVING DATA CORRESPONDINGTO A TCP CONNECTION,”
`
`filed March 6, 2002, by Laurence B. Boucher etal., which in turn claims the benefit under 35
`
`U.S.C. §120 of (is a continuation-in-part of) U.S. Patent Application Serial No. 10/023,240,
`
`20
`
`entitled “TRANSMIT FAST-PATH PROCESSING ON TCP/IP OFFLOAD NETWORK
`
`INTERFACE DEVICE,”filed December 15, 2001, by Laurence B. Boucheret al., which in
`
`turn claims the benefit under 35 U.S.C. §120 of (is a continuation-in-part of) U.S. Patent
`
`Application Serial No. 09/464,283, now U.S. Patent No. 6,427,173, entitled “INTELLIGENT
`
`NETWORK INTERFACE DEVICE AND SYSTEM FOR ACCELERATED
`
`25
`
`COMMUNICATION”,filed December 15, 1999, by Laurence B. Boucheret al., which in turn
`claims the benefit under 35 U.S.C. §120 of (is a continuation-in-part of) U.S. Patent
`Application Serial No. 09/439,603, now U.S.Patent No. 6,247,060, entitled “INTELLIGENT
`
`NETWORK INTERFACE SYSTEM AND METHOD FOR ACCELERATED PROTOCOL
`
`PROCESSING”,filed November 12, 1999, by Laurence B. Boucheret al., which in turn
`
`30
`
`claims the benefit under 35 U.S.C. §120 of(is a continuation-in-part of) U.S. Patent
`
`Application Serial No. 09/067,544, now U.S. Patent No. 6,226,680, entitled “INTELLIGENT
`
`1
`
`INTEL Ex.1002.007
`INTEL Ex.1002.007
`
`

`

`ALA-006K
`
`Express Mail No. EV 406928085 US
`
`NETWORK INTERFACE SYSTEM AND METHOD FOR ACCELERATED PROTOCOL
`
`PROCESSING”, filed April 27, 1998, which in turn claims the benefit under 35 U.S.C.§
`
`119(e)(1) of the Provisional Application filed under 35 U.S.C. §111(b)entitled
`
`“INTELLIGENT NETWORK INTERFACE CARD AND SYSTEM FOR PROTOCOL
`
`PROCESSING,”Serial No. 60/061,809, filed on October 14, 1997.
`
`Application No. 10/260,112 also claims the benefit under 35 U.S.C. §120 of (is a
`
`continuation-in-part of) U.S. Patent Application Serial No. 09/384,792, now U.S. Patent No.
`
`10
`
`6,434,620, entitled “TCP OFFLOAD NETWORK INTERFACEDEVICE,”filed August 27,
`1999, which in turn claims the benefit under 35 U.S.C. §120 of (is a continuation-in-part of)
`U.S. Patent Application Serial No. 09/141,713, now U.S. Patent No. 6,389,479, entitled
`“INTELLIGENT NETWORK INTERFACE DEVICE AND SYSTEM FOR
`ACCELERATED PROTOCOL PROCESSING”,filed August 28, 1998, which both claim the
`
`benefit under 35 U.S.C. § 119(e)(1) of the Provisional Application filed under 35 U.S.C.
`
`§111(b) entitled “INTELLIGENT NETWORK INTERFACE DEVICE AND SYSTEM FOR
`
`15
`
`ACCELERATED COMMUNICATION,”Serial No. 60/098,296,filed August 27, 1998.
`
`Application No. 10/260,112 also claims the benefit under 35 U.S.C. §120 of (is a
`continuation-in-part of) U.S. Patent Application Serial No. 09/416,925, now USS.Patent No.
`6,470,415, entitled “QUEUE SYSTEM FOR MICROPROCESSORS,”filed October 13, 1999,
`
`(is a continuation-in-part of) U.S. Patent Application Serial No. 09/514,425, now U.S. Patent
`No.6,427,171, entitled “PROTOCOL PROCESSING STACK FOR USE WITH
`
`20
`
`INTELLIGENT NETWORK INTERFACE CARD,”filed February 28, 2000,(is a
`
`continuation-in-part of) U.S. Patent Application Serial No. 09/675,484, now U.S. Patent No.
`
`6,807,581, entitled “INTELLIGENT NETWORK STORAGEINTERFACESYSTEM,”filed
`
`September 29, 2000,(is a continuation-in-part of) U.S. Patent Application Serial No.
`
`25
`
`09/675,700, entitled “INTELLIGENT NETWORK STORAGE INTERFACEDEVICE,”filed
`
`September 29, 2000, (is a continuation-in-part of) U.S. Patent Application Serial No.
`
`09/789,366, now U.S. Patent No. 6,757,746, entitled “OBTAINING A DESTINATION
`
`ADDRESS SO THAT A NETWORK INTERFACE DEVICE CAN WRITE NETWORK
`
`DATA WITHOUT HEADERS DIRECTLY INTO HOST MEMORY,”filed February 20,
`
`30
`
`2001, (is a continuation-in-part of) U.S. Patent Application Serial No. 09/801,488, now U.S.
`
`Patent No. 6,687,758, entitled “PORT AGGREGATION FOR NETWORK CONNECTIONS
`
`THAT ARE OFFLOADED TO NETWORK INTERFACE DEVICES,”filed March 7, 2001,
`2
`
`INTEL Ex.1002.008
`INTEL Ex.1002.008
`
`

`

`ALA-006K
`
`|
`
`Express Mail No. EV 406928085 US
`
`(is a continuation-in-part of) U.S. Patent Application Serial No. 09/802,551, entitled
`“INTELLIGENT NETWORK STORAGE INTERFACE SYSTEM,”filed March 9, 2001, (is a
`
`continuation-in-part of) U.S. Patent Application Serial No. 09/802,426, entitled “REDUCING
`
`DELAYS ASSOCIATED WITH INSERTING A CHECKSUM INTO A NETWORK
`
`MESSAGE,”filed March 9, 2001, (is a continuation-in-part of) U.S. Patent Application Serial
`No.09/802,550, now U.S.Patent No. 6,658,480, entitled “INTELLIGENT NETWORK
`
`INTERFACE SYSTEM AND METHOD FOR ACCELERATED PROTOCOL
`
`PROCESSING,”filed March 9, 2001, (is a continuation-in-part of) U.S. Patent Application
`
`Serial No. 09/855,979, entitled “NETWORK INTERFACE DEVICE EMPLOYING DMA
`
`COMMANDQUEUE,”filed March 14, 2001, (is a continuation-in-part of) U.S. Patent
`
`Application Serial No. 09/970,124, entitled “NETWORK INTERFACE DEVICE THAT
`
`FAST-PATH PROCESSES SOLICITED SESSION LAYER READ COMMANDS,”filed
`
`October2, 2001.
`
`15
`
`The subject matter of all of the above-identified patent applications (including the
`subject matter in the Microfiche Appendix of U.S. Application Serial No. 09/464,283), and of
`the two above-identified provisional applications, is incorporated by reference herein.
`
`REFERENCE TO COMPACTDISC APPENDIX
`
`The Compact Disc Appendix (CD Appendix), whichis a part of the present disclosure,
`
`20
`
`includes three folders, designated CD Appendix A, CD Appendix B, and CD Appendix C on
`
`the compact disc. CD Appendix A contains a hardware description language (verilog code)
`
`description of an embodimentof a receive sequencer. CD Appendix B contains microcode
`
`executed by a processorthat operates in conjunction with the receive sequencer of CD
`Appendix A. CD Appendix C contains a device driver executable'on the host as well as ATCP
`code executable on the host. A portion of the disclosure of this patent document contains
`
`25
`
`material (other than any portion ofthe “free BSD”stack included in CD Appendix C) whichis
`
`subject to copyright protection. The copyright ownerof that material has no objection to the
`
`facsimile reproduction by anyone of the patent documentor the patent disclosure, as it appears
`
`in the Patent and Trademark Office patent files or records, but otherwise reservesall copyright
`
`30
`
`rights.
`
`INTEL Ex.1002.009
`INTEL Ex.1002.009
`
`

`

`ALA-006K
`
`Express Mail No. EV 406928085 US
`
`TECHNICAL FIELD
`
`The presentinvention relates generally to computeror other networks, and more
`
`particularly to processing of information communicated between hosts such as computers
`
`connected to a network.
`
`BACKGROUND
`
`The advantages of network computing are increasingly evident. The convenience and
`
`efficiencyof providing information, communication or computational power to individuals at
`their personal computer or other end user devices has led to rapid growthof such network
`
`10
`
`computing, including internet as well as intranet devices and applications.
`
`15
`
`20
`
`25
`
`Asis well known, most network computer communication is accomplished with the aid of
`a layered software architecture for moving information between host computers connected to
`the network. The layers help to segregate information into manageable segments, the general
`
`functions of each layer often based on an international standard called Open Systems
`Interconnection (OSI). OSIsets forth seven processing layers through which information may
`pass whenreceived bya host in order to be presentable to an end user. Similarly, transmission
`of information from a host to the network maypass through those seven processing layers in
`reverse order. Each step of processing and service by a layer may include copying the
`processed information. Another reference modelthat is widely implemented, called TCP/IP
`(TCPstandsfor transport control protocol, while IP denotes internet protocol) essentially
`
`employsfive of the seven layers of OSI.
`
`Networks may include, for instance, a high-speed bus such as an Ethernet connection or an
`
`internet connection between disparate local area networks (LANs), each of which includes
`
`multiple hosts, or any of a variety of other known meansfor data transfer between hosts.
`
`According to the OSI] standard, physical layers are connected to the network at respective
`hosts, the physical layers providing transmission and receipt of raw data bits via the network.
`A data link layer is serviced by the physical layer of each host,the data link layers providing
`frame division anderrorcorrection to the data received from the physical layers, as well as
`processing acknowledgmentframessent by the receiving host. A network layer of each hostis
`
`30
`
`serviced by respective data link layers, the network layers primarily controlling size and
`
`coordination of subnets of packets of data.
`
`INTEL Ex.1002.010
`INTEL Ex.1002.010
`
`

`

`ALA-006K.
`
`Express Mail No. EV 406928085.US
`
`k
`
`A transport layer is serviced by each network layer and a session layer is serviced by each
`transport layer within each host. Transport layers accept data from their respective session
`layers and split the data into smaller units for transmission to the other host’s transport layer,
`
`which concatenates the data for presentation to respective presentation layers. Session layers
`
`allow for enhanced communication control between the hosts. Presentation layers are serviced
`
`by their respective session layers, the presentation layers translating between data semantics
`
`and syntax which maybepeculiar to each host and standardized structures of data
`
`representation. Compression and/or encryption of data may also be accomplished at the
`presentation level. Application layers are serviced by respective presentation layers, the
`application layers translating between programsparticular to individual hosts and standardized
`
`10
`
`programsfor presentation to either an application or an end user. The TCP/IP standard
`
`includes the lower four layers and application layers, but integrates the functions of session
`
`layers and presentation layers into adjacent layers. Generally speaking, application,
`
`presentation and session layers are defined as upper layers, while transport, network and data
`
`15
`
`link layers are defined as lowerlayers.
`
`Therules and conventions for each layer are called the protocol of that layer, and since the
`
`protocols and general functions of each layer are roughly equivalent in varioushosts,it is
`useful to think of communication occurring directly betweenidentical layers of different hosts,
`even though these peer layers do not directly communicate without information transferring
`
`20
`
`sequentially through each layer below. Each lower layer performsa service for the layer
`
`immediately aboveit to help with processing the communicated information. Each layer saves
`
`the information for processing and service to the next layer. Due to the multiplicity of
`
`hardware and software architectures, devices and programs commonly employed,each layeris
`
`necessary to insure that the data can makeit to the intended destination in the appropriate
`
`25
`
`form, regardless of variations in hardware and software that may intervene.
`
`In preparing data for transmission fromafirst to a second host, some control data is added
`at each layer ofthe first host regarding the protocolofthat layer, the control data being
`indistinguishable from the original (payload) data for all lower layers of that host. Thus an
`
`application layer attaches an application header to the payload data and sends the combined
`data to the presentation layer of the sending host, which receives the combined data, operates
`
`30
`
`on it and adds a presentation headerto the data, resulting in another combined data packet.
`
`The data resulting from combination of payload data, application header and presentation
`5
`
`INTEL Ex.1002.011
`INTEL Ex.1002.011
`
`

`

`ALA-006K
`
`SS
`
`Express Mail No. EV 406928085 US
`
`headeris then passed to the session layer, which performs required operations including
`
`attaching a session headerto the data and presenting the resulting combination of data to the
`
`transport layer. This process continuesas the information movesto lowerlayers, with a
`transport header, network header and data link headerandtrailer attached to the data at each of
`
`those layers, with each step typically including data moving and copying, before sending the
`
`data as bit packets over the network to the second host.
`The receiving host generally performs the converse of the above-described process,
`beginningwith receiving the bits from the network, as headers are removed and data processed
`in order from the lowest(physical) layer to the highest (application) layer before transmission
`
`10
`
`to a destination of the receiving host. Each layer of the receiving host recognizes and
`
`manipulates only the headers associated with that layer, since to that layer the higher layer
`
`control data is included with and indistinguishable from the payload data. Multiple interrupts,
`valuable central processing unit (CPU) processing time and repeated data copies may also be
`necessary for the receiving host to place the data in an appropriate form atits intended
`
`15
`
`destination.
`
`The abovedescription of layered protocol processing is simplified, as college-level
`textbooks devoted primarily to this subject are available, such as Computer Networks, Third
`Edition (1996) by Andrew S. Tanenbaum, whichis incorporated herein by reference. As
`defined in that book, a computer network is an interconnected collection of autonomous
`
`20
`
`computers, such as internet and intranet devices, including local area networks (LANs), wide:
`
`area networks (WANs), asynchronoustransfer mode (ATM),ring or token ring, wired,
`
`wireless, satellite or other means for providing communication capability between separate
`
`processors. A computeris defined herein to include a device having both logic and memory
`
`functions for processing data, while computers or hosts connected to a network are said to be
`heterogeneousif they function according to different operating devices or communicate via
`different architectures.
`
`As networks grow increasingly popular and the information communicated thereby
`
`becomesincreasingly complex and copious, the need for such protocol processing has
`increased. It is estimated that a large fraction ofthe processing powerof a host CPU may be
`devoted to controlling protocol processes, diminishing the ability of that CPU to perform other
`
`tasks. Network interface cards have been developed to help with the lowest layers, such as the
`
`physical and data link layers. It is also possible to increase protocol processing speed by
`6 -
`
`25
`
`30
`
`INTEL Ex.1002.012
`INTEL Ex.1002.012
`
`

`

`ALA-006K
`
`.
`
`Express Mail No. EV 406928085 US
`
`simply adding more processing power or CPUsaccording to conventional arrangements. This
`
`solution, however, is both awkward and expensive. But the complexities presented by various
`
`networks, protocols, architectures, operating devices and applications generally require
`
`extensive processing to afford communication capability between various network hosts.
`
`SUMMARYOF THE INVENTION
`
`The current invention provides a device for processing network communication that greatly
`
`increases the speed of that processing andthe efficiency of transferring data being
`
`communicated. The invention has been achieved by questioning the long-standing practice of
`
`10
`
`performing multilayered protocol processing on a general-purposeprocessor. The protocol
`
`15
`
`20
`
`processing method andarchitecture that results effectively collapses the layers of a connection-
`
`based, layered architecture such as TCP/IP into a single wider layer whichis able to send
`
`network data more directly to and from a desired location or buffer on a host. This accelerated
`
`processing is provided to a host for both transmitting and receiving data, and so improves
`performance whetheroneor both hosts involved inan exchangeofinformation have such a
`feature.
`
`The accelerated processing includes employing representative controlinstructions for a
`
`given messagethat allow data from the messageto be processed via a fast-path which accesses
`
`message data directly at its source or delivers it directly to its intended destination. This fast-
`path bypasses conventional protocol processing ofheaders that accompany the data. The fast-
`path employsa specialized microprocessor designed for processing network communication,
`
`avoiding the delays andpitfalls of conventional software layer processing, such as repeated
`copying andinterrupts to the CPU. In effect, the fast-path replaces the states that are
`traditionally found in several layers of a conventional network stack with a singlestate
`
`25
`
`machine encompassing all those layers, in contrast to conventional rules that require rigorous
`
`differentiation and separation of protocol layers. The host retains a sequential protocol
`
`processing stack which can be employed forsetting up a fast-path connection or processing
`message exceptions. The specialized microprocessorandthe host intelligently choose whether
`a given messageor portion of a messageis processed by the microprocessoror the host stack.
`
`30
`
`One embodimentis a method of generating a fast-path response to a packet received onto a
`networkinterface device where the packet is received over a TCP/IP network connection and
`where the TCP/IP network connection is identified at least in part by a TCP source port, a TCP
`7
`oo
`oe
`
`INTEL Ex.1002.013
`INTEL Ex.1002.013
`
`

`

`ALA-006K
`
`.
`
`Express Mail No. EV 406928085 US
`
`destination port, an IP source address, and an IP destination address. The method comprises:
`1) Examining the packet and determining from the packet the TCP sourceport, the TCP
`destination port, the IP source address, and the IP destination address; 2) Accessing an
`appropriate template header stored on the network interface device. The template header has
`
`TCPfields and IP fields; 3) Employinga finite state machine that implements both TCP
`
`protocol processing and IP protocol processingto fill in the TCP fields and IP fields of the
`
`template header; and 4) Transmitting the fast-path response from the network interface device.
`
`The fast-path response includesthefilled in template header and a payload. Thefinite state
`
`machine doesnot entail a TCP protocol processing layer and a discrete IP protocol processing
`
`10
`
`layer where the TCP and JP layers are executed one after another in sequence. Rather, the
`
`finite state machine covers both TCP andIP protocol processing layers.
`In one embodiment, buffer descriptors that point to packets to be transmitted are pushed
`
`onto a plurality of transmit queues. A transmit sequencer pops the transmit queues and obtains
`the buffer descriptors. The buffer descriptors are then used to retrieve the packets from buffers
`where the packets are stored. The retrieved packets are then transmitted from the network
`
`interface device. In one embodiment, there are two transmit queues, one having a higher
`transmission priority than the other. Packets identified by buffer descriptors on the higher
`
`priority transmit queue are transmitted from the network interface device before packets
`
`identified by the lowerpriority transmit queue.
`Other structures and methodsare disclosed in the detailed description below. This
`summary does not purport to define the invention. The invention is defined by the claims.
`
`15
`
`20
`
`BRIEF DESCRIPTION OF THE DRAWINGS
`
`FIG. 1 is a plan view diagram ofa device ofthe present invention, including a host
`
`25
`
`computer having a communication-processing device for accelerating network
`
`communication.
`
`FIG. 2 is a diagram of information flow for the host of FIG. 1 in processing network
`communication, including a fast-path, a slow-path and a transfer of connection context
`between the fast and slow-paths.
`
`30
`
`FIG. 3 is a flow chart of message receiving according to the present invention.
`
`FIG.4A is a diagram of information flow for the host of FIG. 1 receiving a message packet
`processed by the slow-path.
`
`INTEL Ex.1002.014
`INTEL Ex.1002.014
`
`

`

`ALA-006K
`
`Express Mail No. EV 406928085 US
`
`FIG.4B is a diagram of information flow for the host of FIG. 1 receiving aninitial message
`
`packet processed by the fast-path.
`
`FIG.4C is a diagram of information flow for the host of FIG. 4B receiving a subsequent
`
`message packet processedby the fast-path.
`
`FIG.4D is a diagram of information flow for the host of FIG. 4C receiving a message
`
`packet having an error that causes processing to revert to the slow-path.
`
`FIG. 5 is a diagram of information flow for the host of FIG. 1 transmitting a message by
`
`either the fast or slow-paths.
`
`FIG.6 is a diagram of information flow for a first embodimentofan intelligent network
`
`10
`
`interface card (INIC) associated with a client having a TCP/IP processing stack.
`
`FIG.7 is a diagram of hard