Prosecution Insights
Last updated: April 19, 2026
Application No. 17/932,954

INCREASING TRANSMISSION CONTROL PROTOCOL (TCP) THROUGHPUT BY REDUCING TCP ROUND-TRIP TIME (RTT) IN A WIRELESS NETWORK

Non-Final OA §103
Filed
Sep 16, 2022
Examiner
PEI, PATRICK YIPAO
Art Unit
2473
Tech Center
2400 — Computer Networks
Assignee
Qualcomm Incorporated
OA Round
3 (Non-Final)
79%
Grant Probability
Favorable
3-4
OA Rounds
3y 1m
To Grant
99%
With Interview

Examiner Intelligence

Grants 79% — above average
79%
Career Allow Rate
15 granted / 19 resolved
+20.9% vs TC avg
Strong +33% interview lift
Without
With
+33.3%
Interview Lift
resolved cases with interview
Typical timeline
3y 1m
Avg Prosecution
26 currently pending
Career history
45
Total Applications
across all art units

Statute-Specific Performance

§103
63.2%
+23.2% vs TC avg
§102
34.5%
-5.5% vs TC avg
§112
2.2%
-37.8% vs TC avg
Black line = Tech Center average estimate • Based on career data from 19 resolved cases

Office Action

§103
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 . Continued Examination Under 37 CFR 1.114 A request for continued examination under 37 CFR 1.114, including the fee set forth in 37 CFR 1.17(e), was filed in this application after final rejection. Since this application is eligible for continued examination under 37 CFR 1.114, and the fee set forth in 37 CFR 1.17(e) has been timely paid, the finality of the previous Office action has been withdrawn pursuant to 37 CFR 1.114. Applicant's submission filed on November 17, 2025 has been entered. Response to Arguments Applicant’s arguments with respect to claim(s) 1 and 13 have been considered but are moot because the new ground of rejection does not rely on any reference applied in the prior rejection of record for any teaching or matter specifically challenged in the argument. Claim Objections Claim 13 objected to because of the following informalities: Minor grammar mistake in “selecting a target RTT of the TCP flow to reduce the TCP RTT increase TCP data throughput in the link in accordance with the channel conditions of the wireless channel” that should have the “and” such as in “selecting a target RTT of the TCP flow to reduce the TCP RTT and increase TCP data throughput in the link in accordance with the channel conditions of the wireless channel” in claim 1. Appropriate correction is required. 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. The factual inquiries for establishing a background for determining obviousness under 35 U.S.C. 103 are summarized as follows: 1. Determining the scope and contents of the prior art. 2. Ascertaining the differences between the prior art and the claims at issue. 3. Resolving the level of ordinary skill in the pertinent art. 4. Considering objective evidence present in the application indicating obviousness or nonobviousness. Claims 1 and 13 are rejected under 35 U.S.C. 103 as being unpatentable over Dhanabalan et al. US 20170070444 A1 (Domestic Priority September 4, 2015) in view of Das et al. US 20120265897 A1 (Domestic Priority April 15, 2011). Regarding claim 1 (Currently Amended), Dhanabalan discloses a wireless communication device for wireless communication (see, appliance is a device that optimizes wide area network (WAN) traffic such as a quality of service (“QoS”) engine for local area network (LAN) traffic, metropolitan area network (MAN) traffic, or wireless network traffic, section 0018; noted, network interface can be wireless, section 0029), comprising: one or more interfaces (see, Appliance can include one or more network interfaces, section 0030) capable of: obtaining an indication of channel conditions of a wireless channel (see, one or more TCP controllers can be configured to send and receive flow information from TCP module, and/or QoS engine, section 0036; noted, TCP characteristics includes information of packets such as packet round trop times and packet loss rate for a data flow, section 0034; noted, TCP characteristic can include a plurality of information such as, for example, flow priorities for one or more TCP flows, packet round trip times and/or the packet loss rate for a particular data flow, an average queuing delay and/or bandwidth delay product for the packets sent and received across a particular link, receive window drop information, and/or other receive window information such as receive window size, a queue threshold, and buffer memory size, section 0049) supporting a link between the wireless communication device and a second wireless communication device (see, first appliance works in conjunction with or cooperation with a second appliance to optimize network traffic, section 0018), wherein the link conveys a transfer control protocol (TCP) flow comprising a TCP round trip time (RTT) (see, TCP characteristic, includes a plurality of information such as packet round trip times and/or the packet loss rate for a particular data flow, section 0034) to the second wireless communication device (see, first appliance works in conjunction with or cooperation with a second appliance to optimize network traffic, section 0018); and a processing system capable of: selecting a target RTT of the TCP flow to reduce the TCP RTT and increase TCP data throughput in the link in accordance with the channel conditions of the wireless channel, wherein the channel conditions comprise a channel usage below a channel usage threshold for increasing the TCP data throughput in the link; modifying, associated with the target RTT, one or more transmit parameters of the wireless communication device (see, TCP module can determine one or more TCP characteristics of the flow based on the stored data, section 0034; noted, TCP characteristic, includes a plurality of information such as packet round trip times and/or the packet loss rate for a particular data flow, section 0034; noted, TCP characteristics can be derived from a sampled list of previously seen long-lived TCP links by recording the congestion related parameters for each sampled flow, section 0044) to increase the TCP data throughput in the link; and outputting TCP data of the TCP flow according to the one or more modified transmit parameters (see, flow is active when packets are being sent and received across a TCP link where the TCP is modified by TCP characteristics, section 0042). Dhanabalan discloses all claim limitations but fail to explicitly disclose: selecting a target RTT of the TCP flow to reduce the TCP RTT and increase TCP data throughput in the link in accordance with the channel conditions of the wireless channel, wherein the channel conditions comprise a channel usage below a channel usage threshold for increasing the TCP data throughput in the link; modifying, associated with the target RTT, one or more transmit parameters of the wireless communication device (see, TCP module can determine one or more TCP characteristics of the flow based on the stored data, section 0034; noted, TCP characteristic, includes a plurality of information such as packet round trip times and/or the packet loss rate for a particular data flow, section 0034; noted, TCP characteristics can be derived from a sampled list of previously seen long-lived TCP links by recording the congestion related parameters for each sampled flow, section 0044) to increase the TCP data throughput in the link; and outputting TCP data of the TCP flow according to the one or more modified transmit parameters (see, flow is active when packets are being sent and received across a TCP link where the TCP is modified by TCP characteristics, section 0042). However, Das from a similar field of endeavor discloses: selecting a target RTT of the TCP flow (see, target RTT for priority flows through formulations, sections 0035-0038 Das) to reduce the TCP RTT (see, flow modification module may be in communication with level of interest module and may use the current state of the applications and any input information from level of interest module to manipulate the TCP flows per application and can increase the throughput of more TCP flows deemed more important and reduce TCP flows for applications which were deemed to have less important TCP flows, section 0029 Das) and increase TCP data throughput in the link in accordance with the channel conditions of the wireless channel (see, round trip delay or RTT is directly proportional to the throughput of any given TCP flow, increasing the overall RTT by delaying acknowledgement packets may effectively reduce the TCP throughput of an application relative to the other TCP flows on the link thus it can be assumed that the opposite of decreasing the overall RTT by delaying acknowledgement packets may effectively increase the TCP throughput, section 0041 Das; noted, values applied to the RTT based on equations, sections 0035-0038 Das), wherein the channel conditions comprise a channel usage below a channel usage threshold (see, ME may modify one or more aspects of flows associated with the one or more applications, section 0035 Das; noted, process may be not invoked if the one or more applications running on the ME use less than a threshold value of available bandwidth from a network, section 0034 Das; noted, ME may modify the TCP flows by prioritizing processing of the TCP flow associated with an active application where any TCP flows not associated with the active application may be delayed where the delay may be achieved by applying a value to the round trip time (RTT) for outbound acknowledgements for TCP flows not associated with the active application, section 0035 Das) for increasing the TCP data throughput in the link (see, round trip delay or RTT is directly proportional to the throughput of any given TCP flow, increasing the overall RTT by delaying acknowledgement packets may effectively reduce the TCP throughput of an application relative to the other TCP flows on the link thus it can be assumed that the opposite of decreasing the overall RTT by delaying acknowledgement packets may effectively increase the TCP throughput, section 0041 Das; noted, values applied to the RTT based on equations, sections 0035-0038 Das); modifying, associated with the target RTT, one or more transmit parameters of the wireless communication device to increase the TCP data throughput in the link (see, round trip delay or RTT is directly proportional to the throughput of any given TCP flow, increasing the overall RTT by delaying acknowledgement packets may effectively reduce the TCP throughput of an application relative to the other TCP flows on the link thus it can be assumed that the opposite of decreasing the overall RTT by delaying acknowledgement packets may effectively increase the TCP throughput, section 0041 Das; noted, values applied to the RTT based on equations, sections 0035-0038 Das); and outputting TCP data of the TCP flow according to the one or more modified transmit parameters. In view of the above, it would have been obvious before the effective filling date of the claim invention to a person having ordinary skill in the art of which the claimed invention pertains to modify the wireless communication of Dhanabalan with the TCP flow as taught by Das. The motivation would have been to modify transport flow associated with at least one of the one or more applications. Regarding claim 13 (Currently Amended), Dhanabalan discloses a method for wireless communication by a wireless communication device (see, appliance is a device that optimizes wide area network (WAN) traffic such as a quality of service (“QoS”) engine for local area network (LAN) traffic, metropolitan area network (MAN) traffic, or wireless network traffic, section 0018; noted, network interface can be wireless, section 0029), comprising: obtaining an indication of channel conditions of a wireless channel (see, one or more TCP controllers can be configured to send and receive flow information from TCP module, and/or QoS engine, section 0036; noted, TCP characteristics includes information of packets such as packet round trop times and packet loss rate for a data flow, section 0034; noted, TCP characteristic can include a plurality of information such as, for example, flow priorities for one or more TCP flows, packet round trip times and/or the packet loss rate for a particular data flow, an average queuing delay and/or bandwidth delay product for the packets sent and received across a particular link, receive window drop information, and/or other receive window information such as receive window size, a queue threshold, and buffer memory size, section 0049) supporting a link between the wireless communication device and a second wireless communication device (see, first appliance works in conjunction with or cooperation with a second appliance to optimize network traffic, section 0018), wherein the link conveys a transfer control protocol (TCP) flow comprising a TCP round trip time (RTT) (see, TCP characteristic, includes a plurality of information such as packet round trip times and/or the packet loss rate for a particular data flow, section 0034) to the second wireless communication device (see, first appliance works in conjunction with or cooperation with a second appliance to optimize network traffic, section 0018); selecting a target RTT of the TCP flow to reduce the TCP RTT increase TCP data throughput in the link in accordance with the channel conditions of the wireless channel (see, QoS engine can select a TCP flavor suitable for avoiding TCP traffic congestion on the one or more flow, section 0031), wherein the channel conditions comprise a channel usage below a channel usage threshold (see, TCP controller monitoring the TCP packet queue for early detection of a resource crunch (e.g., an over-use of system resources including memory, CPU usage, etc.) which is avoided by a flow priority of TCP connections and TCP characteristics by slowing the least priority TCP traffic below the usage limit, section 0046) for increasing the TCP data throughput in the link; modifying, associated with the target RTT, one or more transmit parameters of the wireless communication device (see, TCP module can determine one or more TCP characteristics of the flow based on the stored data, section 0034; noted, TCP characteristic, includes a plurality of information such as packet round trip times and/or the packet loss rate for a particular data flow, section 0034; noted, TCP characteristics can be derived from a sampled list of previously seen long-lived TCP links by recording the congestion related parameters for each sampled flow, section 0044) to increase the TCP data throughput in the link; and transmitting TCP data of the TCP flow over the wireless channel to the second wireless communication device according to the one or more modified transmit parameters (see, flow is active when packets are being sent and received across a TCP link where the TCP is modified by TCP characteristics, section 0042; noted, first appliance works in conjunction with or cooperation with a second appliance to optimize network traffic, section 0018). Dhanabalan discloses all claim limitations but fail to explicitly disclose: selecting a target RTT of the TCP flow to reduce the TCP RTT increase TCP data throughput in the link in accordance with the channel conditions of the wireless channel (see, QoS engine can select a TCP flavor suitable for avoiding TCP traffic congestion on the one or more flow, section 0031), wherein the channel conditions comprise a channel usage below a channel usage threshold (see, TCP controller monitoring the TCP packet queue for early detection of a resource crunch (e.g., an over-use of system resources including memory, CPU usage, etc.) which is avoided by a flow priority of TCP connections and TCP characteristics by slowing the least priority TCP traffic below the usage limit, section 0046) for increasing the TCP data throughput in the link; modifying, associated with the target RTT, one or more transmit parameters of the wireless communication device (see, TCP module can determine one or more TCP characteristics of the flow based on the stored data, section 0034; noted, TCP characteristic, includes a plurality of information such as packet round trip times and/or the packet loss rate for a particular data flow, section 0034; noted, TCP characteristics can be derived from a sampled list of previously seen long-lived TCP links by recording the congestion related parameters for each sampled flow, section 0044) to increase the TCP data throughput in the link; and transmitting TCP data of the TCP flow over the wireless channel to the second wireless communication device according to the one or more modified transmit parameters (see, flow is active when packets are being sent and received across a TCP link where the TCP is modified by TCP characteristics, section 0042; noted, first appliance works in conjunction with or cooperation with a second appliance to optimize network traffic, section 0018). However, Das from a similar field of endeavor discloses: selecting a target RTT of the TCP flow (see, target RTT for priority flows through formulations, sections 0035-0038 Das) to reduce the TCP RTT (see, flow modification module may be in communication with level of interest module and may use the current state of the applications and any input information from level of interest module to manipulate the TCP flows per application and can increase the throughput of more TCP flows deemed more important and reduce TCP flows for applications which were deemed to have less important TCP flows, section 0029 Das) increase TCP data throughput in the link in accordance with the channel conditions of the wireless channel (see, round trip delay or RTT is directly proportional to the throughput of any given TCP flow, increasing the overall RTT by delaying acknowledgement packets may effectively reduce the TCP throughput of an application relative to the other TCP flows on the link thus it can be assumed that the opposite of decreasing the overall RTT by delaying acknowledgement packets may effectively increase the TCP throughput, section 0041 Das; noted, values applied to the RTT based on equations, sections 0035-0038 Das), wherein the channel conditions comprise a channel usage below a channel usage threshold (see, ME may modify one or more aspects of flows associated with the one or more applications, section 0035 Das; noted, process may be not invoked if the one or more applications running on the ME use less than a threshold value of available bandwidth from a network, section 0034 Das; noted, ME may modify the TCP flows by prioritizing processing of the TCP flow associated with an active application where any TCP flows not associated with the active application may be delayed where the delay may be achieved by applying a value to the round trip time (RTT) for outbound acknowledgements for TCP flows not associated with the active application, section 0035 Das) for increasing the TCP data throughput in the link (see, round trip delay or RTT is directly proportional to the throughput of any given TCP flow, increasing the overall RTT by delaying acknowledgement packets may effectively reduce the TCP throughput of an application relative to the other TCP flows on the link thus it can be assumed that the opposite of decreasing the overall RTT by delaying acknowledgement packets may effectively increase the TCP throughput, section 0041 Das; noted, values applied to the RTT based on equations, sections 0035-0038 Das); modifying, associated with the target RTT, one or more transmit parameters of the wireless communication device to increase the TCP data throughput in the link (see, round trip delay or RTT is directly proportional to the throughput of any given TCP flow, increasing the overall RTT by delaying acknowledgement packets may effectively reduce the TCP throughput of an application relative to the other TCP flows on the link thus it can be assumed that the opposite of decreasing the overall RTT by delaying acknowledgement packets may effectively increase the TCP throughput, section 0041 Das; noted, values applied to the RTT based on equations, sections 0035-0038 Das); and transmitting TCP data of the TCP flow over the wireless channel to the second wireless communication device according to the one or more modified transmit parameters. In view of the above, it would have been obvious before the effective filling date of the claim invention to a person having ordinary skill in the art of which the claimed invention pertains to modify the wireless communication of Dhanabalan with the TCP flow as taught by Das. The motivation would have been to modify transport flow associated with at least one of the one or more applications. Claim 2 is rejected under 35 U.S.C. 103 as being unpatentable over Dhanabalan et al. US 20170070444 A1 (Domestic Priority September 4, 2015) in view of Das et al. US 20120265897 A1 (Domestic Priority April 15, 2011), and in further view of Merlin et al. US 20160198500 A1 (Domestic Priority January 7, 2015). The combination of Dhanabalan and Das discloses all claim limitations but fail to explicitly disclose: Regarding claim 2 (Original), the wireless communication device of claim 1, wherein the modifying the one or more transmit parameters includes reducing a transmission opportunity (TXOP) duration of the wireless communication device. However, Merlin from a similar field of endeavor discloses: the wireless communication device of claim 1, wherein the modifying the one or more transmit parameters includes reducing a transmission opportunity (TXOP) duration of the wireless communication device (see, the EDCA parameters to be used by the STA for contention may be a function of the frequency and duration of the granted UL MU TXOP where the first set of EDCA parameters may have a shorter TXOP limit than the second set of EDCA parameters or a larger minimum or maximum contention window than the second set of EDCA parameters and the STA may choose to expedite the contention by resetting the contention window size, decreasing the contention window size, or maintaining the current contention window size, sections 0102-0109 Merlin). In view of the above, it would have been obvious before the effective filling date of the claim invention to a person having ordinary skill in the art of which the claimed invention pertains to modify the combination of Dhanabalan and Das with the parameters of Merlin. The motivation would have been to address the issue of increasing bandwidth requirements that are demanded for wireless communications systems. Claim(s) 3, and 10-12 are rejected under 35 U.S.C. 103 as being unpatentable over Dhanabalan et al. US 20170070444 A1 (Domestic Priority September 4, 2015) in view of Das et al. US 20120265897 A1 (Domestic Priority April 15, 2011), and in further view of Sivaraj et al. US 20200195539 A1 (Domestic Priority December 14, 2018). The combination of Dhanabalan and Das discloses all claim limitations but fail to explicitly disclose: Regarding claim 3 (Original), the wireless communication device of claim 1, wherein the modifying the one or more transmit parameters includes reducing a transmission (TX) aggregation delay of the wireless communication device. However, Sivaraj from a similar field of endeavor discloses: the wireless communication device of claim 1, wherein the modifying the one or more transmit parameters includes reducing a transmission (TX) aggregation delay of the wireless communication device (see, reduction of higher TCP latency results from TCP round trip time (RTT) by modifying channel conditions to prevent TCP response time-outs, sections 0043-0044 Sivaraj). In view of the above, it would have been obvious before the effective filling date of the claim invention to a person having ordinary skill in the art of which the claimed invention pertains to modify the combination of Dhanabalan and Das with the reduction of higher TCP latency results of Sivaraj. The motivation would have been to predict and reduce latency experienced in wireless communication systems. The combination of Dhanabalan and Das discloses all claim limitations but fail to explicitly disclose: Regarding claim 10 (Original), the wireless communication device of claim 1, wherein the processing system is capable of, associated with the target RTT, selecting a transmission opportunity (TXOP) duration for the wireless communication device. However, Sivaraj from a similar field of endeavor discloses: the wireless communication device of claim 1, wherein the processing system is capable of, associated with the target RTT (fig. 12, the MAC layer allocates PRBs to the UE across certain TTIs and sends a “Transmission (Tx) opportunity” to the RLC layer with the recommended Transport Block Size (TBS), section 0069 Sivaraj, 0078-lower RTT values), selecting a transmission opportunity (TXOP) duration for the wireless communication device (fig. 12, the MAC layer allocates PRBs to the UE across certain TTIs and sends a “Transmission (Tx) opportunity” to the RLC layer with the recommended Transport Block Size (TBS), sections 0069-0072 Sivaraj). In view of the above, it would have been obvious before the effective filling date of the claim invention to a person having ordinary skill in the art of which the claimed invention pertains to modify the combination of Dhanabalan and Das with the reduction of higher TCP latency results of Sivaraj. The motivation would have been to predict and reduce latency experienced in wireless communication systems. The combination of Dhanabalan and Das discloses all claim limitations but fail to explicitly disclose: Regarding claim 11 (Original), the wireless communication device of claim 1, wherein the processing system is capable of, subsequent to transmitting the TCP data of the TCP flow over the wireless link to the second wireless communication device according to the one or more modified transmit parameters, associated with an increase in a utilization level of the wireless channel, reverting at least one of the one or more modified transmit parameters to a previous value. However, Sivaraj from a similar field of endeavor discloses: the wireless communication device of claim 1, wherein the processing system is capable of, subsequent to transmitting the TCP data of the TCP flow over the wireless link (see, outputting the latency guidance data to facilitate the reduction in the communication latency experienced by the user equipment in the wireless network, section 0091; noted, TCP RTT correlate with RAN latencies, section 0055 Sivaraj) to the second wireless communication device (see, TCP server transmits a TCP packet to the client UE in the downlink where the UE can be seen as the second device, section 0044 Sivaraj) according to the one or more modified transmit parameters (see, latency guidance data adjusting a content output variable applicable to content being transmitted to the user equipment where the latency guidance data to the user equipment can be used in modifying requests for content, section 0082-0083, 0086-0087 Sivaraj), associated with an increase in a utilization level of the wireless channel (see, varying payload size and inter-packet gap changes traffic rates, section 0048 Sivaraj), reverting at least one of the one or more modified transmit parameters (see, latency guidance data adjusting a content output variable applicable to content being transmitted to the user equipment where the latency guidance data to the user equipment can be used in modifying requests for content, section 0082-0083, 0086-0087 Sivaraj) to a previous value (see, the TCP congestion window may repeatedly enters a slow start phase if higher TCP latency results from TCP round trip time (RTT) are detected per RTT, but ends repeating phase where TCP congestion window consistently grows, section 0044 Sivaraj). In view of the above, it would have been obvious before the effective filling date of the claim invention to a person having ordinary skill in the art of which the claimed invention pertains to modify the combination of Dhanabalan and Das with the reduction of higher TCP latency results of Sivaraj. The motivation would have been to predict and reduce latency experienced in wireless communication systems. The combination of Dhanabalan and Das discloses all claim limitations but fail to explicitly disclose: Regarding claim 12 (Original), The wireless communication device of claim 1, wherein the wireless communication device is an access point (AP) of a wireless local area network (WLAN), and the second wireless communication device is a station (STA) of the WLAN. However, Sivaraj from a similar field of endeavor discloses: the wireless communication device of claim 1, wherein the wireless communication device is an access point (AP) of a wireless local area network (WLAN) (fig. 21, the software trigger component 2138 can be provided that facilitates triggering of the hysteresis component 2136 when the Wi-Fi transceiver 2113 detects the beacon of the access point., sections 0047,0106 Sivaraj), and the second wireless communication device is a station (STA) of the WLAN (see, devices are connected to a UE on a WLAN, sections 0047,0106 Sivaraj). In view of the above, it would have been obvious before the effective filling date of the claim invention to a person having ordinary skill in the art of which the claimed invention pertains to modify the combination of Dhanabalan and Das with the reduction of higher TCP latency results of Sivaraj. The motivation would have been to predict and reduce latency experienced in wireless communication systems. Claim 4 is rejected under 35 U.S.C. 103 as being unpatentable over Dhanabalan et al. US 20170070444 A1 (Domestic Priority September 4, 2015) in view of Das et al. US 20120265897 A1 (Domestic Priority April 15, 2011), and in further view of Dai et al. US 20140079016 A1 (Domestic Priority November 12, 2010). The combination of Dhanabalan and Das discloses all claim limitations but fail to explicitly disclose: Regarding claim 4 (Original), the wireless communication device of claim 1, wherein the modifying the one or more transmit parameters includes modifying one or more enhanced distributed channel access (EDCA) parameters of the wireless communication device. However, Dai from a similar field of endeavor discloses: the wireless communication device of claim 1, wherein the modifying the one or more transmit parameters includes modifying one or more enhanced distributed channel access (EDCA) parameters of the wireless communication device (see, enhanced distributed channel access functions may modify parameters to change priority, sections 0201 Dai). In view of the above, it would have been obvious before the effective filling date of the claim invention to a person having ordinary skill in the art of which the claimed invention pertains to modify the combination of Dhanabalan and Das with the enhanced distributed channel access functions of Dai. The motivation would have been to improve bandwidth-demanding wireless applications. Claims 5 and 6 are rejected under 35 U.S.C. 103 as being unpatentable over Dhanabalan et al. US 20170070444 A1 (Domestic Priority September 4, 2015) in view of Das et al. US 20120265897 A1 (Domestic Priority April 15, 2011), and in further view of Dai et al. US 20140079016 A1 (Domestic Priority November 12, 2010) of claim 4, and in further view of Merlin et al. US 20160198500 A1 (Domestic Priority January 7, 2015). The combination of Dhanabalan, Das, and Dai disclose all claim limitations but fail to explicitly disclose: Regarding claim 5 (Original), the wireless communication device of claim 4, wherein the modifying one or more EDCA parameters of the wireless communication device includes increasing a minimum contention window size. However, Merlin from a similar field of endeavor discloses: the wireless communication device of claim 4, wherein the modifying one or more EDCA parameters of the wireless communication device (see, the access point may generate one or more frames to indicate a set of EDCA parameters, sections 0097-0102, 0109 Merlin) includes increasing a minimum contention window size (see, the access point may generate one or more frames to indicate a first and second set of EDCA parameters such that the first set of EDCA parameters have a larger minimum or maximum contention window than the second set of EDCA parameters, sections 0097-0102, 0109 Merlin). In view of the above, it would have been obvious before the effective filling date of the claim invention to a person having ordinary skill in the art of which the claimed invention pertains to modify the combination of Dhanabalan, Das, and Dai with the parameters of Merlin. The motivation would have been to address the issue of increasing bandwidth requirements that are demanded for wireless communications systems. The combination of Dhanabalan, Das, and Dai disclose all claim limitations but fail to explicitly disclose: Regarding claim 6 (Original), the wireless communication device of claim 4, wherein the modifying one or more EDCA parameters of the wireless communication device includes increasing a maximum contention window size. However, Merlin from a similar field of endeavor discloses: the wireless communication device of claim 4, wherein the modifying one or more EDCA parameters of the wireless communication device (see, providers have parameters such as contention window sizes, backoff window sizes, and other thresholds where providers use EDCA access rules, sections 0064 Merlin; noted, the adjusting of a set of EDCA parameters in response to detecting one or more conditions, section 0087 Merlin) includes increasing a maximum contention window size (see, the selection of different window sizes that are randomly generated to fit the need of the provider, sections 0078-0087 Merlin). In view of the above, it would have been obvious before the effective filling date of the claim invention to a person having ordinary skill in the art of which the claimed invention pertains to modify the combination of Dhanabalan, Das, and Dai with the parameters of Merlin. The motivation would have been to address the issue of increasing bandwidth requirements that are demanded for wireless communications systems. Claims 7-9 are rejected under 35 U.S.C. 103 as being unpatentable over Dhanabalan et al. US 20170070444 A1 (Domestic Priority September 4, 2015) in view of Das et al. US 20120265897 A1 (Domestic Priority April 15, 2011), and in further view of Yang et al. US 20180176136 A1 (Domestic Priority December 19, 2016). The combination of Dhanabalan and Das discloses all claim limitations but fail to explicitly disclose: Regarding claim 7 (Original), the wireless communication device of claim 1, wherein the processing system is capable of selecting the target RTT according to a bytes-in-flight of the TCP flow. However, Yang from a similar field of endeavor discloses: the wireless communication device of claim 1, wherein the processing system is capable of selecting the target RTT according to a bytes-in-flight of the TCP flow (see, the comparison of bandwidth-delay product (BDP) and congestion windows size (CWND) which is the optimal value of BDP when data bytes are in flight between TCP server and TCP client and the formula of BDP=BW * RTT where RTT is the TCP round trip time, sections 0020-0021 Yang). In view of the above, it would have been obvious before the effective filling date of the claim invention to a person having ordinary skill in the art of which the claimed invention pertains to modify the combination of Dhanabalan and Das with the use of bytes-in-flight of Yang. The motivation would have been to improve and enhance TCP bufferbloat resolution. The combination of Dhanabalan and Das discloses all claim limitations but fail to explicitly disclose: Regarding claim 8 (Original), the wireless communication device of claim 7, wherein the processing system is capable of selecting the target RTT according to the bytes-in-flight of the TCP flow and a physical layer communication rate of the second wireless communication device. However, Yang from a similar field of endeavor discloses: the wireless communication device of claim 7, wherein the processing system is capable of selecting the target RTT according to the bytes-in-flight of the TCP flow (see, the comparison of bandwidth-delay product (BDP) and congestion windows size (CWND) which is the optimal value of BDP when data bytes are in flight between TCP server and TCP client and the formula of BDP=BW * RTT where RTT is the TCP round trip time, sections 0020-0021 Yang) and a physical layer communication rate of the second wireless communication device (see, TCP sender detects congestion signal such as excessive TCP round trip time (RTT), the sender will decrease CWND size and thus reduce the sending rate of TCP segments, sections 0020-0021 Yang). In view of the above, it would have been obvious before the effective filling date of the claim invention to a person having ordinary skill in the art of which the claimed invention pertains to modify the combination of Dhanabalan and Das with the use of bytes-in-flight of Yang. The motivation would have been to improve and enhance TCP bufferbloat resolution. The combination of Dhanabalan and Das discloses all claim limitations but fail to explicitly disclose: Regarding claim 9 (Original), the wireless communication device of claim 7, wherein the processing system is capable of obtaining an indication of the bytes-in-flight of the TCP flow from a device driver. However, Yang from a similar field of endeavor discloses: the wireless communication device of claim 7, wherein the processing system is capable of obtaining an indication of the bytes-in-flight of the TCP flow (see, TCP sender sends only a few segments to the network to probe the bandwidth of the congestion windows size (CWND) and if successful, receives a TCP ACK in response, also CWND is the maximum number of bytes that can be transmitted to the network, sections 0020-0021 Yang) from a device driver (see, TCP server receiving feedback information from TCP client, section 0028 Yang). In view of the above, it would have been obvious before the effective filling date of the claim invention to a person having ordinary skill in the art of which the claimed invention pertains to modify the combination of Dhanabalan and Das with the use of bytes-in-flight of Yang. The motivation would have been to improve and enhance TCP bufferbloat resolution. Claims 14-17 are rejected under 35 U.S.C. 103 as being unpatentable over Dhanabalan et al. US 20170070444 A1 (Domestic Priority September 4, 2015) in view of Das et al. US 20120265897 A1 (Domestic Priority April 15, 2011), and in further view of Shihada et al. US 20140140209 A1 (Domestic Priority March 20, 2011). The combination of Dhanabalan and Das discloses all claim limitations but fail to explicitly disclose: Regarding claim 14 (Original), the method of claim 13, further comprising, associated with a utilization level of the wireless channel, checking a medium access control service data unit (MSDU) queue for a presence of MSDUs associated with TCP flows. However, Shihada from a similar field of endeavor discloses: the method of claim 13, further comprising, associated with a utilization level of the wireless channel, checking a medium access control service data unit (MSDU) queue for a presence of MSDUs associated with TCP flows (fig. 8, 9, a single A-MPDU can contain K TCP segments where A-MPDU can aggregate several A-MSDUs where aggregates may be as big as 1 MB which makes small buffers infeasible and require varying queue size, sections 0051-0052, 0093 Shihada). In view of the above, it would have been obvious before the effective filling date of the claim invention to a person having ordinary skill in the art of which the claimed invention pertains to modify the combination of Dhanabalan and Das with the MSDU queue of MSDUs of Shihada. The motivation would have been to improve the buffering of data when routing data in networks. The combination of Dhanabalan and Das discloses all claim limitations but fail to explicitly disclose: Regarding claim 15 (Original), the method of claim 14, further comprising, associated with a presence in the MSDU queue of MSDUs associated with the TCP flow. However, Shihada from a similar field of endeavor discloses: Regarding claim 15, the method of claim 14, further comprising, associated with a presence in the MSDU queue of MSDUs associated with the TCP flow (fig. 8, 9, a single A-MPDU can contain K TCP segments where A-MPDU can aggregate several A-MSDUs, sections 0051-0052, 0093 Shihada), selecting the target RTT (fig. 7, large buffers can affect the queuing and therefore RTT values that are available to use, sections 0050, 0055-0057 Shihada). In view of the above, it would have been obvious before the effective filling date of the claim invention to a person having ordinary skill in the art of which the claimed invention pertains to modify the combination of Dhanabalan and Das with the MSDU queue of MSDUs of Shihada. The motivation would have been to improve the buffering of data when routing data in networks. The combination of Dhanabalan and Das discloses all claim limitations but fail to explicitly disclose: Regarding claim 16 (Original), the method of claim 14, further comprising, associated with a number of times per second that the MSDU queue becomes empty, checking the MSDU queue for bursty traffic. However, Shihada from a similar field of endeavor discloses: the method of claim 14, further comprising, associated with a number of times per second that the MSDU queue becomes empty (see, in 802.11n standard frame aggregation for queue draining time, the rates can be as 600 Mb/s until the buffer is emptied where frame aggregation includes A-MSDUs, sections 0051 Shihada), checking the MSDU queue for bursty traffic (see, bursty traffic can be seen with as a loss of packets while waits for a time interval during a congestion avoidance phase, section 0079 Shihada). In view of the above, it would have been obvious before the effective filling date of the claim invention to a person having ordinary skill in the art of which the claimed invention pertains to modify the combination of Dhanabalan and Das with the MSDU queue of MSDUs of Shihada. The motivation would have been to improve the buffering of data when routing data in networks. The combination of Dhanabalan and Das discloses all claim limitations but fail to explicitly disclose: Regarding claim 17 (Original), the method of claim 16, further comprising, associated with finding bursty traffic associated with a non-TCP flow in the MSDU queue, increasing an aggregation delay for MSDUs comprising data of the non-TCP flow. However, Shihada from a similar field of endeavor discloses: the method of claim 16, further comprising, associated with finding bursty traffic associated with a non-TCP flow in the MSDU queue (see, bursty traffic can be seen with as a loss of packets while waits for a time interval during a congestion avoidance phase, section 0079 Shihada), increasing an aggregation delay for MSDUs comprising data of the non-TCP flow (see, frame aggregation in the 802.11n standard can include long queuing delays where frame aggregation includes A-MSDUs, sections 0049-0053 Shihada). In view of the above, it would have been obvious before the effective filling date of the claim invention to a person having ordinary skill in the art of which the claimed invention pertains to modify the combination of Dhanabalan and Das with the MSDU queue of MSDUs of Shihada. The motivation would have been to improve the buffering of data when routing data in networks. Claim 18 is rejected under 35 U.S.C. 103 as being unpatentable over Dhanabalan et al. US 20170070444 A1 (Domestic Priority September 4, 2015) in view of Das et al. US 20120265897 A1 (Domestic Priority April 15, 2011), and in further view of Shihada et al. US 20140140209 A1 (Domestic Priority March 20, 2011) of claim 17, and in further view of Sivaraj et al. US 20200195539 A1 (Domestic Priority December 14, 2018). The combination of Dhanabalan, Das, and Shihada discloses all claim limitations but fail to explicitly disclose: Regarding claim 18 (Original), the method of claim 17, wherein the non-TCP flow comprises a user datagram protocol (UDP) flow. However, Sivaraj from a similar field of endeavor discloses: the method of claim 17, wherein the non-TCP flow comprises a user datagram protocol (UDP) flow (see, finite-buffer UDP data stream for each load UE, section 0048 Sivaraj). In view of the above, it would have been obvious before the effective filling date of the claim invention to a person having ordinary skill in the art of which the claimed invention pertains to modify the combination of Dhanabalan, Das, and Shihada with the reduction of higher TCP latency results of Sivaraj. The motivation would have been to predict and reduce latency experienced in wireless communication systems. Claims 19 and 20 are rejected under 35 U.S.C. 103 as being unpatentable over Dhanabalan et al. US 20170070444 A1 (Domestic Priority September 4, 2015) in view of Das et al. US 20120265897 A1 (Domestic Priority April 15, 2011), and in further view of Shihada et al. US 20140140209 A1 (Domestic Priority March 20, 2011) of claim 17, and in further view of Dai et al. US 20140079016 A1 (Domestic Priority November 12, 2010). The combination of Dhanabalan, Das, and Shihada disclose all claim limitations but fail to explicitly disclose: Regarding claim 19 (Original), the method of claim 17, wherein the non-TCP flow comprises traffic associated with an enhanced distributed channel access (EDCA) voice (VO) access category (AC). However, Dai from a similar field of endeavor discloses: the method of claim 17, wherein the non-TCP flow (figs. 37A, 37B, MAC layer architecture 3700 may distribute frames over a plurality of parallel PHY channels, sections 0197-0200 Dai) comprises traffic (see, once a MAC service data unit (MSDU) frame from the upper layer is received, the MAC layer may examine the user priority of the frame which may be mapped to access category values, section 0200 Dai) associated with an enhanced distributed channel access (EDCA) voice (VO) access category (AC) (see, the four AC types, listed with priorities from high to low, may include: AC_VO (voice), AC_VI (video), AC_BE (best effort) and AC_BK (background), sections 0200, 0301 Dai). In view of the above, it would have been obvious before the effective filling date of the claim invention to a person having ordinary skill in the art of which the claimed invention pertains to modify the combination of Dhanabalan, Das, and Shihada with the enhanced distributed channel access functions of Dai. The motivation would have been to improve bandwidth-demanding wireless applications. The combination of Dhanabalan, Das, and Shihada disclose all claim limitations but fail to explicitly disclose: Regarding claim 20 (Original), the method of claim 17, wherein the non-TCP flow comprises traffic associated with an enhanced distributed channel access (EDCA) video (VI) access category (AC). However, Dai from a similar field of endeavor discloses: the method of claim 17, wherein the non-TCP flow (figs. 37A, 37B, MAC layer architecture 3700 may distribute frames over a plurality of parallel PHY channels, sections 0197-0200 Dai) comprises traffic (see, once a MAC service data unit (MSDU) frame from the upper layer is received, the MAC layer may examine the user priority of the frame which may be mapped to access category values, section 0200 Dai) associated with an enhanced distributed channel access (EDCA) video (VI) access category (AC) (see, the four AC types, listed with priorities from high to low, may include: AC_VO (voice), AC_VI (video), AC_BE (best effort) and AC_BK (background), sections 0200, 0301 Dai). In view of the above, it would have been obvious before the effective filling date of the claim invention to a person having ordinary skill in the art of which the claimed invention pertains to modify the combination of Dhanabalan, Das, and Shihada with the enhanced distributed channel access functions of Dai. The motivation would have been to improve bandwidth-demanding wireless applications. Conclusion Any inquiry concerning this communication or earlier communications from the examiner should be directed to PATRICK YIPAO PEI whose telephone number is (703)756-1890. The examiner can normally be reached Monday - Friday 9:30 AM to 5:30 PM ET. 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, Kwang Yao can be reached at (571) 272-3182. 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 (IN USA OR CANADA) or 571-272-1000. /PATRICK YIPAO PEI/Examiner, Art Unit 2473 /KWANG B YAO/Supervisory Patent Examiner, Art Unit 2473
Read full office action

