Sciweavers

1116 search results - page 197 / 224
» Key Agreement Using Statically Keyed Authenticators
Sort
View
WORM
2003
13 years 9 months ago
Worm anatomy and model
We present a general framework for reasoning about network worms and analyzing the potency of worms within a specific network. First, we present a discussion of the life cycle of ...
Dan Ellis
CONCUR
2010
Springer
13 years 8 months ago
A Theory of Design-by-Contract for Distributed Multiparty Interactions
Reliability is a critical issue in many multi-organizational distributed applications, be they web services, financial protocols, scientific computing infrastructure, and software ...
Laura Bocchi, Kohei Honda, Emilio Tuosto, Nobuko Y...
CORR
2010
Springer
142views Education» more  CORR 2010»
13 years 7 months ago
The Accuracy of Tree-based Counting in Dynamic Networks
Tree-based protocols are ubiquitous in distributed systems. They are flexible, they perform generally well, and, in static conditions, their analysis is mostly simple. Under churn...
Supriya Krishnamurthy, John Ardelius, Erik Aurell,...
ENTCS
2007
128views more  ENTCS 2007»
13 years 7 months ago
Optimisation Validation
We introduce the idea of optimisation validation, which is to formally establish that an instance of an optimising transformation indeed improves with respect to some resource mea...
David Aspinall, Lennart Beringer, Alberto Momiglia...
JPDC
2007
100views more  JPDC 2007»
13 years 7 months ago
Deadlock-free connection-based adaptive routing with dynamic virtual circuits
Virtual circuits can reduce routing overheads with irregular topologies and provide support for a mix of quality of service (QOS) requirements. Information about network loads and...
Yoshio Turner, Yuval Tamir