Prosecution Insights
Last updated: November 20, 2026
Application No. 19/145,785

MESSAGE FORWARDING METHOD AND APPARATUS, AND ELECTRONIC DEVICE AND STORAGE MEDIUM

Non-Final OA §102§103§112
Filed
Jul 03, 2025
Priority
Jun 28, 2023 — nonprovisional of PCTCN2023103402
Examiner
HUANG, KAYLEE J
Art Unit
2447
Tech Center
2400 — Computer Networks
Assignee
New H3C Technologies Co., Ltd.
OA Round
1 (Non-Final)
75%
Grant Probability
Favorable
1-2
OA Rounds
1y 3m
Est. Remaining
99%
With Interview

Examiner Intelligence

Grants 75% — above average
75%
Career Allowance Rate
278 granted / 371 resolved
+16.9% vs TC avg
Strong +48% interview lift
Without
With
+47.6%
Interview Lift
resolved cases with interview
Typical timeline
2y 7m
Avg Prosecution
19 currently pending
Career history
405
Total Applications
across all art units

Statute-Specific Performance

§101
5.5%
-34.5% vs TC avg
§103
49.6%
+9.6% vs TC avg
§102
7.9%
-32.1% vs TC avg
§112
30.2%
-9.8% vs TC avg
Black line = Tech Center average estimate • Based on career data from 371 resolved cases

Office Action

