File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Optimal methods for coordinated enroute Web caching for tree networks

TitleOptimal methods for coordinated enroute Web caching for tree networks
Authors
KeywordsAutonomous system (AS)
Dynamic programming
Object placement (replacement)
Performance evaluation
Tree network
Web caching
Issue Date2005
PublisherAssociation for Computing Machinery, Inc.
Citation
Acm Transactions On Internet Technology, 2005, v. 5 n. 3, p. 480-507 How to Cite?
AbstractWeb 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 Identifierhttp://hdl.handle.net/10722/88926
ISSN
2015 Impact Factor: 0.705
2015 SCImago Journal Rankings: 0.565
References

 

DC FieldValueLanguage
dc.contributor.authorKeqiu, LIen_HK
dc.contributor.authorShen, Hen_HK
dc.contributor.authorChin, FYLen_HK
dc.contributor.authorZheng, SQen_HK
dc.date.accessioned2010-09-06T09:50:13Z-
dc.date.available2010-09-06T09:50:13Z-
dc.date.issued2005en_HK
dc.identifier.citationAcm Transactions On Internet Technology, 2005, v. 5 n. 3, p. 480-507en_HK
dc.identifier.issn1533-5399en_HK
dc.identifier.urihttp://hdl.handle.net/10722/88926-
dc.description.abstractWeb 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.languageengen_HK
dc.publisherAssociation for Computing Machinery, Inc.en_HK
dc.relation.ispartofACM Transactions on Internet Technologyen_HK
dc.rightsACM Transactions on Internet Technology. Copyright © Association for Computing Machinery, Inc.en_HK
dc.subjectAutonomous system (AS)en_HK
dc.subjectDynamic programmingen_HK
dc.subjectObject placement (replacement)en_HK
dc.subjectPerformance evaluationen_HK
dc.subjectTree networken_HK
dc.subjectWeb cachingen_HK
dc.titleOptimal methods for coordinated enroute Web caching for tree networksen_HK
dc.typeArticleen_HK
dc.identifier.openurlhttp://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+Networksen_HK
dc.identifier.emailChin, FYL:chin@cs.hku.hken_HK
dc.identifier.authorityChin, FYL=rp00105en_HK
dc.description.naturelink_to_subscribed_fulltext-
dc.identifier.doi10.1145/1084772.1084774en_HK
dc.identifier.scopuseid_2-s2.0-27144472748en_HK
dc.identifier.hkuros117573en_HK
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-27144472748&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.volume5en_HK
dc.identifier.issue3en_HK
dc.identifier.spage480en_HK
dc.identifier.epage507en_HK
dc.publisher.placeUnited Statesen_HK
dc.identifier.scopusauthoridKeqiu, LI=25649609600en_HK
dc.identifier.scopusauthoridShen, H=7404522601en_HK
dc.identifier.scopusauthoridChin, FYL=7005101915en_HK
dc.identifier.scopusauthoridZheng, SQ=7403146216en_HK

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats