University of Houston
Department of Computer Science
In
partial fulfillment of the Requirements for the Degree of
Master of
Science
Yuan Zhang
will defend his thesis
A HOME BASED INTERNET CACHE ARRAY PROTOCOL
Abstract
The advantages of using an Internet cache are well known. In a large-scale enterprise network, multiple caches are quite common. There are several protocols to coordinate these caches as a cache array. A new Internet cache array protocol - Home Based Cache Array Protocol, or HOME, is proposed in this thesis.
CARP and ICP are two well-known existing cache array protocols. In ICP, caches store all objects requested by their clients and send multi-cast messages to all neighbor caches to locate requested object. There are lots of duplicate objects in caches, and Multi-cast ICP messages add high protocol overhead. In CARP, hashing algorithm is used to decide which cache should store the requested object. Objects are distributed among all caches, but default hit ratio is low. HOME is proposed to combine advantages of both ICP and CARP. In HOME, hashing algorithm is used to locate requested objects. Meanwhile, caches store both objects that are requested by their clients and objects that should be stored according to hashing algorithm.
A trace-driven simulation program was developed to compare the performance among cache array protocols. A lot of simulations were conducted to compare ICP, CARP, HOME, and independent cache array. Parameters that influence cache array performance are studied. The result shows that HOME is a load balanced, positively scalable, and stable Internet cache array protocol. HOME has practically best performance in default hit ratio, hit ratio, average response time, and protocol overhead. Furthermore, HOME is stable to network condition change.
Date: Wednesday, May 8th, 2002
Time: 2:00 PM
Place: 550-PGH
Faculty, students, and the general public are
invited.
Thesis Advisor: Dr. Jaspal Subhlok