Sciweavers

12301 search results - page 314 / 2461
» Distributed Computation in Dynamic Networks
Sort
View
DSOM
2009
Springer
16 years 1 months ago
Self-optimizing Hybrid Routing in Publish/Subscribe Systems
Rendering networks and distributed systems self-managing and self-optimizing has become a major research focus. This task is especially important for systems, such as publish/subsc...
Arnd Schröter, Daniel Graff, Gero Mühl, ...
CORR
2010
Springer
151views Education» more  CORR 2010»
15 years 5 months ago
Adding a referee to an interconnection network: What can(not) be computed in one round
Abstract—In this paper we ask which properties of a distributed network can be computed from a few amount of local information provided by its nodes. The distributed model we con...
Florent Becker, Martín Matamala, Nicolas Ni...
MOBIHOC
2002
ACM
16 years 6 months ago
Weak duplicate address detection in mobile ad hoc networks
Auto-configuration is a desirable goal in implementing mobile ad hoc networks. Specifically, automated dynamic assignment (without manual intervention) of IP addresses is desirabl...
Nitin H. Vaidya
ICDCS
1997
IEEE
15 years 11 months ago
Predictable Network Computing
Clusters of networked, off-the-shelf workstations are currently used for computationintensive, parallel applications. However, it is hardly possible to predict the timing behaviou...
Andreas Polze, Gerhard Fohler, Matthias Werner
NETWORKING
2004
15 years 8 months ago
Efficient, Authenticated, and Fault-Tolerant Key Agreement for Dynamic Peer Groups
We present an efficient authenticated and fault-tolerant protocol (AFTD) for tree-based key agreement. Our approach is driven by the insight that when a Diffie-Hellman blinded key ...
Li Zhou, Chinya V. Ravishankar