Sciweavers

182 search results - page 21 / 37
» A formal framework for the performance analysis of P2P netwo...
Sort
View
WDAG
2000
Springer
87views Algorithms» more  WDAG 2000»
13 years 11 months ago
A Probabilistically Correct Leader Election Protocol for Large Groups
This paper presents a scalable leader election protocol for large process groups with a weak membership requirement. The underlying network is assumed to be unreliable but characte...
Indranil Gupta, Robbert van Renesse, Kenneth P. Bi...
EMSOFT
2006
Springer
13 years 11 months ago
An analysis framework for network-code programs
Distributed real-time systems require a predictable and verifiable mechanism to control the communication medium. Current real-time communication protocols are typically independe...
Madhukar Anand, Sebastian Fischmeister, Insup Lee
INFOCOM
2003
IEEE
14 years 23 days ago
A Framework for Incremental Deployment Strategies for Router-Assisted Services
— Incremental deployment of a new network service or protocol is typically a hard problem, especially when it has to be deployed in the routers. First, an incrementally deployabl...
Xinming He, Christos Papadopoulos, Pavlin Radoslav...
CCS
2006
ACM
13 years 11 months ago
Replayer: automatic protocol replay by binary analysis
We address the problem of replaying an application dialog between two hosts. The ability to accurately replay application dialogs is useful in many security-oriented applications,...
James Newsome, David Brumley, Jason Franklin, Dawn...
EUROPAR
2008
Springer
13 years 9 months ago
Auction Protocols for Resource Allocations in Ad-Hoc Grids
Abstract. Different auction-based approaches have been used to allocate resources in Grids, but none of them provide the design choice for a specific economic model while consideri...
Behnaz Pourebrahimi, Koen Bertels