§102 §103 §112
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 . This office action is in response to preliminary amendment filed on 07/03/2025. Claims 1-7, 15-22, and 24-27 present for examination. Information Disclosure Statement It is hereby acknowledged that the following papers have been received and placed of record in the file: Information Disclosure Statement(s) as received on 07/03/2025, 11/20/2025, 12/05/2025, and 03/25/2026 is/are considered by the Examiner. Claim Rejections - 35 USC § 112 The following is a quotation of 35 U.S.C. 112(b): (b) CONCLUSION.—The specification shall conclude with one or more claims particularly pointing out and distinctly claiming the subject matter which the inventor or a joint inventor regards as the invention. The following is a quotation of 35 U.S.C. 112 (pre-AIA ), second paragraph: The specification shall conclude with one or more claims particularly pointing out and distinctly claiming the subject matter which the applicant regards as his invention. Claims 6, 7, 20, 21, 25, and 27 are rejected under 35 U.S.C. 112(b) or 35 U.S.C. 112 (pre-AIA ), second paragraph, as being indefinite for failing to particularly point out and distinctly claim the subject matter which the inventor or a joint inventor (or for applications subject to pre-AIA 35 U.S.C. 112, the applicant), regards as the invention. Claim 6 recites the limitation "the number" in line 7. There is insufficient antecedent basis for this limitation in the claim. Same rejection applies to claims 20, 25, and 27. Regarding claim 6, claim limitation recites “the first indication label are popped up” in lines 7-8, which renders the claim vague and indefinite. It is unclear how a label is popped up. Same rejection applies to claims 20, 25, and 27. Claim 6 recites the limitation "the number of labels" in line 9. There is insufficient antecedent basis for this limitation in the claim. Same rejection applies to claims 20, 25, and 27. Claim 7 recites the limitation "the second composite special purpose label" in lines 1-2. There is insufficient antecedent basis for this limitation in the claim. Same rejection applies to claim 21. Claim 7 recites the limitation "the number" in lines 4-5. There is insufficient antecedent basis for this limitation in the claim. Same rejection applies to claim 21. Regarding claim 7, claim limitation recites “the second indication label are popped up unconditionally” in lines 7-8, which renders the claim vague and indefinite. It is unclear how a label is popped up unconditionally. Same rejection applies to claim 21. Claim 7 recites the limitation "the number of labels" in line 6. There is insufficient antecedent basis for this limitation in the claim. Same rejection applies to claim 21. The claims are generally narrative and indefinite, failing to conform with current U.S. practice. They appear to be a literal translation into English from a foreign document and are replete with grammatical and idiomatic errors. Claim Rejections - 35 USC § 102 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 the appropriate paragraphs of 35 U.S.C. 102 that form the basis for the rejections under this section made in this Office action: A person shall be entitled to a patent unless – (a)(1) the claimed invention was patented, described in a printed publication, or in public use, on sale, or otherwise available to the public before the effective filing date of the claimed invention. Claim(s) 1-5, 15-19, 22, 24, and 26 is/are rejected under 35 U.S.C. 102(a)(1) as being anticipated by Sitaraman et al. (US 10,476,811 B2), hereinafter Sitaraman. Regarding claim 1, Sitaraman discloses A packet forwarding method, wherein the method is applied to a first node (network node 202, FIG. 2), and comprises: acquiring a first packet (Col. 7, lines 5-7: receive, at a network node within a network, a packet from another network node within the network), wherein the first packet comprises a first label stack comprising node labels and a composite special purpose label (Col. 7, lines 32-40: identify, within the packet, a label stack that includes a plurality of labels that collectively represent at least a portion of an Label-Switched Paths (LSP) within the network), and the node labels comprise a first label indicating the first node and a second label indicating a second node (Col. 7, lines 36-43: the label stack may include multiple labels that collectively represent at least a portion of an LSP within the network; the term “label stack,” as used herein, generally refers to any collection of labels that each identify a certain segment or link of an LSP; & Col. 7, lines 51-53: each label in the label stack may identify and/or represent a different link of the LSP being traversed by the packet; & FIG. 5); in response to determining that a next label of the first label is a first type of composite special purpose label (MPLS), and a node corresponding to a next label of the first type of composite special purpose label is unreachable, forwarding a second packet to the second node (Col. 9, lines 48-50: in the event that network node 206 has failed, network node 202 may identify the packet’s backup path and then forward the packet along the same), wherein the second packet comprises a second label stack, and a stack top label of the second label stack is the second label (Col. , lines : create a context table in connection with the next hop; & Col. , lines : after the top label has been popped from the label stack, identification module 106 may search the context table corresponding to failed network node 206 using the next label in the label stack). Regarding claim 2, Sitaraman discloses the packet forwarding method as described in claim 1. Sitaraman further discloses the node corresponding to the next label of the first type of composite special purpose label is a third node, after acquiring the first packet, the method further comprises: in response to determining that the next label of the first label is the first type of composite special purpose label, and the third node is reachable, forwarding a third packet to the third node, wherein the third packet comprises a third label stack, and a stack top label of the third label stack is a third label indicating the third node (Col. 7, lines 62-66: any packet that arrives at network node 202 and includes the assigned label as the next one to be popped (e.g., the top label in the label stack) may be forwarded to the other network node by way of the specific link unless that other network node has failed; & Col. 10, lines 42-46: identify the next label (e.g., the top label) to be popped from the label stack included in the packet’s header; & Col. 13, lines 17-20: in the event that network node 206 is functional and reachable, network node 202 may simply pop the top label from the label stack of a packet and then forward that packet to network node 206 in the primary path). Regarding claim 3, Sitaraman discloses the packet forwarding method as described in claim 1. Sitaraman further discloses the node corresponding to the next label of the first type of composite special purpose label is a main tail node which is a tail node in a main path to forward the first packet, and the second node is a backup tail node which is a tail node in a backup path to forward the first packet; or, the node corresponding to the next label of the first type of composite special purpose label is an intermediate node in the main path, and the second node is an intermediate node or the tail node in the main path (Col. 13, lines 17-20: in the event that network node 206 is functional and reachable, network node 202 may simply pop the top label from the label stack of a packet and then forward that packet to network node 206 in the primary path; primary path corresponds to main path). Regarding claim 4, Sitaraman discloses the packet forwarding method as described in claim 1. Sitaraman further discloses the first node is a main tail node which is a tail node in a main path to forward the first packet (Col. 13, lines 17-20: in the event that network node 206 is functional and reachable, network node 202 may simply pop the top label from the label stack of a packet and then forward that packet to network node 206 in the primary path), the second node is a backup tail node which is a tail node in a backup path to forward the first packet (Col. 13, lines 20-26: in the event that network node 206 has failed or is unreachable, network node 202 may pop the top label and subsequent label from the packet’s label stack; in this example, the subsequent label may correspond to network node 512 and/or reside just under and/or subsequent to the top label in the packet’s label stack); after acquiring the first packet, the method further comprising: in response to determining that the next label of the first label is a second type of composite special purpose label, forwarding a fourth packet, wherein the fourth packet is a packet in an inner layer of the first label stack (Col. 13, lines 17-20: in the event that network node 206 is functional and reachable, network node 202 may simply pop the top label from the label stack of a packet and then forward that packet to network node 206 in the primary path). Regarding claim 5, Sitaraman discloses the packet forwarding method as described in claim 1. Sitaraman further discloses in response to determining that the first node is a source node (Col. 1, lines 8-10: MultiProtocol Label Switching (MPLS) networks often include various paths that facilitate the flow of traffic from a source device to a destination device), acquiring the first packet comprises: receiving a fifth packet (Col. 6, lines 11-12: a router may receive a packet); encapsulating the first label stack in an outer layer of the fifth packet, to obtain the first packet (Col. 6, lines 5-7: labels 122 may be assigned and/or attached to traffic and/or individual packets). Regarding claims 15 and 22, the limitations of claims 15 and 22 are rejected in the analysis of claim 1 above and these claims are rejected on that basis. Regarding claim 16, the limitations of claim 16 are rejected in the analysis of claim 2 above and this claim is rejected on that basis. Regarding claims 17, 24, and 26, the limitations of claims 17, 24, and 26 are rejected in the analysis of claim 3 above and these claims are rejected on that basis. Regarding claim 18, the limitations of claim 18 are rejected in the analysis of claim 4 above and this claim is rejected on that basis. Regarding claim 19, the limitations of claim 19 are rejected in the analysis of claim 5 above and these claims are rejected on that basis. Claim Rejections - 35 USC § 103 In the event the determination of the status of the application as subject to AIA 35 U.S.C. 102 and 103 (or as subject to pre-AIA 35 U.S.C. 102 and 103) is incorrect, any correction of the statutory basis (i.e., changing from AIA to pre-AIA ) for the rejection will not be considered a new ground of rejection if the prior art relied upon, and the rationale supporting the rejection, would be the same under either status. The following is a quotation of 35 U.S.C. 103 which forms the basis for all obviousness rejections set forth in this Office action: A patent for a claimed invention may not be obtained, notwithstanding that the claimed invention is not identically disclosed as set forth in section 102, if the differences between the claimed invention and the prior art are such that the claimed invention as a whole would have been obvious before the effective filing date of the claimed invention to a person having ordinary skill in the art to which the claimed invention pertains. Patentability shall not be negated by the manner in which the invention was made. Claim(s) 6, 7, 20, 21, 25, and 27 is/are rejected under 35 U.S.C. 103 as being unpatentable over Sitaraman in view of Duan et al. (US 2023/0318966 A1), hereinafter Duan, and further in view of Ra et al. (US 2013/0287027 A1), hereinafter Ra. Regarding claim 6, Sitaraman discloses the packet forwarding method as described in claim 1. Sitaraman do not explicitly disclose the first type of composite special purpose label comprises a first extension label and a first indication label, and the first indication label comprises a label value field, a type field, a stack bottom marker bit, and a number field; a value of the stack bottom marker bit is a second value, which is to indicate that the first indication label is not a stack bottom label of the first label stack. However, Duan discloses the first type of composite special purpose label comprises a first extension label and a first indication label, and the first indication label comprises a label value field, a type field, a stack bottom marker bit, and a number field ([0299]: in the new BIER header, next header indicates a next header, Hdr Ext Len indicates an extension header length, an option (OT) field indicates a type (for example, BIER MPLS or BIER ETH) of the BIER packet in the first network, and option length indicates a length of the option field; BIFT-id (bit index forwarding table identifier) identifies a forwarding table, and in a BIER MPLS encapsulation manner, BIFT-id is an MPLS label, TC indicates a traffic type, S indicates a label stack bottom identifier, and TTL (time-to-live) indicates time to live; nibble is a fixed value, and is used to distinguish between BIER encapsulation and an equal cost multi-path (ECMP) function of MPLS, Ver (version) indicates a version number, BSL (bitstring len) indicates a length of a bit string, and entropy indicates entropy and supports ECMP); a value of the stack bottom marker bit is a second value, which is to indicate that the first indication label is not a stack bottom label of the first label stack ([0299]: S indicates a label stack bottom identifier). It would have been obvious to a person with ordinary skill in the art before the effective filing date of the claimed invention to incorporate the feature of Duan in Sitaraman because Sitaraman discloses forward packets along LSP to network node by inserting a label stack consisting of labels in the packets’ headers (Col. 9, lines 37-42) and Duan further suggests MPLS label includes traffic type, label stack bottom identifier, and TTL fields ([0299]). One of ordinary skill in the art would be motivated to utilize the teachings of Duan in the Sitaraman system in order to forward packets using a quick lookup. Sitaraman and Duan do not explicitly disclose a value of the type field is a first value, which is to indicate that in response to determining that a node corresponding to a node label after the first indication label in the first label stack is unreachable, labels the number of which is indicated by the number field after the first indication label are popped up; the number field is to indicate the number of labels to be popped up. However, Ra discloses a value of the type field is a first value, which is to indicate that in response to determining that a node corresponding to a node label after the first indication label in the first label stack is unreachable, labels the number of which is indicated by the number field after the first indication label are popped up ([0086]: the MPOP header 620 consists of a copy number field, an original source port field, an original L2 header size field, an added L2 header and MPLS label size field, a more pop control signal field, and a pop label number field); the number field is to indicate the number of labels to be popped up ([0086]: the MPOP header 620 consists of a copy number field, an original source port field, an original L2 header size field, an added L2 header and MPLS label size field, a more pop control signal field, and a pop label number field). It would have been obvious to a person with ordinary skill in the art before the effective filing date of the claimed invention to incorporate the feature of Ra in Sitaraman and Duan because Sitaraman and Duan disclose forward packets along LSP to network node by inserting a label stack consisting of labels in the packets’ headers (Sitaraman: Col. 9, lines 37-42) and Ra further suggests header includes pop label number field ([0086]). One of ordinary skill in the art would be motivated to utilize the teachings of Ra in the Sitaraman and Duan system in order to save processing time and resources. Regarding claim 7, Sitaraman discloses the packet forwarding method as described in claim 4. Sitaraman do not explicitly disclose the second composite special purpose label comprises a second extension label and a second indication label, and the second indication label comprises a label value field, a type field, a stack bottom marker bit, and a number field; a value of the stack bottom marker bit is a second value, which is to indicate that the second indication label is not a stack bottom label of the first label stack. However, Duan discloses the second composite special purpose label comprises a second extension label and a second indication label, and the second indication label comprises a label value field, a type field, a stack bottom marker bit, and a number field ([0299]: in the new BIER header, next header indicates a next header, Hdr Ext Len indicates an extension header length, an option (OT) field indicates a type (for example, BIER MPLS or BIER ETH) of the BIER packet in the first network, and option length indicates a length of the option field; BIFT-id (bit index forwarding table identifier) identifies a forwarding table, and in a BIER MPLS encapsulation manner, BIFT-id is an MPLS label, TC indicates a traffic type, S indicates a label stack bottom identifier, and TTL (time-to-live) indicates time to live; nibble is a fixed value, and is used to distinguish between BIER encapsulation and an equal cost multi-path (ECMP) function of MPLS, Ver (version) indicates a version number, BSL (bitstring len) indicates a length of a bit string, and entropy indicates entropy and supports ECMP); a value of the stack bottom marker bit is a second value, which is to indicate that the first indication label is not a stack bottom label of the first label stack ([0299]: S indicates a label stack bottom identifier). It would have been obvious to a person with ordinary skill in the art before the effective filing date of the claimed invention to incorporate the feature of Duan in Sitaraman because Sitaraman discloses forward packets along LSP to network node by inserting a label stack consisting of labels in the packets’ headers (Col. 9, lines 37-42) and Duan further suggests MPLS label includes traffic type, label stack bottom identifier, and TTL fields ([0299]). One of ordinary skill in the art would be motivated to utilize the teachings of Duan in the Sitaraman system in order to forward packets using a quick lookup. Sitaraman and Duan do not explicitly disclose a value of the type field is a second value, which is to indicate that labels the number of which is indicated by the number field after the second indication label are popped up unconditionally; the number field is to indicate the number of labels to be popped up. However, Ra discloses a value of the type field is a second value, which is to indicate that labels the number of which is indicated by the number field after the second indication label are popped up unconditionally ([0086]: the MPOP header 620 consists of a copy number field, an original source port field, an original L2 header size field, an added L2 header and MPLS label size field, a more pop control signal field, and a pop label number field); the number field is to indicate the number of labels to be popped up ([0086]: the MPOP header 620 consists of a copy number field, an original source port field, an original L2 header size field, an added L2 header and MPLS label size field, a more pop control signal field, and a pop label number field). It would have been obvious to a person with ordinary skill in the art before the effective filing date of the claimed invention to incorporate the feature of Ra in Sitaraman and Duan because Sitaraman and Duan disclose forward packets along LSP to network node by inserting a label stack consisting of labels in the packets’ headers (Sitaraman: Col. 9, lines 37-42) and Ra further suggests header includes pop label number field ([0086]). One of ordinary skill in the art would be motivated to utilize the teachings of Ra in the Sitaraman and Duan system in order to save processing time and resources. Regarding claims 20, 25, and 27, the limitations of claims 20, 25, and 27 are rejected in the analysis of claim 6 above and these claims are rejected on that basis. Regarding claim 21, the limitations of claim 21 are rejected in the analysis of claim 7 above and this claim is rejected on that basis. Conclusion The prior art made of record and not relied upon is considered pertinent to applicant's disclosure. Song et al. (US 2021/0135986 A1). Receiving a packet and modifying the packet by adding one or more MPLS extension headers, adding a header of the extension header(s), and adding an indication within an MPLS label stack that one or more MPLS extension headers have been added to the packet. Kim et al. (US 2005/0169264 A1). Table includes a label field of the packet, the number of pop of the label and a traffic parameter ([0047]). Song et al. (US 2020/0358698 A1). The label value field of MPLS label stack entry is used to forward the MPLS traffic unit in the data plane towards the destination on a hop-by-hop basis, except when penultimate-hop-popping (PHP) is used, which case the forwarding header is removed completely on the last hop ([0087]). Any inquiry concerning this communication or earlier communications from the examiner should be directed to KAYLEE J HUANG whose telephone number is (571)272-0080. The examiner can normally be reached Monday-Friday 9AM-5PM. 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, Joon H Hwang can be reached at 571-272-4036. 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. Kaylee Huang 08/28/2026 /KAYLEE J HUANG/Primary Examiner, Art Unit 2447
Read full office action

