Optimal dynamic replica placement in content delivery networks

Content delivery networks (CDN) design entails the placement of server replicas to bring the content close to the users, together with an efficient and content aware request routing. In this paper we address the problem of dynamic replica placement to account for users demand variability while optim...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Bartolini, N., Presti, F.L., Petrioli, C.
Format: Tagungsbericht
Sprache:eng
Schlagworte:
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 130
container_issue
container_start_page 125
container_title
container_volume
creator Bartolini, N.
Presti, F.L.
Petrioli, C.
description Content delivery networks (CDN) design entails the placement of server replicas to bring the content close to the users, together with an efficient and content aware request routing. In this paper we address the problem of dynamic replica placement to account for users demand variability while optimizing the costs paid by a CDN provider and the overall performance of the distributed replica servers architecture. We formulate the dynamic replica placement problem as a semi Markov decision process accounting for the traffic conditions, the users level of satisfaction, as well as the costs paid to install, maintain or remove a replica from a site. The proposed model applies to general network topologies and considers realistic constraints on network and servers capacity. The optimal strategy derived by means of the decision model provides the ground for designing a centralized heuristic and is used as a benchmark for the heuristic evaluation. Simulation results show that the proposed heuristic has a behavior close to that of the optimal strategy and achieves very good performance in terms of low average distance from a user to the serving replica, low average number of replicas and high probability of being able to serve a request.
doi_str_mv 10.1109/ICON.2003.1266178
format Conference Proceeding
fullrecord <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_1266178</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>1266178</ieee_id><sourcerecordid>1266178</sourcerecordid><originalsourceid>FETCH-LOGICAL-i218t-3721f057367ccf9e3cda76a37ffa0a1b38d8b34a64832481906c610b375d06793</originalsourceid><addsrcrecordid>eNotj81KxDAUhYM_4DjOA4ibvEDrvbltbrIRpPgzMNiNroc0TSHadkpblL69Iw4cON_q8B0hbhFSRLD326J8SxUApai0RjZnYqWIVJKzNediY9nAMcRsjLoQK8wJE6VQX4nrafoEUKA4W4mHcphj51pZL73ropdjGNronRxa50MX-lnGXvpDP_9hHdr4HcZF9mH-OYxf0424bFw7hc2p1-Lj-em9eE125cu2eNwlUaGZE2KFDeRMmr1vbCBfO9aOuGkcOKzI1KaizOnMkMoMWtBeI1TEeQ2aLa3F3f9uDCHsh_GoPC7703X6BXUmSnI</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Optimal dynamic replica placement in content delivery networks</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Bartolini, N. ; Presti, F.L. ; Petrioli, C.</creator><creatorcontrib>Bartolini, N. ; Presti, F.L. ; Petrioli, C.</creatorcontrib><description>Content delivery networks (CDN) design entails the placement of server replicas to bring the content close to the users, together with an efficient and content aware request routing. In this paper we address the problem of dynamic replica placement to account for users demand variability while optimizing the costs paid by a CDN provider and the overall performance of the distributed replica servers architecture. We formulate the dynamic replica placement problem as a semi Markov decision process accounting for the traffic conditions, the users level of satisfaction, as well as the costs paid to install, maintain or remove a replica from a site. The proposed model applies to general network topologies and considers realistic constraints on network and servers capacity. The optimal strategy derived by means of the decision model provides the ground for designing a centralized heuristic and is used as a benchmark for the heuristic evaluation. Simulation results show that the proposed heuristic has a behavior close to that of the optimal strategy and achieves very good performance in terms of low average distance from a user to the serving replica, low average number of replicas and high probability of being able to serve a request.</description><identifier>ISSN: 1531-2216</identifier><identifier>ISBN: 9780780377882</identifier><identifier>ISBN: 0780377885</identifier><identifier>EISSN: 2332-5798</identifier><identifier>DOI: 10.1109/ICON.2003.1266178</identifier><language>eng</language><publisher>IEEE</publisher><subject>Cost function ; Delay ; Intelligent networks ; IP networks ; Network servers ; Network topology ; Remuneration ; Telecommunication traffic ; Traffic control ; Web server</subject><ispartof>The 11th IEEE International Conference on Networks, 2003. ICON2003, 2003, p.125-130</ispartof><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/1266178$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,780,784,789,790,2058,4050,4051,27925,54920</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/1266178$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Bartolini, N.</creatorcontrib><creatorcontrib>Presti, F.L.</creatorcontrib><creatorcontrib>Petrioli, C.</creatorcontrib><title>Optimal dynamic replica placement in content delivery networks</title><title>The 11th IEEE International Conference on Networks, 2003. ICON2003</title><addtitle>ICON</addtitle><description>Content delivery networks (CDN) design entails the placement of server replicas to bring the content close to the users, together with an efficient and content aware request routing. In this paper we address the problem of dynamic replica placement to account for users demand variability while optimizing the costs paid by a CDN provider and the overall performance of the distributed replica servers architecture. We formulate the dynamic replica placement problem as a semi Markov decision process accounting for the traffic conditions, the users level of satisfaction, as well as the costs paid to install, maintain or remove a replica from a site. The proposed model applies to general network topologies and considers realistic constraints on network and servers capacity. The optimal strategy derived by means of the decision model provides the ground for designing a centralized heuristic and is used as a benchmark for the heuristic evaluation. Simulation results show that the proposed heuristic has a behavior close to that of the optimal strategy and achieves very good performance in terms of low average distance from a user to the serving replica, low average number of replicas and high probability of being able to serve a request.</description><subject>Cost function</subject><subject>Delay</subject><subject>Intelligent networks</subject><subject>IP networks</subject><subject>Network servers</subject><subject>Network topology</subject><subject>Remuneration</subject><subject>Telecommunication traffic</subject><subject>Traffic control</subject><subject>Web server</subject><issn>1531-2216</issn><issn>2332-5798</issn><isbn>9780780377882</isbn><isbn>0780377885</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2003</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNotj81KxDAUhYM_4DjOA4ibvEDrvbltbrIRpPgzMNiNroc0TSHadkpblL69Iw4cON_q8B0hbhFSRLD326J8SxUApai0RjZnYqWIVJKzNediY9nAMcRsjLoQK8wJE6VQX4nrafoEUKA4W4mHcphj51pZL73ropdjGNronRxa50MX-lnGXvpDP_9hHdr4HcZF9mH-OYxf0424bFw7hc2p1-Lj-em9eE125cu2eNwlUaGZE2KFDeRMmr1vbCBfO9aOuGkcOKzI1KaizOnMkMoMWtBeI1TEeQ2aLa3F3f9uDCHsh_GoPC7703X6BXUmSnI</recordid><startdate>2003</startdate><enddate>2003</enddate><creator>Bartolini, N.</creator><creator>Presti, F.L.</creator><creator>Petrioli, C.</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>2003</creationdate><title>Optimal dynamic replica placement in content delivery networks</title><author>Bartolini, N. ; Presti, F.L. ; Petrioli, C.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i218t-3721f057367ccf9e3cda76a37ffa0a1b38d8b34a64832481906c610b375d06793</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2003</creationdate><topic>Cost function</topic><topic>Delay</topic><topic>Intelligent networks</topic><topic>IP networks</topic><topic>Network servers</topic><topic>Network topology</topic><topic>Remuneration</topic><topic>Telecommunication traffic</topic><topic>Traffic control</topic><topic>Web server</topic><toplevel>online_resources</toplevel><creatorcontrib>Bartolini, N.</creatorcontrib><creatorcontrib>Presti, F.L.</creatorcontrib><creatorcontrib>Petrioli, C.</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 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>Bartolini, N.</au><au>Presti, F.L.</au><au>Petrioli, C.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Optimal dynamic replica placement in content delivery networks</atitle><btitle>The 11th IEEE International Conference on Networks, 2003. ICON2003</btitle><stitle>ICON</stitle><date>2003</date><risdate>2003</risdate><spage>125</spage><epage>130</epage><pages>125-130</pages><issn>1531-2216</issn><eissn>2332-5798</eissn><isbn>9780780377882</isbn><isbn>0780377885</isbn><abstract>Content delivery networks (CDN) design entails the placement of server replicas to bring the content close to the users, together with an efficient and content aware request routing. In this paper we address the problem of dynamic replica placement to account for users demand variability while optimizing the costs paid by a CDN provider and the overall performance of the distributed replica servers architecture. We formulate the dynamic replica placement problem as a semi Markov decision process accounting for the traffic conditions, the users level of satisfaction, as well as the costs paid to install, maintain or remove a replica from a site. The proposed model applies to general network topologies and considers realistic constraints on network and servers capacity. The optimal strategy derived by means of the decision model provides the ground for designing a centralized heuristic and is used as a benchmark for the heuristic evaluation. Simulation results show that the proposed heuristic has a behavior close to that of the optimal strategy and achieves very good performance in terms of low average distance from a user to the serving replica, low average number of replicas and high probability of being able to serve a request.</abstract><pub>IEEE</pub><doi>10.1109/ICON.2003.1266178</doi><tpages>6</tpages><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier ISSN: 1531-2216
ispartof The 11th IEEE International Conference on Networks, 2003. ICON2003, 2003, p.125-130
issn 1531-2216
2332-5798
language eng
recordid cdi_ieee_primary_1266178
source IEEE Electronic Library (IEL) Conference Proceedings
subjects Cost function
Delay
Intelligent networks
IP networks
Network servers
Network topology
Remuneration
Telecommunication traffic
Traffic control
Web server
title Optimal dynamic replica placement in content delivery networks
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-22T05%3A22%3A01IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Optimal%20dynamic%20replica%20placement%20in%20content%20delivery%20networks&rft.btitle=The%2011th%20IEEE%20International%20Conference%20on%20Networks,%202003.%20ICON2003&rft.au=Bartolini,%20N.&rft.date=2003&rft.spage=125&rft.epage=130&rft.pages=125-130&rft.issn=1531-2216&rft.eissn=2332-5798&rft.isbn=9780780377882&rft.isbn_list=0780377885&rft_id=info:doi/10.1109/ICON.2003.1266178&rft_dat=%3Cieee_6IE%3E1266178%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=1266178&rfr_iscdi=true