DESIGN AND SIMULATION OF PROBABILISTIC TECHNIQUES FOR CACHE REPLACEMENT

ABSTRACT

We analyze a class of randomized Least-Recently-Used (LRU) cache replacement algorithms under the independent reference model with generalized Zipf’s law request probabilities. The randomization was recently proposed for Web caching as a mechanism that discriminates between different document sizes. In particular, a requested document that is not found in the cache either replaces a necessary number of least recently used documents with probability depending on its size or the cache is left unchanged. In this framework, we provide explicit asymptotic characterization of the cache fault probability. Using the derived result we prove that the asymptotic performance of this class of algorithms is optimized when the randomization probabilities are chosen inversely proportional to document sizes. In addition, for this optimized and easy to implement policy, we show that its performance is within a constant factor from the optimal static algorithm. An excellent agreement between our approximation and simulation experiments, even for small cache sizes, further validates our asymptotic results

TABLE OF CONTENTS

TITLE PAGE

CERTIFICATION

DEDICATION

ACKNOWLEDGEMENT

ORGANIZATION OF WORK

ABSTRACT

TABLE OF CONTENT

CHAPTER ONE

1.0 INTRODUCTION

1.1 STATEMENT OF THE PROBLEM

1.2 PURPOSE OF THE STUDY

1.3 AIM AND OBJECTIVES

1.4 SCOPE OF STUDY

1.5 CONSTRAINTS

1.6 ASSUMPTION

1.7 DEFINITION OF TERMS

CHAPTER TWO

2.0 LITERATURE REVIEW

CHAPTER THREE

3.0 DESCRIPTION AND ANALYSIS OF THE EXISTING SYSTEM

3.1 FACT FINDING METHODS USED

3.11 REFERENCES TO WRITTEN DOCUMENT

3.1.2 BROWSING OF INTERNET

3.2 INPUT, PROCESS, OUTPUT ANALYSIS

3.2.1 INPUT, ANALYSIS

3.2.2 INPUT FORMAT

3.2.3 PROCESS, ANALYSIS

3.2.4 OUTPUT, ANALYSIS

3.2.5 INPUT FORMAT

3.3 PROBLEM OF THE EXISTING SYSTEM

3.4 OBJECTIVE OF THE EXISTING SYSTEM

3.5 JUSTIFICATION OF THE NEW EXISTING SYSTEM

CHAPTER FOUR

4.0 THE DESIGN OF THE NEW SYSTEM

4.1 OUTPUT SPECIFICATION AND DESIGN

4.2 INPUT SPECIFICATION AND DESIGN

4.3 FILE DESIGN

4.4 FILE STRUCTURE

4.5 PROCEDURE CHART

4.6 SYSTEM FLOWCHART

4.7 SYSTEM REQUIREMENT

4.71 HARDWARE REQUIREMENT

4.72 SOFT WARE REQUIREMENT

5.0 IMPLEMENTATION

5.1 PROGRAM DESIGN

5.2 PSEUDO CODE

5.3 PROGRAM FLOWCHART

6.0 DOCUMENTATION

6.1 CHOICE OF LANGUAGE

6.2 LANGUAGE INTRODUCTION

6.3 CHANGE OVER METHOD

7.0 CHAPTER FIVE

8.0 CONCLUSION

7.1 RECOMMENDATION

BIBLIOGRAPHY

Report Access / View File

Overall Rating

0

5 Star

(0)

4 Star

(0)

3 Star

(0)

2 Star

(0)

1 Star

(0)

APA

LB3KrQR5c0006fde3c696.03592209, X. (2018). DESIGN AND SIMULATION OF PROBABILISTIC TECHNIQUES FOR CACHE REPLACEMENT. Afribary. Retrieved from https://archive.afribary.com/works/design-and-simulation-of-probabilistic-techniques-for-cache-replacement-9912

MLA 8th

LB3KrQR5c0006fde3c696.03592209, XuZJAx35c0006fde31d75.71658929 "DESIGN AND SIMULATION OF PROBABILISTIC TECHNIQUES FOR CACHE REPLACEMENT" Afribary. Afribary, 29 Jan. 2018, https://archive.afribary.com/works/design-and-simulation-of-probabilistic-techniques-for-cache-replacement-9912. Accessed 09 May. 2026.

MLA7

LB3KrQR5c0006fde3c696.03592209, XuZJAx35c0006fde31d75.71658929 . "DESIGN AND SIMULATION OF PROBABILISTIC TECHNIQUES FOR CACHE REPLACEMENT". Afribary, Afribary, 29 Jan. 2018. Web. 09 May. 2026. < https://archive.afribary.com/works/design-and-simulation-of-probabilistic-techniques-for-cache-replacement-9912 >.

Chicago

LB3KrQR5c0006fde3c696.03592209, XuZJAx35c0006fde31d75.71658929 . "DESIGN AND SIMULATION OF PROBABILISTIC TECHNIQUES FOR CACHE REPLACEMENT" Afribary (2018). Accessed May 09, 2026. https://archive.afribary.com/works/design-and-simulation-of-probabilistic-techniques-for-cache-replacement-9912

DESIGN AND SIMULATION OF PROBABILISTIC TECHNIQUES FOR CACHE REPLACEMENT

0

Document Details

Related Works