DETAILED ACTION
Status of Case
The present application, filed on or after March 16, 2013, is being examined under the first inventor to file provisions of the AIA .
This Office Action is in response to the claims filed on 3/28/2024.
Claims 1-12 are pending.
Information Disclosure Statement
The information disclosure statement (IDS) filed on 11/6/2025 has been considered by Examiner.
Claim Rejections - 35 USC § 103
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.
Claims 1, 11, 12 are rejected under 35 U.S.C. 103 as being unpatentable over Jeon (USPAN 2021/0120531) in view of Riddle (USPAN 2008/0316922).
Consider claims 1, 11, and 12, Jeon discloses a message processing method applied to an Open Radio Access Network Radio Unit (O-RU) (see paragraph 58: if the RU 80 conforms to the O-RAN standard, it may be referred to as an O-RAN RU (O-RU); also, see figure 5, reproduced below for convenience), and a corresponding Open Radio Access Network Radio Unit (O-RU), comprising: at least one processor; and a memory communicating with and connected to the at least one processor: wherein the memory stores instructions executable by the at least one processor, and the instructions are executed by the at least one processor to cause the at least one processor (see figure 3: O-RU comprising storage unit 320 and controller 330; paragraph 77: the storage unit may comprise a memory; paragraph 78: the controller may include at least one processor), and a corresponding non-transient computer-readable storage medium storing a computer program which, when executed by a processor, cause the processor (see paragraph 194: computer-readable storage medium) to:
obtain frequency-domain in-phase quadrature (IQ) data according to uplink data received by an antenna, and store the frequency-domain IQ data in a preset storage space (see Table 1 and paragraphs 110, 155, and 158: said IQ data);
receive a control plane message issued by an Open Radio Access Network Distributed Unit (O-DU), analyze the control plane message to obtain a control plane parameter(see figure 5: control layer messages via control plane C-plane message; also, see paragraphs 17-20, 86, and 107);
read the cached control plane parameter, and generate a user plane message transmission scheduling command according to the read control plane parameter and read the frequency-domain IQ data from the storage space according to the user plane message transmission scheduling command, and obtain an uplink user plane message to be sent according to the read frequency-domain IQ data, and send the uplink user plane message to the O-DU (see figure 5, paragraphs 17-20, and paragraph 107: user data messages via user-plane U-plane; see paragraph 89: queue management).
.
PNG
media_image1.png
584
616
media_image1.png
Greyscale
Jeon does not specifically disclose to cache the control plane parameter in a queue corresponding to the control plane parameter in a queue group; wherein M queues in the queue group are respectively used for storing control plane parameters of M symbols and the M symbols are in one-to-one correspondence with the M queues.
Riddle discloses to cache the control plane parameter in a queue corresponding to the control plane parameter in a queue group; wherein M queues in the queue group are respectively used for storing control plane parameters of M symbols and the M symbols are in one-to-one correspondence with the M queues (see figure 5B (reproduced below for convenience) and paragraph 113: FIG. 5B illustrates a process flow that may be implemented by the Data Plane in connection with, server-side triggered policies. The illustrated process is quite similar to that described in connection with FIG. 5A. However, in FIG. 5B, after the Data Plane creates a flow reference, it accesses the triggering cache to determine if a matching cache entry exists (550). To find a match, the Data Plane generates a key comprising the server-side IP address, server-side port number and the protocol identifier contained in the received packet. As discussed above, the Data Plane may hash this key value to identify a hash group, and then search the entries of the hash group to find a matching cache entry. Additionally, a cache hit may also be conditioned on the value of the time stamp in the cache entry relative to a time out value (triggerexpiration) transmitted by the Control Plane in a SizingData control message (see above). If no matching entry is found, the Data Plane operates as discussed above relative to the data flow. If a matching entry is found, however, the Data Plane sets the Flow Index value in the flow reference to the index value (K) of the matching cache entry, and sets a flag associated with the packet that causes the data plane to insert a header when sampling the packet to the control plane (see FIG. 8, and accompanying description) (552). Accordingly, when the process proceeds to step 516, the flow reference identifies a flow index value, causing the cached policies in the cache entry to be applied (526), as opposed to the default policy (520). However, if the trigger parameter has been set to 3 (ServiceOnly), as discussed above, then the Data Plane applies the default policy).
PNG
media_image2.png
522
430
media_image2.png
Greyscale
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 Jeon and combine it with the noted teachings of Riddle. The motivation to combine these references is to provide an efficient method for network application traffic management in a manner that reduces costs (see paragraphs 30 and 35 of Riddle).
Allowable Subject Matter
Claims 2-10 are objected to as being dependent upon a rejected base claim, but would be allowable if rewritten in independent form including all of the limitations of the base claim and any intervening claims.
Conclusion
Any inquiry concerning this communication or earlier communications from the examiner should be directed to Jamal Javaid whose telephone number is 571-270-5137 and email address is Jamal.Javaid@uspto.gov.
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, Charles Jiang, can be reached on 571-270-7191. The fax phone number for the organization where this application or proceeding is assigned is 571-273-8300.
Information regarding the status of an application may be obtained from the Patent Application Information Retrieval (PAIR) system. Status information for published applications may be obtained from either Private PAIR or Public PAIR. Status information for unpublished applications is available through Private PAIR only. For more information about the PAIR system, see http://pair-direct.uspto.gov. Should you have questions on access to the Private PAIR system, contact the Electronic Business Center (EBC) at 866-217-9197 (toll-free).
/JAMAL JAVAID/
Primary Examiner, Art Unit 2412
JAMAL JAVAID
Primary Examiner
Art Unit 2412