2010 · 23 citations · 22 references
ComputingComputer ScienceComputer SystemsComplex SystemsComputer NetworksDistributed SystemsDynamic Network AnalysisNetwork AnalysisNetwork DynamicsNetwork ModelingNetwork TheoryNetwork TopologyAbstractionDynamic Communication NetworksGossip AlgorithmsMean Field AnalysisMean-field ModelsMean-field TheoryModel AbstractionNetwork Topology Analysis
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.
22
Markov Processes: Characterization and Convergence.
Andris Abakuks, S. N. Ethier, Thomas G. Kurtz · Biometrics · 1987 · 4.5K citations
Exactly Solved Models in Statistical Mechanics
M. A. Moore · Physics Bulletin · 1983 · 4.5K citations
Performance modeling of epidemic routing
Xiaolan Zhang, Giovanni Neglia, Jim Kurose et al. · Computer Networks · 2006 · 802 citations