• No results found

Stochastic models for quality of service of component connectors Moon, Y.J.

N/A
N/A
Protected

Academic year: 2021

Share "Stochastic models for quality of service of component connectors Moon, Y.J."

Copied!
11
0
0

Bezig met laden.... (Bekijk nu de volledige tekst)

Hele tekst

(1)

Stochastic models for quality of service of component connectors

Moon, Y.J.

Citation

Moon, Y. J. (2011, October 25). Stochastic models for quality of service of component connectors. IPA Dissertation Series. Retrieved from https://hdl.handle.net/1887/17975

Version: Corrected Publisher’s Version

License: Licence agreement concerning inclusion of doctoral thesis in the Institutional Repository of the University of Leiden

Downloaded from: https://hdl.handle.net/1887/17975

Note: To cite this publication please use the final published version (if applicable).

(2)

Stochastic Models

for Quality of Service of Component Connectors

Young-Joo Moon

(3)
(4)

Stochastic Models

for Quality of Service of

Component Connectors

(5)
(6)

Stochastic Models

for Quality of Service of Component Connectors

PROEFSCHRIFT

ter verkrijging van

de graad van Doctor aan de Universiteit Leiden

op gezag van de Rector Magnificus prof. mr. P. F. van der Heijden volgens besluit van het College voor Promoties

te verdedigen op dinsdag 25 oktober 2011 klokke 10.00 uur

door

Young-Joo Moon

geboren te Pohang, Zuid-Korea

(7)

Promotor: Prof. Dr. F. Arbab Universiteit Leiden

Co-promotor: Dr. A. Silva Radboud University Nijmegen Dr. E.P. de Vink Technische Universiteit Eindhoven Other members: Prof. Dr. F.S. de Boer Universiteit Leiden

Dr. M.M. Bonsangue Universiteit Leiden

Prof. Dr. J.-M. Jacquet University of Namur, Belgium Dr. J. Kleijn Universiteit Leiden

Prof. Dr. J.N. Kok Universiteit Leiden

Prof. Dr. R. van der Mei Vrije Universiteit Amsterdam Prof. Dr. M. Sirjani Reykjavik University, Iceland

The work reported in this thesis has been carried out at the Center for Mathemat- ics and Computer Science (CWI) in Amsterdam and Leiden Institute of Advanced Computer Science at Leiden University, under the auspices of the research school IPA (Institute for Programming research and Algorithmics). The research was supported by the grant from the GLANCE funding program of NWO through Coordination with Performance Guarantees (CooPer) project (600.643.000.05N12).

Copyright© 2011 by Young-Joo Moon

Cover design by Young-Joo Moon & Song-Hee Lee.

Printed by Ponsen & Looijen.

ISBN: 978–90–6464–506–8 IPA Dissertation Seriese 2011-17

(8)

Contents

1 Introduction 1

1.1 Quantitative analysis of systems . . . 2

1.2 Thesis overview and contributions . . . 3

1.2.1 Contributions . . . 5

2 Models for component coordination 7 2.1 Reo language . . . 7

2.2 Stochastic Reo . . . 8

2.3 Semantic models for Reo . . . 11

2.3.1 Constraint Automata . . . 11

2.3.2 Intentional Automata . . . 12

2.3.3 Reo Automata . . . 17

2.4 Markov Chains . . . 21

2.5 Interactive Markov Chains . . . 22

2.6 Related work . . . 23

2.6.1 Other coordination languages . . . 23

2.6.2 Continuous-Time Constraint Automata . . . 24

2.6.3 Stochastic Process Algebra . . . 25

2.6.4 Stochastic Petri Nets . . . 26

2.6.5 Stochastic Automata Networks . . . 27

3 Quantitative Intentional Automata 29 3.1 Introduction . . . 29

3.2 Quantitative Intentional Automata . . . 30

3.2.1 Invariants . . . 31

3.2.2 QIA composition . . . 32

3.3 Translation into a stochastic model . . . 37

3.3.1 Micro-step transitions . . . 39

3.3.2 Extracting a delay-sequence . . . 40

3.3.3 Dividing macro-step transitions with a delay-sequence . . . 41 i

(9)

3.3.4 Preemptive request-arrivals . . . 45

3.4 Discussion . . . 47

4 Stochastic Reo Automata 49 4.1 Introduction . . . 49

4.2 Stochastic Reo Automata . . . 50

4.2.1 Stochastic Reo Automata . . . 50

4.3 Reward model . . . 57

4.3.1 Stochastic Reo with reward information . . . 58

4.3.2 Stochastic Reo Automata with reward information . . . 61

4.4 Translation into CTMC . . . 64

4.4.1 Synchronized data-flows . . . 64

4.4.2 Deriving the CTMC . . . 64

4.4.3 Rewards . . . 66

4.5 Interactive Markov Chains and Reo . . . 69

4.5.1 Interactive Markov Chains . . . 70

4.6 Discussion . . . 75

5 Tool implementation 77 5.1 Introduction . . . 77

5.2 Reo2MC: description and implementation . . . 77

5.2.1 Implementation . . . 78

5.2.2 Usage . . . 87

5.3 Discussion . . . 94

6 Case study 97 6.1 Introduction . . . 97

6.2 The ASK system . . . 98

6.2.1 Overview of the ASK system . . . 100

6.3 Modeling the ASK system . . . 102

6.3.1 The Reception component . . . 102

6.3.2 Extracting distributions from logs . . . 104

6.4 QoS analysis . . . 105

6.4.1 Analysis on derived CTMC . . . 105

6.4.2 Simulation . . . 109

6.5 Discussion . . . 112

7 Conclusions and Future work 115 7.1 Conclusions . . . 115

7.2 Future work . . . 116

Bibliography 119

Abstract 127

ii

(10)

Samenvatting 129

iii

(11)

Referenties

GERELATEERDE DOCUMENTEN

License: Licence agreement concerning inclusion of doctoral thesis in the Institutional Repository of the University of Leiden Downloaded.

Furthermore, in order to enable practical analysis of the end-to-end QoS of a system, we provide translation methods from the specification models into stochastic models (Markov

In order to describe the processing delay rates of a primitive channel explicitly, we name the rate by the combination of a pair of (source, sink) nodes and the buffer of the

In a LossySync channel ab, losing data at node a occurs only when node b is not pending. After the product with a Sync channel bc, node b is always pending, and losing data occurs

Using the definitions for the composition of Stochastic Reo Automata in Section 4.2, the following figure shows the Stochastic Reo Automaton extended with reward

Moreover, the large graphical result of the translation is neither tractable nor read- able. Thus, Reo2MC also provides the translation from Stochastic Reo circuits into the

These two threads have the same architecture with the same performance, thus, the analysis on the utilization is carried out on the RMHRT1 thread, the result of which can be used

This translation method has been implemented, in the Reo2MC tool, in the Extensible Coordination Tools (ECT) [35]. As a plug-in for ECT, Reo2MC provides the following functionali-