Prosecution Insights
Last updated: May 04, 2026
Application No. 18/314,406

UNIFIED PROTOCOL FOR LINK ADAPTATION

Non-Final OA §103
Filed
May 09, 2023
Priority
Jun 07, 2022 — provisional 63/349,648
Examiner
CHAKRAVARTHY, LATHA
Art Unit
2461
Tech Center
2400 — Computer Networks
Assignee
MediaTek Inc.
OA Round
3 (Non-Final)
31%
Grant Probability
At Risk
3-4
OA Rounds
4m
Est. Remaining
88%
With Interview

Examiner Intelligence

Grants only 31% of cases
31%
Career Allowance Rate
8 granted / 26 resolved
-27.2% vs TC avg
Strong +57% interview lift
Without
With
+57.0%
Interview Lift
resolved cases with interview
Typical timeline
3y 4m
Avg Prosecution
42 currently pending
Career history
68
Total Applications
across all art units

Statute-Specific Performance

§103
67.0%
+27.0% vs TC avg
§102
26.1%
-13.9% vs TC avg
§112
6.9%
-33.1% vs TC avg
Black line = Tech Center average estimate • Based on career data from 26 resolved cases

Office Action

§103
DETAILED ACTION 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 . Status of the Claims The office action is in response to the claim amendments and remarks filed on December 24, 2025 for the application filed May 09, 2023. Claims 1 and 4 are currently amended. Claims 1-20 are currently pending. 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. 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-6, 10-17 are rejected under 35 U.S.C. 103 as being unpatentable over Zhu et al. (US2021/0377840A1) in view of Ho et al. (KR100564753B1). Regarding claim 1, Zhu teaches a method of processing a packet in a protocol entity of a node in a communications system, comprising: receiving the packet from a first peer node; performing a first set of functions on the packet based on destination information of the packet; comparing a destination of the packet with an identity of the node (Paragraph [0006]: According to a first aspect, a communication method is provided. The method includes: receiving, by a first entity in one or more adaptation layer entities of a network node, a data packet that is delivered by a protocol layer entity of a lower protocol layer and that includes an adaptation layer header and an adaptation layer payload; determining, by the first entity, whether the network node is a destination node to which the data packet is routed at an adaptation layer; and processing, by the first entity, the data packet based on a determining result. Paragraph [0007]: The first entity is located on a receive side of the network node. Paragraph [0008]: According to the method provided in the first aspect, whether the network node is the destination node of the routing at the adaptation layer directly affects a subsequent data packet processing process. Therefore, the network node processes the data packet based on the determining result of whether the network node is the destination node of the routing at the adaptation layer, to correctly process the data packet. Paragraph [0239]: When the data packet is the data PDU, after the first entity of the network node stores the data packet in the buffer of the Adapt layer, the network node may further perform an action in any one of the implementation 1 to the implementation 3. In this case, the network node may be an access IAB node, a donor node, or a donor-DU. Paragraph [0207]: According to the method provided in Embodiment 1, whether the network node is the destination node of the routing at the Adapt layer directly affects a subsequent data packet processing process. Therefore, according to the method provided in Embodiment 1, the network node processes the data packet based on the determining result of whether the network node is the destination node to which the data packet is routed at the Adapt layer, to correctly process the data packet, thereby avoiding an error in the data packet processing process.) in response to the destination of the packet matching the identity of the node, performing a second set of functions on the packet based on flow identifier information (Paragraph [0055]: In a possible implementation, before the adding, by a first entity of a network node, an adaptation layer header to the data packet, the method further includes: performing, by the first entity of the network node, header compression on the data packet. In this possible implementation, the first entity of the network node performs the header compression on the data packet. Paragraph [0162]: The Adapt layer has one or more of the following capabilities: adding, to a data packet, routing information (Routing info) that can be identified by a wireless backhaul node; performing routing selection based on the routing information that can be identified by the wireless backhaul node; adding, to the data packet, identification information that can be identified by the wireless backhaul node and that is related to a quality of service (QoS) requirement; performing QoS mapping on a plurality of links including the wireless backhaul node for the data packet; adding data packet type indication information to the data packet; and sending flow control feedback information to a node having a flow control capability. Paragraph [0166]: The identification information related to the QoS requirement may be a QoS flow identifier (QFI) of the terminal, an identifier of the RB of the terminal, a differentiated services code point (DSCP), a flow label in a header of an IP data packet of internet protocol version 6 (IPv6), and the like.) and in response to the destination of the packet not matching the identity of the node, transmitting a copy of the packet to a second peer node (Paragraph [0017]: In a possible implementation, the determining result is that the network node is not the destination node to which the data packet is routed at the adaptation layer, and the processing, by the first entity of the network node, the data packet based on a determining result includes: delivering, by the first entity of the network node, the data packet to a third entity, where the third entity is a protocol layer entity of a protocol layer of a wireless backhaul interface or a protocol layer entity of a lower protocol layer of the adaptation layer. Paragraph [0018]: The third entity in the first aspect is located on a transmit side of the network node. Paragraph [0036]: According to the method provided in the third aspect, the third entity of the network node delivers the data packet to the fourth entity through the second service differentiation channel corresponding to the next-hop node of the data packet, so that it can be ensured that the data packet is correctly transmitted to the next-hop node of the data packet.) Zhu does not explicitly teach wherein the second set of functions comprises: security processing However, Ho teaches wherein the second set of functions comprises: security processing (Page 7, Paragraph 6: 2 is a flowchart illustrating an operation of an IP security protocol processing apparatus of FIG. 1. Referring to FIG. 2, when a packet is received through a network, the packet classification engine 111 performs different processing according to the destination IP address of the packet (S110). If the destination IP address of the packet matches the router's own address, the packet examines the value of the protocol field of the packet as inbound IP traffic (S120). If the value of the protocol field is AH or ESP, this packet indicates that the packet is being encrypted or authenticated through the IPSec protocol. For this packet, an input IPSec processing unit (which is present in the IPSec engine 120 for application of the IPSec protocol) 114, the packet is delivered (S130 to S140). The input IPSec processing unit 114 of the IPSec engine 120 performs authentication and encryption processing on the packet by using a key possessed by a predetermined router and an authentication and encryption algorithm possessed by the authentication and encryption information storage unit 113 ( S150). If the destination IP address of the packet is not the router's own address, the packet is outbound IP traffic.) Therefore, it would have been obvious to one of ordinary skill in the art before the effective filing date of the claimed invention to provide wherein the second set of functions comprises: security processing, as taught by Ho in the system of Zhu, so that authentication and encryption processing can be performed on the packet (Ho: Page 7, Paragraph 6). Regarding claim 2, the combination of Zhu and Ho teaches the method of claim 1 (see rejection for claim 1); Zhu further teaches wherein the first set of functions comprises duplicate detection and discarding (Paragraph [0356]: Optionally, for a transmit side of the network node, if the Adapt layer receives, from a lower protocol layer (for example, an RLC layer), a sending success acknowledgment indication for a data packet (an Adapt PDU, an Adapt SDU, or an RLC SDU), the Adapt layer may discard the data packet according to the indication, to clean up buffer space. Paragraph [0357]: In this optional method, when there is a buffer at the Adapt layer, the Adapt layer may be enabled to effectively perform buffer management and discard a data packet that does not need to be buffered. For example, after receiving an RLC status report fed back from a receive side of a node communicating with the network node, an RLC layer entity on the transmit side of the network node may send, based on data packet acknowledgment (ACK) information indicated in the RLC status report, a sending success acknowledgment indication to an upper protocol layer, namely, the Adapt layer; and the Adapt layer discards a data packet according to the indication, to clean up buffer space.) identifying a next hop in a route (Paragraph [0018]: The third entity in the first aspect is located on a transmit side of the network node. Paragraph [0036]: According to the method provided in the third aspect, the third entity of the network node delivers the data packet to the fourth entity through the second service differentiation channel corresponding to the next-hop node of the data packet, so that it can be ensured that the data packet is correctly transmitted to the next-hop node of the data packet. Paragraph [0040]: In this possible implementation, the third entity of the network node may determine the next-hop node and/or the second service differentiation channel for delivering the data packet, to ensure that the third entity correctly delivers the data packet to the lower protocol layer. Paragraph [0194]: Routing information: This field is used to indicate routing information of the Adapt PDU. For example, the routing information may include an identifier of a destination node that receives the Adapt PDU, and may further include an identifier of a source node that sends the Adapt PDU. Paragraph [0376]: Optionally, referring to FIG. 17, the network node further includes a determining unit 1704, where the determining unit 1704 is configured to determine a next-hop node of the data packet, and the processing unit 1703 is further configured to deliver, to the third entity, information used to indicate the next-hop node.) Regarding claim 3, the combination of Zhu and Ho teaches the method of claim 1 (see rejection for claim 1); Zhu further teaches wherein the second set of functions comprises delivery to an upper protocol layer (Paragraph [0362]: An embodiment of this application further provides a network node (denoted as a network node 170). As shown in FIG. 17, the network node includes: Paragraph [0363]: an obtaining unit 1701, configured to receive a data packet delivered by a protocol layer entity of a lower protocol layer of an adaptation layer of the network node, Paragraph [0364]: a judging unit 1702, configured to determine whether the network node is a destination node to which the data packet is routed at the adaptation layer; Paragraph [0365]: a processing unit 1703, configured to process the data packet based on a determining result. Paragraph [0366]: Optionally, the determining result is that the network node is the destination node to which the data packet is routed at the adaptation layer; and Paragraph [0367]: the processing unit 1703 is specifically configured to deliver the adaptation layer payload of the data packet to a second entity, where the second entity is a protocol layer entity of a protocol layer of an F1 interface or a protocol layer entity of an upper protocol layer of the adaptation layer.) Regarding claim 4, the combination of Zhu and Ho teaches the method of claim 1 (see rejection for claim 1); Zhu further teaches wherein the second set of functions further comprises flow identification (Paragraph [0162]: The Adapt layer has one or more of the following capabilities: adding, to a data packet, routing information (Routing info) that can be identified by a wireless backhaul node; performing routing selection based on the routing information that can be identified by the wireless backhaul node; adding, to the data packet, identification information that can be identified by the wireless backhaul node and that is related to a quality of service (QoS) requirement; performing QoS mapping on a plurality of links including the wireless backhaul node for the data packet; adding data packet type indication information to the data packet; and sending flow control feedback information to a node having a flow control capability. Paragraph [0166]: The identification information related to the QoS requirement may be a QoS flow identifier (QFI) of the terminal, an identifier of the RB of the terminal, a differentiated services code point (DSCP), a flow label in a header of an IP data packet of internet protocol version 6 (IPv6), and the like.) Regarding claim 5, the combination of Zhu and Ho teaches the method of claim 1 (see rejection for claim 1); Zhu further teaches wherein the packet comprises a source identity (Paragraph [0156]: The Adapt layer header may include routing information (which may also be referred to as routing-related information of the Adapt layer) and/or RB-related information of a terminal to which the data packet belongs, and may further include Adapt PDU type indication information, where the Adapt PDU type indication information is used to indicate whether a type of the Adapt PDU is a control PDU or a data PDU. Paragraph [0194]: Routing information: This field is used to indicate routing information of the Adapt PDU. For example, the routing information may include an identifier of a destination node that receives the Adapt PDU, and may further include an identifier of a source node that sends the Adapt PDU.) a destination identity (Paragraph [0157]: The routing information may be an identifier of a destination node of a routing at the Adapt layer, or an identifier of a cell served by a destination node of a routing at the Adapt layer, or an identifier of a transmission path at the Adapt layer. The destination node of the routing at the Adapt layer is the last node of the routing at the Adapt layer.) a flow identifier (Paragraph [0162]: The Adapt layer has one or more of the following capabilities: adding, to a data packet, routing information (Routing info) that can be identified by a wireless backhaul node; performing routing selection based on the routing information that can be identified by the wireless backhaul node; adding, to the data packet, identification information that can be identified by the wireless backhaul node and that is related to a quality of service (QoS) requirement; performing QoS mapping on a plurality of links including the wireless backhaul node for the data packet; adding data packet type indication information to the data packet; and sending flow control feedback information to a node having a flow control capability. Paragraph [0166]: The identification information related to the QoS requirement may be a QoS flow identifier (QFI) of the terminal, an identifier of the RB of the terminal, a differentiated services code point (DSCP), a flow label in a header of an IP data packet of internet protocol version 6 (IPv6), and the like.) and an upper layer protocol data unit (PDU) (Paragraph [0156]: The Adapt layer header may include routing information (which may also be referred to as routing-related information of the Adapt layer) and/or RB-related information of a terminal to which the data packet belongs, and may further include Adapt PDU type indication information, where the Adapt PDU type indication information is used to indicate whether a type of the Adapt PDU is a control PDU or a data PDU. Paragraph [0367]: the processing unit 1703 is specifically configured to deliver the adaptation layer payload of the data packet to a second entity, where the second entity is a protocol layer entity of a protocol layer of an F1 interface or a protocol layer entity of an upper protocol layer of the adaptation layer. Paragraph [0371]: the processing unit 1703 is specifically configured to deliver the data packet to a third entity, where the third entity is a protocol layer entity of a protocol layer of a wireless backhaul interface or a protocol layer entity of a lower protocol layer of the adaptation layer.) Regarding claim 6, the combination of Zhu and Ho teaches he method of claim 1 (see rejection for claim 1); Zhu further teaches wherein types of upper layer PDUs supported by the packet include; a PDU of an RRC protocol; a PDU of an F1 application protocol (F1AP) (Paragraph [0057]: The network node includes: an obtaining unit, configured to receive a data packet from a fifth entity, where the fifth entity is a protocol layer entity of a protocol layer of an F1 interface or a protocol layer entity of an upper protocol layer of an adaptation layer, and the data packet is a data packet including an adaptation layer payload; an adding unit, configured to add an adaptation layer header to the data packet; Paragraph [0165]: The data packet type indication information may be used to indicate that content encapsulated at the Adapt layer includes any one or more of the following types: user plane data of the terminal, an RRC message of the terminal, an RRC message of the IAB node, a control layer application message (for example, an F1AP message) on an interface between the IAB node and the donor node (or the donor-CU or a CU-CP), a flow control feedback message generated by the IAB node, a header compression feedback message generated by the IAB node, a data PDU of the Adapt layer, a control PDU of the Adapt layer, and the like.) Regarding claim 10, the combination of Zhu and Ho teaches the method of claim 1 (see rejection for claim 1); Zhu further teaches wherein the flow identifier information includes a QoS flow identifier corresponding to a data flow of a control-plane transmission (Paragraph [0152]: The PDU of the Adapt layer may be classified into a control PDU of the Adapt layer and a data PDU of the Adapt layer. In the data PDU of the Adapt layer, an Adapt layer payload includes user plane data and/or control plane signaling. In the control PDU of the Adapt layer, an Adapt layer payload includes Adapt layer feedback information, for example, flow control feedback information, header compression feedback information, or other feedback information or control information generated by the Adapt layer. The control PDU that is of the Adapt layer and that includes the header compression feedback information may be referred to as a header compression status report. The control PDU that is of the Adapt layer and that includes the flow control feedback information may be referred to as a flow control status report. Paragraph [0162]: The Adapt layer has one or more of the following capabilities: adding, to a data packet, routing information (Routing info) that can be identified by a wireless backhaul node; performing routing selection based on the routing information that can be identified by the wireless backhaul node; adding, to the data packet, identification information that can be identified by the wireless backhaul node and that is related to a quality of service (QoS) requirement; performing QoS mapping on a plurality of links including the wireless backhaul node for the data packet; adding data packet type indication information to the data packet; and sending flow control feedback information to a node having a flow control capability. Paragraph [0166]: The identification information related to the QoS requirement may be a QoS flow identifier (QFI) of the terminal, an identifier of the RB of the terminal, a differentiated services code point (DSCP), a flow label in a header of an IP data packet of internet protocol version 6 (IPv6), and the like.) Regarding claim 11, Zhu teaches a method of processing a service data unit (SDU) in a protocol entity of a node in a communications system, comprising: receiving the SDU from an upper protocol layer; wherein the SDU is associated with flow identifier information (Paragraph [0150]: In a communications network, a data unit exchanged between peer protocol layer entities of different nodes is a PDU. A protocol layer transfers a PDU of the protocol layer to an adjacent lower protocol layer by using a service access point (SAP) (which may also be referred. to as a service interface) provided by the lower protocol layer to the protocol layer, and the lower protocol layer indirectly exchanges the PDU of the protocol layer. The PDU of the protocol layer is used as an SDU of the lower protocol layer. Paragraph [0151]: For example, for a protocol layer, if a data packet received by the protocol layer does not include a protocol layer header of the protocol layer, the data packet may be considered as an SDU of the protocol layer; or if a data packet received by the protocol layer includes a protocol layer header of the protocol layer, the data packet may be considered as a PDU of the protocol layer. For example, for an Adapt layer, if a data packet received by the Adapt layer does not include an Adapt layer header, the data packet may be considered as an SDU of the Adapt layer; or if a data packet received by the Adapt layer includes an Adapt layer header, the data packet may be considered as a PDU of the Adapt layer. Paragraph [0162]: The Adapt layer has one or more of the following capabilities: adding, to a data packet, routing information (Routing info) that can be identified by a wireless backhaul node; performing routing selection based on the routing information that can be identified by the wireless backhaul node; adding, to the data packet, identification information that can be identified by the wireless backhaul node and that is related to a quality of service (QoS) requirement; performing QoS mapping on a plurality of links including the wireless backhaul node for the data packet; adding data packet type indication information to the data packet; and sending flow control feedback information to a node having a flow control capability. Paragraph [0166]: The identification information related to the QoS requirement may be a QoS flow identifier (QFI) of the terminal, an identifier of the RB of the terminal, a differentiated services code point (DSCP), a flow label in a header of an IP data packet of internet protocol version 6 (IPv6), and the like. Paragraph [0371]: The processing unit 1703 is specifically configured to deliver the data packet to a third entity, where the third entity is a protocol layer entity of a protocol layer of a wireless backhaul interface or a protocol layer entity of a lower protocol layer of the adaptation layer.) performing a second set of functions on the SDU to generate a protocol data unit (PDU) of the protocol entity based on the flow identifier information (Paragraph [0055]: In a possible implementation, before the adding, by a first entity of a network node, an adaptation layer header to the data packet, the method further includes: performing, by the first entity of the network node, header compression on the data packet. In this possible implementation, the first entity of the network node performs the header compression on the data packet. Paragraph [0162]: The Adapt layer has one or more of the following capabilities: adding, to a data packet, routing information (Routing info) that can be identified by a wireless backhaul node; performing routing selection based on the routing information that can be identified by the wireless backhaul node; adding, to the data packet, identification information that can be identified by the wireless backhaul node and that is related to a quality of service (QoS) requirement; performing QoS mapping on a plurality of links including the wireless backhaul node for the data packet; adding data packet type indication information to the data packet; and sending flow control feedback information to a node having a flow control capability. Paragraph [0166]: The identification information related to the QoS requirement may be a QoS flow identifier (QFI) of the terminal, an identifier of the RB of the terminal, a differentiated services code point (DSCP), a flow label in a header of an IP data packet of internet protocol version 6 (IPv6), and the like.) wherein the PDU comprises destination information of a packet; performing a first set of functions on the PDU based on the destination information; and transmitting the packet to a peer node, wherein the peer node is a next hop determined by the performing the first set of functions on the packet, and wherein the packet comprises at least the PDU. (Paragraph [0030]: In a possible implementation, the determining, by the first entity of the network node, whether the network node is a destination node to which the data packet is routed at an adaptation layer includes: determining, by the first entity of the network node, whether the network node is the destination node to which the data packet is routed at the adaptation layer based on one or more of routing information in the adaptation layer header of the data packet, whether the adaptation layer header of the data packet includes the routing information, or whether the data packet is the control PDU. Paragraph [0036]: According to the method provided in the third aspect, the third entity of the network node delivers the data packet to the fourth entity through the second service differentiation channel corresponding to the next-hop node of the data packet, so that it can be ensured that the data packet is correctly transmitted to the next-hop node of the data packet. Paragraph [0207]: According to the method provided in Embodiment 1, whether the network node is the destination node of the routing at the Adapt layer directly affects a subsequent data packet processing process. Therefore, according to the method provided in Embodiment 1, the network node processes the data packet based on the determining result of whether the network node is the destination node to which the data packet is routed at the Adapt layer, to correctly process the data packet, thereby avoiding an error in the data packet processing process. Paragraph [0376]: Optionally, referring to FIG. 17, the network node further includes a determining unit 1704, where the determining unit 1704 is configured to determine a next-hop node of the data packet, and the processing unit 1703 is further configured to deliver, to the third entity, information used to indicate the next-hop node;) Zhu does not explicitly teach wherein the second set of functions comprises: security processing However, Ho teaches wherein the second set of functions comprises: security processing (Page 7, Paragraph 6: 2 is a flowchart illustrating an operation of an IP security protocol processing apparatus of FIG. 1. Referring to FIG. 2, when a packet is received through a network, the packet classification engine 111 performs different processing according to the destination IP address of the packet (S110). If the destination IP address of the packet matches the router's own address, the packet examines the value of the protocol field of the packet as inbound IP traffic (S120). If the value of the protocol field is AH or ESP, this packet indicates that the packet is being encrypted or authenticated through the IPSec protocol. For this packet, an input IPSec processing unit (which is present in the IPSec engine 120 for application of the IPSec protocol) 114, the packet is delivered (S130 to S140). The input IPSec processing unit 114 of the IPSec engine 120 performs authentication and encryption processing on the packet by using a key possessed by a predetermined router and an authentication and encryption algorithm possessed by the authentication and encryption information storage unit 113 ( S150). If the destination IP address of the packet is not the router's own address, the packet is outbound IP traffic.) Therefore, it would have been obvious to one of ordinary skill in the art before the effective filing date of the claimed invention to provide wherein the second set of functions comprises: security processing, as taught by Ho in the system of Zhu, so that authentication and encryption processing can be performed on the packet (Ho: Page 7, Paragraph 6). Regarding claim 12, the combination of Zhu and Ho teaches the method of claim 11 (see rejection for claim 11); Zhu further teaches wherein the flow identifier is a QoS flow identifier (Paragraph [0152]: The PDU of the Adapt layer may be classified into a control PDU of the Adapt layer and a data PDU of the Adapt layer. In the data PDU of the Adapt layer, an Adapt layer payload includes user plane data and/or control plane signaling. In the control PDU of the Adapt layer, an Adapt layer payload includes Adapt layer feedback information, for example, flow control feedback information, header compression feedback information, or other feedback information or control information generated by the Adapt layer. The control PDU that is of the Adapt layer and that includes the header compression feedback information may be referred to as a header compression status report. The control PDU that is of the Adapt layer and that includes the flow control feedback information may be referred to as a flow control status report. Paragraph [0162]: The Adapt layer has one or more of the following capabilities: adding, to a data packet, routing information (Routing info) that can be identified by a wireless backhaul node; performing routing selection based on the routing information that can be identified by the wireless backhaul node; adding, to the data packet, identification information that can be identified by the wireless backhaul node and that is related to a quality of service (QoS) requirement; performing QoS mapping on a plurality of links including the wireless backhaul node for the data packet; adding data packet type indication information to the data packet; and sending flow control feedback information to a node having a flow control capability. Paragraph [0166]: The identification information related to the QoS requirement may be a QoS flow identifier (QFI) of the terminal, an identifier of the RB of the terminal, a differentiated services code point (DSCP), a flow label in a header of an IP data packet of internet protocol version 6 (IPv6), and the like.) Regarding claim 13, the combination of Zhu and Ho teaches the method of claim 11 (see rejection for claim 11); Zhu further teaches wherein the flow identifier corresponds to a control protocol (Paragraph [0152]: The PDU of the Adapt layer may be classified into a control PDU of the Adapt layer and a data PDU of the Adapt layer. In the data PDU of the Adapt layer, an Adapt layer payload includes user plane data and/or control plane signaling. In the control PDU of the Adapt layer, an Adapt layer payload includes Adapt layer feedback information, for example, flow control feedback information, header compression feedback information, or other feedback information or control information generated by the Adapt layer. The control PDU that is of the Adapt layer and that includes the header compression feedback information may be referred to as a header compression status report. The control PDU that is of the Adapt layer and that includes the flow control feedback information may be referred to as a flow control status report. Paragraph [0162]: The Adapt layer has one or more of the following capabilities: adding, to a data packet, routing information (Routing info) that can be identified by a wireless backhaul node; performing routing selection based on the routing information that can be identified by the wireless backhaul node; adding, to the data packet, identification information that can be identified by the wireless backhaul node and that is related to a quality of service (QoS) requirement; performing QoS mapping on a plurality of links including the wireless backhaul node for the data packet; adding data packet type indication information to the data packet; and sending flow control feedback information to a node having a flow control capability. Paragraph [0166]: The identification information related to the QoS requirement may be a QoS flow identifier (QFI) of the terminal, an identifier of the RB of the terminal, a differentiated services code point (DSCP), a flow label in a header of an IP data packet of internet protocol version 6 (IPv6), and the like.) Regarding claim 14, the combination of Zhu and Ho teaches the method of claim 11 (see rejection for claim 11); Zhu further teaches wherein the second set of functions further comprises header compression (Paragraph [0055]: In a possible implementation, before the adding, by a first entity of a network node, an adaptation layer header to the data packet, the method further includes: performing, by the first entity of the network node, header compression on the data packet. In this possible implementation, the first entity of the network node performs the header compression on the data packet. Regarding claim 15, the combination of Zhu and Ho teaches the method of claim 11 (see rejection for claim 11); Zhu further teaches wherein the first set of functions comprises identifying the next hop in a route (Paragraph [0018]: The third entity in the first aspect is located on a transmit side of the network node. Paragraph [0036]: According to the method provided in the third aspect, the third entity of the network node delivers the data packet to the fourth entity through the second service differentiation channel corresponding to the next-hop node of the data packet, so that it can be ensured that the data packet is correctly transmitted to the next-hop node of the data packet. Paragraph [0040]: In this possible implementation, the third entity of the network node may determine the next-hop node and/or the second service differentiation channel for delivering the data packet, to ensure that the third entity correctly delivers the data packet to the lower protocol layer. Paragraph [0194]: Routing information: This field is used to indicate routing information of the Adapt PDU. For example, the routing information may include an identifier of a destination node that receives the Adapt PDU, and may further include an identifier of a source node that sends the Adapt PDU. Paragraph [0376]: Optionally, referring to FIG. 17, the network node further includes a determining unit 1704, where the determining unit 1704 is configured to determine a next-hop node of the data packet, and the processing unit 1703 is further configured to deliver, to the third entity, information used to indicate the next-hop node.) and identification of an egress transport bearer (Paragraph [0306]: During specific implementation of the manner 1, the third entity of the network node may determine the second service differentiation channel based on a correspondence between a service differentiation channel of an ingress link and a service differentiation channel of an egress link. A service differentiation channel of one ingress link may correspond to one or more service differentiation channels of one or more egress links. Paragraph [0354]: The new Adapt layer routing and forwarding table may include a new uplink Adapt layer routing and forwarding table and/or a new downlink Adapt layer routing and forwarding table. The new bearer mapping relationship may be a new mapping relationship between an RB of a terminal and a service differentiation channel of a new egress link, a new mapping relationship between a service differentiation channel of an ingress link and a service differentiation channel of a new egress link, or the like.) Regarding claim 16, the combination of Zhu and Ho teaches the method of claim 11 (see rejection for claim 11); Zhu further teaches wherein the packet comprises a header including a source identity (Paragraph [0156]: The Adapt layer header may include routing information (which may also be referred to as routing-related information of the Adapt layer) and/or RB-related information of a terminal to which the data packet belongs, and may further include Adapt PDU type indication information, where the Adapt PDU type indication information is used to indicate whether a type of the Adapt PDU is a control PDU or a data PDU. Paragraph [0194]: Routing information: This field is used to indicate routing information of the Adapt PDU. For example, the routing information may include an identifier of a destination node that receives the Adapt PDU, and may further include an identifier of a source node that sends the Adapt PDU.) a destination identity (Paragraph [0157]: The routing information may be an identifier of a destination node of a routing at the Adapt layer, or an identifier of a cell served by a destination node of a routing at the Adapt layer, or an identifier of a transmission path at the Adapt layer. The destination node of the routing at the Adapt layer is the last node of the routing at the Adapt layer.) and a flow identifier (Paragraph [0162]: The Adapt layer has one or more of the following capabilities: adding, to a data packet, routing information (Routing info) that can be identified by a wireless backhaul node; performing routing selection based on the routing information that can be identified by the wireless backhaul node; adding, to the data packet, identification information that can be identified by the wireless backhaul node and that is related to a quality of service (QoS) requirement; performing QoS mapping on a plurality of links including the wireless backhaul node for the data packet; adding data packet type indication information to the data packet; and sending flow control feedback information to a node having a flow control capability. Paragraph [0166]: The identification information related to the QoS requirement may be a QoS flow identifier (QFI) of the terminal, an identifier of the RB of the terminal, a differentiated services code point (DSCP), a flow label in a header of an IP data packet of internet protocol version 6 (IPv6), and the like.) Regarding claim 17, the combination of Zhu and Ho teaches the method of claim 11 (see rejection for claim 11); Zhu further teaches wherein the packet includes an upper layer PDU of the upper layer protocol (Paragraph [0156]: The Adapt layer header may include routing information (which may also be referred to as routing-related information of the Adapt layer) and/or RB-related information of a terminal to which the data packet belongs, and may further include Adapt PDU type indication information, where the Adapt PDU type indication information is used to indicate whether a type of the Adapt PDU is a control PDU or a data PDU. Paragraph [0367]: the processing unit 1703 is specifically configured to deliver the adaptation layer payload of the data packet to a second entity, where the second entity is a protocol layer entity of a protocol layer of an F1 interface or a protocol layer entity of an upper protocol layer of the adaptation layer. Paragraph [0371]: the processing unit 1703 is specifically configured to deliver the data packet to a third entity, where the third entity is a protocol layer entity of a protocol layer of a wireless backhaul interface or a protocol layer entity of a lower protocol layer of the adaptation layer.) and types of upper layer PDUs supported by the packet include a PDU of an RRC protocol; a PDU of an F1 application protocol (F1AP) (Paragraph [0057]: The network node includes: an obtaining unit, configured to receive a data packet from a fifth entity, where the fifth entity is a protocol layer entity of a protocol layer of an F1 interface or a protocol layer entity of an upper protocol layer of an adaptation layer, and the data packet is a data packet including an adaptation layer payload; an adding unit, configured to add an adaptation layer header to the data packet; Paragraph [0165]: The data packet type indication information may be used to indicate that content encapsulated at the Adapt layer includes any one or more of the following types: user plane data of the terminal, an RRC message of the terminal, an RRC message of the IAB node, a control layer application message (for example, an F1AP message) on an interface between the IAB node and the donor node (or the donor-CU or a CU-CP), a flow control feedback message generated by the IAB node, a header compression feedback message generated by the IAB node, a data PDU of the Adapt layer, a control PDU of the Adapt layer, and the like.) Claims 7, 8, 18, 19 are rejected under 35 U.S.C. 103 as being unpatentable over Zhu et al. in view of Ho et al. and further in view of Wu et al. (US2023/0413351A1). Regarding claim 7, the combination of Zhu and Ho teaches the method of claim 1 (see rejection for claim 1); Zhu further teaches wherein types of upper layer PDUs supported by the packet include: a PDU of an RRC protocol; a PDU of an F1AP (see rejection for claim 6); The combination of Zhu and Ho does not explicitly teach a PDU of a PC5-RRC protocol. However, Wu teaches a PDU of a PC5-RRC protocol (Abstract: According to some embodiments of the disclosure, a method may include: establishing a RRC connection between a first UE and a BS via a second UE, wherein a PC5 RRC connection between the first UE and the second UE has been established and an RRC connection between the second UE and the BS has been established; receiving, from either the first UE or the BS at a second UE, a first data; determining a destination of the first data; and transmitting the first data to the destination of the first data in response to the destination of the first data being not the second UE. Paragraph [0012]: According to some other embodiments of the present disclosure, a method may include establishing, at a first user equipment (UE), a radio resource control (RRC) connection with a base station (BS) via a second UE, wherein a PC5 RRC connection between the first UE and the second UE has been established and an RRC connection between the second UE and the BS has been established; encoding upper layer data into a sidelink adaptation layer (SLAP) protocol data unit (PDU); and transmitting the SLAP PDU to the BS, wherein the SLAP PDU may include a header of the SLAP PDU including at least one sub-header and at least one service data unit (SDU).) Therefore, it would have been obvious to one of ordinary skill in the art before the effective filing date of the claimed invention to provide a PDU of a PC5-RRC protocol, as taught by Wu in the combined system of Zhu and Ho, so that the sidelink adaptation layer protocol data unit (SLAP PDU) can be received based on the PC5-RRC protocol, and can be processed and transmitted to the destination. This will facilitate efficient communication between a remote UE and a base station via a relay UE (Wu: Abstract, Paragraphs [0005], [0006], [0012]). Regarding claim 8, the combination of Zhu and Ho teaches the method of claim 1 (see rejection for claim 1); The combination of Zhu and Ho does not explicitly teach wherein the node in the communications system is one of a remote UE and a relay UE. However, Wu teaches wherein the node in the communications system is one of a remote UE and a relay UE (Abstract: According to some embodiments of the disclosure, a method may include: establishing a RRC connection between a first UE and a BS via a second UE, wherein a PC5 RRC connection between the first UE and the second UE has been established and an RRC connection between the second UE and the BS has been established; receiving, from either the first UE or the BS at a second UE, a first data; determining a destination of the first data; and transmitting the first data to the destination of the first data in response to the destination of the first data being not the second UE. Paragraph [0005]: A relaying function based on a sidelink may be supported in a communication network. For example, a UE supporting sidelink communication may function as a relay node to extend the coverage of a BS. An out-of-coverage UE may communicate with a BS via a relay UE. In the context of the present disclosure, a UE, which functions as a relay between another UE and a BS, may be referred to a UE-to-network relay or a U2N relay. There is a need for efficiently performing communication in a communication system supporting a U2N relay.) Therefore, it would have been obvious to one of ordinary skill in the art before the effective filing date of the claimed invention to provide wherein the node in the communications system is one of a remote UE and a relay UE, as taught by Wu in the combined system of Zhu and Ho, so that the sidelink adaptation layer protocol data unit (SLAP PDU) and can be processed and transmitted to the destination. This will facilitate efficient communication between a remote UE and a base station via a relay UE (Wu: Abstract, Paragraphs [0005], [0006], [0012]). Regarding claim 18, the combination of Zhu and Ho teaches the method of claim 11 (see rejection for claim 11); Zhu further teaches wherein the packet includes an upper layer PDU of the upper layer protocol, and types of upper layer PDUs supported by the packet include a PDU of an RRC protocol; and a PDU of an F1AP (see rejection for claim 17); The combination of Zhu and Ho does not explicitly teach a PDU of a PC5-RRC protocol. However, Wu teaches a PDU of a PC5-RRC protocol (Abstract: According to some embodiments of the disclosure, a method may include: establishing a RRC connection between a first UE and a BS via a second UE, wherein a PC5 RRC connection between the first UE and the second UE has been established and an RRC connection between the second UE and the BS has been established; receiving, from either the first UE or the BS at a second UE, a first data; determining a destination of the first data; and transmitting the first data to the destination of the first data in response to the destination of the first data being not the second UE. Paragraph [0012]: According to some other embodiments of the present disclosure, a method may include establishing, at a first user equipment (UE), a radio resource control (RRC) connection with a base station (BS) via a second UE, wherein a PC5 RRC connection between the first UE and the second UE has been established and an RRC connection between the second UE and the BS has been established; encoding upper layer data into a sidelink adaptation layer (SLAP) protocol data unit (PDU); and transmitting the SLAP PDU to the BS, wherein the SLAP PDU may include a header of the SLAP PDU including at least one sub-header and at least one service data unit (SDU).) Therefore, it would have been obvious to one of ordinary skill in the art before the effective filing date of the claimed invention to provide a PDU of a PC5-RRC protocol, as taught by Wu in the combined system of Zhu and Ho, so that the sidelink adaptation layer protocol data unit (SLAP PDU) can be received based on the PC5-RRC protocol, and can be processed and transmitted to the destination. This will facilitate efficient communication between a remote UE and a base station via a relay UE (Wu: Abstract, Paragraphs [0005], [0006], [0012]). Regarding claim 19, the combination of Zhu and Ho teaches the method of claim 11 (see rejection for claim 11); The combination of Zhu and Ho does not explicitly teach wherein the node in the communications system is one of a remote UE and a relay UE. However, Wu teaches wherein the node in the communications system is one of a remote UE and a relay UE (see rejection for claim 8); Therefore, it would have been obvious to one of ordinary skill in the art before the effective filing date of the claimed invention to provide wherein the node in the communications system is one of a remote UE and a relay UE, as taught by Wu in the combined system of Zhu and Ho, so that the sidelink adaptation layer protocol data unit (SLAP PDU) and can be processed and transmitted to the destination. This will facilitate efficient communication between a remote UE and a base station via a relay UE (Wu: Abstract, Paragraphs [0005], [0006], [0012]). Claims 9, 20 are rejected under 35 U.S.C. 103 as being unpatentable over Zhu et al. in view of Ho et al. and further in view of Shimoda et al. (US2024/0260110A1). Regarding claim 9, the combination of Zhu and Ho teaches the method of claim 1 (see rejection for claim 1); Zhu further teaches wherein the node in the communications system is one of a base station; an integrated access and backhaul node (IAB-node); a distributed unit (DU); a centralized unit (CU) (Paragraph [0098]: In a network including an IAB node (referred to as an IAB network for short below), the IAB node may provide a radio access service for a terminal, and is connected to a donor node through a wireless backhaul link for transmitting service data of a user. For example, the donor node may be a donor base station. The donor node may be briefly referred to as an IAB donor or a DgNB (namely, a donor gNodeB) in the 5G network. The donor node may be a complete entity, or may be in a form in which a centralized unit (CU) (referred to as a donor-CU or a CU for short in this specification) and a distributed unit (DU) (referred to as a donor-DU for short in this specification) are separated, that is, the donor node includes the donor-CU and the donor-DU. In the embodiments of this application and the accompanying drawings, an example in which the donor node includes the donor-CU and the donor-DU is used to describe the method provided in the embodiments of this application.) a node of a user plane function (UPF) (Paragraph [0102]: For example, referring to FIG. 1, a parent node of an IAB node 1 is a donor node, the IAB node 1 is a parent node of an IAB node 2 and an IAB node 3, both the IAB node 2 and the IAB node 3 are parent nodes of an IAB node 4, and a parent node of an IAB node 5 is the IAB node 3. An uplink data packet of a terminal may be transmitted to the donor node through one or more IAB nodes, and then the donor node sends the uplink data packet to a mobile gateway device (for example, a user plane function (UPF) network element in a 5G network). After receiving a downlink data packet from the mobile gateway device, the donor node sends the downlink data packet to the terminal through the one or more IAB nodes. There are two available paths for data packet transmission between a terminal 1 and the donor node: the terminal 1→the IAB node 4→the IAB node 3→the IAB node 1→the donor node, and the terminal 1→the IAB node 4→the IAB node 2→the IAB node 1→the donor node. There are three available paths for data packet transmission between a terminal 2 and the donor node: the terminal 2→the IAB node 4→the IAB node 3→the IAB node 1→the donor node, the terminal 2→the IAB node 4→the IAB node 2→the IAB node 1→the donor node, and the terminal 2→the IAB node 5→the IAB node 2→the IAB node 1→the donor node.) The combination of Zhu and Ho does not explicitly teach a node of a mobility management function (AMF); and a node of a location management function (LMF). However, Shimoda teaches a node of a mobility management function (AMF); and a node of a location management function (LMF) (Abstract: A communication system is configured with a central unit and a distributed unit, includes a first base station that operates as a donor for integrated access and backhaul and one or more second base stations that operate as nodes for the integrated access and backhaul, and the central unit performs address configuration for multicasting data from a central unit toward a communication terminal in a backhaul adaptation layer in which data transmitted and received by the communication terminal is routed, on the distributed unit and the second base stations. Paragraph [0248]: An identifier representing the BAP address may be provided. For example, an identifier associated with each of the transmission destination BAP address and/or the next hop BAP address configured from the IAB-donor CU may be provided, or one identifier corresponding to the plurality of transmission destination BAP addresses and/or next hop BAP addresses may be provided. Paragraph [0177]: Each gNB 217 is connected via an NG interface to an AMF/SMF/UPF unit (hereinafter, sometimes referred to as a “5GC unit”) 214 including an access and mobility management function (AMF), a session management function (SMF), or a user plane function (UPF), or the AMF, the SMF, and the UPF. Paragraph [0182]: A location management function (LMF) described in Non Patent Literature 24 (3GPP TS 38.305) may be provided in the 5G communication system. The LMF may be connected to a base station via the AMF as disclosed in Non Patent Literature 25 (3GPP TS 23.273).) Therefore, it would have been obvious to one of ordinary skill in the art before the effective filing date of the claimed invention to provide a node of a mobility management function (AMF); and a node of a location management function (LMF), as taught by Shimoda in the combined system of Zhu and Ho, so that the AMF and LMF nodes can facilitate effective communication and routing of control and/or user data between other nodes such as base station, UEs, and IAB nodes, perform mobility control, manage a tracking area list (Shimoda: Abstract, Paragraphs [0177], [0178], [0182], [0248]). Regarding claim 20, the combination of Zhu and Ho teaches the method of claim 11 (see rejection for claim 11); Zhu further teaches wherein the node in the communications system is one of a base station; an integrated access and backhaul node (IAB-node); a distributed unit (DU); a centralized unit (CU); a node of a user plane function (UPF) (see rejection for claim 9); The combination of Zhu and Ho does not explicitly teach a node of a mobility management function (AMF); and a node of a location management function (LMF). However, Shimoda teaches a node of a mobility management function (AMF); and a node of a location management function (LMF) (see rejection for claim 9); Therefore, it would have been obvious to one of ordinary skill in the art before the effective filing date of the claimed invention to provide a node of a mobility management function (AMF); and a node of a location management function (LMF), as taught by Shimoda in the combined system of Zhu and Ho, so that the AMF and LMF nodes can facilitate effective communication and routing of control and/or user data between other nodes such as base station, UEs, and IAB nodes, perform mobility control, manage a tracking area list (Shimoda: Abstract, Paragraphs [0177], [0178], [0182], [0248]). Response to Arguments Applicant's arguments filed December 24, 2025 with respect to claims 1-6, 10-17 being rejected under 35 U.S.C. 103 as being unpatentable over Zhu et al. (US2021/0377840A1) in view of Zhou et al. (US2021/0336725A1); claims 7, 8, 18, 19 being rejected under 35 U.S.C. 103 as being unpatentable over Zhu et al. in view of Zhou et al., and further in view of Wu et al. (U52023/0413351A1); claims 9, 20 being rejected under 35 U.S.C. 103 as being unpatentable over Zhu et al. in view of Zhou et al, and further in view of Shimoda et al. (US2024/0260110A1) have been fully considered. Applicant submits that Zhu fails to teach the amended limitations of claim 1 which recites in part “wherein the second set of functions comprises some or all of: security processing, header compression and a network coding algorithm”, or the features of claim 11 which recites in part “wherein the second set of functions comprises some or all of: security processing, and initiation of a network coding algorithm”. However, Ho et al. (KR100564753B1) teaches “wherein the second set of functions comprises: security processing”. Ho teaches that when a packet is received through a network, if the destination IP address of the packet matches the current destination address (such as the router’s address), the packet examines the value of the protocol field of the packet as inbound IP traffic, and if the packet is being encrypted or authenticated through the IPSec protocol. The input IPSec processing unit then performs authentication and encryption processing on the packet by using a key possessed by a predetermined router and an authentication and encryption algorithm possessed by the authentication and encryption information storage unit. If the destination IP address of the packet does match the current destination address (router's address), the packet is outbound IP traffic. (Ho: Page 7, Paragraph 6). Ho teaches that based on the destination of the packet matching the current node identity, a second set of functions such as security processing is performed on the packet. Thus, the combination of Zhu and Ho teaches claim 1 and claim 11. Dependent claims 2-10, and 12-20 are also taught by a combination of the cited references. Conclusion Any inquiry concerning this communication or earlier communications from the examiner should be directed to LATHA CHAKRAVARTHY whose telephone number is (703)756-1172. The examiner can normally be reached M-Th 8:30 AM - 5 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, Huy Vu can be reached at 571-272-3155. 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. /L.C./Examiner, Art Unit 2461 /HUY D VU/Supervisory Patent Examiner, Art Unit 2461
Read full office action