Prosecution Timeline

Sep 16, 2022
Application Filed
Jan 21, 2025
Non-Final Rejection — §103
Apr 14, 2025
Interview Requested
Apr 21, 2025
Examiner Interview Summary
Apr 21, 2025
Applicant Interview (Telephonic)
Apr 28, 2025
Response Filed
Jul 15, 2025
Final Rejection — §103
Nov 11, 2025
Response after Non-Final Action
Nov 11, 2025
Interview Requested
Nov 17, 2025
Request for Continued Examination
Nov 23, 2025
Response after Non-Final Action
Feb 03, 2026
Non-Final Rejection — §103 (current)

Precedent Cases

Applications granted by this same examiner with similar technology

Patent 12588015
HYBRID AUTOMATIC REPEAT REQUEST IDENTIFIER DETERMINATION ASSOCIATED WITH CROSS-LINK INTERFERENCE MEASUREMENTS
2y 5m to grant Granted Mar 24, 2026
Patent 12557078
DYNAMIC, MULTI-FREQUENCY SUPERFRAME SLOTTING
2y 5m to grant Granted Feb 17, 2026
Patent 12538299
METHOD AND APPARATUS FOR MEASURING AND REPORTING INTERFERENCE SIGNAL IN WIRELESS COMMUNICATION SYSTEMS
2y 5m to grant Granted Jan 27, 2026
Patent 12520291
SYSTEMS AND METHODS FOR MANAGING TRANSMISSION INDICATION IN MULTICAST AND BROADCAST COMMUNICATIONS
2y 5m to grant Granted Jan 06, 2026
Patent 12512882
APPARATUS, METHOD, AND SYSTEM FOR PERFORMING MULTIPLE-USER MULTIPLE-INPUT MULTIPLE-OUTPUT COMMUNICATION, AND NON-TRANSITORY COMPUTER READABLE STORAGE MEDIUM
2y 5m to grant Granted Dec 30, 2025
Study what changed to get past this examiner. Based on 5 most recent grants.

AI Strategy Recommendation

Get an AI-powered prosecution strategy using examiner precedents, rejection analysis, and claim mapping.
Powered by AI — typically takes 5-10 seconds

Prosecution Projections

3-4
Expected OA Rounds
79%
Grant Probability
99%
With Interview (+33.3%)
3y 1m
Median Time to Grant
High
PTA Risk
Based on 19 resolved cases by this examiner. Grant probability derived from career allow rate.

Sign in with your work email

Enter your email to receive a magic link. No password needed.

Personal email addresses (Gmail, Yahoo, etc.) are not accepted.

Free tier: 3 strategy analyses per month