Sciweavers

1189 search results - page 13 / 238
» Minimizing churn in distributed systems
Sort
View
ATAL
2003
Springer
15 years 9 months ago
Minimizing communication cost in a distributed Bayesian network using a decentralized MDP
In complex distributed applications, a problem is often decomposed into a set of subproblems that are distributed to multiple agents. We formulate this class of problems with a tw...
Jiaying Shen, Victor R. Lesser, Norman Carver
RTSS
2007
IEEE
15 years 10 months ago
Distributed Minimal Time Convergecast Scheduling for Small or Sparse Data Sources
— Many applications of sensor networks require the base station to collect all the data generated by sensor nodes. As a consequence many-to-one communication pattern, referred to...
Ying Zhang, Shashidhar Gandham, Qingfeng Huang
EUROPAR
2009
Springer
15 years 11 months ago
Uniform Sampling for Directed P2P Networks
Selecting a random peer with uniform probability across a peer-to-peer (P2P) network is a fundamental function for unstructured search, data replication, and monitoring algorithms....
Cyrus P. Hall, Antonio Carzaniga
ICDCS
2007
IEEE
15 years 10 months ago
Protocol Design for Dynamic Delaunay Triangulation
Delaunay triangulation (DT) is a useful geometric structure for networking applications. In this paper we investigate the design of join, leave, and maintenance protocols to const...
Dong-Young Lee, Simon S. Lam
IWSOS
2009
Springer
15 years 9 months ago
Self-organized Data Redundancy Management for Peer-to-Peer Storage Systems
In peer-to-peer storage systems, peers can freely join and leave the system at any time. Ensuring high data availability in such an environment is a challenging task. In this paper...
Yaser Houri, Manfred Jobmann, Thomas Fuhrmann