mdh.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Computing scores of forwarding schemes in switched networks with probabilistic faults
IST Austria, Klosterneuburg, Austria.
IIT Bombay, Mumbai, India.
IST Austria, Klosterneuburg, Austria.
Mälardalen University, School of Innovation, Design and Engineering, Embedded Systems.ORCID iD: 0000-0002-4987-7669
2017 (English)In: Lecture Notes in Computer Science, Volume 10206, Springer Verlag , 2017, 169-187 p.Conference paper (Refereed)
Abstract [en]

Time-triggered switched networks are a deterministic communication infrastructure used by real-time distributed embedded systems. Due to the criticality of the applications running over them, developers need to ensure that end-to-end communication is dependable and predictable. Traditional approaches assume static networks that are not flexible to changes caused by reconfigurations or, more importantly, faults, which are dealt with in the application using redundancy. We adopt the concept of handling faults in the switches from non-real-time networks while maintaining the required predictability. We study a class of forwarding schemes that can handle various types of failures. We consider probabilistic failures. For a given network with a forwarding scheme and a constant ℓ, we compute the score of the scheme, namely the probability (induced by faults) that at least ℓ messages arrive on time. We reduce the scoring problem to a reachability problem on a Markov chain with a “product-like” structure. Its special structure allows us to reason about it symbolically, and reduce the scoring problem to #SAT. Our solution is generic and can be adapted to different networks and other contexts. Also, we show the computational complexity of the scoring problem is #P-complete, and we study methods to estimate the score. We evaluate the effectiveness of our techniques with an implementation.

Place, publisher, year, edition, pages
Springer Verlag , 2017. 169-187 p.
Series
Lecture Notes in Computer Science, ISSN 0302-9743 ; 10206
National Category
Communication Systems
Identifiers
URN: urn:nbn:se:mdh:diva-35266DOI: 10.1007/978-3-662-54580-5_10ScopusID: 2-s2.0-85017497560ISBN: 9783662545799 OAI: oai:DiVA.org:mdh-35266DiVA: diva2:1091615
Conference
23rd International Conference on Tools and Algorithms for the Construction and Analysis of Systems, TACAS 2017 held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2017; Uppsala; Sweden
Available from: 2017-04-27 Created: 2017-04-27 Last updated: 2017-04-28Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopus

Search in DiVA

By author/editor
Rodriguez-Navas, Guillermo
By organisation
Embedded Systems
Communication Systems

Search outside of DiVA

GoogleGoogle Scholar

Altmetric score

Total: 11 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf