This paper discusses the problem of placing data replicas in a ring network to maximize data availability. For read-anyΓwrite-all protocol, we prove that the equally spacing placement is optimal for read-dominant systems, while the grouping placement is optimal for write-dominant systems. For majori
β¦ LIBER β¦
Experiments on data reduction for optimal domination in networks
β Scribed by Jochen Alber; Nadja Betzler; Rolf Niedermeier
- Publisher
- Springer US
- Year
- 2006
- Tongue
- English
- Weight
- 340 KB
- Volume
- 146
- Category
- Article
- ISSN
- 0254-5330
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Placement of Data Replicas for Optimal D
β
X.-D. Hu; X.-H. Jia; D.-Z. Du; D.-Y. Li; H.-J. Huang
π
Article
π
2001
π
Elsevier Science
π
English
β 210 KB
Energy optimization for chain-based data
β
Li-Hsing Yen; Ming-Zhou Cai; Yang-Min Cheng; Ping-Yuan Yang
π
Article
π
2007
π
John Wiley and Sons
π
English
β 376 KB
π 1 views
## Abstract This paper aims to minimize energy expense for chainβbased data gathering schemes, which is essential to prolong the operation lifetime of wireless sensor networks. Energy expense in chainβbased data gathering schemes consists of two parts. One corresponds to interβsensor communications
Development of artificial neural network
β
Frank K. Urban III; Dong C. Park; Milad F. Tabet
π
Article
π
1992
π
Elsevier Science
π
English
β 672 KB
On using Bayesian networks for complexit
β
Adriana Brogini; Debora Slanzi
π
Article
π
2009
π
Springer
π
English
β 152 KB
Optimizing processes based on censored d
β
Lee-Ing Tong; Chung-Ho Wang; Lin-Chan Hsiao
π
Article
π
2005
π
Springer
π
English
β 410 KB
On optimal batch rekeying for secure gro
β
Jin-Hee Cho; Ing-Ray Chen; Mohamed Eltoweissy
π
Article
π
2007
π
Springer
π
English
β 656 KB