Prosecution Insights
Last updated: July 17, 2026
Application No. 18/226,268

Method and Device for Time Synchronization of Time Synchronization Domains

Final Rejection §102
Filed
Jul 26, 2023
Priority
Dec 19, 2022 — provisional 63/433,487 +1 more
Examiner
PATEL, NIMESH G
Art Unit
2176
Tech Center
2100 — Computer Architecture & Software
Assignee
Moxa Inc.
OA Round
4 (Final)
77%
Grant Probability
Favorable
5-6
OA Rounds
0m
Est. Remaining
84%
With Interview

Examiner Intelligence

Grants 77% — above average
77%
Career Allowance Rate
560 granted / 726 resolved
+22.1% vs TC avg
Moderate +7% lift
Without
With
+7.4%
Interview Lift
resolved cases with interview
Typical timeline
2y 10m
Avg Prosecution
15 currently pending
Career history
746
Total Applications
across all art units

Statute-Specific Performance

§101
1.3%
-38.7% vs TC avg
§103
66.1%
+26.1% vs TC avg
§102
19.8%
-20.2% vs TC avg
§112
4.5%
-35.5% vs TC avg
Black line = Tech Center average estimate • Based on career data from 726 resolved cases

Office Action

§102
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 . Claim Rejections - 35 USC § 102 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-18 is/are rejected under 35 U.S.C. 102(a)(1) as being anticipated by Wen(US 2020/0252150). Regarding claim 1, Wen discloses a time synchronization method, executed by a time synchronization device(Figure 8, CDC node 800) coupling a plurality of time synchronization domains(Figure 8, Paragraph 68, PTP domains), the time synchronization method comprising: instantiating a plurality of precision time protocol (PTP) instances corresponding to the plurality of time synchronization domains(Paragraph 100, enable respective PTP sessions 812, 822, 832 and 842 with four PTP domains 810, 820, 830 and 840 through corresponding PTP ports 811, 821, 831 and 841. Thus, the CDC node 800 may connect to four clock domains); determining a grandmaster clock and synchronizing, by the plurality of PTP instances, timings of the plurality of time synchronization domains according to the grandmaster clock(Paragraphs 99-100, the CDC node 800 may choose a domain with the best clock quality from the attached clock domains to synchronize its local clock 801. For example, the CDC node 800 may choose the PTP domain 810 to synchronize the local clock 801, and get the corresponding timestamp pairs through the PTP port 811. On the other hand, the synchronized time from the local clock 801 may be provided to the PTP ports 811, 821, 831 and 841. The CDC node can be configured as a GMC node). Regarding claim 2, Wen discloses time synchronization method of claim 1, wherein the step of determining the grandmaster clock comprises: determining a plurality of local best clocks corresponding to the plurality of PTP instances; and determining the grandmaster clock according to the plurality of local best clocks corresponding to the plurality of PTP instances(Paragraph 57, a root network node with the best clock quality in a timing domain such as a PTP domain can provide a master clock such as GMC for synchronization of other network nodes within the timing domain. A cross domain network node attached to this timing domain and one or more other timing domains may report clock quality of the one or more other timing domains to the root network node providing the master clock. Through clock quality comparison across timing domains, the clock synchronization can be performed across different timing domains). Regarding claim 3, Wen discloses time synchronization method of claim 2, wherein the step of determine the plurality of local best clocks corresponding to the plurality of PTP instances is determining a best clock of each time synchronization domain of the plurality of time synchronization domain according to a best master clock algorithm (BMCA) so as to determining the plurality of local best clocks corresponding to the plurality of PTP instances(Paragraph 44, By running a distributed algorithm, such as the best master clock algorithm (BMCA), each clock in the network identifies the highest quality clock, such as a clock with the best set of characteristics. The highest quality clock may be called as the grand master clock (GMC), and synchronize all other slave clocks). Regarding claim 4, Wen discloses time synchronization method of claim 2, wherein the step of determining the grandmaster clock according to the plurality of local best clocks corresponding to the plurality of PTP instances is continuously comparing any two local best clocks among the plurality of local best clocks until one of the local best clocks is the best, and deciding the one of the local best clocks as the grandmaster clock(Paragraph 44, If the GMC is removed from the network, or if its characteristics change in a way such that it is no longer the best quality clock, the BMCA can provide a way for the participating clocks to automatically determine the current best quality clock, which may become the new GMC. The BMCA can provide a fault tolerant and administrative free way of determining the clock used as the timing source for the entire network). Regarding claim 5, Wen discloses time synchronization method of claim 4, wherein the step of continuously comparing any two local best clocks among the plurality of local best clocks comprises not repetitively comparing any two local best clocks of the plurality of local best clocks(Paragraph 44, If the GMC is removed from the network, or if its characteristics change in a way such that it is no longer the best quality clock, the BMCA can provide a way for the participating clocks to automatically determine the current best quality clock, which may become the new GMC. The BMCA can provide a fault tolerant and administrative free way of determining the clock used as the timing source for the entire network). Regarding claim 6, Wen discloses time synchronization method of claim 4, wherein the step of continuously comparing any two local best clocks among the plurality of local best clocks is continuously comparing priority vectors of any two local best clocks of the plurality of local best clocks(Paragraph 44, If the GMC is removed from the network, or if its characteristics change in a way such that it is no longer the best quality clock, the BMCA can provide a way for the participating clocks to automatically determine the current best quality clock, which may become the new GMC. The BMCA can provide a fault tolerant and administrative free way of determining the clock used as the timing source for the entire network). Regarding claim 7, Wen discloses time synchronization method of claim 2, further comprising executing the following steps when a PTP instance of the plurality of PTP instances receives an announce message from a first clock of a corresponding time synchronization domain: comparing the first clock with a local best clock corresponding to the PTP instance; replacing the local best clock corresponding to the PTP instance with the first clock in response to the first clock being better than the local best clock corresponding to the PTP instance; comparing the local best clock updated by the first clock with the grandmaster clock; replacing the grandmaster clock with the local best clock updated by the first clock in response to the local best clock updated by the first clock being better than the grandmaster clock; and notifying the plurality of PTP instances to synchronize the time of the plurality of time synchronization domains according to the updated grandmaster clock(Paragraph 62, For example, if the domain 320 has better clock quality than the local timing source of the GMC 311, then the GMC 311 may ask the CDC 325 attached to the domain 320 to provide timing information comprising at least timestamp information of the GMC 321, for example, by a process of remote timing sensing as illustrated later in FIG. 6(a)-FIG. 7. With the provided timing information of the domain 320, the GMC 311 can tune its clock and distribute synchronization information within the domain 310, without reversing the master slave roles on the timing tree in the domain 310. Correspondingly, the GMC 311 may update its clock quality with the clock quality of the GMC 321, and optionally a hop count between the GMC 311 and the GMC 321) Regarding claim 8, Wen discloses time synchronization method of claim 1, further comprising executing the following steps when a PTP instance of the plurality of PTP instances receives an announce message from a first clock of a corresponding time synchronization domain: comparing the first clock with the grandmaster clock; replacing the grandmaster clock with the first clock in response to the first clock being better than the grandmaster clock; and notifying the plurality of PTP instances to synchronize the time of the plurality of time synchronization domains according to the updated grandmaster clock(Paragraph 62, For example, if the domain 320 has better clock quality than the local timing source of the GMC 311, then the GMC 311 may ask the CDC 325 attached to the domain 320 to provide timing information comprising at least timestamp information of the GMC 321, for example, by a process of remote timing sensing as illustrated later in FIG. 6(a)-FIG. 7. With the provided timing information of the domain 320, the GMC 311 can tune its clock and distribute synchronization information within the domain 310, without reversing the master slave roles on the timing tree in the domain 310. Correspondingly, the GMC 311 may update its clock quality with the clock quality of the GMC 321, and optionally a hop count between the GMC 311 and the GMC 321) Regarding claim 9, Wen discloses time synchronization method of claim 1, wherein the plurality of time synchronization domains use different types of PTP profiles(Paragraph 94, In the exemplary embodiment shown in FIGS. 6(a)-(c), a GMC 611 and a BC 612 are located in a PTP domain 610, a GMC 621 and a BC 622 are located in a PTP domain 620, and a CDC 623 is attached to the PTP domains 610 and 620). Regarding claim 10, Wen discloses time synchronization device(Figure 8, CDC node 800), used for coupling to a plurality of time synchronization domains(Figure 8, Paragraph 68, PTP domains), comprising: a processing unit, configured to execute a program code; and a storage unit, coupled to the processing unit, configured to store the program code to instruct the processing unit to execute a time synchronization method, wherein the time synchronization method comprises: instantiating a plurality of precision time protocol instances (PTP instances) corresponding to the plurality of time synchronization domains(Paragraph 100, enable respective PTP sessions 812, 822, 832 and 842 with four PTP domains 810, 820, 830 and 840 through corresponding PTP ports 811, 821, 831 and 841. Thus, the CDC node 800 may connect to four clock domains); determining a grandmaster clock; and synchronizing, by the plurality of PTP instances, timings of the plurality of time synchronization domains according to the grandmaster clock(Paragraph 100, the CDC node 800 may choose a domain with the best clock quality from the attached clock domains to synchronize its local clock 801. For example, the CDC node 800 may choose the PTP domain 810 to synchronize the local clock 801, and get the corresponding timestamp pairs through the PTP port 811. On the other hand, the synchronized time from the local clock 801 may be provided to the PTP ports 811, 821, 831 and 841). Regarding claim 11, Wen discloses time synchronization device of claim 10, wherein the step of determining the grandmaster clock comprises: determining a plurality of local best clocks corresponding to the plurality of PTP instances; and determining the grandmaster clock according to the plurality of local best clocks corresponding to the plurality of PTP instances(Paragraphs 57-58 and 61, a root network node with the best clock quality in a timing domain such as a PTP domain can provide a master clock such as GMC for synchronization of other network nodes within the timing domain. A cross domain network node attached to this timing domain and one or more other timing domains may report clock quality of the one or more other timing domains to the root network node providing the master clock. Through clock quality comparison across timing domains, the clock synchronization can be performed across different timing domains. The GMC such as GMC 311 or GMC 321 may be elected in a selection process of the best master clock, and a timing tree may be built for the frequency/time distribution within a timing domain. The GMC 311 may be synchronized to the GMC in the selected adjacent domain). Regarding claim 12, Wen discloses time synchronization device of claim 11, wherein the step of determine the plurality of local best clocks corresponding to the plurality of PTP instances is determining a best clock of each time synchronization domain of the plurality of time synchronization domain according to a best master clock algorithm (BMCA) so as to determining the plurality of local best clocks corresponding to the plurality of PTP instances(Paragraph 44, By running a distributed algorithm, such as the best master clock algorithm (BMCA), each clock in the network identifies the highest quality clock, such as a clock with the best set of characteristics. The highest quality clock may be called as the grand master clock (GMC), and synchronize all other slave clocks). Regarding claim 13, Wen discloses time synchronization device of claim 11, wherein the step of determining the grandmaster clock according to the plurality of local best clocks corresponding to the plurality of PTP instances is continuously comparing any two local best clocks among the plurality of local best clocks until one of the local best clocks is the best, and deciding the one of the local best clocks as the grandmaster clock(Paragraph 44, If the GMC is removed from the network, or if its characteristics change in a way such that it is no longer the best quality clock, the BMCA can provide a way for the participating clocks to automatically determine the current best quality clock, which may become the new GMC. The BMCA can provide a fault tolerant and administrative free way of determining the clock used as the timing source for the entire network). Regarding claim 14, Wen discloses time synchronization device of claim 13, wherein the step of continuously comparing any two local best clocks among the plurality of local best clocks comprises not repetitively comparing any two local best clocks of the plurality of local best clocks(Paragraph 44, If the GMC is removed from the network, or if its characteristics change in a way such that it is no longer the best quality clock, the BMCA can provide a way for the participating clocks to automatically determine the current best quality clock, which may become the new GMC. The BMCA can provide a fault tolerant and administrative free way of determining the clock used as the timing source for the entire network). Regarding claim 15, Wen discloses time synchronization device of claim 13, wherein the step of continuously comparing any two local best clocks among the plurality of local best clocks is continuously comparing priority vectors of any two local best clocks of the plurality of local best clocks(Paragraph 44, If the GMC is removed from the network, or if its characteristics change in a way such that it is no longer the best quality clock, the BMCA can provide a way for the participating clocks to automatically determine the current best quality clock, which may become the new GMC. The BMCA can provide a fault tolerant and administrative free way of determining the clock used as the timing source for the entire network). Regarding claim 16, Wen discloses time synchronization device of claim 11, further comprising executing the following steps when a PTP instance of the plurality of PTP instances receives an announce message from a first clock of a corresponding time synchronization domain: comparing the first clock with a local best clock corresponding to the PTP instance; replacing the local best clock corresponding to the PTP instance with the first clock in response to the first clock being better than the local best clock corresponding to the PTP instance; comparing the local best clock updated by the first clock with the grandmaster clock; replacing the grandmaster clock with the local best clock updated by the first clock in response to the local best clock updated by the first clock being better than the grandmaster clock; and notifying the plurality of PTP instances to synchronize the time of the plurality of time synchronization domains according to the updated grandmaster clock(Paragraph 62, For example, if the domain 320 has better clock quality than the local timing source of the GMC 311, then the GMC 311 may ask the CDC 325 attached to the domain 320 to provide timing information comprising at least timestamp information of the GMC 321, for example, by a process of remote timing sensing as illustrated later in FIG. 6(a)-FIG. 7. With the provided timing information of the domain 320, the GMC 311 can tune its clock and distribute synchronization information within the domain 310, without reversing the master slave roles on the timing tree in the domain 310. Correspondingly, the GMC 311 may update its clock quality with the clock quality of the GMC 321, and optionally a hop count between the GMC 311 and the GMC 321) Regarding claim 17, Wen discloses time synchronization device of claim 10, further comprising executing the following steps when a PTP instance of the plurality of PTP instances receives an announce message from a first clock of a corresponding time synchronization domain: comparing the first clock with the grandmaster clock; replacing the grandmaster clock with the first clock in response to the first clock being better than the grandmaster clock; and notifying the plurality of PTP instances to synchronize the time of the plurality of time synchronization domains according to the updated grandmaster clock(Paragraph 62, For example, if the domain 320 has better clock quality than the local timing source of the GMC 311, then the GMC 311 may ask the CDC 325 attached to the domain 320 to provide timing information comprising at least timestamp information of the GMC 321, for example, by a process of remote timing sensing as illustrated later in FIG. 6(a)-FIG. 7. With the provided timing information of the domain 320, the GMC 311 can tune its clock and distribute synchronization information within the domain 310, without reversing the master slave roles on the timing tree in the domain 310. Correspondingly, the GMC 311 may update its clock quality with the clock quality of the GMC 321, and optionally a hop count between the GMC 311 and the GMC 321) Regarding claim 18, Wen discloses time synchronization device of claim 10, wherein the plurality of time synchronization domains use different types of PTP profiles(Paragraph 94, In the exemplary embodiment shown in FIGS. 6(a)-(c), a GMC 611 and a BC 612 are located in a PTP domain 610, a GMC 621 and a BC 622 are located in a PTP domain 620, and a CDC 623 is attached to the PTP domains 610 and 620). Response to Arguments Applicant's arguments have been fully considered but they are not persuasive. Applicant argues that Wen does not teach the claim PTP instance. However, under BRI, Wen’s PTP session is considered an instance. Each domain enables respective PTP sessions 812, 822, 832 and 842 with four PTP domains 810, 820, 830 and 840 through corresponding PTP ports 811, 821, 831 and 841. Thus, the CDC node 800 may connect to four clock domains(Paragraph 100). Under BRI, this is considered as PTP instance. It is important to note that Applicant’s arguments point to features that are not claimed, such as each PTP instance includes an independent state machine, a complete dataset, and independent clock properties. The plurality of PTP instances are not limited to operating solely in a slave role. Rather, each PTP instance may function as either a master or a slave and may actively trigger Master/Slave role transitions within its respective domain. Applicant’ further argues determining a grandmaster clock and synchronizing, by the PTP instances, timings of the plurality of time synchronizations. However, Wen does disclose determining a grandmaster clock and synchronizing, by the plurality of PTP instances, timings of the plurality of time synchronization domains according to the grandmaster clock(Paragraphs 100, the CDC node 800 may choose a domain with the best clock quality from the attached clock domains to synchronize its local clock 801. For example, the CDC node 800 may choose the PTP domain 810 to synchronize the local clock 801, and get the corresponding timestamp pairs through the PTP port 811. On the other hand, the synchronized time from the local clock 801 may be provided to the PTP ports 811, 821, 831 and 841. The CDC node can be configured as a GMC node). Again, Applicant argues features that are not claimed, such as each PTP instance in the instant application includes an independent state machine, a complete dataset, and independent clock properties, and is capable of operating as either a master or a slave. Through these instantiated PTP instances, the claimed time synchronization device actively synchronizes the respective domains according to the determined grandmaster clock and may effect Master/Slave role transitions within those domains. Thus, Applicant’s arguments are not found persuasive. Conclusion THIS ACTION IS MADE FINAL. 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 NIMESH G PATEL whose telephone number is (571)272-3640. The examiner can normally be reached Monday-Friday, 8:15-4:15. 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, Jaweed Abbaszadeh can be reached on 571-270-1640. 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. /NIMESH G PATEL/ Primary Examiner, Art Unit 2187
Read full office action

