scholarly journals Modeling Time Requirements of CPS in Wireless Networks

Sensors ◽  
2020 ◽  
Vol 20 (7) ◽  
pp. 1818 ◽  
Author(s):  
César Huegel Richa ◽  
Mateus M. de Lucena ◽  
Leonardo Passig Horstmann ◽  
José Luis Conradi Hoffmann ◽  
Antônio Augusto Fröhlich
Keyword(s):  
Case Analysis ◽  
Network Capacity ◽  
Cyber Physical Systems ◽  
Worst Case Analysis ◽  
Worst Case ◽  
Physical Systems ◽  
Network Load ◽  
Time Requirements ◽  
Safety Parameter ◽  
Margin Of Safety

In this paper, we present an approach to assess the schedulability and scalability of Cyber-Physical Systems (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.

Hierarchical Programming for Worst-Case Analysis of Power Grids

2018 ◽  
Author(s):  
Hatim Djelassi ◽  
Stephane Fliscounakis ◽  
Alexander Mitsos ◽  
Patrick Panciatici
Keyword(s):  
Case Analysis ◽  
Power Grids ◽  
Worst Case Analysis ◽  
Worst Case

Formal Worst-Case Analysis of Crosstalk Noise in Mesh-Based Optical Networks-on-Chip

2013 ◽  
Vol 21 (10) ◽  
pp. 1823-1836 ◽  
Author(s):  
Yiyuan Xie ◽  
Mahdi Nikdast ◽  
Jiang Xu ◽  
Xiaowen Wu ◽  
Wei Zhang ◽  
...  
Keyword(s):  
Optical Networks ◽  
Case Analysis ◽  
Worst Case Analysis ◽  
Crosstalk Noise ◽  
Worst Case ◽  
Networks On Chip ◽  
On Chip

Worst-case Analysis of Autonomous Rendezvous Systems

2010 ◽  
Vol 43 (15) ◽  
pp. 321-326 ◽  
Author(s):  
Wenfei Wang ◽  
Prathyush P. Menon ◽  
Nuno M. Gomes Paulino ◽  
Emanuele Di Sotto ◽  
Sohrab Salehi ◽  
...  
Keyword(s):  
Case Analysis ◽  
Worst Case Analysis ◽  
Worst Case ◽  
Autonomous Rendezvous

scholarly journals Average-Case Approximation Ratio of Scheduling without Payments

Algorithmica ◽  
2021 ◽  
Author(s):  
Jie Zhang
Keyword(s):  
Mechanism Design ◽  
Case Analysis ◽  
Theoretical Computer Science ◽  
Approximation Ratio ◽  
Approximation Schemes ◽  
Worst Case Analysis ◽  
Algorithmic Mechanism Design ◽  
Worst Case ◽  
Average Case ◽  
Optimal Mechanism

AbstractApart from the principles and methodologies inherited from Economics and Game Theory, the studies in Algorithmic Mechanism Design typically employ the worst-case analysis and design of approximation schemes of Theoretical Computer Science. For instance, the approximation ratio, which is the canonical measure of evaluating how well an incentive-compatible mechanism approximately optimizes the objective, is defined in the worst-case sense. It compares the performance of the optimal mechanism against the performance of a truthful mechanism, for all possible inputs. In this paper, we take the average-case analysis approach, and tackle one of the primary motivating problems in Algorithmic Mechanism Design—the scheduling problem (Nisan and Ronen, in: Proceedings of the 31st annual ACM symposium on theory of computing (STOC), 1999). One version of this problem, which includes a verification component, is studied by Koutsoupias (Theory Comput Syst 54(3):375–387, 2014). It was shown that the problem has a tight approximation ratio bound of $$(n+1)/2$$ ( n + 1 ) / 2 for the single-task setting, where n is the number of machines. We show, however, when the costs of the machines to executing the task follow any independent and identical distribution, the average-case approximation ratio of the mechanism given by Koutsoupias (Theory Comput Syst 54(3):375–387, 2014) is upper bounded by a constant. This positive result asymptotically separates the average-case ratio from the worst-case ratio. It indicates that the optimal mechanism devised for a worst-case guarantee works well on average.

Sign in / Sign up

Export Citation Format

Share Document