Filters








16,511 Hits in 7.6 sec

Gossiping with multiple sends and receives

A. Bagchi, E.F. Schmeichel, S.L. Hakimi
1996 Discrete Applied Mathematics  
During a single round, each processor may send an unlimited size message to k neighbors, or receive messages from k neighbors, but a processor cannot both send and receive during the same round.  ...  As an interesting corollary of several of our main results, we obtain an optimal (d + 1)-round gossiping algorithm for the d-dimensional hypercube when k = 2 and show that gossiping in d rounds is impossible  ...  It then follows by Conjecture 10 and Theorem 4 that r,(T) G r,(T') = diam(T') + 1 = diam(T) + #odd(T) + 1.  ... 
doi:10.1016/0166-218x(95)00123-9 fatcat:5djohw4d2bd6hb4btmeizgbnfu

An online distributed gossiping protocol for mobile networks

Zhengnan Shi, Pradip K. Srimani
2006 Journal of combinatorial optimization  
does the gossiping based algorithm solve the overlap problem which causes some nodes to receive multiple copies of the same data.  ...  multiple control messages allowed.  ...  The node P i may send it to its neighbors in the same time slot. 3. During the control message time slot (denoted as s c ), each node P i may send and receive multiple control messages.  ... 
doi:10.1007/s10878-006-5979-6 fatcat:dfkzrut27za7hcxof6chw3tivu

Gossip-based service coordination for scalability and resilience

Filipe Campos, José Pereira
2008 Proceedings of the 3rd workshop on Middleware for service oriented computing - MW4SOC '08  
It is based on gossiping and thus potentially fully decentralized, requiring that each participant is concerned only with a small number of peers.  ...  Although being obviously simple and scalable, it has been shown that gossip-based protocols lead to emergent strong resilience guarantees.  ...  In the infect--and-die model, a node that is infected, i.e. receives a message, takes only one round to send the received message to other nodes, and then never sends it again, becoming dead in the analogy  ... 
doi:10.1145/1462802.1462812 dblp:conf/middleware/CamposP08a fatcat:gpikczmkvrbixaqcz5yddy3u34

Energy Cost Model for Frequent Item Set Discovery in Unstructured P2P Networks [chapter]

Emrah Cem, Ender Demirkaya, Ertem Esiner, Burak Ozaydin, Oznur Ozkasap
2011 Computer and Information Sciences II  
After developing the energy cost model, we examine the effect of protocol parameters on energy consumption using our simulation model on PeerSim and compare push-pull method of ProFID with the well-known  ...  and security.  ...  As future work, we plan to deploy our protocol on PlanetLab and analyze its energy cost on this network testbed. We also aim to extend our energy cost model to hierarchical gossip approaches.  ... 
doi:10.1007/978-1-4471-2155-8_14 dblp:conf/iscis/CemDEOO11 fatcat:dqrh55qrlvdn5mjcsycvdj433m

Energy efficient hierarchical epidemics in peer-to-peer systems

Emrah Cem, Tugba Koc, Oznur Ozkasap
2011 2011 International Conference on Energy Aware Computing  
In this study, we consider power awareness features of flat and hierarchical epidemics in peer-topeer (P2P) systems, and propose a power-aware hierarchical epidemic approach with its energy cost model  ...  In flat neighborhood epidemics, peers have similar responsibilities and all participate in gossiping via neighboring peers.  ...  Each peer contacts with a single neighbor at each round and sends its local state in a single gossip message.  ... 
doi:10.1109/iceac.2011.6136685 dblp:conf/iceac/CemKO11 fatcat:xjbikc4ryvfodiwplofvgttlae

Epidemic-based reliable and adaptive multicast for mobile ad hoc networks

Oznur Ozkasap, Zulkuf Genc, Emre Atsan
2009 Computer Networks  
Furthermore, frequency of gossip messages that a node will send and probability of sending a request message are adjusted dynamically by the adaptivity mechanism.  ...  Each node in the network periodically selects a random node and sends a gossip message containing the digest of database content to this node.  ...  and Technical Research) Action 279: Analysis and Design of Advanced Multiservice Networks supporting Mobility, Multimedia, and Internetworking.  ... 
doi:10.1016/j.comnet.2009.01.007 fatcat:dwe6dp7ldjhwjaofdku7ivi7ce

Optimizing information flow in the gossip objects platform

Ymir Vigfusson, Ken Birman, Qi Huang, Deepak P. Nataraj
2010 ACM SIGOPS Operating Systems Review  
GO allows nodes to join multiple gossip groups without losing the appealing fixed bandwidth guarantee of gossip protocols, and the platform also optimizes latency in a principled manner.  ...  Our algorithm is based on the observations that multiple rumors can often be squeezed into a single IP packet, and that indirect routing of rumors can speed up delivery.  ...  GO was supported in part by grants from AFOSR, AFRL, NSF, Intel Corporation and Yahoo!.  ... 
doi:10.1145/1773912.1773930 fatcat:mjmgeqhohfetvc242dcc5s2ziu

TDMA service for sensor networks

