Cooperative caching by clients constructing a peer-to-peer network for push-based broadcast

In this paper, we propose new cooperative caching strategies by multiple clients in a push-based broadcast system, which replaces cached items based on benefits of the waiting time. A key idea is that the clients construct a logical peer-to-peer network and each of them determines the replacement of its own cache by taking into account access probabilities to data items from neighboring clients and the broadcast periods of data items or the times remaining until these items are broadcasted next. We confirm that the proposed strategies reduce the average response time by simulation experiments.