Sciweavers

104 search results - page 17 / 21
» Latency-aware leader election
Sort
View
IPL
2002
95views more  IPL 2002»
14 years 9 months ago
On a game in directed graphs
Inspired by recent algorithms for electing a leader in a distributed system, we study the following game in a directed graph: each vertex selects one of its outgoing arcs (if any)...
Alan J. Hoffman, Kate Jenkins, Tim Roughgarden
SIAMCOMP
1998
117views more  SIAMCOMP 1998»
14 years 9 months ago
The Queue-Read Queue-Write PRAM Model: Accounting for Contention in Parallel Algorithms
This paper introduces the queue-read, queue-write (qrqw) parallel random access machine (pram) model, which permits concurrent reading and writing to shared memory locations, but ...
Phillip B. Gibbons, Yossi Matias, Vijaya Ramachand...
WIMOB
2008
IEEE
15 years 4 months ago
A Moderate to Robust Game Theoretical Model for Intrusion Detection in MANETs
—One popular solution for reducing the resource consumption of Intrusion Detection System (IDS) in MANET is to elect a head-cluster (leader) to provide intrusion detection servic...
Hadi Otrok, Noman Mohammed, Lingyu Wang, Mourad De...
RSP
2007
IEEE
139views Control Systems» more  RSP 2007»
15 years 4 months ago
Verifying Distributed Protocols using MSC-Assertions, Run-time Monitoring, and Automatic Test Generation
This paper addresses the need for formal specification and runtime verification of system-level requirements of distributed reactive systems. It describes a formalism for specifyi...
Doron Drusinsky, Man-tak Shing
SIGCOMM
2005
ACM
15 years 3 months ago
Meridian: a lightweight network location service without virtual coordinates
This paper introduces a lightweight, scalable and accurate framework, called Meridian, for performing node selection based on network location. The framework consists of an overla...
Bernard Wong, Aleksandrs Slivkins, Emin Gün S...