In this paper, we present an approach to assess the schedulability and scalability of CPS Networks through an algorithm that is capable of estimating the load of the network as its utility grows. Our approach evaluates both the network load and the laxity of messages, considering its current topology and real-time constraints while abstracting environmental specificities. The proposed algorithm also accounts for the network unreliability by applying a margin-of-safety parameter. This approach enables higher utilities as it evaluates the load of the network considering a margin-of-safety that encapsulates phenomena such as collisions and interference, instead of performing a worst-case analysis. Furthermore, we present an evaluation of the proposed algorithm over three representative scenarios showing that the algorithm was able to successfully assess the network capacity as it reaches a higher use.
Keywords: Cyber-Physical Systems; Real-time Constraints; network load analysis; network scalability; network schedulability.