Per-hop based scheduling for delay bounded search in Gnutella-like networks

Gnutella-like P2P networks typically adopt flooding-based search techniques to locate files. However, due to flooding´s poor scalability, research efforts have been made to solve this problem. The search response time, which is another important user-perceivable parameter, has received little attention. In this work, we investigate the performance of a novel search algorithm for the overlay networks with bounded search delay in Gnutella-like networks. In our algorithm, a mechanism is introduced to calculate the per-hop delay consisting of two parts: the message queuing delay and the per-hop propagation delay. We also use packet-level simulations to undertake a measurement study to characterize the message loss behavior and the success rate in a Gnutella network under different traffic and topology scenarios, And we also give an analysis and comparison of several queuing policies including fair-queuing and priority queuing.