A Hierarchical Internet Object Cache

Chankhunthod, Anawat; Danzig, Peter B.; Neerdaels, Chuck; Schwartz, Michael F.; Worrell, Kurt J.

doi:10.21236/ada446612

Cited by 416 publications

(277 citation statements)

References 10 publications

Supporting

Mentioning

271

Contrasting

Unclassified

Order By: Relevance

“…In [17], [6], and [27], file replication is performed through multiple hash functions, which are organized in a tree. This results in the replication servers being organized into a tree.…”

Section: B Existing Load-balancing Techniquesmentioning

confidence: 99%

Algorithms and performance of load-balancing with multiple hash functions in massive content distribution

et al. 2009

View full text Add to dashboard Cite

Abstract-We consider a two-tier content distribution system for distributing massive content, consisting of an infrastructure content distribution network (CDN) and a large number of ordinary clients. The nodes of the infrastructure network form a structured, distributed-hash-table-based (DHT) peer-to-peer (P2P) network. Each file is first placed in the CDN, and possibly, is replicated among the infrastructure nodes depending on its popularity. In such a system, it is particularly pressing to have proper load-balancing mechanisms to relieve server or network overload. The subject of the paper is on popularitybased file replication techniques within the CDN using multiple hash functions. Our strategy is to set aside a large number of hash functions. When the demand for a file exceeds the overall capacity of the current servers, a previously unused hash function is used to obtain a new node ID where the file will be replicated. The central problems are how to choose an unused hash function when replicating a file and how to choose a used hash function when requesting the file. Our solution to the filereplication problem is to choose the unused hash function with the smallest index, and our solution to the file-request problem is to choose a used hash function uniformly at random. Our main contribution is that we have developed a set of distributed, robust algorithms to implement the above solutions and we have evaluated their performance. In particular, we have analyzed a random binary search algorithm for file request and a random gap-removal algorithm for failure recovery.

show abstract

“…In [17], [6], and [27], file replication is performed through multiple hash functions, which are organized in a tree. This results in the replication servers being organized into a tree.…”

Section: B Existing Load-balancing Techniquesmentioning

confidence: 99%

Algorithms and performance of load-balancing with multiple hash functions in massive content distribution

et al. 2009

View full text Add to dashboard Cite

show abstract

“…In this paper, we consider two feasible architectures that is, the hierarchical and the flat ones. In a hierarchical architecture, the nodes are organized in a hierarchy of different levels [8], where only the bottom level (leaf) nodes handle client requests directly. In a flat architecture, all the nodes are placed on the same level.…”

Section: Interventions For Cooperationmentioning

confidence: 99%

Content Adaptation Architectures Based on Squid Proxy Server

2005

View full text Add to dashboard Cite

The overwhelming popularity of Internet and the technology advancements have determined the diffusion of many different Web-enabled devices. In such an heterogeneous client environment, efficient content adaptation and delivery services are becoming a major requirement for the new Internet service infrastructure. In this paper we describe intermediary-based architectures that provide adaptation and delivery of Web content to different user terminals. We present the design of a Squid-based prototype that carries out the adaptation of Web images and combines such a functionality with the caching of multiple versions of the same resource. We also investigate how to provide some form of cooperation among the nodes of the intermediary infrastructure, with the goal to evaluate to what extent the cooperation in discovering, adapting, and delivering Web resources can improve the user-perceived performance.

show abstract

“…Several HTTP cache implementations, most notably the Harvest/Squid cache [2], create cooperative arrangements between several caches. If such caches use a protocol other than HTTP to communicate between themselves, such as the Internet Cache Protocol (ICP) [12], and if they implement the Meter header, then they MUST act to ensure that their cooperation does not violate the intention of this specification.…”

Section: Implementation By Cooperating Cachesmentioning

confidence: 99%

Simple Hit-Metering and Usage-Limiting for HTTP

Mogul¹,

Leach²

1997

View full text Add to dashboard Cite

A Hierarchical Internet Object Cache

Cited by 416 publications

References 10 publications

Algorithms and performance of load-balancing with multiple hash functions in massive content distribution

Algorithms and performance of load-balancing with multiple hash functions in massive content distribution

Content Adaptation Architectures Based on Squid Proxy Server

Simple Hit-Metering and Usage-Limiting for HTTP

Contact Info

Product

Resources

About