Notice of Pre-AIA or AIA Status
The present application, filed on or after March 16, 2013, is being examined under the first inventor to file provisions of the AIA .
Applicant’s arguments, filed 8/18/25, with respect to the rejection(s) of claim(s) 1 under 102 rejection have been fully considered and are persuasive. Therefore, the rejection has been withdrawn. However, upon further consideration, a new ground(s) of rejection is made below.
Claim Rejections - 35 USC § 103
In the event the determination of the status of the application as subject to AIA 35 U.S.C. 102 and 103 (or as subject to pre-AIA 35 U.S.C. 102 and 103) is incorrect, any correction of the statutory basis (i.e., changing from AIA to pre-AIA ) for the rejection will not be considered a new ground of rejection if the prior art relied upon, and the rationale supporting the rejection, would be the same under either status.
The following is a quotation of 35 U.S.C. 103 which forms the basis for all obviousness rejections set forth in this Office action:
A patent for a claimed invention may not be obtained, notwithstanding that the claimed invention is not identically disclosed as set forth in section 102, if the differences between the claimed invention and the prior art are such that the claimed invention as a whole would have been obvious before the effective filing date of the claimed invention to a person having ordinary skill in the art to which the claimed invention pertains. Patentability shall not be negated by the manner in which the invention was made.
Claim(s) 1-2, 7, 8, 13-14 and 19-20 is/are rejected under 35 U.S.C. 103 as being unpatentable over Qian (2009/0060009) in view of Patil (2024/0305987).
As per claim 1, Qian teaches the use of a method comprising: obtaining, by an access point (AP) (e.g. figure 3, element 304), a first Media Access Control Service Data Unit (MSDU) with first payload information via a link of the AP and a second MSDU with second payload information via a link of the AP (e.g. paragraph 29); determining, by the AP, that a destination of the first MSDU is same as a destination of the second MSDU (e.g. paragraph 29); generating, by the AP, an aggregation frame based on the first MSDU and the second MSDU (e.g. paragraph 29), the aggregation frame comprising the first payload information of the first MSDU and the second payload information of the second MSDU(e.g. paragraph 29, “aggregate comprising the first and second frames”); and transmitting, by the AP, the aggregation frame to the destination via a wired network (e.g. paragraph 24, “MAC processor 206 forwards the frames to Physical Layer Processor (PHY) 208 for transmission across a media” and paragraph 36 “a communication link 420 that is coupled to an external device (not shown). For example, communication interface 418 may be an integrated services digital network (ISDN) card or a modem to provide a data communication connection to a corresponding type of telephone line”.
Qian does not specifically show first and second links. Patil shows the use of first and second links (e.g., figure 1, elements 106 and paragraphs 40-44).
It would have been obvious to one of ordinary skill in the art before the effective filing date of the claimed invention to modify the invention of Qian with the above limitations of Patil because it would ensure the packets are received in the proper order.
As per claim 2, Qian teaches the use of the method of claim 1, wherein the AP supports an aggregated MSDU (AMSDU) frame format, and generating the aggregation frame based on the first MSDU and the second MSDU comprises: generating the aggregation frame based on the first MSDU and the second MSDU by using a AMSDU frame format (e.g. paragraphs 29 and 43).
As per claim 7, Qian shows the use of the method of claim 2, wherein generating the aggregation frame based on the first MSDU and the second MSDU by using the AMSDU frame format comprises: determining a sequence number for the aggregation frame based on a sequence number of the first MSDU and a sequence number of the second MSDU; and generating the aggregation frame by assigning the determined sequence number to the sequence number of the aggregation frame (e.g. paragraph 18) but does not show that the sequence numbers are in the header fields. Patil shows the use of the sequence number in the header fields (e.g. figure 5).
It would have been obvious to one of ordinary skill in the art before the effective filing date of the claimed invention to modify the invention of Qian with the above limitations of Patil because it would ensure the packets are received in the proper order.
As per claim 8, Qian shows the method of claim 7, wherein determining the sequence number for the first MSDU and the second MSDU comprises: determining a minimum value of the sequence number of the first MSDU and the sequence number of the second MSDU as the sequence number for the aggregation frame (e.g. paragraph 18, “1-1” and “2-1”); or determining a maximum value of the sequence number of the first MSDU and the sequence number of the second MSDU as the sequence number for the aggregation frame (e.g. paragraph 18, “1-4” and “2-4”).
As per claim 13, Qian teaches the use of an access point (AP) comprising: at least one processor; and a memory coupled to the at least one processor (e.g. figure 4), the memory storing instructions to cause the at least one processor to (e.g. paragraph 37): obtain a first Media Access Control Service Data Unit (MSDU) with first payload information via a first link of the AP and a second MSDU with second payload information via a second link of the AP (e.g. paragraph 29); determine that a destination of the first MSDU is same as a destination of the second MSDU (e.g. paragraph 29); generate an aggregation frame based on the first MSDU and the second MSDU, the aggregation frame comprising the first payload information of the first MSDU and the second payload information of the second MSDU (e.g. paragraph 29); and transmit the aggregation frame to the destination via a wired network (e.g. paragraphs 24 and 36).
As per claim 14, Qian teaches the use of the AP of claim 13, wherein the AP supports an aggregated MSDU (AMSDU) frame format, and the instructions to generate the aggregation frame based on the first MSDU and the second MSDU comprises instructions to: generate the aggregation frame based on the first MSDU and the second MSDU by using the AMSDU frame format (e.g. paragraph 29, 37 and 43).
As per claim 19, it is rejected for similar reasons as claim 7.
As per claim 20, it is rejected for similar reasons as claims 1 and 13.
Claim(s) 3 and 15 is/are rejected under 35 U.S.C. 103 as being unpatentable over Qian (2009/0060009) in view of Patil (2024/0305987) and further in view of Simileysky (2019/0200291).
As per claim 3, Qian does not show, but Simileysky shows the use of wherein generating the aggregation frame based on the first MSDU and the second MSDU by using the AMSDU frame format comprises: generating the aggregation frame by assigning a value indicating no encryption for data to a corresponding bit in a frame control field of the aggregation frame (e.g. paragraph 57).
It would have been obvious to one of ordinary skill in the art before the effective filing date of the claimed invention to modify the invention of Qian with the above limitations of Simileysky because it would allow for the increase of power efficiency of the network interface (i.e., sending unencrypted transmission).
As per claim 15, it is rejected for similar reasons as claim 3.
Claim(s) 4 and 16 is/are rejected under 35 U.S.C. 103 as being unpatentable over Qian (2009/0060009) in view of Patil (2024/0305987) and further in view of Ran (11064375).
As per claim 4, Qian does not show, but Ran shows the use of wherein generating the aggregation frame based on the first MSDU and the second MSDU by using the AMSDU frame format comprises: generating a virtual AP multi-link device (MLD) address and a station MLD address for the first MSDU and the second MSDU; and generating the aggregation frame by assigning the virtual AP MLD address and the station MLD address to address fields in the aggregation frame (e.g. col. 4, lines 10-32, col. 6, lines 6-15 and col. 10, lines 5-8; i.e., IP address of the server).
It would have been obvious to one of ordinary skill in the art before the effective filing date of the claimed invention to modify the invention of Qian with the above limitations of Ran because it would allow the access point to operate the virtual client without disassociating external wireless client devices which are associated with the access point.
As per claim 16, Qian does not show, but Ran shows the use of the AP of claim 14, wherein the instructions to generate the aggregation frame based on the first MSDU and the second MSDU by using the AMSDU frame format comprises instructions to: generate a virtual AP multi-link device (MLD) address and a station MLD address for the first MSDU and the second MSDU; and generate the aggregation frame by assigning the virtual AP MLD address and the station MLD address to address fields in the aggregation frame (e.g. col. 4, lines 10-32, col. 6, lines 6-15 and col. 10, lines 5-8; i.e., IP address of the server).
It would have been obvious to one of ordinary skill in the art before the effective filing date of the claimed invention to modify the invention of Qian with the above limitations of Ran because it would allow the access point to operate the virtual client without disassociating external wireless client devices which are associated with the access point.
Claim(s) 5-6, 9, 12 and 17-18 is/are rejected under 35 U.S.C. 103 as being unpatentable over Qian (2009/0060009) in view of Patil (2024/0305987) and further in view of Gopalasetty (9125089).
As per claim 5 Qian shows the method of claim 2, wherein the aggregation frame is a jumbo frame, and generating the aggregation frame based on the first MSDU and the second MSDU by using the AMSDU frame format comprises: determining a size of an AMSDU field of the aggregation frame (e.g. paragraph 51). However, Qian does not show, but Gopalasetty shows the use of determining a maximum number of MSDUs in the aggregation frame based on the size of the AMSDU field of the aggregation frame (e.g. col. 9, lines 45-55); and generating the aggregation frame based on the maximum number of MSDUs in the aggregation frame (col. 9, lines 45-55 and abstract “and the aggregated packet is transmitted to the destination station”.)
It would have been obvious to one of ordinary skill in the art before the effective filing date of the claimed invention to modify the invention of Qian with the above limitations of Gopalasetty because it would increase overall packet throughput.
As per claim 6, Qian does not show, but Patil shows determining a size of header fields of the aggregation frame and the maximum size includes the size of the header fields (e.g. paragraph 58) but Gopalasetty shows wherein determining the size of the AMSDU field of the aggregation frame comprises: determining a maximum size of the jumbo frame; and determining the size of the AMSDU field of the aggregation frame based on the maximum size of the jumbo frame and the size of the header fields.
It would have been obvious to one of ordinary skill in the art before the effective filing date of the claimed invention to modify the invention of Qian with the above limitations of Gopalasetty because it would increase overall packet throughput.
As per claim 9, Qian does not show, but Gopalasetty shows wherein generating the aggregation frame based on the first MSDU and the second MSDU comprises: determining a maximum number of MSDUs in the aggregation frame based on the size of the aggregation frame; determining a time threshold to wait for a plurality of MSDUs to be aggregated; and generating the aggregation frame containing a plurality of MSDUs based on the maximum number of MSDUs and the time threshold (e.g. col. 2, lines 13-19).
It would have been obvious to one of ordinary skill in the art before the effective filing date of the claimed invention to modify the invention of Qian with the above limitations of Gopalasetty because it would increase overall packet throughput.
As per claim 12, Qian does not show, but Gopalasetty shows wherein generating the aggregation frame based on the first MSDU and the second MSDU comprises: determining a differentiated services code point (DSCP) category of the first MSDU and the second MSDU; in response to the DSCP category being a voice or video, transmitting the first MSDU and the second MSDU without generating the aggregation frame; and in response to the DSCP category being a best effort or background, generating the aggregation frame based on the first MSDU and the second MSDU (e.g. col. 7, line 60 to col. 8, line 4 and col. 8, lines 43-58).
It would have been obvious to one of ordinary skill in the art before the effective filing date of the claimed invention to modify the invention of Qian with the above limitations of Gopalasetty because it would increase overall packet throughput.
As per claim 17, it is rejected for similar reasons as claim 5.
As per claim 18, it is rejected for similar reasons as claim 6.
Claim(s) 10 and 11 is/are rejected under 35 U.S.C. 103 as being unpatentable over Qian (2009/0060009) view of Patil (2024/0305987) and further in view of Sahu (2015/0071061).
As per claim 10, Qian does not show, but Sahu does show the method of claim 1, further comprising: determining an aggregation probability based on a plurality of MSDUs transmitted in a time period; in response to the aggregation probability being greater than or equal to a probability threshold, turning on aggregation forwarding; and in response to the aggregation probability being smaller than the probability threshold, turning off aggregation forwarding (e.g. paragraphs 22, 23 and 60).
It would have been obvious to one of ordinary skill in the art before the effective filing date of the claimed invention to modify the invention of Qian with the above limitations of Sahu because it would improve transmission performance and efficiency.
As per claim 11, Qian does not show, but Sahu does show wherein determining the aggregation probability based on the plurality of MSDUs transmitted in the time period comprises: determining a ratio of MSDUs with a same traffic identifier (TID) (i.e., access category) and a same destination within the time period to all MSDUs within the time period as the aggregation probability (e.g., paragraph 60).
It would have been obvious to one of ordinary skill in the art before the effective filing date of the claimed invention to modify the invention of Qian with the above limitations of Sahu because it would improve transmission performance and efficiency.
Conclusion
Any inquiry concerning this communication or earlier communications from the examiner should be directed to John Follansbee whose telephone number is (571)272-3964. The examiner can normally be reached Monday-Thursday 6:30 AM - 5:30 PM.
Examiner interviews are available via telephone, in-person, and video conferencing using a USPTO supplied web-based collaboration tool. To schedule an interview, applicant is encouraged to use the USPTO Automated Interview Request (AIR) at http://www.uspto.gov/interviewpractice.
If attempts to reach the examiner by telephone are unsuccessful, the examiner's supervisor, Colleen Fauz can be reached on 571-272-1667. The fax phone number for the organization where this application or proceeding is assigned is 571-273-8300.
Information regarding the status of published or unpublished applications may be obtained from Patent Center. Unpublished application information in Patent Center is available to registered users. To file and manage patent submissions in Patent Center, visit: https://patentcenter.uspto.gov. Visit https://www.uspto.gov/patents/apply/patent-center for more information about Patent Center and https://www.uspto.gov/patents/docx for information about filing in DOCX format. For additional questions, contact the Electronic Business Center (EBC) at 866-217-9197 (toll-free). If you would like assistance from a USPTO Customer Service Representative, call 800-786-9199 (INUSA OR CANADA) or 571-272-1000.
/JOHN A FOLLANSBEE/Supervisory Patent Examiner, Art Unit 2444