Abstract
We investigate an abstraction method, called mean- field method, for the performance evaluation of dynamic net- works with pairwise communication between nodes. It allows us to evaluate systems with very large numbers of nodes, that is, systems of a size where traditional performance evaluation methods fall short. While the mean-field analysis is well-established in epidemics and for chemical reaction systems, it is rarely used for commu- nication networks because a mean-field model tends to abstract away the underlying topology. To represent topological information, however, we extend the mean-field analysis with the concept of classes of states. At the abstraction level of classes we define the network topology by means of connectivity between nodes. This enables us to encode physical node positions and model dynamic networks by allowing nodes to change their class membership whenever they make a local state transition. Based on these extensions, we derive and implement algorithms for automating a mean-field based performance evaluation.
Original language | English |
---|---|
Publisher | IEEE Computer Society |
Number of pages | 10 |
Place of Publication | USA |
ISBN (Print) | 978-0-7695-4188-4 |
DOIs | |
Publication status | Published - Sept 2010 |
Externally published | Yes |
Keywords
- METIS-276245
- EWI-19152
- IR-75339