Sciweavers

184 search results - page 22 / 37
» Communication in Networks with Random Dependent Faults
Sort
View
INFOCOM
2005
IEEE
14 years 1 months ago
The one-to-many TCP overlay: a scalable and reliable multicast architecture
Abstract— We consider reliable multicast in overlay networks where nodes have finite-size buffers and are subject to failures. We address issues of end-to-end reliability and th...
François Baccelli, Augustin Chaintreau, Zhe...
INFOCOM
2005
IEEE
14 years 1 months ago
Gossip algorithms: design, analysis and applications
Abstract— Motivated by applications to sensor, peer-topeer and ad hoc networks, we study distributed asynchronous algorithms, also known as gossip algorithms, for computation and...
Stephen P. Boyd, Arpita Ghosh, Balaji Prabhakar, D...
INFOCOM
2003
IEEE
14 years 21 days ago
IMPORTANT: A framework to systematically analyze the Impact of Mobility on Performance of RouTing protocols for Adhoc NeTworks
— A Mobile Ad hoc Network (MANET) is a collection of wireless mobile nodes forming a temporary network without using any existing infrastructure. Since not many MANETs are curren...
Fan Bai, Narayanan Sadagopan, Ahmed Helmy
COMCOM
2011
13 years 2 months ago
Modeling gossip-based content dissemination and search in distributed networking
This paper presents a rigorous analytic study of gossip-based message dissemination schemes that can be employed for content/service dissemination or discovery in unstructured and...
Siyu Tang, Eva Jaho, Ioannis Stavrakakis, Ioannis ...
EUROSYS
2008
ACM
14 years 4 months ago
DepSpace: a byzantine fault-tolerant coordination service
The tuple space coordination model is one of the most interesting coordination models for open distributed systems due to its space and time decoupling and its synchronization pow...
Alysson Neves Bessani, Eduardo Adílio Pelin...