E-MACSC: A novel dynamic cache tuning technique to reduce information retrieval roundtrip time over the Internet

The novel technique proposed in this paper for dynamic cache size tuning is an enhancement of the previous MACSC ( Model for Adaptive Cache Size Control) approach. Similar to its MACSC predecessor the Enhanced MACSC (E-MACSC) technique consistently maintains the given cache hit ratio. The focus of t...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Computer communications 2006-05, Vol.29 (8), p.1094-1109
Hauptverfasser: Wu, Richard S.L., Wong, Allan K.Y., Dillon, Tharam S.
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 1109
container_issue 8
container_start_page 1094
container_title Computer communications
container_volume 29
creator Wu, Richard S.L.
Wong, Allan K.Y.
Dillon, Tharam S.
description The novel technique proposed in this paper for dynamic cache size tuning is an enhancement of the previous MACSC ( Model for Adaptive Cache Size Control) approach. Similar to its MACSC predecessor the Enhanced MACSC (E-MACSC) technique consistently maintains the given cache hit ratio. The focus of the research is presently on supporting small caching systems of limited recyclable memory resources. The MACSC tunes the cache size adaptively with the instantaneous popularity ratio, which is computed statistically by the point-estimate (PE) method on the fly. It is difficult to harness the PE convergence time, because the following are unpredictable: (a) the number of data samples needed by the PE process to achieve convergence and (b) the inter-arrival times among these data samples. In the E-MACSC framework this unpredictability problem is resolved by replacing PE with the M 3RT mechanism, which is a realization of the Convergence Algorithm (CA). Therefore the E-MACSC is also called the MACSC(M 3RT) as compared to the original PE-based MACSC or MACSC(PE). The CA is an IEPM ( Internet End-to-End Performance Measurement) technique that measures the mean of a waveform quickly and accurately. The CA prediction accuracy, however, differs from other IEPM techniques, because it is independent of the type of waveform/distribution. This independence arises from the fact that CA is based on the Central Limit Theorem. The E-MACSC approach provides several benefits as follows: (a) it maintains the prescribed hit ratio efficaciously, (b) it lessens cache size oscillation, and (c) it uses a fixed number of data samples and this makes its computation time more predictable. The E-MACSC is unique because of the following reasons: (a) it utilizes the relative popularity of the data objects as the sole control parameter and (b) it tunes the cache size adaptively by direct data measurement with the CA support. The relative popularity profile of data objects is called popularity distribution (PD) in the E-MACSC context. Any change in the PD's standard deviation indicates a shift of user preference for particular data objects. Monitoring and leveraging this change is the basis for E-MACSC to find a meaningful popularity ratio for deciding how the cache size should be tuned in a dynamic manner.
doi_str_mv 10.1016/j.comcom.2005.06.022
format Article
fullrecord <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_57652317</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>S014036640500246X</els_id><sourcerecordid>28060631</sourcerecordid><originalsourceid>FETCH-LOGICAL-c347t-5680626c71d11c7ada60cc040912091a99b8215325d7d47f5d2de620d28c87f53</originalsourceid><addsrcrecordid>eNqFUcFq3DAQNaWFbtP-QQ-6tDe7I9mW7B4Ky5KkgZQekkJvQh2NGy22tJXkhfx9tGygtxZmGGZ48-Yxr6rec2g4cPlp32BYSjQCoG9ANiDEi2rDB9XWCtqfL6sN8A7qVsrudfUmpT0AdEq1m-pwWX_b7u52n9mW-XCkmdlHbxaHDA0-EMurd_43y4QP3v1ZyyCwSHZFYs5PIS4mu-DLKEdHRzOzGFZvS3Ng2S3ECmVkuRDd-EzRU35bvZrMnOjdc72oflxd3u--1rffr29229sa207lupcDSCFRccs5KmONBEToYOSipBnHX4PgfSt6q2ynpt4KS1KAFQMOpW0vqo9n3kMMRXfKenEJaZ6Np7Am3SvZi5ar_wJFEQKy5QXYnYEYQ0qRJn2IbjHxUXPQJx_0Xp990CcfNEhdfChrH575TUIzT9F4dOnvrlLj2I0nwV_OOCpfOTqKOqEjj2RdJMzaBvfvQ09ftZ_W</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>28060631</pqid></control><display><type>article</type><title>E-MACSC: A novel dynamic cache tuning technique to reduce information retrieval roundtrip time over the Internet</title><source>Elsevier ScienceDirect Journals</source><creator>Wu, Richard S.L. ; Wong, Allan K.Y. ; Dillon, Tharam S.</creator><creatorcontrib>Wu, Richard S.L. ; Wong, Allan K.Y. ; Dillon, Tharam S.</creatorcontrib><description>The novel technique proposed in this paper for dynamic cache size tuning is an enhancement of the previous MACSC ( Model for Adaptive Cache Size Control) approach. Similar to its MACSC predecessor the Enhanced MACSC (E-MACSC) technique consistently maintains the given cache hit ratio. The focus of the research is presently on supporting small caching systems of limited recyclable memory resources. The MACSC tunes the cache size adaptively with the instantaneous popularity ratio, which is computed statistically by the point-estimate (PE) method on the fly. It is difficult to harness the PE convergence time, because the following are unpredictable: (a) the number of data samples needed by the PE process to achieve convergence and (b) the inter-arrival times among these data samples. In the E-MACSC framework this unpredictability problem is resolved by replacing PE with the M 3RT mechanism, which is a realization of the Convergence Algorithm (CA). Therefore the E-MACSC is also called the MACSC(M 3RT) as compared to the original PE-based MACSC or MACSC(PE). The CA is an IEPM ( Internet End-to-End Performance Measurement) technique that measures the mean of a waveform quickly and accurately. The CA prediction accuracy, however, differs from other IEPM techniques, because it is independent of the type of waveform/distribution. This independence arises from the fact that CA is based on the Central Limit Theorem. The E-MACSC approach provides several benefits as follows: (a) it maintains the prescribed hit ratio efficaciously, (b) it lessens cache size oscillation, and (c) it uses a fixed number of data samples and this makes its computation time more predictable. The E-MACSC is unique because of the following reasons: (a) it utilizes the relative popularity of the data objects as the sole control parameter and (b) it tunes the cache size adaptively by direct data measurement with the CA support. The relative popularity profile of data objects is called popularity distribution (PD) in the E-MACSC context. Any change in the PD's standard deviation indicates a shift of user preference for particular data objects. Monitoring and leveraging this change is the basis for E-MACSC to find a meaningful popularity ratio for deciding how the cache size should be tuned in a dynamic manner.</description><identifier>ISSN: 0140-3664</identifier><identifier>EISSN: 1873-703X</identifier><identifier>DOI: 10.1016/j.comcom.2005.06.022</identifier><language>eng</language><publisher>Amsterdam: Elsevier B.V</publisher><subject>Applied sciences ; Caching ; Computer science; control theory; systems ; Computer systems and distributed systems. User interface ; Dynamic cache size tuning ; E-MACSC ; Exact sciences and technology ; IEPM ; Information systems. Data bases ; Internet ; M 3RT ; MACSC ; Memory organisation. Data processing ; Point estimate ; Popularity ratio ; Software ; Zipf-like behavior</subject><ispartof>Computer communications, 2006-05, Vol.29 (8), p.1094-1109</ispartof><rights>2005 Elsevier B.V.</rights><rights>2006 INIST-CNRS</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><cites>FETCH-LOGICAL-c347t-5680626c71d11c7ada60cc040912091a99b8215325d7d47f5d2de620d28c87f53</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://dx.doi.org/10.1016/j.comcom.2005.06.022$$EHTML$$P50$$Gelsevier$$H</linktohtml><link.rule.ids>314,776,780,3536,27903,27904,45974</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&amp;idt=17799495$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>Wu, Richard S.L.</creatorcontrib><creatorcontrib>Wong, Allan K.Y.</creatorcontrib><creatorcontrib>Dillon, Tharam S.</creatorcontrib><title>E-MACSC: A novel dynamic cache tuning technique to reduce information retrieval roundtrip time over the Internet</title><title>Computer communications</title><description>The novel technique proposed in this paper for dynamic cache size tuning is an enhancement of the previous MACSC ( Model for Adaptive Cache Size Control) approach. Similar to its MACSC predecessor the Enhanced MACSC (E-MACSC) technique consistently maintains the given cache hit ratio. The focus of the research is presently on supporting small caching systems of limited recyclable memory resources. The MACSC tunes the cache size adaptively with the instantaneous popularity ratio, which is computed statistically by the point-estimate (PE) method on the fly. It is difficult to harness the PE convergence time, because the following are unpredictable: (a) the number of data samples needed by the PE process to achieve convergence and (b) the inter-arrival times among these data samples. In the E-MACSC framework this unpredictability problem is resolved by replacing PE with the M 3RT mechanism, which is a realization of the Convergence Algorithm (CA). Therefore the E-MACSC is also called the MACSC(M 3RT) as compared to the original PE-based MACSC or MACSC(PE). The CA is an IEPM ( Internet End-to-End Performance Measurement) technique that measures the mean of a waveform quickly and accurately. The CA prediction accuracy, however, differs from other IEPM techniques, because it is independent of the type of waveform/distribution. This independence arises from the fact that CA is based on the Central Limit Theorem. The E-MACSC approach provides several benefits as follows: (a) it maintains the prescribed hit ratio efficaciously, (b) it lessens cache size oscillation, and (c) it uses a fixed number of data samples and this makes its computation time more predictable. The E-MACSC is unique because of the following reasons: (a) it utilizes the relative popularity of the data objects as the sole control parameter and (b) it tunes the cache size adaptively by direct data measurement with the CA support. The relative popularity profile of data objects is called popularity distribution (PD) in the E-MACSC context. Any change in the PD's standard deviation indicates a shift of user preference for particular data objects. Monitoring and leveraging this change is the basis for E-MACSC to find a meaningful popularity ratio for deciding how the cache size should be tuned in a dynamic manner.</description><subject>Applied sciences</subject><subject>Caching</subject><subject>Computer science; control theory; systems</subject><subject>Computer systems and distributed systems. User interface</subject><subject>Dynamic cache size tuning</subject><subject>E-MACSC</subject><subject>Exact sciences and technology</subject><subject>IEPM</subject><subject>Information systems. Data bases</subject><subject>Internet</subject><subject>M 3RT</subject><subject>MACSC</subject><subject>Memory organisation. Data processing</subject><subject>Point estimate</subject><subject>Popularity ratio</subject><subject>Software</subject><subject>Zipf-like behavior</subject><issn>0140-3664</issn><issn>1873-703X</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2006</creationdate><recordtype>article</recordtype><recordid>eNqFUcFq3DAQNaWFbtP-QQ-6tDe7I9mW7B4Ky5KkgZQekkJvQh2NGy22tJXkhfx9tGygtxZmGGZ48-Yxr6rec2g4cPlp32BYSjQCoG9ANiDEi2rDB9XWCtqfL6sN8A7qVsrudfUmpT0AdEq1m-pwWX_b7u52n9mW-XCkmdlHbxaHDA0-EMurd_43y4QP3v1ZyyCwSHZFYs5PIS4mu-DLKEdHRzOzGFZvS3Ng2S3ECmVkuRDd-EzRU35bvZrMnOjdc72oflxd3u--1rffr29229sa207lupcDSCFRccs5KmONBEToYOSipBnHX4PgfSt6q2ynpt4KS1KAFQMOpW0vqo9n3kMMRXfKenEJaZ6Np7Am3SvZi5ar_wJFEQKy5QXYnYEYQ0qRJn2IbjHxUXPQJx_0Xp990CcfNEhdfChrH575TUIzT9F4dOnvrlLj2I0nwV_OOCpfOTqKOqEjj2RdJMzaBvfvQ09ftZ_W</recordid><startdate>20060515</startdate><enddate>20060515</enddate><creator>Wu, Richard S.L.</creator><creator>Wong, Allan K.Y.</creator><creator>Dillon, Tharam S.</creator><general>Elsevier B.V</general><general>Elsevier Science</general><scope>IQODW</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>E3H</scope><scope>F2A</scope></search><sort><creationdate>20060515</creationdate><title>E-MACSC: A novel dynamic cache tuning technique to reduce information retrieval roundtrip time over the Internet</title><author>Wu, Richard S.L. ; Wong, Allan K.Y. ; Dillon, Tharam S.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c347t-5680626c71d11c7ada60cc040912091a99b8215325d7d47f5d2de620d28c87f53</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2006</creationdate><topic>Applied sciences</topic><topic>Caching</topic><topic>Computer science; control theory; systems</topic><topic>Computer systems and distributed systems. User interface</topic><topic>Dynamic cache size tuning</topic><topic>E-MACSC</topic><topic>Exact sciences and technology</topic><topic>IEPM</topic><topic>Information systems. Data bases</topic><topic>Internet</topic><topic>M 3RT</topic><topic>MACSC</topic><topic>Memory organisation. Data processing</topic><topic>Point estimate</topic><topic>Popularity ratio</topic><topic>Software</topic><topic>Zipf-like behavior</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Wu, Richard S.L.</creatorcontrib><creatorcontrib>Wong, Allan K.Y.</creatorcontrib><creatorcontrib>Dillon, Tharam S.</creatorcontrib><collection>Pascal-Francis</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts – Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><collection>Library &amp; Information Sciences Abstracts (LISA)</collection><collection>Library &amp; Information Science Abstracts (LISA)</collection><jtitle>Computer communications</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Wu, Richard S.L.</au><au>Wong, Allan K.Y.</au><au>Dillon, Tharam S.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>E-MACSC: A novel dynamic cache tuning technique to reduce information retrieval roundtrip time over the Internet</atitle><jtitle>Computer communications</jtitle><date>2006-05-15</date><risdate>2006</risdate><volume>29</volume><issue>8</issue><spage>1094</spage><epage>1109</epage><pages>1094-1109</pages><issn>0140-3664</issn><eissn>1873-703X</eissn><abstract>The novel technique proposed in this paper for dynamic cache size tuning is an enhancement of the previous MACSC ( Model for Adaptive Cache Size Control) approach. Similar to its MACSC predecessor the Enhanced MACSC (E-MACSC) technique consistently maintains the given cache hit ratio. The focus of the research is presently on supporting small caching systems of limited recyclable memory resources. The MACSC tunes the cache size adaptively with the instantaneous popularity ratio, which is computed statistically by the point-estimate (PE) method on the fly. It is difficult to harness the PE convergence time, because the following are unpredictable: (a) the number of data samples needed by the PE process to achieve convergence and (b) the inter-arrival times among these data samples. In the E-MACSC framework this unpredictability problem is resolved by replacing PE with the M 3RT mechanism, which is a realization of the Convergence Algorithm (CA). Therefore the E-MACSC is also called the MACSC(M 3RT) as compared to the original PE-based MACSC or MACSC(PE). The CA is an IEPM ( Internet End-to-End Performance Measurement) technique that measures the mean of a waveform quickly and accurately. The CA prediction accuracy, however, differs from other IEPM techniques, because it is independent of the type of waveform/distribution. This independence arises from the fact that CA is based on the Central Limit Theorem. The E-MACSC approach provides several benefits as follows: (a) it maintains the prescribed hit ratio efficaciously, (b) it lessens cache size oscillation, and (c) it uses a fixed number of data samples and this makes its computation time more predictable. The E-MACSC is unique because of the following reasons: (a) it utilizes the relative popularity of the data objects as the sole control parameter and (b) it tunes the cache size adaptively by direct data measurement with the CA support. The relative popularity profile of data objects is called popularity distribution (PD) in the E-MACSC context. Any change in the PD's standard deviation indicates a shift of user preference for particular data objects. Monitoring and leveraging this change is the basis for E-MACSC to find a meaningful popularity ratio for deciding how the cache size should be tuned in a dynamic manner.</abstract><cop>Amsterdam</cop><cop>Tokyo</cop><cop>New York, NY</cop><pub>Elsevier B.V</pub><doi>10.1016/j.comcom.2005.06.022</doi><tpages>16</tpages></addata></record>
fulltext fulltext
identifier ISSN: 0140-3664
ispartof Computer communications, 2006-05, Vol.29 (8), p.1094-1109
issn 0140-3664
1873-703X
language eng
recordid cdi_proquest_miscellaneous_57652317
source Elsevier ScienceDirect Journals
subjects Applied sciences
Caching
Computer science
control theory
systems
Computer systems and distributed systems. User interface
Dynamic cache size tuning
E-MACSC
Exact sciences and technology
IEPM
Information systems. Data bases
Internet
M 3RT
MACSC
Memory organisation. Data processing
Point estimate
Popularity ratio
Software
Zipf-like behavior
title E-MACSC: A novel dynamic cache tuning technique to reduce information retrieval roundtrip time over the Internet
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-21T11%3A54%3A32IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=E-MACSC:%20A%20novel%20dynamic%20cache%20tuning%20technique%20to%20reduce%20information%20retrieval%20roundtrip%20time%20over%20the%20Internet&rft.jtitle=Computer%20communications&rft.au=Wu,%20Richard%20S.L.&rft.date=2006-05-15&rft.volume=29&rft.issue=8&rft.spage=1094&rft.epage=1109&rft.pages=1094-1109&rft.issn=0140-3664&rft.eissn=1873-703X&rft_id=info:doi/10.1016/j.comcom.2005.06.022&rft_dat=%3Cproquest_cross%3E28060631%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=28060631&rft_id=info:pmid/&rft_els_id=S014036640500246X&rfr_iscdi=true