Methods of analytical and stochastic modelling are widely used in engineering to assess and design various complex systems, like computer and communication networks, and manufacturing systems, or for the control of transportation systems. The ASMTA conference is a main forum for advancing these techniques and their applications and aims to bring together researchers of academia and industry to discuss the latest developments in analytical, numerical and simulation algorithms for stochastic systems, including Markov processes, queueing networks, stochastic Petri nets, process algebras, game theoretical models, etc.
ASMTA 2016 is co-located with the 10th International Conference on Next Generation Mobile Applications, Services and Technologies (NGMAST 2016).
Abstract submission | 25 April 2016 (extended) |
Full paper submission | 2 May 2016 (extended) |
Notification | 6 June 2016 |
Final paper submission | 17 June 2016 |
Conference | 24-26 August 2016 |
Methods of analytical and stochastic modelling are widely used in engineering to assess and design various complex systems, like computer and communication networks, and manufacturing systems. The ASMTA conference is a main forum for advancing these techniques and their applications and aims to bring together researchers of academia and industry to discuss the latest developments in analytical, numerical and simulation algorithms for stochastic systems, including Markov processes, queueing networks, stochastic Petri nets, process algebras, game theoretical models, etc. The proceedings of ASMTA 2016 will be published as Springer Verlag Lecture Notes in Computer Science (LNCS) (approved).
The conference is seeking contributions on performance analysis techniques and algorithms from areas including (but not restricted to):
Envisaged applications encompass the following areas:
We also welcome contributions describing new performance analysis tools such as:
Full papers reporting original and unpublished research results on ASMTA topics are solicited. Submissions should not be under consideration for publication elsewhere while being evaluated for this conference. The proceedings will be published in the Springer Verlag Lecture Notes in Computer Science (LNCS) series (approved). Submissions may already be prepared in LNCS format and must not exceed 15 pages, including figures, tables and references; see the information for authors on Springer’s web site for formatting instructions ( Springer ). Please clearly indicate the corresponding author. The paper submission for ASMTA 2016 will only be accepted through the Easychair Paper Submission System (Easy chair ). Only papers in PDF will be accepted for reviewing. Submissions as e-mail attachment will not be accepted. Consistent with standard practice, each submitted paper will receive rigorous peer reviewing. Papers will be selected based on their originality, timeliness, significance, relevance, and clarity of presentation. Submission implies the willingness of at least one of the authors to register and present the paper, if accepted. All accepted papers in the conference are expected to be presented and will be included in the conference proceedings.
The files belonging to your camera-ready paper need to be submitted through Easychair by June 17, 2016. The page limit is 15 pages.
Please also upload a signed and completed copyright form. To download the form click here. Please use ASMTA 2016 as title of the book and use Sabine Wittevrongel and Tuan Phung-Duc as volume editors.
The ASMTA 2016 Committee will select the best paper award of the conference for which a certificate will be presented at the end of the conference.
Khalid Al-Begain (chair)
Dieter Fiems (secretary)
Simonetta Balsamo
Herwig Bruneel
Alexander Dudin
Jean-Michel Fourneau
Peter Harrison
Miklós Telek
Jean-Marc Vincent
Conference participants are encouraged to submit extended versions of their presented papers to a special issue of the journal Advances in Operations Research.
The deadline for submission to the special issue is 14 October 2016.
Title: Edge Clouds: Architectures and Deployment Models
Abstract: An architecture for undertaking data processing across multiple layers of a distributed computing infrastructure is introduced, composed of edge devices (making use of Internet-of-Things (IoT) based protocols), intermediate gateway nodes and large scale data centres. In this way, data processing that is intended to be carried out in the data centre can be pushed to the edges of the network - enabling more efficient use of data centre and in-network resources. Such an approach also suggests the need to re-think of cloud computing deployment architectures, requiring a "traditional" data centre-based cloud system to stretch to the network edge. We suggest the need for specialist data analysis and management algorithms that are resource-aware, and are able to split computation across these different layers. A coordination mechanism is proposed that is able to combine different types of data processing capability, such as in-transit and in-situ. An application scenario is used to illustrate the concepts, subsequently evaluated through a multi-site deployment.
Speaker's bio: Omer F. Rana is Professor of Performance Engineering at Cardiff University, with research interests in high performance distributed computing, data analysis/mining and multi-agent systems. He currently leads the Complex Systems Research Group. He was formerly the deputy director of the Welsh eScience Centre and had the opportunity to interact with a number of computational scientists across Cardiff University and the UK. He currently serves on the steering committee of Cardiff University's multi-disciplinary "Data Innovation" and "Energy Systems" Research Institutes. Rana has contributed to specification and standardisation activities via the Open Grid Forum and worked as a software developer with London-based Marshall Bio-Technology Limited prior to joining Cardiff University, where he developed specialist software to support biotech instrumentation. He also contributed to public understanding of science, via the Wellcome Trust funded "Science Line", in collaboration with BBC and Channel 4. Rana holds a PhD in "Neural Computing and Parallel Architectures from Imperial College (London Univ.), an MSc in Microelectronics (Univ. of Southampton) and a BEng in Information Systems Eng. from Imperial College (London Univ.).
Title: Faster by Replication - Beyond the Poisson Model
Abstract: Task replication has recently been advocated as a practical solution to reduce latencies in parallel systems. In addition to several convincing empirical studies, some others provide analytical results, yet under some strong assumptions such as Poisson arrivals, exponential service times, or independent service times of the replicas themselves, which may lend themselves to some contrasting and perhaps contriving behavior. In this talk we present a unified and general theoretical framework to compute tight bounds on the distribution of response times in general replication systems which account in particular for non-Poisson arrivals. These results immediately lend themselves to the optimal number of replicas minimizing response time quantiles, depending on the parameters of the system (e.g., the degree of correlation amongst replicas).
Speaker's bio: Florin Ciucu is an Assistant Professor in the CS Department at the University of Warwick. Previously he was a Senior Research Scientist at T-Labs / TU Berlin. He received an Informatics Diploma from the University of Bucharest, Faculty of Mathematics and Computer Science, and a Ph.D. degree in Computer Science from the University of Virginia. He is interested in developing stochastic models and techniques to better understand and engineer communication networks, computer systems, and the smart grid. On the practical side, he is interested in resource allocation and randomized algorithms for large systems.
Title: Coupling from the past in closed queueing networks
Abstract: Coupling from the past algorithms is a technique developed by Propp and Wilson in 1996 to sample random variables exactly according to the stationary distribution of a finite ergodic Markov chain. In its basic presentation, the complexity of this algorithm is at least linear in the number of states of the chain, and cannot be used in practice, due to the cardinality of the state space. However, coupling from the past becomes algorithmically efficient when the chain has a monotonic representation, or when "bounding chains" can be defined. The stationary distribution of closed queueing networks does not have a simple form in general, hence it might be useful to have efficient simulation tools. Contrary to open queueing networks, closed queuing networks are not monotonic systems, and even the state space does not exhibit a natural order. We present a compact representation of the sets of states that makes the coupling from the past algorithm efficient.
Speaker's bio: Anne Bouillard has been an assistant professor since 2006, first at École Normale Supérieure de Cachan (Brittany location) and is now at École Normale Supérieure (Paris, France) since 2010, in the departments of Computer Science. She received a Master in Computer science from ENS and a PhD in Computer Science from ENS Lyon. Her current research interests include performance evaluation, network monitoring using tropical algebras and sampling of Markov chains. She participated to several national research projects and collaborated with industrial partners including Thalès and Alcatel-Lucent.
You can download the detailed conference program in pdf format here.
The registration will take place starting from 8:45 at the conference venue (there will be signs inside the building).
The conference will be held in the Wales Millennium Centre in Cardiff, the capital city of Wales, UK.
The gala dinner will take place in Cardiff Castle.
For details about the location, hotels and local arrangements click here.
Additional information is also available on the website of the NGMAST 2016 conference, co-located with ASMTA 2016.
In case of specific questions with respect to the venue or other practical matters, please contact the local organiser Khalid Al-Begain, University of South Wales (E-mail: k.begain@southwales.ac.uk).
ASMTA 2016 registrations are handled by Castell Communications at http://www.castellcomms.co.uk/asmta.php.
The conference fees are listed below. Student authors need to send scanned proof of being enrolled as a student to asmta@castellcomms.co.uk
Note that at least one author of an accepted paper must register and pay before June 17, 2016.
In case you need an invitation letter, please contact the local organiser Khalid Al-Begain, University of South Wales (E-mail: k.begain@southwales.ac.uk).
New author or participant | EUR 425.00 |
Returning author or participant (returning in two years) | EUR 395.00 |
Student author | EUR 325.00 |
Additional paper fee (after first fully paid) | EUR 200.00 |
Additional page charge per page | EUR 25.00 |
Additional person for dinner | EUR 50.00 |
ASMTA 2015 (Albena, Bulgaria)
ASMTA 2014 (Budapest, Hungary)
ASMTA 2013 (Ghent, Belgium)
ASMTA 2012 (Grenoble, France)
ASMTA 2011 (Venice, Italy)
ASMTA 2010 (Cardiff, Wales, UK)
ASMTA 2009 (Madrid, Spain)