Boundary Clock PTP Source Selection Across IWF Profile Translation
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing PTP networks face complexity when implementing mixed architectures with IWFs that translate between different PTP profiles, leading to suboptimal selection of grandmaster clocks due to hidden clock source details, especially in scenarios involving GNSS backup and IWF profile translations.
Innovation Solution
Utilizing reserved bits in PTP announce packets to indicate IWF profile translations, allowing boundary clock nodes to make informed decisions based on priority levels and clock conditions, ensuring accurate selection of grandmaster clocks.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Measurement precision
If boundary clock nodes use standard PTP selection algorithms without IWF priority consideration, then the selection process is simple, but accuracy of PTP source selection deteriorates in mixed architectures
Solution Approach 1:
The patent introduces a new parameter (IWF priority level) into the existing PTP source selection algorithm. Boundary clock nodes transmit IWF priority information in PTP announce messages, and downstream nodes use this parameter alongside traditional criteria (clock class, time offset) to select the best PTP source. This parameter change enables accurate source selection in mixed architectures without requiring a complete algorithm redesign.
Solution Approach 2:
The IWF priority level acts as an intermediary parameter that bridges the gap between different PTP architectures (PTS and FTS). By encoding the capability information of boundary clock nodes with IWF functionality into a prioritizable parameter, the system enables informed source selection without direct complex interaction between heterogeneous network elements.
2Measurement precision
If boundary clock nodes transmit detailed IWF capability information, then source selection accuracy improves, but message overhead increases
Solution Approach 1:
The patent extracts only the essential IWF capability information (priority level) from complex IWF details and transmits it in PTP announce messages. This selective extraction provides sufficient information for accurate source selection while keeping message overhead minimal, avoiding transmission of unnecessary detailed capability data.
Solution Approach 2:
Complex IWF capability descriptions are transformed into a compact prioritizable parameter (IWF priority level). This parameter transformation enables accurate source selection decisions without requiring transmission of extensive capability information, thus reducing message overhead while maintaining selection accuracy.
3Adaptability or versatility
If the network supports multiple PTP profiles with IWF translation, then adaptability improves, but difficulty of detecting and measuring clock quality worsens
Solution Approach 1:
The IWF priority level serves as an intermediary indicator that simplifies clock quality assessment in multi-profile networks. Instead of directly analyzing complex IWF translation capabilities and profile compatibility, downstream nodes use the prioritizable IWF priority parameter to infer clock quality and make selection decisions, reducing the difficulty of quality detection.
Solution Approach 2:
The patent transforms complex clock quality attributes (IWF capability, profile compatibility) into a simplified prioritizable parameter. This parameter change enables downstream nodes to assess clock quality efficiently without directly measuring complex multi-profile compatibility, thus reducing detection difficulty while maintaining adaptability.
Data Source
AI summary
Aspects of the subject disclosure may include, for example, a device, including: a processing system including a processor; and a memory that stores executable instructions that, when executed by the processing system, facilitate performance of operations of: receiving an indication of a priority level of an interworking function used by a boundary clock node; and selecting a best master clock using an algorithm that considers the priority level of the boundary clock node. Other embodiments are disclosed.