Tschaikowski, Max and Tribastone, Mirco Generalised communication for interacting agents. In: Proceedings of the 9th International Conference on Quantitative Evaluation of Systems (QEST). IEEE, pp. 178-188. ISBN 978-0-7695-4781-7 (2012)
Full text not available from this repository.Abstract
Process algebra for quantitative evaluation are based on either of the two following mechanisms for communication: binary, where a channel is shared by exactly two agents, or multiway, where all agents sharing a channel must synchronise. In this paper we consider an intermediate form which we call generalised communication, where only m agents out of n potentially available are involved in the communication. We study this in the context of the stochastic process algebra PEPA, of which we conservatively extend the syntax and semantics. We give an intuitive interpretation in terms of bandwidth assignments to agents communicating over a shared medium. We validate this semantics using a real implementation of a simple peer-to-peer protocol, for which our performance model yields predictions with high accuracy. We prove a result of lumpability that exploits symmetries between identical communicating agents, yielding good scalability of the underlying continuous-time Markov chain (CTMC) with respect to increasing population levels. Furthermore, we present an algorithm that derives the lumped chain directly, without having to generate the full CTMC first.
| Item Type: | Book Section |
|---|---|
| Identification Number: | 10.1109/QEST.2012.16 |
| Uncontrolled Keywords: | bandwidth sharing; process algebra; semantics of communication |
| Subjects: | Q Science > QA Mathematics > QA75 Electronic computers. Computer science |
| Research Area: | Computer Science and Applications |
| Depositing User: | Ms T. Iannizzi |
| Date Deposited: | 10 Feb 2015 14:02 |
| Last Modified: | 24 Jul 2015 12:28 |
| URI: | http://eprints.imtlucca.it/id/eprint/2586 |
Actions (login required)
 |
Edit Item |
