Fast gossiping with short unreliable messages
نویسندگان
چکیده
منابع مشابه
Fast gossiping with short unreliable messages
Each of n nodes of a communication network has a piece of information (gossip) which should be made known to all other nodes. Gossiping is done by sending letters. In a unit of time each node can either send one letter to a neighbor or receive one such letter, containing one gossip currently known to the sender. Letters reach their destinations with constant probability 0 < q < 1, independently...
متن کاملFast Gossiping by Short Messages
Gossiping is the process of information diiusion in which each node of a network holds a packet that must be communicated to all other nodes in the network. We consider the problem of gossiping in communication networks under the restriction that communicating nodes can exchange up to a xed number p of packets at each round. In the rst part of the paper we study the extremal case p = 1 and we e...
متن کاملOptimal Sequential Gossiping by Short Messages
Gossiping is the process of information diiusion in which each node of a network holds a block that must be communicated to all the other nodes in the network. We consider the problem of gossiping in communication networks under the restriction that communicating nodes can exchange up to a xed number p of blocks during each call. We study the minimum number of calls necessary to perform gossipi...
متن کاملGossiping with Bounded Size Messages in ad hoc Radio Networks
We study deterministic algorithms for the gossiping problem in ad hoc radio networks under the assumption that each combined message contains at most b(n) single messages or bits of auxiliary information, where b is an integer function and n is the number of nodes in the network. We term such a restricted gossiping problem b(n)-gossiping. We show that √ n-gossiping in an ad hoc radio network on...
متن کاملFast Gossiping for the Hypercube
The gossip problem involves communicating a unique item from every node in a graph to every other node. We study the minimum time required to do this for the binary hypercube under two models of communication. In the rst model, all communication links may be used concurrently but each may only carry information in one direction at a time. In the second, weaker model each node may be involved in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1994
ISSN: 0166-218X
DOI: 10.1016/0166-218x(94)90176-7