Skip to Main Content
P2P based file sharing systems have become an extremely popular and they are highly scalable, self-configurable and fault tolerant. Some researches exploit them for the Web caching systems to solve the scalability issue. However they treat the Web objects as homogeneous objects and there is no concern about the various Web characteristics. This paper suggests an efficient Web caching system which manages the objects by different policies to exploit the characteristics of Web objects. Basically, we apply the different caching policies to the objects according to their size. Small-sized objects are stored by themselves but large-sized objects are stored by division into many small blocks which are distributed in the clients and the object header block is stored rather than the large object itself. Moreover we give large sized objects higher priority than small sized objects and maximize the effect of hit for a large-sized object which increase the byte hit rate. We examine the performance of the efficient policies via a trace driven simulation and demonstrate effective enhancement of the Web cache performance.