Rights Creative Commons: Attribution 3.0 Hong Kong License Dynamic Organization Schemes for Cooperative Proxy Caching

In 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 lo-cal cache cannot fulfill the majority of the arriving requests (typi-cal 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 di-verse; (ii) the contents of some nodes may extensively overlap; (iii) the inter-node distance might be too large. Furthermore, organiz-ing proxies in a mesh topology introduces scalability problems, since the number of queries is of the order of . Therefore, re-stricting the number of neighbors for each proxy t