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...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Journal of network and systems management Jg. 24; H. 1; S. 34 - 56
Hauptverfasser: Jiang, Xiaofeng, Li, Jun, Xi, Hongsheng
Format: Journal Article
Sprache:Englisch
Veröffentlicht: New York Springer US 01.01.2016
Springer Nature B.V
Schlagworte:
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-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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 is an asynchronous distributed algorithm as it takes more time to be completed. However its performance approaches the optimal algorithm, and a fast replication algorithm that is very suitable as the initial algorithm of the approximation optimal algorithm. We give a proof of the complexity of the algorithms, and show that the time and communication complexities of the algorithms are polynomial with respect to the number of objects and the maximum storage capacities of the servers. Finally, simulation experiments are performed to investigate the performance of the algorithms, and the results show that the two algorithms can effectively solve the replication problem.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
content type line 23
ISSN:1064-7570
1573-7705
DOI:10.1007/s10922-014-9338-0