Prosecution Insights
Last updated: July 17, 2026
Application No. 18/739,847

TECHNIQUES TO MANAGE VIRTUAL CLOCKS FOR A TIME SENSITIVE NETWORK

Final Rejection §103§112
Filed
Jun 11, 2024
Examiner
HUANG, KAYLEE J
Art Unit
2447
Tech Center
2400 — Computer Networks
Assignee
Intel Corporation
OA Round
2 (Final)
75%
Grant Probability
Favorable
3-4
OA Rounds
6m
Est. Remaining
99%
With Interview

Examiner Intelligence

Grants 75% — above average
75%
Career Allowance Rate
268 granted / 358 resolved
+16.9% vs TC avg
Strong +50% interview lift
Without
With
+50.5%
Interview Lift
resolved cases with interview
Typical timeline
2y 7m
Avg Prosecution
21 currently pending
Career history
385
Total Applications
across all art units

Statute-Specific Performance

§101
0.2%
-39.8% vs TC avg
§103
88.4%
+48.4% vs TC avg
§102
1.3%
-38.7% vs TC avg
§112
8.4%
-31.6% vs TC avg
Black line = Tech Center average estimate • Based on career data from 358 resolved cases

Office Action

§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 . The amendment filed on 04/20/2026 has been entered. Applicant amended claims 1, 3, 8, 10, 15, and 17 in the amendment. Claims 2, 9, and 16 are cancelled. Claims 1, 3-8, 10-15, and 17-20 remain pending. Response to Arguments Applicant’s arguments with respect to claims 1, 3-8, 10-15, and 17-20 filed on 04/20/2026 have been considered but they are deemed to be moot in view of new grounds of rejection. 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 1, 3-8, 10-15, and 17-20 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. Regarding claim 1, claim limitation recites “the first synchronization interval comprises an integer value multiplied by the reference synchronization interval” in lines 7-8, which renders the claim vague and indefinite. According to The American Heritage dictionary of the English Language (https://www.ahdictionary.com/word/search.html?q=integer), the definition of integer is a member of the set of positive whole number {1, 2, 3, …}, negative whole numbers {-1, -2, -3, …}, and zero {0}. When the integer value is negative, the first synchronization interval will be negative, which renders the claim indefinite. When the integer value is 1, the first synchronization interval is same as the reference synchronization interval, which renders the claim indefinite, as the claim requires “a first synchronization interval that is different from the reference synchronization interval.” Same rejection applies to claims 3, 8, 10, 15, and 17. All dependent claims are rejected as having the same deficiencies as the claims they depend from. Claim Rejections - 35 USC § 103 In the event the determination of the status of the application as subject to AIA 35 U.S.C. 102 and 103 (or as subject to pre-AIA 35 U.S.C. 102 and 103) is incorrect, any correction of the statutory basis (i.e., changing from AIA to pre-AIA ) for the rejection will not be considered a new ground of rejection if the prior art relied upon, and the rationale supporting the rejection, would be the same under either status. The following is a quotation of 35 U.S.C. 103 which forms the basis for all obviousness rejections set forth in this Office action: A patent for a claimed invention may not be obtained, notwithstanding that the claimed invention is not identically disclosed as set forth in section 102, if the differences between the claimed invention and the prior art are such that the claimed invention as a whole would have been obvious before the effective filing date of the claimed invention to a person having ordinary skill in the art to which the claimed invention pertains. Patentability shall not be negated by the manner in which the invention was made. Claim(s) 1, 3, 7, 8, 10, 14, 15, and 17 is/are rejected under 35 U.S.C. 103 as being unpatentable over Kozaki et al. (US 2013/0266306 A1), hereinafter Kozaki, in view of Manevich et al. (US 2025/0323743 A1), hereinafter Manevich, in view of Shimizu et al. (US 2018/0062780 A1), hereinafter Shimizu, and further in view of Maltsev et al. (US 9,084,260 B2), hereinafter Maltsev. Regarding claim 1, Kozaki discloses A method, comprising: decoding a reference message comprising time information to synchronize a hardware clock of a time sensitive network (TSN) node with a network time for a TSN ([0044]: the slave station apparatus 10, which receives the synchronization command, compares the time stamp of the synchronization command and time (timing information) indicated by a clock of the slave station apparatus (a PON clock) and corrects the time information of the synchronization command based on different between the time stamp and the time; the slave station apparatus 10 converts the corrected time information into a synchronization message (Sync message) in the second network and transmits the synchronization message to the slave apparatus SL); selecting a first virtual clock from a set of virtual clocks for the TSN node ([0160]: the control device 11 determines, according to whether the control device 11 is in the protection period (the handover state), whether the local clock A is selected or the local clock B is selected as a clock used for the synchronization processing); adjusting a time for the first virtual clock based on the time information from the reference message to synchronize the first virtual clock with the network time for the TSN ([0044]: upon receiving the synchronization message, the slave apparatus SL extracts the time information from the synchronization message and corrects the time information using a delay time of the second network measured in advance; the slave apparatus SL can synchronize with time of the grand master apparatus GM by synchronizing time of the clock of the slave apparatus SL with the corrected time information). Kozaki does not explicitly disclose the reference message associated with a reference synchronization interval. However, Manevich discloses the reference message associated with a reference synchronization interval ([0046]: manage periodic transmission of time synchronization message (e.., sync messages) to one or more time synchronization followers according to the clock time of a hardware clock maintained by the network device). It would have been obvious to one of ordinary skill in the art before the effective filing date of the claimed invention to incorporate the feature of Manevich in Kozaki because Kozaki discloses transmit synchronization message for time synchronization ([0011]) and Manevich further suggests manage periodic transmission of time synchronization message ([0046]]). One of ordinary skill in the art would be motivated to utilize the teachings of Manevich in the Kozaki system in order to ensure device maintains an accurate clock. Kozaki and Manevich do not explicitly disclose the first virtual clock associated with a first synchronization interval that is different from the reference synchronization interval. However, Shimizu discloses the first virtual clock associated with a first synchronization interval that is different from the reference synchronization interval ([0026]: a first master node among the plurality of master node is configured to correct a first local master clock of the first master node at predetermined periodic intervals by synchronizing with a timing synchronization signal from a source clock node having a source clock selected for a clock domain). It would have been obvious to one of ordinary skill in the art before the effective filing date of the claimed invention to incorporate the feature of Shimizu in Kozaki and Manevich because Kozaki and Manevich disclose transmit synchronization message for time synchronization (Kozaki: [0011]) and Shimizu further suggests correct local clock at predetermined periodic intervals ([0026]]). One of ordinary skill in the art would be motivated to utilize the teachings of Shimizu in the Kozaki and Manevich system in order to ensure device maintains an accurate clock. Kozaki, Manevich, Shimizu do not explicitly disclose the synchronization interval comprises an integer value multiplied by the reference synchronization interval. However, Maltsev discloses the synchronization interval comprises an integer value multiplied by the reference synchronization interval (claim 1: the frame synchronization parameter comprising a reference time interval for the second communication system, the reference time interval comprising an integer multiple of a defined interval for the first communication system). It would have been obvious to one of ordinary skill in the art before the effective filing date of the claimed invention to incorporate the feature of Maltsev in Kozaki, Manevich, and Shimizu because Kozaki, Manevich, and Shimizu disclose transmit synchronization message for time synchronization (Kozaki: [0011]) and Maltsev further suggests time interval comprising an integer multiple of a defined interval (claim 1). One of ordinary skill in the art would be motivated to utilize the teachings of Maltsev in the Kozaki, Manevich, and Shimizu system in order to optimize performance. Regarding claim 3, Kozaki, Manevich, Shimizu, and Maltsev disclose the method as described in claim 1. Kozaki, Manevich, Shimizu, and Maltsev further disclose each virtual clock from the set of virtual clocks corresponds to a synchronization loop comprising a synchronization interval to control when each virtual clock is synchronized with the network time for the TSN (Shimizu: [0026]: a first master node among the plurality of master node is configured to correct a first local master clock of the first master node at predetermined periodic intervals by synchronizing with a timing synchronization signal from a source clock node having a source clock selected for a clock domain), each synchronization interval is a different integer value multiplied by the reference synchronization interval (Maltsev: claim 1: the frame synchronization parameter comprising a reference time interval for the second communication system, the reference time interval comprising an integer multiple of a defined interval for the first communication system). Therefore, the limitations of claim 3 are rejected in the analysis of claim 1 above, and the claim is rejected on that basis. Regarding claim 7, Kozaki, Manevich, Shimizu, and Maltsev disclose the method as described in claim 1. Kozaki further discloses the TSN node is a clock follower node for the TSN and the reference message is from a clock leader node for the TSN ([0012]: a master station apparatus configured to transmit time information to a second network connected to a slave station apparatus via a first network). Regarding claims 8 and 15, the limitations of claims 8 and 15 are rejected in the analysis of claim 1 above and these claims are rejected on that basis. Regarding claims 10 and 17, the limitations of claims 10 and 17 are rejected in the analysis of claim 3 above and these claims are rejected on that basis. Regarding claim 14, the limitations of claim 14 are rejected in the analysis of claim 7 above and these claims are rejected on that basis. Allowable Subject Matter Claims 4-6, 11-13, 18-20 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 The prior art made of record and not relied upon is considered pertinent to applicant's disclosure. D’Eletto (US 2017/0180108 A1). Sender device 210 may maintain multiple virtual clocks 230 that correspond to multiple reflector clocks 250 maintained by multiple reflector devices 240 ([0029]). Rebello et al. (US 2016/0098326 A1). Upon receipt of the synchronization message, the synchronization message is timestamped with a local timestamp; determine an offset between its own hardware timestamp and that of the PTP master node ([0041]). Zhang (US 2016/0173267 A1). When a Precision Time Protocol (PTP) message is received from an ingress or sent from an egress, this instruction is adopted to generate a PTP TS (TimeStamp), and the generated TS is used for subsequent calculation of a link delay and a time offset. Lee et al. (US 2014/0010515 A1). Generate a clock offset value based on the sender timestamp. Dionne et al. (US 2015/0326387 A1). Starting a counter clocked by a local clock signal to determine an offset time since receipt of the time-stamp packet ([0011]). Applicant's amendment necessitated the new ground(s) of rejection presented in this Office action. Accordingly, THIS ACTION IS MADE FINAL. See MPEP § 706.07(a). Applicant is reminded of the extension of time policy as set forth in 37 CFR 1.136(a). A shortened statutory period for reply to this final action is set to expire THREE MONTHS from the mailing date of this action. In the event a first reply is filed within TWO MONTHS of the mailing date of this final action and the advisory action is not mailed until after the end of the THREE-MONTH shortened statutory period, then the shortened statutory period will expire on the date the advisory action is mailed, and any nonprovisional extension fee (37 CFR 1.17(a)) pursuant to 37 CFR 1.136(a) will be calculated from the mailing date of the advisory action. In no event, however, will the statutory period for reply expire later than SIX MONTHS from the mailing date of this final action. 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 06/12/2026 /KAYLEE J HUANG/Primary Examiner, Art Unit 2447
Read full office action

Prosecution Timeline

Jun 11, 2024
Application Filed
Jan 20, 2026
Non-Final Rejection mailed — §103, §112
Apr 20, 2026
Response Filed
Jun 17, 2026
Final Rejection mailed — §103, §112 (current)

Precedent Cases

Applications granted by this same examiner with similar technology

Patent 12670292
METHOD AND SYSTEM FOR SHARING COLLABORATIVE DIGITAL MODELS
3y 1m to grant Granted Jun 30, 2026
Patent 12647397
Hierarchical-Context Area Network As A Virtual Private Network Infrastructure System
3y 2m to grant Granted Jun 02, 2026
Patent 12641093
PROTECTION OF COMPUTING DEVICE FROM POTENTIAL OPTICAL NETWORK INTRUSION ATTACK
2y 8m to grant Granted May 26, 2026
Patent 12634302
MALICIOUS TRAFFIC IDENTIFICATION METHOD AND RELATED APPARATUS
2y 10m to grant Granted May 19, 2026
Patent 12627694
DNS EARLY THREAT RESPONSE
1y 11m to grant Granted May 12, 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
75%
Grant Probability
99%
With Interview (+50.5%)
2y 7m (~6m remaining)
Median Time to Grant
Moderate
PTA Risk
Based on 358 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