File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Dynamic organization schemes for cooperative proxy caching

TitleDynamic organization schemes for cooperative proxy caching
Authors
KeywordsComputers
Electronic data processing
Issue Date2003
PublisherIEEE, Computer Society.
Citation
IEEE Symposium on Parallel and Distributed Processing Proceedings, Nice, France, 22-26 April 2003, p. 48-55 How to Cite?
AbstractIn a generic cooperative caching architecture, web proxies form a mesh network. When a proxy cannot satisfy a request, it forwards the request to the other nodes of the mesh. Since a local cache cannot fulfill the majority of the arriving requests (typical values of the local hit ratio are about 30-50%), the volume of queries diverted to neighboring nodes can substantially grow and may consume considerable amount of system resources. A proxy does not need to cooperate with every node of the mesh due to the following reasons: (i) the traffic characteristics may be highly diverse; (ii) the contents of some nodes may extensively overlap; (iii) the inter-node distance might be too large. Furthermore, organizing N proxies in a mesh topology introduces scalability problems, since the number of queries is of the order of N/sup 2/. Therefore, restricting the number of neighbors for each proxy to k < N - 1 will likely lead to a balanced trade-off between query overhead and hit ratio, provided cooperation is done among useful neighbors. For a number of reasons the selection of useful neighbors is not efficient. An obvious reason is that web access patterns change dynamically. Furthermore, availability of proxies is not always globally known. This paper proposes a set of algorithms that enable proxies to independently explore the network and choose the k most beneficial (according to local criteria) neighbors in a dynamic fashion. The simulation experiments illustrate that the proposed dynamic neighbor reconfiguration schemes significantly reduce the overhead incurred by the mesh topology while yielding higher hit ratios compared to the static approach.
Persistent Identifierhttp://hdl.handle.net/10722/46399
ISSN

 

DC FieldValueLanguage
dc.contributor.authorBakiras, Sen_HK
dc.contributor.authorLoukopoulos, Ten_HK
dc.contributor.authorAhmad, Ien_HK
dc.date.accessioned2007-10-30T06:49:02Z-
dc.date.available2007-10-30T06:49:02Z-
dc.date.issued2003en_HK
dc.identifier.citationIEEE Symposium on Parallel and Distributed Processing Proceedings, Nice, France, 22-26 April 2003, p. 48-55en_HK
dc.identifier.issn1063-6374en_HK
dc.identifier.urihttp://hdl.handle.net/10722/46399-
dc.description.abstractIn a generic cooperative caching architecture, web proxies form a mesh network. When a proxy cannot satisfy a request, it forwards the request to the other nodes of the mesh. Since a local cache cannot fulfill the majority of the arriving requests (typical values of the local hit ratio are about 30-50%), the volume of queries diverted to neighboring nodes can substantially grow and may consume considerable amount of system resources. A proxy does not need to cooperate with every node of the mesh due to the following reasons: (i) the traffic characteristics may be highly diverse; (ii) the contents of some nodes may extensively overlap; (iii) the inter-node distance might be too large. Furthermore, organizing N proxies in a mesh topology introduces scalability problems, since the number of queries is of the order of N/sup 2/. Therefore, restricting the number of neighbors for each proxy to k < N - 1 will likely lead to a balanced trade-off between query overhead and hit ratio, provided cooperation is done among useful neighbors. For a number of reasons the selection of useful neighbors is not efficient. An obvious reason is that web access patterns change dynamically. Furthermore, availability of proxies is not always globally known. This paper proposes a set of algorithms that enable proxies to independently explore the network and choose the k most beneficial (according to local criteria) neighbors in a dynamic fashion. The simulation experiments illustrate that the proposed dynamic neighbor reconfiguration schemes significantly reduce the overhead incurred by the mesh topology while yielding higher hit ratios compared to the static approach.en_HK
dc.format.extent381674 bytes-
dc.format.extent2600 bytes-
dc.format.mimetypeapplication/pdf-
dc.format.mimetypetext/plain-
dc.languageengen_HK
dc.publisherIEEE, Computer Society.en_HK
dc.rightsCreative Commons: Attribution 3.0 Hong Kong License-
dc.rights©2003 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.en_HK
dc.subjectComputersen_HK
dc.subjectElectronic data processingen_HK
dc.titleDynamic organization schemes for cooperative proxy cachingen_HK
dc.typeConference_Paperen_HK
dc.identifier.openurlhttp://library.hku.hk:4550/resserv?sid=HKU:IR&issn=1063-6374&volume=&spage=48&epage=55&date=2003&atitle=Dynamic+organization+schemes+for+cooperative+proxy+cachingen_HK
dc.description.naturepublished_or_final_versionen_HK
dc.identifier.doi10.1109/IPDPS.2003.1213136en_HK
dc.identifier.hkuros82614-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats