Mean-field framework for performance evaluation of push-pull gossip protocols
Performance Evaluation
Comparison of the mean-field approach and simulation in a peer-to-peer botnet case study
EPEW'11 Proceedings of the 8th European conference on Computer Performance Engineering
Mechanized extraction of topology anti-patterns in wireless networks
IFM'12 Proceedings of the 9th international conference on Integrated Formal Methods
Scalable analysis for large social networks: the data-aware mean-field approach
SocInfo'12 Proceedings of the 4th international conference on Social Informatics
| Hi-index | 0.00 |
We investigate an abstraction method, called mean-field method, for the performance evaluation of dynamic networks 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 communication 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.