WebWave: Globally Load Balanced Fully Distributed Caching of Hot Published Documents
Date
1996-10-10
DOI
Authors
Heddaya, Abdelsalam
Mirdad, Sulaiman
Version
OA Version
Citation
Heddaya, Abdelsalam; Mirdad, Sulaiman. "WebWave: Globally Load Balanced Fully Distributed Caching of Hot Published Documents", Technical Report BUCS-1996-024, Computer Science Department, Boston University, October 10, 1996. [Available from: http://hdl.handle.net/2144/3746]
Abstract
Document publication service over such a large network as the Internet challenges us to harness available server and network resources to meet fast growing demand. In this paper, we show that large-scale dynamic caching can be employed to globally minimize server idle time, and hence maximize the aggregate server throughput of the whole service. To be efficient, scalable and robust, a successful caching mechanism must have three properties: (1) maximize the global throughput of the system, (2) find cache copies without recourse to a directory service, or to a discovery protocol, and (3) be completely distributed in the sense of operating only on the basis of local information.
In this paper, we develop a precise definition, which we call tree load-balance (TLB), of what it means for a mechanism to satisfy these three goals. We present an algorithm that computes TLB off-line, and a distributed protocol that induces a load distribution that converges quickly to a TLB one. Both algorithms place cache copies of immutable documents, on the routing tree that connects the cached document's home server to its clients, thus enabling requests to stumble on cache copies en route to the home server.