S.S. Kulkarni
2004 24th International Conference on Distributed Computing Systems Workshops, 2004. Proceedings.  
Sensors networks are often constrained by limited power and limited communication range. If a sensor receives two messages simultaneously then they collide and both messages become incomprehensible.  ...  We present TDMA algorithms customized for different communication patterns, namely, broadcast, convergecast and local gossip, that occur commonly in sensor networks.  ...  Local gossip. In Figures 8(c) and 8(d) , we present the simulation results for local gossip with location errors.  ... 
doi:10.1109/icdcsw.2004.1284094 dblp:conf/icdcsw/KulkarniA04 fatcat:cc5tm6jwtrhxflimf6db3os27q

Epidemic Broadcast Trees

Joao Leitao, Jose Pereira, Luis Rodrigues
2007 2007 26th IEEE International Symposium on Reliable Distributed Systems (SRDS 2007)  
The protocol sends the message payload preferably via tree branches but uses the remaining links of the gossip overlay for fast recovery and expedite tree healing.  ...  We use a low cost scheme to build and maintain broadcast trees embedded on a gossip-based overlay.  ...  with multiple senders.  ... 
doi:10.1109/srds.2007.27 dblp:conf/srds/LeitaoPR07 fatcat:ongbfjjc7rbwfid63tk2vgi67e

Flat and hierarchical epidemics in P2P systems: Energy cost models and analysis

Oznur Ozkasap, Emrah Cem, Sena Efsun Cebeci, Tugba Koc
2014 Future generations computer systems  
We propose a dominating-set based and power-aware hierarchical epidemic approach that eliminates a significant number of peers from gossiping.  ...  on energy consumption. a b s t r a c t In large scale distributed systems, epidemic or gossip-based communication mechanisms are preferred for their ease of deployment, simplicity, robustness against  ...  Since E send,j and E receive,j are the energies consumed while sending and receiving a single tuple respectively, the total energy consumed during a gossip round would linearly increase with the mms.  ... 
doi:10.1016/j.future.2013.09.009 fatcat:2q6bwrrufbaehktvfze7j7wwxy

Epidemic Broadcast Trees

Joao Leitao, Jose Pereira, Luis Rodrigues
2007 Symposium on Reliable Distributed Systems. Proceedings  
The protocol sends the message payload preferably via tree branches but uses the remaining links of the gossip overlay for fast recovery and expedite tree healing.  ...  We use a low cost scheme to build and maintain broadcast trees embedded on a gossip-based overlay.  ...  with multiple senders.  ... 
doi:10.1109/srds.2007.4365705 fatcat:rxq2lz77azdjfg2j5rnx7tp6we

Formal Verification and Simulation for Performance Analysis for Probabilistic Broadcast Protocols [chapter]

Ansgar Fehnker, Peng Gao
2006 Lecture Notes in Computer Science  
For example, [3] and [5] both evaluate the flooding protocol, but sending and receiving is perfectly synchronized in [3], while [5] assumes a random waiting period in-between sending and receiving.  ...  This reduces the probability that a node receives a message multiple times, thus the redundancy and cost.  ...  The next section of this paper gives an introduction to flooding and gossiping protocols. Section 3 and 4 introduce the model checker Prism and Monte-Carlo simulation respectively.  ... 
doi:10.1007/11814764_12 fatcat:3grltya7jfexfnv54icbkx57ri

The "art" of programming gossip-based systems

Patrick Eugster, Pascal Felber, Fabrice Le Fessant
2007 ACM SIGOPS Operating Systems Review  
We address the first question by arguing that gossip-based protocols are all built following one and the same pattern, and describing three building blocks which we claim are used to support this recurrent  ...  The second question is addressed by arguing that gossip-based protocols exhibit some probabilistic or imperfect flavor (e.g., probabilistic or partial completion), and by proposing to take such probabilistic  ...  Dealing with multiple outputs The possibility of a probabilistic component yielding different outcomes in response to its invocation leads to the issue of dealing with these multiple outputs.  ... 
doi:10.1145/1317379.1317386 fatcat:dzjwfafpzfbipjsoq64b6ocu3u

Reinforced Secure Gossiping against DoS Attacks in Post-Disaster Scenarios

Christian Esposito, Zhongliang Zhao, Jacek Rak
2020 IEEE Access  
In this sense, gossiping is a multi-path routing from multiple senders, with message sending occurring at different moments.  ...  A push gossip typically includes sending the last received message as soon as it is successfully received.  ... 
doi:10.1109/access.2020.3027150 fatcat:j53eojx6z5ga7pjndddr32u2hu

Multisource Rumor Spreading with Network Coding

Yerom-David Bromberg, Quentin Dufour, Davide Frey
2019 IEEE INFOCOM 2019 - IEEE Conference on Computer Communications  
In particular, the originality of our approach is to combine sparse vector encoding to send our network coding coefficients and Lamport timestamps to split messages in generations in order to provide an  ...  efficient gossiping.  ...  By sending a linear combination of M 1 and M 2 , nodes D and E can respectively recover M 2 and M 1 with the help of the plain message they also received.  ... 
doi:10.1109/infocom.2019.8737576 dblp:conf/infocom/BrombergDF19 fatcat:shslgq5zojakrost25jjcadkci
« Previous Showing results 1 — 15 out of 16,511 results