File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1145/1084772.1084774
- Scopus: eid_2-s2.0-27144472748
- Find via
Supplementary
-
Citations:
- Scopus: 0
- Appears in Collections:
Article: Optimal methods for coordinated enroute Web caching for tree networks
Title | Optimal methods for coordinated enroute Web caching for tree networks |
---|---|
Authors | |
Keywords | Autonomous system (AS) Dynamic programming Object placement (replacement) Performance evaluation Tree network Web caching |
Issue Date | 2005 |
Publisher | Association for Computing Machinery, Inc. |
Citation | Acm Transactions On Internet Technology, 2005, v. 5 n. 3, p. 480-507 How to Cite? |
Abstract | Web caching is an important technology for improving the scalability of Web services. One of the key problems in coordinated enroute Web caching is to compute the locations for storing copies of an object among the enroute caches so that some specified objectives are achieved. In this article, we address this problem for tree networks, and formulate it as a maximization problem. We consider this problem for both unconstrained and constrained cases. The constrained case includes constraints on the cost gain per node and on the number of object copies to be placed. We present dynamic programming-based solutions to this problem for different cases and theoretically show that the solutions are either optimal or convergent to optimal solutions. We derive efficient algorithms that produce these solutions. Based on our mathematical model, we also present a solution to coordinated enroute Web caching for autonomous systems as a natural extension of the solution for tree networks. We implement our algorithms and evaluate our model on different performance metrics through extensive simulation experiments. The implementation results show that our methods outperform the existing algorithms of either coordinated enroute Web caching for linear topology or object placement (replacement) at individual nodes only. © 2005 ACM. |
Persistent Identifier | http://hdl.handle.net/10722/88926 |
ISSN | 2021 Impact Factor: 3.989 2020 SCImago Journal Rankings: 0.667 |
References |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Keqiu, LI | en_HK |
dc.contributor.author | Shen, H | en_HK |
dc.contributor.author | Chin, FYL | en_HK |
dc.contributor.author | Zheng, SQ | en_HK |
dc.date.accessioned | 2010-09-06T09:50:13Z | - |
dc.date.available | 2010-09-06T09:50:13Z | - |
dc.date.issued | 2005 | en_HK |
dc.identifier.citation | Acm Transactions On Internet Technology, 2005, v. 5 n. 3, p. 480-507 | en_HK |
dc.identifier.issn | 1533-5399 | en_HK |
dc.identifier.uri | http://hdl.handle.net/10722/88926 | - |
dc.description.abstract | Web caching is an important technology for improving the scalability of Web services. One of the key problems in coordinated enroute Web caching is to compute the locations for storing copies of an object among the enroute caches so that some specified objectives are achieved. In this article, we address this problem for tree networks, and formulate it as a maximization problem. We consider this problem for both unconstrained and constrained cases. The constrained case includes constraints on the cost gain per node and on the number of object copies to be placed. We present dynamic programming-based solutions to this problem for different cases and theoretically show that the solutions are either optimal or convergent to optimal solutions. We derive efficient algorithms that produce these solutions. Based on our mathematical model, we also present a solution to coordinated enroute Web caching for autonomous systems as a natural extension of the solution for tree networks. We implement our algorithms and evaluate our model on different performance metrics through extensive simulation experiments. The implementation results show that our methods outperform the existing algorithms of either coordinated enroute Web caching for linear topology or object placement (replacement) at individual nodes only. © 2005 ACM. | en_HK |
dc.language | eng | en_HK |
dc.publisher | Association for Computing Machinery, Inc. | en_HK |
dc.relation.ispartof | ACM Transactions on Internet Technology | en_HK |
dc.rights | ACM Transactions on Internet Technology. Copyright © Association for Computing Machinery, Inc. | en_HK |
dc.subject | Autonomous system (AS) | en_HK |
dc.subject | Dynamic programming | en_HK |
dc.subject | Object placement (replacement) | en_HK |
dc.subject | Performance evaluation | en_HK |
dc.subject | Tree network | en_HK |
dc.subject | Web caching | en_HK |
dc.title | Optimal methods for coordinated enroute Web caching for tree networks | en_HK |
dc.type | Article | en_HK |
dc.identifier.openurl | http://library.hku.hk:4550/resserv?sid=HKU:IR&issn=0730-0301&volume=5&issue=3&spage=480&epage=507&date=2005&atitle=Optimal+Methods+for+Coordinated+Enroute+Web+Caching+for+Tree+Networks | en_HK |
dc.identifier.email | Chin, FYL:chin@cs.hku.hk | en_HK |
dc.identifier.authority | Chin, FYL=rp00105 | en_HK |
dc.description.nature | link_to_subscribed_fulltext | - |
dc.identifier.doi | 10.1145/1084772.1084774 | en_HK |
dc.identifier.scopus | eid_2-s2.0-27144472748 | en_HK |
dc.identifier.hkuros | 117573 | en_HK |
dc.relation.references | http://www.scopus.com/mlt/select.url?eid=2-s2.0-27144472748&selection=ref&src=s&origin=recordpage | en_HK |
dc.identifier.volume | 5 | en_HK |
dc.identifier.issue | 3 | en_HK |
dc.identifier.spage | 480 | en_HK |
dc.identifier.epage | 507 | en_HK |
dc.publisher.place | United States | en_HK |
dc.identifier.scopusauthorid | Keqiu, LI=25649609600 | en_HK |
dc.identifier.scopusauthorid | Shen, H=7404522601 | en_HK |
dc.identifier.scopusauthorid | Chin, FYL=7005101915 | en_HK |
dc.identifier.scopusauthorid | Zheng, SQ=7403146216 | en_HK |
dc.identifier.issnl | 1533-5399 | - |