2013 1st International Workshop on Combining Modelling and Search-Based Software Engineering (CMSBSE) 2013
DOI: 10.1109/cmsbse.2013.6604429
|View full text |Cite
|
Sign up to set email alerts
|

Testing elastic systems with surrogate models

Abstract: Abstract-We combine search-based test case generation and surrogate models for black-box system testing of elastic systems. We aim to efficiently generate tests that expose functional errors and performance problems related to system elasticity.Elastic systems dynamically change their resources allocation to provide consistent quality of service in face of workload fluctuations. However, their ability to adapt could be a double edged sword if not properly designed: They may fail to acquire the right amount of … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
8
0

Year Published

2013
2013
2024
2024

Publication Types

Select...
4
1

Relationship

2
3

Authors

Journals

citations
Cited by 6 publications
(8 citation statements)
references
References 25 publications
0
8
0
Order By: Relevance
“…We define formally a bigraph F modelling a front-end of a cloud elastic system by all q-nodes are atomic Φ 4 In a c-node, one port is always linked to an r-name and the other may be linked to one or more s-nodes of the back-end bigraph b Φ 5 all children of a 1-region have sort 1, where 1 ∈ {b, e, v, t, s, r, i, q} Φ 6 all children of a b-node have sort q of the front-end bigraph f Φ 7 all children of an e-node have sort v tri Φ 8 all children of an v-node have sort ŝ ri Φ 9 all children of an s-node have sort q Φ 10 all b evts-nodes are active Φ 11 all r i-nodes are atomic Φ 12 In a b-node, one port is always linked to an r-name, the second port may be linked to e-nodes and the last port may be linked to i-nodes Φ 13 In an e-node, one port may be linked to b-nodes, the second port may be linked to v-nodes and the last port may be linked to r i-nodes Φ 14 In a v-node, one port may be linked to e-nodes, the second port may be linked to s-nodes and the last port may be linked to r i-nodes Φ 15 In a s-node, one port may be linked to v-nodes, the second port may be linked to i-nodes and the last port may be linked to one or more c-nodes of the front-end bigraph f Φ 16 an r-node may be linked to ê vt-nodes Φ 17 i-node may be linked to one or more b evts-nodes Φ 18 all children of a 2-region have sort 2, where 2 ∈ {o, m, f} Φ 19 all ô mf-nodes are atomic Φ 20 an m-node is always linked to an i-name Φ 21 an f-node is always linked to an a-name Φ 22 an o-node may be linked to m f-nodes Φ 23 an m-node may be linked to ô f-nodes Φ 24 an f-node may be linked to ôm-nodes Downloaded by [University of Sussex Library] at 01:35 01 June 2016…”
Section: The Front-end Bigraphmentioning
confidence: 99%
See 1 more Smart Citation
“…We define formally a bigraph F modelling a front-end of a cloud elastic system by all q-nodes are atomic Φ 4 In a c-node, one port is always linked to an r-name and the other may be linked to one or more s-nodes of the back-end bigraph b Φ 5 all children of a 1-region have sort 1, where 1 ∈ {b, e, v, t, s, r, i, q} Φ 6 all children of a b-node have sort q of the front-end bigraph f Φ 7 all children of an e-node have sort v tri Φ 8 all children of an v-node have sort ŝ ri Φ 9 all children of an s-node have sort q Φ 10 all b evts-nodes are active Φ 11 all r i-nodes are atomic Φ 12 In a b-node, one port is always linked to an r-name, the second port may be linked to e-nodes and the last port may be linked to i-nodes Φ 13 In an e-node, one port may be linked to b-nodes, the second port may be linked to v-nodes and the last port may be linked to r i-nodes Φ 14 In a v-node, one port may be linked to e-nodes, the second port may be linked to s-nodes and the last port may be linked to r i-nodes Φ 15 In a s-node, one port may be linked to v-nodes, the second port may be linked to i-nodes and the last port may be linked to one or more c-nodes of the front-end bigraph f Φ 16 an r-node may be linked to ê vt-nodes Φ 17 i-node may be linked to one or more b evts-nodes Φ 18 all children of a 2-region have sort 2, where 2 ∈ {o, m, f} Φ 19 all ô mf-nodes are atomic Φ 20 an m-node is always linked to an i-name Φ 21 an f-node is always linked to an a-name Φ 22 an o-node may be linked to m f-nodes Φ 23 an m-node may be linked to ô f-nodes Φ 24 an f-node may be linked to ôm-nodes Downloaded by [University of Sussex Library] at 01:35 01 June 2016…”
Section: The Front-end Bigraphmentioning
confidence: 99%
“…A related formalization approach to automatically generate test cases for cloud-based elastic systems is given in [16]. This approach relies on a simple model for cloud elastic systems behaviour build on searchbased software engineering methods and surrogate models.…”
Section: Related Workmentioning
confidence: 99%
“…The single most related paper by the authors is [12] where they propose an automatic test case generation for elastic systems based on Genetic Algorithms and introduce the idea of parametric workloads for the compact representation of test cases that we used here. In this paper, authors propose an alternative approach for generating test cases that builds an informative model of the system behavior and tries to speed up the generation process following a formally grounded heuristic instead of (pseudo-)randomized search.…”
Section: Related Workmentioning
confidence: 99%
“…For example, in [12] a parametric sine function has been used to test the response of the system to oscillatory loads. A workload profile is uniquely characterized within its parametric class by an assignmentw of the function parameters.…”
Section: The Approachmentioning
confidence: 99%
“…The elastic behavior causes the ES to switch between elasticity states (denoted elastic transition) under certain conditions. A series of such transitions (e.g., a scale-out followed by a scalein) has been termed elastic transition sequence [8] …”
Section: Introductionmentioning
confidence: 99%