13,232 research outputs found
A Statistical Mechanical Load Balancer for the Web
The maximum entropy principle from statistical mechanics states that a closed
system attains an equilibrium distribution that maximizes its entropy. We first
show that for graphs with fixed number of edges one can define a stochastic
edge dynamic that can serve as an effective thermalization scheme, and hence,
the underlying graphs are expected to attain their maximum-entropy states,
which turn out to be Erdos-Renyi (ER) random graphs. We next show that (i) a
rate-equation based analysis of node degree distribution does indeed confirm
the maximum-entropy principle, and (ii) the edge dynamic can be effectively
implemented using short random walks on the underlying graphs, leading to a
local algorithm for the generation of ER random graphs. The resulting
statistical mechanical system can be adapted to provide a distributed and local
(i.e., without any centralized monitoring) mechanism for load balancing, which
can have a significant impact in increasing the efficiency and utilization of
both the Internet (e.g., efficient web mirroring), and large-scale computing
infrastructure (e.g., cluster and grid computing).Comment: 11 Pages, 5 Postscript figures; added references, expanded on
protocol discussio
Stochastic Analysis of a Churn-Tolerant Structured Peer-to-Peer Scheme
We present and analyze a simple and general scheme to build a churn
(fault)-tolerant structured Peer-to-Peer (P2P) network. Our scheme shows how to
"convert" a static network into a dynamic distributed hash table(DHT)-based P2P
network such that all the good properties of the static network are guaranteed
with high probability (w.h.p). Applying our scheme to a cube-connected cycles
network, for example, yields a degree connected network, in which
every search succeeds in hops w.h.p., using messages,
where is the expected stable network size. Our scheme has an constant
storage overhead (the number of nodes responsible for servicing a data item)
and an overhead (messages and time) per insertion and essentially
no overhead for deletions. All these bounds are essentially optimal. While DHT
schemes with similar guarantees are already known in the literature, this work
is new in the following aspects:
(1) It presents a rigorous mathematical analysis of the scheme under a
general stochastic model of churn and shows the above guarantees;
(2) The theoretical analysis is complemented by a simulation-based analysis
that validates the asymptotic bounds even in moderately sized networks and also
studies performance under changing stable network size;
(3) The presented scheme seems especially suitable for maintaining dynamic
structures under churn efficiently. In particular, we show that a spanning tree
of low diameter can be efficiently maintained in constant time and logarithmic
number of messages per insertion or deletion w.h.p.
Keywords: P2P Network, DHT Scheme, Churn, Dynamic Spanning Tree, Stochastic
Analysis
- …