Gossip-based Search in Multipeer Communication Networks

Details Gossip-based Search in Multipeer Communication Networks Gossip-based Search in Multipeer Communication Networks

2009-07-15

arxiv.org/abs/0907.2563v1

Computer Science

Networking and Internet Architecture

preprint (18 pages, 6 figures)

Scientific paper

We study a gossip-based algorithm for searching data objects in a multipeer communication network. All of the nodes in the network are able to communicate with each other. There exists an initiator node that starts a round of searches by randomly querying one or more of its neighbors for a desired object. The queried nodes can also be activated and look for the object. We examine several behavioural patterns of nodes with respect to their willingness to cooperate in the search. We derive mathematical models for the search process based on the balls and bins model, as well as known approximations for the rumour-spreading problem. All models are validated with simulations. We also evaluate the performance of the algorithm and examine the impact of search parameters.

Affiliated with

Also associated with

No associations

Rating

Gossip-based Search in Multipeer Communication Networks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Gossip-based Search in Multipeer Communication Networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Gossip-based Search in Multipeer Communication Networks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-364318