IEICE TRANSACTIONS on Communications
Achieving Global Optimal Replication in Distributed Networks
Summary :
This letter presents the globally optimal data replication in the distributed networks. We propose a distributed approach based on the metropolis-hastings algorithm to achieve the globally optimal data replication without requiring any global information. Experimental results show that the proposed approach works well and the error can be held below 0.6% easily.
- Publication
- IEICE TRANSACTIONS on Communications Vol.E93-B No.7 pp.1923-1926
- Publication Date
- 2010/07/01
- Publicized
- Online ISSN
- 1745-1345
- DOI
- 10.1587/transcom.E93.B.1923
- Type of Manuscript
- LETTER
- Category
- Network
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Yao YU, Yu ZHOU, Kanglian ZHAO, Sidan DU, "Achieving Global Optimal Replication in Distributed Networks" in IEICE TRANSACTIONS on Communications,
vol. E93-B, no. 7, pp. 1923-1926, July 2010, doi: 10.1587/transcom.E93.B.1923.
Abstract: This letter presents the globally optimal data replication in the distributed networks. We propose a distributed approach based on the metropolis-hastings algorithm to achieve the globally optimal data replication without requiring any global information. Experimental results show that the proposed approach works well and the error can be held below 0.6% easily.
URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.E93.B.1923/_p
Copy
@ARTICLE{e93-b_7_1923,
author={Yao YU, Yu ZHOU, Kanglian ZHAO, Sidan DU, },
journal={IEICE TRANSACTIONS on Communications},
title={Achieving Global Optimal Replication in Distributed Networks},
year={2010},
volume={E93-B},
number={7},
pages={1923-1926},
abstract={This letter presents the globally optimal data replication in the distributed networks. We propose a distributed approach based on the metropolis-hastings algorithm to achieve the globally optimal data replication without requiring any global information. Experimental results show that the proposed approach works well and the error can be held below 0.6% easily.},
keywords={},
doi={10.1587/transcom.E93.B.1923},
ISSN={1745-1345},
month={July},}
Copy
TY - JOUR
TI - Achieving Global Optimal Replication in Distributed Networks
T2 - IEICE TRANSACTIONS on Communications
SP - 1923
EP - 1926
AU - Yao YU
AU - Yu ZHOU
AU - Kanglian ZHAO
AU - Sidan DU
PY - 2010
DO - 10.1587/transcom.E93.B.1923
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E93-B
IS - 7
JA - IEICE TRANSACTIONS on Communications
Y1 - July 2010
AB - This letter presents the globally optimal data replication in the distributed networks. We propose a distributed approach based on the metropolis-hastings algorithm to achieve the globally optimal data replication without requiring any global information. Experimental results show that the proposed approach works well and the error can be held below 0.6% easily.
ER -
English