Prosecution Timeline

Jul 03, 2025
Application Filed
Sep 01, 2026
Non-Final Rejection mailed — §102, §103, §112 (current)

Precedent Cases

Applications granted by this same examiner with similar technology

Patent 12783617
MONITORING USER INTERACTION WITH CLIENT DEVICES
3y 1m to grant Granted Nov 03, 2026
Patent 12771699
SYSTEM AND METHOD TO DETECT AND COUNTERMEASURE RPL ATTACKS IN IOT NETWORK
2y 4m to grant Granted Oct 20, 2026
Patent 12732567
SYSTEMS AND METHODS FOR TRACKING USER ACCESS ACROSS WEB DOMAINS
3y 2m to grant Granted Sep 08, 2026
Patent 12732539
AI-BASED HONEYPOT TO MITIGATE SOCIAL ENGINEERING CYBERATTACK
3y 1m to grant Granted Sep 08, 2026
Patent 12732444
AGENT FUNCTIONALITY EVALUATION IN MANAGED ENDPOINTS
1y 9m to grant Granted Sep 08, 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

1-2
Expected OA Rounds
75%
Grant Probability
99%
With Interview (+47.6%)
2y 7m (~1y 3m remaining)
Median Time to Grant
Low
PTA Risk
Based on 371 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