Design and Implementation of a P2p Cooperative Proxy Cache System

Wang, James; Bhulawala, Vipul

doi:10.1142/s0219265907001953

Cited by 4 publications

(4 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The results of the performance studies show the impact of cache coherency on the system's performance. It also shows that the proposed routing protocols significantly improve the performance of the cooperative caching system in terms of cache hit ratio, byte hit ratio, user request latency, as well as the number of exchanged messages between the caches in the cooperative set (Wang & Bhulawala, 2005). Yet another study presented a trustable peer-to-peer web caching system, in which peers in the network share their web cache contents.…”

mentioning

confidence: 89%

Computational Intelligence and Modern Heuristics

Ali¹

2010

View full text Add to dashboard Cite

Computational Intelligence and Modern Heuristics 8 Management systemThe management system of service network allocates the services and network resources to realized tasks, checks the efficient states of the services network, performs suitable actions to locate faults, attacks or viruses and minimize their negative effects. Generally the management system has two main functionalities: monitoring of network states and controlling of services and resources,  creating and implementing maintenance policies which ought to be adequate network reactions on concrete events/accidents. In many critical situations a team of men and the management system have to cooperate in looking for adequate counter-measures, for instance in case of a heavy attack or a new virus. The maintenance policy is based on two main concepts: detection of unfriendly events (attacks, faults, failures) and network responses to them. In general the network responses incorporate the following procedures: detection of incidents and identification of them,  isolation of damaged network resources in order to limit proliferation of incident consequences,  renewal of damaged services, processes and resources. It is hard to predict all possible events (for example all new demands for a task realization) or incidents (for example failures, faults, attacks or an end of a renewal procedure) in the services network, especially it is not possible to predict all possible attacks or men faults, so system reactions are very often "improvised" by the management system, by its administrator staff or even by expert panels specially created to find a solution for the existing situation. The time, needed for the renewal, depends on the incident that has occurred, the system resources that are available and the renewal policy that is applied. The renewal policy is formulated on the basis of the required levels of system dependability and on the economical conditions (first of all, the cost of downtime and cost of lost achievements) (Zamojski & Caban, 2006; Zamojski & Caban, 2007). Maintenance policy is based on maintenance rules that are understood as chains of decisions about allocation of services and network resources (hardware, software, information and service staff) that are undertaken to keep the system operational after an incident. These rules are very often connected with small fragments of the system, for example; replacement of a machine (a processor) or communication links. These local operations may have impact on the whole network, e.g. if a communication channel is down for a few minutes, then rates of medium (data) traffic of the network may violently change (Zamojski & Caban, 2007). ChroniclesThe set of system events is created by events connected with tasks realization, incidents occurrence (faults, viruses, and attacks) and system reactions (hardware and information renewals). Management systemThe management system of service network allocates the services and network resources to realized tasks, checks the efficient states of the services networ...

show abstract

mentioning

confidence: 89%

Computational Intelligence and Modern Heuristics

Ali¹

2010

View full text Add to dashboard Cite

show abstract

“…Wang and others [26] proposed the Criteria Weighted (CW) algorithm for a peer-to-peer cooperative proxy caching system. The criteria for choosing the replacement victim includes access frequency of the document, size of the document, number of replicas of the document known to the proxy, and time lapsed since the last access to the document.…”

Section: Related Workmentioning

confidence: 99%

“…Thus, the cache must be optimized or freed from existing objects to accommodate new incoming objects. The optimization can be done with cache replacement polices [4], [5], [11]- [26]. Most cache replacement policies select an entire cached object or part of the cached object as a victim and apply the policy to it.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Cache Optimization on Hot-Point Proxy Caching Using Weighted-Rank Cache Replacemnt Policy

Ponnusamy¹

2013

ETRI J

View full text Add to dashboard Cite

The development of proxy caching is essential in the area of video‐on‐demand (VoD) to meet users' expectations. VoD requires high bandwidth and creates high traffic due to the nature of media. Many researchers have developed proxy caching models to reduce bandwidth consumption and traffic. Proxy caching keeps part of a media object to meet the viewing expectations of users without delay and provides interactive playback. If the caching is done continuously, the entire cache space will be exhausted at one stage. Hence, the proxy server must apply cache replacement policies to replace existing objects and allocate the cache space for the incoming objects. Researchers have developed many cache replacement policies by considering several parameters, such as recency, access frequency, cost of retrieval, and size of the object. In this paper, the Weighted‐Rank Cache replacement Policy (WRCP) is proposed. This policy uses such parameters as access frequency, aging, and mean access gap ratio and such functions as size and cost of retrieval. The WRCP applies our previously developed proxy caching model, Hot‐Point Proxy, at four levels of replacement, depending on the cache requirement. Simulation results show that the WRCP outperforms our earlier model, the Dual Cache Replacement Policy.

show abstract