Prosecution Timeline

Show 1 earlier event
Feb 13, 2025
Non-Final Rejection mailed — §102
Apr 16, 2025
Response Filed
Aug 06, 2025
Final Rejection mailed — §102
Nov 03, 2025
Request for Continued Examination
Nov 07, 2025
Response after Non-Final Action
Dec 17, 2025
Non-Final Rejection mailed — §102
Mar 16, 2026
Response Filed
Jun 03, 2026
Final Rejection mailed — §102 (current)

Precedent Cases

Applications granted by this same examiner with similar technology

Patent 12661188
METHOD FOR INTELLIGENT INSTRUMENTS FOR MODULAR ENERGY SYSTEM
5y 2m to grant Granted Jun 23, 2026
Patent 12664114
HIGHLY SCALABLE ACCELERATOR
2y 0m to grant Granted Jun 23, 2026
Patent 12657036
REMOTE CONFIGURATION OF BIOS SETTINGS
2y 7m to grant Granted Jun 16, 2026
Patent 12657123
ALLOCATING DATA STORAGE DEVICE RESOURCES BASED ON DETERMINED CAPABILITIES OF A HOST DEVICE
2y 3m to grant Granted Jun 16, 2026
Patent 12650720
Sleep/Wake-Up Method, System, and Apparatus
1y 10m to grant Granted Jun 09, 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

5-6
Expected OA Rounds
77%
Grant Probability
84%
With Interview (+7.4%)
2y 10m (~0m remaining)
Median Time to Grant
High
PTA Risk
Based on 726 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