Skip to Main content Skip to Navigation
New interface
Theses

Scalable Trajectory Approach for ensuring deterministic guarantees in large networks

Abstract : In critical real-time systems, any faulty behavior may endanger lives. Hence, system verification and validation is essential before their deployment. In fact, safety authorities ask to ensure deterministic guarantees. In this thesis, we are interested in offering temporal guarantees; in particular we need to prove that the end-to-end response time of every flow present in the network is bounded. This subject has been addressed for many years and several approaches have been developed. After a brief comparison between the existing approaches, the Trajectory Approach sounded like a good candidate due to the tightness of its offered bound. This method uses results established by the scheduling theory to derive an upper bound. The reasons leading to a pessimistic upper bound are investigated. Moreover, since the method must be applied on large networks, it is important to be able to give results in an acceptable time frame. Hence, a study of the method’s scalability was carried out. Analysis shows that the complexity of the computation is due to a recursive and iterative processes. As the number of flows and switches increase, the total runtime required to compute the upper bound of every flow present in the network understudy grows rapidly. While based on the concept of the Trajectory Approach, we propose to compute an upper bound in a reduced time frame and without significant loss in its precision. It is called the Scalable Trajectory Approach. After applying it to a network, simulation results show that the total runtime was reduced from several days to a dozen seconds.
Document type :
Theses
Complete list of metadata

https://theses.hal.science/tel-00998249
Contributor : ABES STAR :  Contact
Submitted on : Wednesday, June 11, 2014 - 2:51:42 PM
Last modification on : Friday, October 7, 2022 - 3:45:44 AM
Long-term archiving on: : Thursday, September 11, 2014 - 10:45:40 AM

Identifiers

  • HAL Id : tel-00998249, version 1

Citation

Sara Medlej. Scalable Trajectory Approach for ensuring deterministic guarantees in large networks. Other [cs.OH]. Université Paris Sud - Paris XI, 2013. English. ⟨NNT : 2013PA112168⟩. ⟨tel-00998249⟩

Share

Metrics

Record views

254

Files downloads

988