Biased Gossip
Above, a purely random peer-selection scheme for gossip was described: when agent A decides to run a gossip round, it picks some peer B uniformly and at random within the network as a whole (or launches a message on a random walk that will terminate at a random agent). More commonly, gossip algorithms are designed so that agents interact mostly with nearby agents, and only sometimes with agents that are far away (in terms of network delay). These biased gossip protocols need to ensure a sufficient degree of connectivity to avoid the risk of complete disconnection of one side of a network from the other, but if care is taken, can be faster and more efficient than protocols that are purely random. Moreover, as a purely practical question, it is much easier to maintain lists of peers in ways that might be somewhat biased.
Read more about this topic: Gossip Protocol
Famous quotes containing the words biased and/or gossip:
“Scientists are human—they’re as biased as any other group. But they do have one great advantage in that science is a self-correcting process.”
—Cyril Ponnamperuma (b. 1923)
“I am grown by sympathy a little eager and sentimental, but leave me alone, and I should relish every hour and what it brought me, the pot-luck of the day, as heartily as the oldest gossip in the bar-room.”
—Ralph Waldo Emerson (1803–1882)