Sciweavers

481 search results - page 64 / 97
» Distributed Consensus, revisited
Sort
View
SERSCISA
2009
Springer
14 years 3 months ago
A Kademlia-Based Node Lookup System for Anonymization Networks
Node lookup mechanisms constitute an integral part of any overlay network, and hence also of anonymous communication networks. Today, most anonymizers use centralized directories, ...
Benedikt Westermann, Andriy Panchenko, Lexi Pimeni...
SMC
2007
IEEE
122views Control Systems» more  SMC 2007»
14 years 3 months ago
Can complexity science support the engineering of critical network infrastructures?
— Considerable attention is now being devoted to the study of “complexity science” with the intent of discovering and applying universal laws of highly interconnected and evo...
David Alderson, John C. Doyle
DFG
2007
Springer
14 years 3 months ago
Natural Neighbor Concepts in Scattered Data Interpolation and Discrete Function Approximation
: The concept of natural neighbors employs the notion of distance to define local neighborhoods in discrete data. Especially when querying and accessing large scale data, it is im...
Tom Bobach, Georg Umlauf
DEXAW
2006
IEEE
151views Database» more  DEXAW 2006»
14 years 2 months ago
Avenues to Flexible Data Integrity Checking
Traditional methods for integrity checking in relational or deductive databases heavily rely on the assumption that data have integrity before the execution of updates. In this wa...
Hendrik Decker, Davide Martinenghi
NETWORKING
2008
13 years 10 months ago
The Effect of Peer Selection with Hopcount or Delay Constraint on Peer-to-Peer Networking
We revisit the peer selection problem of finding the most nearby peer from an initiating node. The metrics to assess the closeness between peers are hopcount and delay, respectivel...
Siyu Tang, Huijuan Wang, Piet Van Mieghem