Distributed Algorithms for a Replication Problem of Popular Network Data

The replication of popular data objects can effectively reduce the access time and bandwidth requirements of network services. We study the replication problem in the model of distributed replication groups and propose two distributed algorithms: an approximation optimal replication algorithm, which...

Full description

Saved in:

Bibliographic Details
Published in:	Journal of network and systems management Vol. 24; no. 1; pp. 34 - 56
Main Authors:	Jiang, Xiaofeng, Li, Jun, Xi, Hongsheng
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.01.2016 Springer Nature B.V
Subjects:	Algorithms Approximation Asynchronous Bandwidths Communications Engineering Complexity Computer Communication Networks Computer networks Computer Science Computer Systems Organization and Communication Networks Data replication Experiments Information Systems and Communication Service Isolationism Mathematical analysis Networks Operations Research/Decision Theory Optimization Replication Reproducibility Requirements Servers Simulation Storage Storage capacity Replication of popular data Access cost Asynchronous distributed algorithm Distributed replication group
ISSN:	1064-7570, 1573-7705
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!