Name
Abstract | ||
|---|---|---|
Well-organized proxy caching systems can greatly re- duce the user perceived latency and decrease the network bandwidth consumption. In this paper, we propose a new hash based web caching architecture, Tulip. Tulip extends the locality-based algorithm in UCFS (15) as the basic data grouping scheme in hash based proxy systems, uses it to ag- gregate web objects which are likely to be accessed together into object clusters and uses these clusters as the primary access units between memory and disk. The overhead of slow disk I/Os is greatly reduced. It also presents a simple and efficient data duplication scheme. Along with the local caching strategy, Tulip can achieve both fault tolerance and load balance with minimal overhead introduced. Our simu- lation results show Tulip is scalable and robust, it has better performance than previous approaches. |
Year | DOI | Venue |
|---|---|---|
2004 | 10.1109/IPDPS.2004.1303315 | IPDPS |
Keywords | Field | DocType |
resource allocation,routing protocols,fault tolerance,load balance,bandwidth,clustering algorithms,fault tolerant,web server,robustness,service oriented architecture,internet | Data deduplication,Computer science,Load balancing (computing),Parallel computing,Computer network,Robustness (computer science),Fault tolerance,Hash function,Cluster analysis,Distributed computing,Scalability,Web server | Conference |
Citations | PageRank | References |
0 | 0.34 | 10 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Zhiyong Xu | 1 | 156 | 15.97 |
| Rui Min | 2 | 0 | 0.34 |
| Laxmi N. Bhuyan | 3 | 2393 | 248.44 |
| Yiming Hu | 4 | 11 | 2.28 |