Storage Policies for a Two-Cache System

We study storage policies for a two-cache system where each request for a file arrives at one of the two caches. A request can be served by either one of the two caches or a central server. Serving a request using the cache at which it is received is the most preferred mode of service and is assumed...

Full description

Saved in:
Bibliographic Details
Main Authors: Narayana, V.S. Ch Lakshmi, Reddy, Kota Srinivas, Moharir, Sharayu, Karamchandani, Nikhil
Format: Conference Proceeding
Language:English
Subjects:
Analytical models
Bandwidth
Cache storage
Internet
Optimized production technology
Performance evaluation
Servers
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by
cites
container_end_page 427
container_issue
container_start_page 424
container_title
container_volume
creator Narayana, V.S. Ch Lakshmi
Reddy, Kota Srinivas
Moharir, Sharayu
Karamchandani, Nikhil
description We study storage policies for a two-cache system where each request for a file arrives at one of the two caches. A request can be served by either one of the two caches or a central server. Serving a request using the cache at which it is received is the most preferred mode of service and is assumed to be free. The other cache can serve the request at a low, but non-zero cost, and the central server can serve it at a high cost. The aim is to design storage policies which minimize the cost of serving incoming requests. Via analysis and simulations, we compare the performance of the optimal caching policy with the locally optimal storage policy which makes decisions only based on the request arrival process at that particular cache.
doi_str_mv 10.1109/COMSNETS.2019.8711318
format conference_proceeding
fullrecord <record><control><sourceid>ieee_CHZPO</sourceid><recordid>TN_cdi_ieee_primary_8711318</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>8711318</ieee_id><sourcerecordid>8711318</sourcerecordid><originalsourceid>FETCH-LOGICAL-i175t-4d2f9cb1d80f7c2a86724ea8602e90dc7b473db34e6f83c062b2c6e8c0d329063</originalsourceid><addsrcrecordid>eNotj8FKw0AURUdBsNR8gQjZuUp8700mM7OUUK1Q20LiukwmLzrSEskEpH9vwK7O5nK4R4gHhBwR7FO1e6-3q6bOCdDmRiNKNFcisdqgkqbUFsheiwWhUhkpsLciifEbAOadVZIW4rGehtF9crofjsEHjmk_jKlLm98hq5z_4rQ-x4lPd-Kmd8fIyYVL8fGyaqp1ttm9vlXPmyygVlNWdNRb32JnoNee3PyBCp4BxBY6r9tCy66VBZe9kR5KasmXbDx0kiyUcinu_72BmQ8_Yzi58Xy4pMk_QoZBWw</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Storage Policies for a Two-Cache System</title><source>IEEE Xplore All Conference Series</source><creator>Narayana, V.S. Ch Lakshmi ; Reddy, Kota Srinivas ; Moharir, Sharayu ; Karamchandani, Nikhil</creator><creatorcontrib>Narayana, V.S. Ch Lakshmi ; Reddy, Kota Srinivas ; Moharir, Sharayu ; Karamchandani, Nikhil</creatorcontrib><description>We study storage policies for a two-cache system where each request for a file arrives at one of the two caches. A request can be served by either one of the two caches or a central server. Serving a request using the cache at which it is received is the most preferred mode of service and is assumed to be free. The other cache can serve the request at a low, but non-zero cost, and the central server can serve it at a high cost. The aim is to design storage policies which minimize the cost of serving incoming requests. Via analysis and simulations, we compare the performance of the optimal caching policy with the locally optimal storage policy which makes decisions only based on the request arrival process at that particular cache.</description><identifier>EISSN: 2155-2509</identifier><identifier>EISBN: 9781538679029</identifier><identifier>EISBN: 1538679027</identifier><identifier>DOI: 10.1109/COMSNETS.2019.8711318</identifier><language>eng</language><publisher>IEEE</publisher><subject>Analytical models ; Bandwidth ; Cache storage ; Internet ; Optimized production technology ; Performance evaluation ; Servers</subject><ispartof>2019 11th International Conference on Communication Systems &amp; Networks (COMSNETS), 2019, p.424-427</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/8711318$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,780,784,789,790,27925,54555,54932</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/8711318$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Narayana, V.S. Ch Lakshmi</creatorcontrib><creatorcontrib>Reddy, Kota Srinivas</creatorcontrib><creatorcontrib>Moharir, Sharayu</creatorcontrib><creatorcontrib>Karamchandani, Nikhil</creatorcontrib><title>Storage Policies for a Two-Cache System</title><title>2019 11th International Conference on Communication Systems &amp; Networks (COMSNETS)</title><addtitle>COMSNETS</addtitle><description>We study storage policies for a two-cache system where each request for a file arrives at one of the two caches. A request can be served by either one of the two caches or a central server. Serving a request using the cache at which it is received is the most preferred mode of service and is assumed to be free. The other cache can serve the request at a low, but non-zero cost, and the central server can serve it at a high cost. The aim is to design storage policies which minimize the cost of serving incoming requests. Via analysis and simulations, we compare the performance of the optimal caching policy with the locally optimal storage policy which makes decisions only based on the request arrival process at that particular cache.</description><subject>Analytical models</subject><subject>Bandwidth</subject><subject>Cache storage</subject><subject>Internet</subject><subject>Optimized production technology</subject><subject>Performance evaluation</subject><subject>Servers</subject><issn>2155-2509</issn><isbn>9781538679029</isbn><isbn>1538679027</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2019</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><recordid>eNotj8FKw0AURUdBsNR8gQjZuUp8700mM7OUUK1Q20LiukwmLzrSEskEpH9vwK7O5nK4R4gHhBwR7FO1e6-3q6bOCdDmRiNKNFcisdqgkqbUFsheiwWhUhkpsLciifEbAOadVZIW4rGehtF9crofjsEHjmk_jKlLm98hq5z_4rQ-x4lPd-Kmd8fIyYVL8fGyaqp1ttm9vlXPmyygVlNWdNRb32JnoNee3PyBCp4BxBY6r9tCy66VBZe9kR5KasmXbDx0kiyUcinu_72BmQ8_Yzi58Xy4pMk_QoZBWw</recordid><startdate>201901</startdate><enddate>201901</enddate><creator>Narayana, V.S. Ch Lakshmi</creator><creator>Reddy, Kota Srinivas</creator><creator>Moharir, Sharayu</creator><creator>Karamchandani, Nikhil</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>201901</creationdate><title>Storage Policies for a Two-Cache System</title><author>Narayana, V.S. Ch Lakshmi ; Reddy, Kota Srinivas ; Moharir, Sharayu ; Karamchandani, Nikhil</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i175t-4d2f9cb1d80f7c2a86724ea8602e90dc7b473db34e6f83c062b2c6e8c0d329063</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2019</creationdate><topic>Analytical models</topic><topic>Bandwidth</topic><topic>Cache storage</topic><topic>Internet</topic><topic>Optimized production technology</topic><topic>Performance evaluation</topic><topic>Servers</topic><toplevel>online_resources</toplevel><creatorcontrib>Narayana, V.S. Ch Lakshmi</creatorcontrib><creatorcontrib>Reddy, Kota Srinivas</creatorcontrib><creatorcontrib>Moharir, Sharayu</creatorcontrib><creatorcontrib>Karamchandani, Nikhil</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE/IET Electronic Library (IEL)</collection><collection>IEEE Proceedings Order Plans (POP All) 1998-Present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Narayana, V.S. Ch Lakshmi</au><au>Reddy, Kota Srinivas</au><au>Moharir, Sharayu</au><au>Karamchandani, Nikhil</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Storage Policies for a Two-Cache System</atitle><btitle>2019 11th International Conference on Communication Systems &amp; Networks (COMSNETS)</btitle><stitle>COMSNETS</stitle><date>2019-01</date><risdate>2019</risdate><spage>424</spage><epage>427</epage><pages>424-427</pages><eissn>2155-2509</eissn><eisbn>9781538679029</eisbn><eisbn>1538679027</eisbn><abstract>We study storage policies for a two-cache system where each request for a file arrives at one of the two caches. A request can be served by either one of the two caches or a central server. Serving a request using the cache at which it is received is the most preferred mode of service and is assumed to be free. The other cache can serve the request at a low, but non-zero cost, and the central server can serve it at a high cost. The aim is to design storage policies which minimize the cost of serving incoming requests. Via analysis and simulations, we compare the performance of the optimal caching policy with the locally optimal storage policy which makes decisions only based on the request arrival process at that particular cache.</abstract><pub>IEEE</pub><doi>10.1109/COMSNETS.2019.8711318</doi><tpages>4</tpages></addata></record>
fulltext fulltext_linktorsrc
identifier EISSN: 2155-2509
ispartof 2019 11th International Conference on Communication Systems & Networks (COMSNETS), 2019, p.424-427
issn 2155-2509
language eng
recordid cdi_ieee_primary_8711318
source IEEE Xplore All Conference Series
subjects Analytical models
Bandwidth
Cache storage
Internet
Optimized production technology
Performance evaluation
Servers
title Storage Policies for a Two-Cache System
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-04T05%3A53%3A06IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_CHZPO&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Storage%20Policies%20for%20a%20Two-Cache%20System&rft.btitle=2019%2011th%20International%20Conference%20on%20Communication%20Systems%20&%20Networks%20(COMSNETS)&rft.au=Narayana,%20V.S.%20Ch%20Lakshmi&rft.date=2019-01&rft.spage=424&rft.epage=427&rft.pages=424-427&rft.eissn=2155-2509&rft_id=info:doi/10.1109/COMSNETS.2019.8711318&rft.eisbn=9781538679029&rft.eisbn_list=1538679027&rft_dat=%3Cieee_CHZPO%3E8711318%3C/ieee_CHZPO%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-i175t-4d2f9cb1d80f7c2a86724ea8602e90dc7b473db34e6f83c062b2c6e8c0d329063%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=8711318&rfr_iscdi=true