Automating the mean-field method for large dynamic gossip networks


Share/Save/Bookmark

Bakhshi, Rena and Endrullis, Jörg and Endrullis, Stefan and Fokkink, Wan and Haverkort, Boudewijn (2010) Automating the mean-field method for large dynamic gossip networks. In: Proceedings of the 7th International Conference on the Quantitative Evaluation of Systems, QEST 2010, 15-18 september 2010, Williamsburg, Virginia, USA.

[img]
Preview
PDF
466Kb
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.
Item Type:Conference or Workshop Item
Copyright:© 2010 IEEE
Faculty:
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:http://purl.utwente.nl/publications/75339
Official URL:http://dx.doi.org/10.1109/QEST.2010.38
Conference URL:http://www.qest.org/qest2010/
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page