Using realistic factors to simulate catastrophic congestion events in a network

Dabrowski, Christopher; Mills, Kevin L.

doi:10.1016/j.comcom.2017.08.006

Cited by 1 publication

(1 citation statement)

References 27 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Figure 2 is the graph model of a Internet Service Provider (ISP) network [15]. It has 218 nodes and there is a vertex cover with 41 nodes (see figure).…”

Section: Algorithm Description and Examplesmentioning

confidence: 99%

Using First Hitting Times to Find Sets that Maximize the Convergence Rate to Consensus

Hunt

2018

Preprint

View full text Add to dashboard Cite

In a model of communication in a social network described by a simple consensus model, we pose the problem of finding a subset of nodes with given cardinality and fixed consensus values that enable the fastest convergence rate to equilibrium of the values of the remaining nodes. Given a network topology and a subset, called the stubborn nodes, the equilibrium exists and is a convex sum of the initial values of the stubborn nodes ([18], [32], [14]). The value at a nonstubborn node converges to its consensus value exponentially with a rate constant determined by the expected first hitting time of a random walker starting at the node and ending at the first stubborn node it visits. In this paper, following the work of [6], [10] [45] we will use the sum of the expected first hitting times to the stubborn nodes as an objective function for a minimization problem. Its solution is a set with the fastest convergence rate. We present a polynomial time method for obtaining approximate solutions of the optimization problem for fixed cardinality less than that of a reference vertex cover. Under the assumption that the transition matrix for the random walk is irreducible and reversible, we also obtain an upper bound for the expected first hitting time and therefore an upper bound on the rate of convergence to consensus, using results from the mixing theory of Markov chains. In addition to serving as a convenient screen for sets with fast convergence, the bound also reveals a new characterization of the convergence to consensus in terms of the bottle neck ratio of the Markov chain of the random walk and an accessibility measure expressed in terms the convex weights used in the consensus value.

show abstract

“…Figure 2 is the graph model of a Internet Service Provider (ISP) network [15]. It has 218 nodes and there is a vertex cover with 41 nodes (see figure).…”

Section: Algorithm Description and Examplesmentioning

confidence: 99%

Using First Hitting Times to Find Sets that Maximize the Convergence Rate to Consensus

Hunt

2018

Preprint

View full text Add to dashboard Cite

show abstract

Using realistic factors to simulate catastrophic congestion events in a network

Cited by 1 publication

References 27 publications

Using First Hitting Times to Find Sets that Maximize the Convergence Rate to Consensus

Using First Hitting Times to Find Sets that Maximize the Convergence Rate to Consensus

Contact Info

Product

Resources

About