Summary on Consistent Hashing and Random
Trees: Distributed Caching Protocols for Relieving
Hot Spots on the World Wide Web
Sagar Subudhi
Indian Institute of Space Science and Technology
Thiruvananthapuram
Email: subudhi.sagar123@gmail.com
Abstract—We describe a family of caching protocols for
distributed networks which are based on a special kind of hashing
that we call consistent hashing and can be used to decrease or
eliminate the occurrence of hot spots in the network
I. I NTRODUCTION
In this report writer has briefly described caching protocols
for distributed networks that can be used to decrease or
eliminate the occurrences of hot spots. Hot spots occurs mainly
when so many clients simultaneously want to access data from
a single server.
A. Main contributions
1) MODEL: Here Web is classified in three categories
browsers, servers and caches. Number of caches represented as
C set of all pages- P and latency for a massage from machine
m1 to arrive at m2 - δ(m1 ; m2)
2) RANDOM TREES: Simple caching protocol with the
specifications- 1. All machines know about the caches; 2. δ(mi ;
mj ) for all i6= j and 3. All requests are made at the same time.
This basically combines both the aspects of last two algorithms
described in past work and where swamping of any server
is prevented with high probability and minimizing memory
requirements.
II. A NALYSIS
A. Latency
Here, the delay a browser faces in obtaining a page depends
on the height of the tree. If a request is forwarded from a leaf
to the root, the latency is twice the length of the path, 2 logd C.
If the request is within a cache, the latency is less.
B. Swamping
If h is chosen uniformly and at random from the space of
hash functions then with probability at least 1 1/N, where N is
a parameter the number of requests a given cache gets depends
on theρ and O function of C and N.
C. Storage
The amount of storage each cache must have in order to
make this protocol work. and it is simply the number of pages
for which it receives more than q requests.
III. CONSISTENT HASHING
Consistent hashing solves the problem of different views,
defined to be the set of caches of which a particular client
is aware. A client uses a consistent hash function to map a
object to one of the caches in its view.
IV. RANDOM TREES IN AN INCONSISTENT
WORLD
Here the assumption is only that each machine knows about
a 1/t fraction of the caches chosen by an adversary. There is
no difference in the protocol, except that the mapping h is a
consistent hash function. This change will not affect latency.
It will only effect swamping and storage.
V. FAULT TOLERANCE
The modification to the protocol is quite simple. Choose a
parameter t,and simultaneously send t requests for the page.
A logarithmic number if requests is sufficient to give a high
probability of one of the requests goes through. This change
in the protocol will of course have an impact on the system.
VI. ADDING REAL TIME TO THE METHOD
Till now the main assumption was static. But if we have
to consider real time then cache machine size and cache load
changes according to given theorem in the paper. Here it used
the rate at which requests were issued to measure the rate at
which connections are established to machines.
VII. C ONCLUSION
The ideas have broader applicability. In particular, consistent
hashing may be a useful tool for distributing information from
name servers such as DNS and label servers such as PICS in
a load-balanced.These two schemes may together provide an
interesting method for constructing multicast trees which can
effectively overcome the hots spots issues.
R EFERENCES
[1] David Karger, Eric Lehman, Matthew Levine and Daniel Lewin, Con-
sistent Hashing and Random Trees: Distributed Caching Protocols for
Relieving Hot Spots on the World Wide Web