 For this purpose, a protocol must propagate any new information to all nodes that will be affected by the information within time logarithmic in the size of the system (the "mixing time" must be logarithmic in system size).Suppose that we want to find the object that most closely matches some search pattern, within a network of unknown size, but where the computers are linked to one another and where each machine is running a small "agent" program that implements a gossip protocol.If the messages might get large (for example, if many searches are active all at the same time), a size limit should be introduced.