In this paper, we propose a new structured P2P overlay network, named SW-Uinta, where employs a non-deterministic caching strategy that allows for polylogarithmic search time while having only a constant cache size. Compared with deterministic caching strategies proposed by previous P2P systems, the non-deterministic caching strategy can reduce communication overhead for maintaining the routing cache table. Cache entries in the peer can be updated by subsequent queries rather than only by

more »

... g stabilization periodically. A novel cache replacement scheme is used to improve lookup performance. We compare the performance of our system with that of other structured P2P networks such as Chord and Uinta. It shows that the SW-Uinta protocol can achieve improved object lookup performance and reduce maintenance cost compared with some other protocols.