[LIBRO][B] Microwaves and metals

M Gupta, EWW Leong - 2008 - books.google.com
Using microwaves to treat metal-based materials is rapidly emerging as an energy-efficient
tool to interact with metals for a number of processes such as sintering, melting, brazing …

Unreliable sensor grids: Coverage, connectivity and diameter

S Shakkottai, R Srikant, NB Shroff - Ad Hoc Networks, 2005 - Elsevier
We consider an unreliable wireless sensor grid network with n nodes placed in a square of
unit area. We are interested in the coverage of the region and the connectivity of the …

Peer-to-peer membership management for gossip-based protocols

AJ Ganesh, AM Kermarrec… - IEEE transactions on …, 2003 - ieeexplore.ieee.org
Gossip-based protocols for group communication have attractive scalability and reliability
properties. The probabilistic gossip schemes studied so far typically assume that each group …

Dynamic networks: models and algorithms

F Kuhn, R Oshman - ACM SIGACT News, 2011 - dl.acm.org
The study of dynamic networks has come into popularity recently, and many models and
algorithms for such networks have been suggested. In this column we survey some recent …

Probabilistic reliable dissemination in large-scale systems

AM Kermarrec, L Massoulié… - IEEE Transactions on …, 2003 - ieeexplore.ieee.org
The growth of the Internet raises new challenges for the design of distributed systems and
applications. In the context of group communication protocols, gossip-based schemes have …

HyParView: A membership protocol for reliable gossip-based broadcast

J Leitao, J Pereira, L Rodrigues - 37th Annual IEEE/IFIP …, 2007 - ieeexplore.ieee.org
Gossip, or epidemic, protocols have emerged as a powerful strategy to implement highly
scalable and resilient reliable broadcast primitives. Due to scalability reasons, each …

Brahms: Byzantine resilient random membership sampling

E Bortnikov, M Gurevich, I Keidar, G Kliot… - Proceedings of the twenty …, 2008 - dl.acm.org
We present Brahms, an algorithm for sampling random nodes in a large dynamic system
prone to malicious behavior. Brahms stores small membership views at each node, and yet …

Epidemic broadcast trees

J Leitao, J Pereira, L Rodrigues - 2007 26th IEEE International …, 2007 - ieeexplore.ieee.org
There is an inherent trade-off between epidemic and deterministic tree-based broadcast
primitives. Tree-based approaches have a small message complexity in steady-state but are …

Towards a global IP anycast service

H Ballani, P Francis - ACM SIGCOMM Computer Communication …, 2005 - dl.acm.org
IP anycast, with its innate ability to find nearby resources in a robust and efficient fashion,
has long been considered an important means of service discovery. The growth of P2P …

A robust and scalable peer-to-peer gossi** protocol

S Voulgaris, M Jelasity, M Van Steen - … , July 14, 2003, Revised and Invited …, 2005 - Springer
The newscast model is a general approach for communication in large agent-based
distributed systems. The two basic services—membership management and information …