Sciweavers

1101 search results - page 100 / 221
» Reliability for Networked Storage Nodes
Sort
View
PODC
2012
ACM
13 years 3 months ago
Byzantine broadcast in point-to-point networks using local linear coding
The goal of Byzantine Broadcast (BB) is to allow a set of fault-free nodes to agree on information that a source node wants to broadcast to them, in the presence of Byzantine faul...
Guanfeng Liang, Nitin H. Vaidya
105
Voted
CIKM
2004
Springer
15 years 6 months ago
SWAM: a family of access methods for similarity-search in peer-to-peer data networks
Peer-to-peer Data Networks (PDNs) are large-scale, selforganizing, distributed query processing systems. Familiar examples of PDN are peer-to-peer file-sharing networks, which su...
Farnoush Banaei Kashani, Cyrus Shahabi
INFOCOM
2012
IEEE
13 years 3 months ago
Data gathering in networks of bacteria colonies: Collective sensing and relaying using molecular communication
Abstract—The prospect of new biological and industrial applications that require communication in micro-scale, encourages research on the design of bio-compatible communication n...
Arash Einolghozati, Mohsen Sardari, Ahmad Beirami,...
105
Voted
KDD
2003
ACM
217views Data Mining» more  KDD 2003»
16 years 1 months ago
Algorithms for estimating relative importance in networks
Large and complex graphs representing relationships among sets of entities are an increasingly common focus of interest in data analysis--examples include social networks, Web gra...
Scott White, Padhraic Smyth
COLCOM
2009
IEEE
15 years 5 months ago
Still alive: Extending keep-alive intervals in P2P overlay networks
Abstract—Nodes within existing P2P networks typically exchange periodic keep-alive messages in order to maintain network connections between neighbours. This paper investigates a...
Richard Price, Peter Tiño