A Scalable Service Discovery Protocol with the Optimal Discovery Time for Large-Scale Cyber Physical Systems

MAD‐DDS: Memory‐efficient automatic discovery data distribution service for large‐scale distributed control network

“…2 k is reached between (k) and (k + 1) timing. Since priority of participant i heartbeat is required, then the QoS's priority is evaluated using its inherent values that corresponds to the actual weight as derived in [32] and expressed as follows:…”

“… On receipt of confirmation, DATA packet retransmission ends. In the event that some packets are yet to be received, retransmission timing is extended to a limited time‐frame that mirrors the remaining packet receivable time‐lapse. Since participant i retransmission time is determined by the heartbeat $$P_{\text{Ht}}(i)$$ seconds, then at each retransmission process end, a certain wait time is observed before the next retransmission until an interval $$\frac{P_{\text{Ht}}(i)}{2^{k}}$$ is reached between ( k ) and ( k + 1) timing. Since priority of participant i heartbeat is required, then the QoS's priority is evaluated using its inherent values that corresponds to the actual weight as derived in [32] and expressed as follows: $$$$\begin{equation} P_{\rho }(i) = \sum ^{n}_{j=0} w_{j}q_{j}. \end{equation}$$$$where j in $$w_{j}$$ is QoS weight item, j in $$q_{j}$$ is QoS value item initialized by $$\in (0, +\infty )$$.…”