Traffic analysis of a Web proxy caching hierarchy

Mahanti, Anirban; Williamson, Carey; Eager, Derek L.

doi:10.1109/65.844496

Cited by 141 publications

(119 citation statements)

References 18 publications

Supporting

Mentioning

105

Contrasting

Order By: Relevance

“…Traces from lowerlevel caches such as institution leaf-level proxy caches normally have better locality [7,23]. Therefore we believe that our scheme will have even better performance for lower-level proxy servers, since the localitybased grouping algorithm will work better.…”

Section: Resultsmentioning

confidence: 99%

See 1 more Smart Citation

UCFS - a novel User-space, high performance, Customized File System for Web proxy servers

Wang

Min

Zhu

et al. 2002

IEEE Trans. Comput.

View full text Add to dashboard Cite

Web proxy caching servers play a key role in today's Web infrastructure. Previous studies have shown that disk I/O is one of the major performance bottlenecks of proxy servers. Most conventional file systems do not work well for proxy server workloads and have high overheads. This paper presents a novel, User-space, Custom-made File System called UCFS that can drastically improve I/O performance of proxy servers. UCFS is a user-level software component of a proxy server which manages data on a raw disk or disk partition. Since the entire system runs in the user space, it is easy and inexpensive to implement. It also has good portability and maintainability.UCFS uses efficient in-memory meta-data tables to eliminate almost all I/O overhead of meta-data searches and updates. It also includes a novel file system called Cluster-structured File System (CFS). Similar to the Log-structured File Systems (LFS), CFS uses large disk transfers to significantly improve disk write performance. However, CFS can also markedly improve file read operations, and it does not generate garbage.Comprehensive simulation experiments using five representative real-world traces show that UCFS can significantly improve proxy server performance. For example, UCFS achieves 8-19 times better I/O performance than the state-of-the-art SQUID server running on a Unix Fast File System(FFS), 4-7.5 times better than SQUID on asynchronous FFS and 3-9 times better than the improved SQUIDML.

show abstract

Section: Resultsmentioning

confidence: 99%

“…As reported in [23], many files are accessed only once during their life time in the proxy server, so it is not worth caching it. Previous researches found that one-fourth of the total requests are for these one-timers and approximately 70% of the files referenced are one-timers.…”

Section: One-timer Documentsmentioning

confidence: 99%

UCFS - a novel User-space, high performance, Customized File System for Web proxy servers

Wang

Min

Zhu

et al. 2002

IEEE Trans. Comput.

View full text Add to dashboard Cite

show abstract

“…1 For our numerical examples in later sections we will assume that the i th most popular object is requested according to a generalized power-law distribution, i.e., with probability p i = K/i α (such distributions have been observed in many measured workloads [11,13]). …”

Section: Model Of a Distributed Caching Groupmentioning

confidence: 99%

A Feedback Control Approach to Mitigating Mistreatment in Distributed Caching Groups

Smaragdakis

Laoutaris

Matta

et al. 2006

NETWORKING 2006. Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile A

View full text Add to dashboard Cite

Abstract. We consider distributed collaborative caching groups where individual members are autonomous and self-aware. Such groups have been emerging in many new overlay and peer-to-peer applications. In a recent work of ours, we considered distributed caching protocols where group members (nodes) cooperate to satisfy requests for information objects either locally or remotely from the group, or otherwise from the origin server. In such setting, we identified the problem of a node being mistreated, i.e., its access cost for fetching information objects becoming worse with cooperation than without. We identified two causes of mistreatment: (1) the use of a common caching scheme which controls whether a node should not rely on other nodes in the group by keeping its own local copy of the object once retrieved from the group; and (2) the state interaction that can take place when the miss-request streams from other nodes in the group are allowed to affect the state of the local replacement algorithm. We also showed that both these issues can be addressed by introducing two simple additional parameters that affect the caching behavior (the reliance and the interaction parameters). In this paper, we argue against a static rule-of-thumb policy of setting these parameters since the performance, in terms of average object access cost, depends on a multitude of system parameters (namely, group size, cache sizes, demand skewness, and distances). We then propose a feedback control approach to mitigating mistreatment in distributed caching groups. In our approach, a node independently emulates its performance as if it were acting selfishly and then adapts its reliance and interaction parameters in the direction of reducing its measured access cost below its emulated selfish cost. To ensure good convergence and stability properties, we use a (Proportional-Integral-Differential) PID-style controller. Our simulation results show that our controller adapts to the minimal access cost and outperforms static-parameter schemes.

show abstract

“…Several other tools generate synthetic workloads through transformation (e.g. permutation) of empirical workload traces [6][7][8]. Several studies on analysis and modeling of web workloads have been done [9][10][11].…”

Section: Related Workmentioning

confidence: 99%

Performance Evaluation Approach for Multi-Tier Cloud Applications

Bahga

Madisetti

2013

JSEA

View full text Add to dashboard Cite

Complex multi-tier applications deployed in cloud computing environments can experience rapid changes in their workloads. To ensure market readiness of such applications, adequate resources need to be provisioned so that the applications can meet the demands of specified workload levels and at the same time ensure that service level agreements are met. Multi-tier cloud applications can have complex deployment configurations with load balancers, web servers, application servers and database servers. Complex dependencies may exist between servers in various tiers. To support provisioning and capacity planning decisions, performance testing approaches with synthetic workloads are used. Accuracy of a performance testing approach is determined by how closely the generated synthetic workloads mimic the realistic workloads. Since multi-tier applications can have varied deployment configurations and characteristic workloads, there is a need for a generic performance testing methodology that allows accurately modeling the performance of applications. We propose a methodology for performance testing of complex multi-tier applications. The workloads of multi-tier cloud applications are captured in two different models-benchmark application and workload models. An architecture model captures the deployment configurations of multi-tier applications. We propose a rapid deployment prototyping methodology that can help in choosing the best and most cost effective deployments for multi-tier applications that meet the specified performance requirements. We also describe a system bottleneck detection approach based on experimental evaluation of multi-tier applications.

show abstract

Traffic analysis of a Web proxy caching hierarchy

Cited by 141 publications

References 18 publications

UCFS - a novel User-space, high performance, Customized File System for Web proxy servers

UCFS - a novel User-space, high performance, Customized File System for Web proxy servers

A Feedback Control Approach to Mitigating Mistreatment in Distributed Caching Groups

Performance Evaluation Approach for Multi-Tier Cloud Applications

Contact Info

Product

Resources

About