Targeted Search: Reducing the Time and Cost for Searching for Objects in Multiple-Server Networks

Published

April 1, 2005

Author(s)

G Perara, K Christensen, Allen L. Roginsky

Abstract

In many applications - including P2P file sharing, content distribution networks, and grid computing - a single object will be searched for in multiple servers. In this paper, we find the provably optimal search method for such applications and develop analytical models for search time and cost. A client node searching for objects maintains statistics on where (in which servers) it has previously found objects. Using these statistics to target future searches to popular servers is provably optimal. For object location and request distributions that are non-uniform, which has been shown to be the case in P2P file sharing networks, this method of targeted searching is found to be more cost-effective (i.e., use less server resources) than broadcast-based searching. Our targeted search method is implemented in a prototype Gnutella servent called Ditella. Ditella can improve the scalability of file sharing in P2P networks and reduce the amount of traffic in the Internet by reducing file search query traffic.

Proceedings Title

24th IEEE International Performance Computing and Communications Conference (IPCCC 2005)

Conference Dates

April 7-9, 2005

Conference Location

, USA

Conference Title

IEEE International Performance, Computing, and Communications Conference

Pub Type

Conferences

Keywords

optimal, peer-to-peer, power law, search

Citation

Perara, G. , Christensen, K. and Roginsky, A. (2005), Targeted Search: Reducing the Time and Cost for Searching for Objects in Multiple-Server Networks, 24th IEEE International Performance Computing and Communications Conference (IPCCC 2005), , USA (Accessed April 26, 2026)

Additional citation formats