Prosecution Timeline

May 09, 2023
Application Filed
Aug 30, 2023
Response after Non-Final Action
Jul 30, 2025
Non-Final Rejection — §103
Oct 02, 2025
Response Filed
Oct 15, 2025
Final Rejection — §103
Dec 24, 2025
Request for Continued Examination
Jan 18, 2026
Response after Non-Final Action
Apr 20, 2026
Non-Final Rejection — §103 (current)

Precedent Cases

Applications granted by this same examiner with similar technology

Patent 12610283
BANDWIDTH ADJUSTMENT METHOD, SERVICE TRANSMISSION METHOD, NETWORK DEVICE AND READABLE STORAGE MEDIUM
3y 3m to grant Granted Apr 21, 2026
Patent 12598672
METHOD FOR CELL RESELECTION, TERMINAL DEVICE, AND COMPUTER-READABLE STORAGE MEDIUM
3y 8m to grant Granted Apr 07, 2026
Patent 12549934
Method for Determining Policy Control Network Element, Apparatus, and System
3y 5m to grant Granted Feb 10, 2026
Patent 12542818
APPLICATION FUNCTION NODE AND COMMUNICATION METHOD
3y 5m to grant Granted Feb 03, 2026
Patent 12526837
METHOD AND APPARATUS FOR REPORTING INFORMATION RELATED TO SYSTEM INFORMATION REQUEST IN NEXT-GENERATION MOBILE COMMUNICATION SYSTEM
3y 9m to grant Granted Jan 13, 2026
Study what changed to get past this examiner. Based on 5 most recent grants.

Strategy Recommendation AI-generated — please review before filing

Get a prosecution strategy drawn from examiner precedents, rejection analysis, and claim mapping.
Typically takes 5-10 seconds — AI-generated, attorney review required before filing

Prosecution Projections

3-4
Expected OA Rounds
31%
Grant Probability
88%
With Interview (+57.0%)
3y 4m (~4m remaining)
Median Time to Grant
High
PTA Risk
Based on 26 resolved cases by this examiner. Grant probability derived from career allowance 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