Loading…
A novel dynamic cache size adjustment approach for better data retrieval performance over the internet
A novel model for adaptive cache size control (MACSC) at runtime is proposed in this paper. It automatically maintains the prescribed hit ratio to guarantee the minimum expected caching performance. With this capability the system delivers better client/server communication and service response. The...
Saved in:
Published in: | Computer communications 2003-09, Vol.26 (14), p.1709-1720 |
---|---|
Main Authors: | , , |
Format: | Article |
Language: | English |
Subjects: | |
Citations: | Items that this one cites Items that cite this one |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
cited_by | cdi_FETCH-LOGICAL-c369t-e9c83915328f89d1a2211c60c88ced0cbd6170e47ffe8034a6391096be1ac3963 |
---|---|
cites | cdi_FETCH-LOGICAL-c369t-e9c83915328f89d1a2211c60c88ced0cbd6170e47ffe8034a6391096be1ac3963 |
container_end_page | 1720 |
container_issue | 14 |
container_start_page | 1709 |
container_title | Computer communications |
container_volume | 26 |
creator | Wong, Allan K.Y Ip, May T.W Wu, Richard S.L |
description | A novel model for adaptive cache size control (MACSC) at runtime is proposed in this paper. It automatically maintains the prescribed hit ratio to guarantee the minimum expected caching performance. With this capability the system delivers better client/server communication and service response. The fringe benefit is better availability of the backbone bandwidth because caching reduces the traffic for long-haul data transfer over the Internet. The MACSC adjusts the cache size quickly, optimally and without the deleterious effect of remedying a past event spuriously regarded as a present one. The MACSC is a form of adaptive cache control within the area of cache adaptivity. It is unique and differs from other previous methods because it leverages the relative data object popularity as the only parameter in the control process, in the form of the popularity ratio. For the present MACSC research scope, the relative data object popularity profile, namely, the popularity distribution, is assumed to be bell-shaped and unimodel, but allows for a gentle mode skew. The MACSC computes the cache size adjustment from the sampled life data with the help of the point-estimate approach represented by the
N-equation. The preliminary results from the verification and validation experiments unanimously confirm that the MACSC is indeed effective for automatic adaptive cache size control and economizing Internet backbone bandwidth. |
doi_str_mv | 10.1016/S0140-3664(02)00277-3 |
format | article |
fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_57591991</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>S0140366402002773</els_id><sourcerecordid>57591991</sourcerecordid><originalsourceid>FETCH-LOGICAL-c369t-e9c83915328f89d1a2211c60c88ced0cbd6170e47ffe8034a6391096be1ac3963</originalsourceid><addsrcrecordid>eNqFkE1LAzEQhoMoWKs_QchJ9LA62ewmm5OU4hcUPKjgLaTZWUzZj5qkhfrrTVvx2tMc5nlfZh5CLhncMmDi7g1YARkXoriG_AYglzLjR2TEKskzCfzzmIz-kVNyFsICAAop-Yg0E9oPa2xpvelN5yy1xn4hDe4HqakXqxA77CM1y6Uf0oY2g6dzjBE9rU001GP0DtempUv0admZ3iJNjZ7G1OP6RPYYz8lJY9qAF39zTD4eH96nz9ns9ellOplllgsVM1S24oqVPK-aStXM5DljVoCtKos12HktmAQsZNNgBbwwItGgxByZsVwJPiZX-9507vcKQ9SdCxbb1vQ4rIIuZamYUuwgmEvFBFQqgeUetH4IwWOjl951xm80A73Vr3f69dathlzv9Guecvf7HKZ31w69DtZhklM7jzbqenAHGn4BbQGNdQ</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>27916089</pqid></control><display><type>article</type><title>A novel dynamic cache size adjustment approach for better data retrieval performance over the internet</title><source>Library & Information Science Abstracts (LISA)</source><source>ScienceDirect Freedom Collection</source><creator>Wong, Allan K.Y ; Ip, May T.W ; Wu, Richard S.L</creator><creatorcontrib>Wong, Allan K.Y ; Ip, May T.W ; Wu, Richard S.L</creatorcontrib><description>A novel model for adaptive cache size control (MACSC) at runtime is proposed in this paper. It automatically maintains the prescribed hit ratio to guarantee the minimum expected caching performance. With this capability the system delivers better client/server communication and service response. The fringe benefit is better availability of the backbone bandwidth because caching reduces the traffic for long-haul data transfer over the Internet. The MACSC adjusts the cache size quickly, optimally and without the deleterious effect of remedying a past event spuriously regarded as a present one. The MACSC is a form of adaptive cache control within the area of cache adaptivity. It is unique and differs from other previous methods because it leverages the relative data object popularity as the only parameter in the control process, in the form of the popularity ratio. For the present MACSC research scope, the relative data object popularity profile, namely, the popularity distribution, is assumed to be bell-shaped and unimodel, but allows for a gentle mode skew. The MACSC computes the cache size adjustment from the sampled life data with the help of the point-estimate approach represented by the
N-equation. The preliminary results from the verification and validation experiments unanimously confirm that the MACSC is indeed effective for automatic adaptive cache size control and economizing Internet backbone bandwidth.</description><identifier>ISSN: 0140-3664</identifier><identifier>EISSN: 1873-703X</identifier><identifier>DOI: 10.1016/S0140-3664(02)00277-3</identifier><language>eng</language><publisher>Elsevier B.V</publisher><subject>Adaptive ; Cache size adjustment ; Caching ; Internet ; Optimal ; Popularity distribution ; Popularity ratio ; Relative data object popularity</subject><ispartof>Computer communications, 2003-09, Vol.26 (14), p.1709-1720</ispartof><rights>2002 Elsevier B.V.</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c369t-e9c83915328f89d1a2211c60c88ced0cbd6170e47ffe8034a6391096be1ac3963</citedby><cites>FETCH-LOGICAL-c369t-e9c83915328f89d1a2211c60c88ced0cbd6170e47ffe8034a6391096be1ac3963</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,776,780,27900,27901,34112</link.rule.ids></links><search><creatorcontrib>Wong, Allan K.Y</creatorcontrib><creatorcontrib>Ip, May T.W</creatorcontrib><creatorcontrib>Wu, Richard S.L</creatorcontrib><title>A novel dynamic cache size adjustment approach for better data retrieval performance over the internet</title><title>Computer communications</title><description>A novel model for adaptive cache size control (MACSC) at runtime is proposed in this paper. It automatically maintains the prescribed hit ratio to guarantee the minimum expected caching performance. With this capability the system delivers better client/server communication and service response. The fringe benefit is better availability of the backbone bandwidth because caching reduces the traffic for long-haul data transfer over the Internet. The MACSC adjusts the cache size quickly, optimally and without the deleterious effect of remedying a past event spuriously regarded as a present one. The MACSC is a form of adaptive cache control within the area of cache adaptivity. It is unique and differs from other previous methods because it leverages the relative data object popularity as the only parameter in the control process, in the form of the popularity ratio. For the present MACSC research scope, the relative data object popularity profile, namely, the popularity distribution, is assumed to be bell-shaped and unimodel, but allows for a gentle mode skew. The MACSC computes the cache size adjustment from the sampled life data with the help of the point-estimate approach represented by the
N-equation. The preliminary results from the verification and validation experiments unanimously confirm that the MACSC is indeed effective for automatic adaptive cache size control and economizing Internet backbone bandwidth.</description><subject>Adaptive</subject><subject>Cache size adjustment</subject><subject>Caching</subject><subject>Internet</subject><subject>Optimal</subject><subject>Popularity distribution</subject><subject>Popularity ratio</subject><subject>Relative data object popularity</subject><issn>0140-3664</issn><issn>1873-703X</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2003</creationdate><recordtype>article</recordtype><sourceid>F2A</sourceid><recordid>eNqFkE1LAzEQhoMoWKs_QchJ9LA62ewmm5OU4hcUPKjgLaTZWUzZj5qkhfrrTVvx2tMc5nlfZh5CLhncMmDi7g1YARkXoriG_AYglzLjR2TEKskzCfzzmIz-kVNyFsICAAop-Yg0E9oPa2xpvelN5yy1xn4hDe4HqakXqxA77CM1y6Uf0oY2g6dzjBE9rU001GP0DtempUv0admZ3iJNjZ7G1OP6RPYYz8lJY9qAF39zTD4eH96nz9ns9ellOplllgsVM1S24oqVPK-aStXM5DljVoCtKos12HktmAQsZNNgBbwwItGgxByZsVwJPiZX-9507vcKQ9SdCxbb1vQ4rIIuZamYUuwgmEvFBFQqgeUetH4IwWOjl951xm80A73Vr3f69dathlzv9Guecvf7HKZ31w69DtZhklM7jzbqenAHGn4BbQGNdQ</recordid><startdate>20030901</startdate><enddate>20030901</enddate><creator>Wong, Allan K.Y</creator><creator>Ip, May T.W</creator><creator>Wu, Richard S.L</creator><general>Elsevier B.V</general><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>20030901</creationdate><title>A novel dynamic cache size adjustment approach for better data retrieval performance over the internet</title><author>Wong, Allan K.Y ; Ip, May T.W ; Wu, Richard S.L</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c369t-e9c83915328f89d1a2211c60c88ced0cbd6170e47ffe8034a6391096be1ac3963</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2003</creationdate><topic>Adaptive</topic><topic>Cache size adjustment</topic><topic>Caching</topic><topic>Internet</topic><topic>Optimal</topic><topic>Popularity distribution</topic><topic>Popularity ratio</topic><topic>Relative data object popularity</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Wong, Allan K.Y</creatorcontrib><creatorcontrib>Ip, May T.W</creatorcontrib><creatorcontrib>Wu, Richard S.L</creatorcontrib><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 & Information Sciences Abstracts (LISA)</collection><collection>Library & Information Science Abstracts (LISA)</collection><jtitle>Computer communications</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Wong, Allan K.Y</au><au>Ip, May T.W</au><au>Wu, Richard S.L</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A novel dynamic cache size adjustment approach for better data retrieval performance over the internet</atitle><jtitle>Computer communications</jtitle><date>2003-09-01</date><risdate>2003</risdate><volume>26</volume><issue>14</issue><spage>1709</spage><epage>1720</epage><pages>1709-1720</pages><issn>0140-3664</issn><eissn>1873-703X</eissn><abstract>A novel model for adaptive cache size control (MACSC) at runtime is proposed in this paper. It automatically maintains the prescribed hit ratio to guarantee the minimum expected caching performance. With this capability the system delivers better client/server communication and service response. The fringe benefit is better availability of the backbone bandwidth because caching reduces the traffic for long-haul data transfer over the Internet. The MACSC adjusts the cache size quickly, optimally and without the deleterious effect of remedying a past event spuriously regarded as a present one. The MACSC is a form of adaptive cache control within the area of cache adaptivity. It is unique and differs from other previous methods because it leverages the relative data object popularity as the only parameter in the control process, in the form of the popularity ratio. For the present MACSC research scope, the relative data object popularity profile, namely, the popularity distribution, is assumed to be bell-shaped and unimodel, but allows for a gentle mode skew. The MACSC computes the cache size adjustment from the sampled life data with the help of the point-estimate approach represented by the
N-equation. The preliminary results from the verification and validation experiments unanimously confirm that the MACSC is indeed effective for automatic adaptive cache size control and economizing Internet backbone bandwidth.</abstract><pub>Elsevier B.V</pub><doi>10.1016/S0140-3664(02)00277-3</doi><tpages>12</tpages></addata></record> |
fulltext | fulltext |
identifier | ISSN: 0140-3664 |
ispartof | Computer communications, 2003-09, Vol.26 (14), p.1709-1720 |
issn | 0140-3664 1873-703X |
language | eng |
recordid | cdi_proquest_miscellaneous_57591991 |
source | Library & Information Science Abstracts (LISA); ScienceDirect Freedom Collection |
subjects | Adaptive Cache size adjustment Caching Internet Optimal Popularity distribution Popularity ratio Relative data object popularity |
title | A novel dynamic cache size adjustment approach for better data retrieval performance over the internet |
url | http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-24T23%3A23%3A41IST&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=A%20novel%20dynamic%20cache%20size%20adjustment%20approach%20for%20better%20data%20retrieval%20performance%20over%20the%20internet&rft.jtitle=Computer%20communications&rft.au=Wong,%20Allan%20K.Y&rft.date=2003-09-01&rft.volume=26&rft.issue=14&rft.spage=1709&rft.epage=1720&rft.pages=1709-1720&rft.issn=0140-3664&rft.eissn=1873-703X&rft_id=info:doi/10.1016/S0140-3664(02)00277-3&rft_dat=%3Cproquest_cross%3E57591991%3C/proquest_cross%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c369t-e9c83915328f89d1a2211c60c88ced0cbd6170e47ffe8034a6391096be1ac3963%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=27916089&rft_id=info:pmid/&rfr_iscdi=true |