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

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Journal of network and systems management Ročník 24; číslo 1; s. 34 - 56
Hlavní autoři:	Jiang, Xiaofeng, Li, Jun, Xi, Hongsheng
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York Springer US 01.01.2016 Springer Nature B.V
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Abstract	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.
AbstractList	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.
Author	Li, Jun Jiang, Xiaofeng Xi, Hongsheng
Author_xml	– sequence: 1 givenname: Xiaofeng surname: Jiang fullname: Jiang, Xiaofeng email: jxf@ustc.edu.cn, jxf@mail.ustc.edu.cn organization: Department of Automation, University of Science and Technology of China – sequence: 2 givenname: Jun surname: Li fullname: Li, Jun organization: Department of Automation, University of Science and Technology of China – sequence: 3 givenname: Hongsheng surname: Xi fullname: Xi, Hongsheng organization: Department of Automation, University of Science and Technology of China
BookMark	eNp1kEFLwzAYhoNMcJv-AG8BL16iX5KlaY9jUyeIDtk9pFk6O9tmJinivzejHkTw9L2H5335eCZo1LnOInRJ4YYCyNtAoWCMAJ2RgvOcwAkaUyE5kRLEKGXIZkQKCWdoEsIeAHJeiDFaLesQfV320W7xvNk5X8e3NuDKeazxqz00tdGxdh1ee1c2tsWuwmt36Bvt8bONn86_46WO-hydVroJ9uLnTtHm_m6zWJGnl4fHxfyJGC5pJGJWgeFlWVkmK1HyXDNmhMmkEJpamfGyMCWTwHMJmlvNtWEmL4GJrSmk4FN0PcwevPvobYiqrYOxTaM76_qgqMwzWogsyxJ69Qfdu9536blECc5lIXKeKDpQxrsQvK3Uwdet9l-KgjqqVYNaldSqo1oFqcOGTkhst7P-1_K_pW9OMnyY
Cites_doi	10.1109/TPDS.2006.171 10.1109/TPDS.2011.27 10.1016/j.jpdc.2007.06.009 10.1016/S0140-3664(01)00409-1 10.1109/71.265941 10.1109/71.932716 10.1109/TPDS.2011.83 10.1109/TPDS.2004.1278100 10.1109/TC.2005.202 10.1007/s11276-012-0474-8 10.1109/ICDCS.2000.840950 10.1109/71.250099 10.1016/j.jpdc.2004.04.005 10.1137/080715421 10.1109/90.879344 10.1109/TPDS.2003.1247676 10.1016/j.peva.2009.02.002 10.1109/TMC.2007.70770 10.1109/TPDS.2007.29 10.1109/ICCIT.2009.198 10.1109/WTS.2013.6566257 10.1109/ICIAS.2007.4658447 10.4018/978-1-4666-4781-7.ch011 10.1007/11590354_88 10.1109/NCIS.2011.26
ContentType	Journal Article
Copyright	Springer Science+Business Media New York 2014 Springer Science+Business Media New York 2016
Copyright_xml	– notice: Springer Science+Business Media New York 2014 – notice: Springer Science+Business Media New York 2016
DBID	AAYXX CITATION 3V. 7SC 7WY 7WZ 7XB 87Z 8AL 8AO 8FD 8FE 8FG 8FK 8FL ABUWG AFKRA ALSLI ARAPS AZQEC BENPR BEZIV BGLVJ CCPQU CNYFK DWQXO FRNLG F~G GNUQQ HCIFZ JQ2 K60 K6~ K7- L.- L7M L~C L~D M0C M0N M1O P5Z P62 PHGZM PHGZT PKEHL PQBIZ PQBZA PQEST PQGLB PQQKQ PQUKI PRINS PRQQA Q9U
DOI	10.1007/s10922-014-9338-0
DatabaseName	CrossRef ProQuest Central (Corporate) Computer and Information Systems Abstracts ABI/INFORM Collection ABI/INFORM Global (PDF only) ProQuest Central (purchase pre-March 2016) ABI/INFORM Global (Alumni Edition) Computing Database (Alumni Edition) ProQuest Pharma Collection Technology Research Database ProQuest SciTech Collection ProQuest Technology Collection ProQuest Central (Alumni) (purchase pre-March 2016) ABI/INFORM Collection (Alumni) ProQuest Central (Alumni) ProQuest Central UK/Ireland Social Science Premium Collection Advanced Technologies & Computer Science Collection ProQuest Central Essentials - QC ProQuest Central Business Premium Collection ProQuest Technology Collection ProQuest One Library & Information Science Collection ProQuest Central Korea Business Premium Collection (Alumni) ABI/INFORM Global (Corporate) ProQuest Central Student SciTech Premium Collection ProQuest Computer Science Collection ProQuest Business Collection (Alumni Edition) ProQuest Business Collection Computer Science Database ABI/INFORM Professional Advanced Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional ProQuest ABI/INFORM Global Computing Database Library Science Database Advanced Technologies & Aerospace Database ProQuest Advanced Technologies & Aerospace Collection ProQuest Central Premium ProQuest One Academic (New) ProQuest One Academic Middle East (New) ProQuest One Business ProQuest One Business (Alumni) ProQuest One Academic Eastern Edition (DO NOT USE) ProQuest One Applied & Life Sciences ProQuest One Academic (retired) ProQuest One Academic UKI Edition ProQuest Central China ProQuest One Social Sciences ProQuest Central Basic
DatabaseTitle	CrossRef ProQuest Business Collection (Alumni Edition) Computer Science Database ProQuest Central Student ProQuest Advanced Technologies & Aerospace Collection ProQuest Central Essentials ProQuest Computer Science Collection Computer and Information Systems Abstracts SciTech Premium Collection ProQuest Central China ABI/INFORM Complete ProQuest One Applied & Life Sciences Library & Information Science Collection ProQuest Central (New) Advanced Technologies & Aerospace Collection Business Premium Collection Social Science Premium Collection ABI/INFORM Global ProQuest One Academic Eastern Edition ProQuest Technology Collection ProQuest Business Collection ProQuest One Academic UKI Edition ProQuest One Academic ProQuest One Academic (New) ABI/INFORM Global (Corporate) ProQuest One Business Technology Collection Technology Research Database Computer and Information Systems Abstracts – Academic ProQuest One Academic Middle East (New) ProQuest Central (Alumni Edition) ProQuest One Community College ProQuest Pharma Collection ProQuest Central ABI/INFORM Professional Advanced ProQuest Library Science ProQuest Central Korea Advanced Technologies Database with Aerospace ABI/INFORM Complete (Alumni Edition) ProQuest Computing ProQuest One Social Sciences ABI/INFORM Global (Alumni Edition) ProQuest Central Basic ProQuest Computing (Alumni Edition) ProQuest SciTech Collection Computer and Information Systems Abstracts Professional Advanced Technologies & Aerospace Database ProQuest One Business (Alumni) ProQuest Central (Alumni) Business Premium Collection (Alumni)
DatabaseTitleList	ProQuest Business Collection (Alumni Edition) Computer and Information Systems Abstracts
Database_xml	– sequence: 1 dbid: BENPR name: ProQuest Central url: https://www.proquest.com/central sourceTypes: Aggregation Database
DeliveryMethod	fulltext_linktorsrc
Discipline	Engineering Computer Science
EISSN	1573-7705
EndPage	56
ExternalDocumentID	3912261631 10_1007_s10922_014_9338_0
GroupedDBID	-4Z -59 -5G -BR -EM -Y2 -~C .4S .86 .DC .VR 06D 0R~ 0VY 1N0 1SB 2.D 203 28- 29L 2J2 2JN 2JY 2KG 2LR 2P1 2VQ 2~H 30V 3V. 4.4 406 408 409 40D 40E 5GY 5QI 5VS 67Z 6NX 77K 7WY 8AO 8FE 8FG 8FL 8FW 8TC 8UJ 95- 95. 95~ 96X AAAVM AABHQ AACDK AAHNG AAIAL AAJBT AAJKR AANZL AAOBN AARHV AARTL AASML AATNV AATVU AAUYE AAWCG AAYIU AAYQN AAYTO AAYZH ABAKF ABBBX ABBXA ABDZT ABECU ABFTD ABFTV ABHLI ABHQN ABJNI ABJOX ABKCH ABKTR ABMNI ABMQK ABNWP ABQBU ABQSL ABSXP ABTEG ABTHY ABTKH ABTMW ABULA ABUWG ABWNU ABXPI ACAOD ACBXY ACDTI ACGFS ACHSB ACHXU ACKNC ACMDZ ACMLO ACOKC ACOMO ACPIV ACSNA ACZOJ ADHHG ADHIR ADINQ ADKNI ADKPE ADMLS ADRFC ADTPH ADURQ ADYFF ADZKW AEBTG AEFIE AEFQL AEGAL AEGNC AEJHL AEJRE AEKMD AEMSY AENEX AEOHA AEPYU AESKC AETLH AEVLU AEXYK AFBBN AFEXP AFGCZ AFKRA AFLOW AFQWF AFWTZ AFZKB AGAYW AGDGC AGGDS AGJBK AGMZJ AGQEE AGQMX AGRTI AGWIL AGWZB AGYKE AHAVH AHBYD AHKAY AHSBF AHYZX AIAKS AIGIU AIIXL AILAN AITGF AJBLW AJRNO AJZVZ ALMA_UNASSIGNED_HOLDINGS ALSLI ALWAN AMKLP AMXSW AMYLF AMYQR AOCGG ARAPS ARCSS ARMRJ ASPBG AVWKF AXYYD AYJHY AZFZN AZQEC B-. BA0 BBWZM BDATZ BENPR BEZIV BGLVJ BGNMA BPHCQ BSONS CAG CCPQU CNYFK COF CS3 CSCUP DDRTE DL5 DNIVK DPUIP DU5 DWQXO EBLON EBS EDO EIOEI EJD ESBYG FEDTE FERAY FFXSO FIGPU FINBP FNLPD FRNLG FRRFC FSGXE FWDCC GGCAI GGRSB GJIRD GNUQQ GNWQR GQ6 GQ7 GQ8 GROUPED_ABI_INFORM_COMPLETE GROUPED_ABI_INFORM_RESEARCH GXS H13 HCIFZ HF~ HG5 HG6 HMJXF HQYDN HRMNR HVGLF HZ~ I-F I09 IHE IJ- IKXTQ ITM IWAJR IXC IXE IZIGR IZQ I~X I~Z J-C J0Z JBSCW JCJTX JZLTJ K60 K6V K6~ K7- KDC KOV KOW LAK LLZTM M0C M0N M1O M4Y MA- N2Q NB0 NDZJH NPVJJ NQJWS NU0 O9- O93 O9G O9I O9J OAM OVD P19 P2P P62 P9O PF0 PQBIZ PQBZA PQQKQ PROAC PT4 PT5 Q2X QOK QOS R4E R89 R9I RHV RNI RNS ROL RPX RSV RZC RZE RZK S16 S1Z S26 S27 S28 S3B SAP SCJ SCLPG SCO SDH SDM SHX SISQX SJYHP SNE SNPRN SNX SOHCF SOJ SPISZ SRMVM SSLCW STPWE SZN T13 T16 TEORI TSG TSK TSV TUC TUS U2A UG4 UOJIU UTJUX UZXMN VC2 VFIZW W23 W48 WK8 YLTOR Z45 Z7R Z7X Z7Z Z81 Z83 Z88 Z8R Z8W Z92 ZMTXR ~A9 ~EX 77I AAPKM AAYXX ABBRH ABDBE ABFSG ABRTQ ACSTC ADHKG AEZWR AFDZB AFFHD AFHIU AFOHR AGQPQ AHPBZ AHWEU AIXLP ATHPR AYFIA CITATION PHGZM PHGZT PQGLB PRQQA 7SC 7XB 8AL 8FD 8FK JQ2 L.- L7M L~C L~D PKEHL PQEST PQUKI PRINS Q9U PUEGO
ID	FETCH-LOGICAL-c371t-54f0c3bbfe27f5b38a22c5c6755a1e763b9cb2703870a3ea3ac2c8b025dc9753
IEDL.DBID	M0C
ISICitedReferencesCount	0
ISICitedReferencesURI	http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000367682400002&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN	1064-7570
IngestDate	Fri Sep 05 06:47:11 EDT 2025 Sun Nov 16 04:01:10 EST 2025 Sat Nov 29 07:54:22 EST 2025 Fri Feb 21 02:37:23 EST 2025
IsPeerReviewed	true
IsScholarly	true
Issue	1
Keywords	Replication of popular data Access cost Asynchronous distributed algorithm Distributed replication group
Language	English
LinkModel	DirectLink
MergedId	FETCHMERGED-LOGICAL-c371t-54f0c3bbfe27f5b38a22c5c6755a1e763b9cb2703870a3ea3ac2c8b025dc9753
Notes	ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 content type line 23
PQID	1753379583
PQPubID	32329
PageCount	23
ParticipantIDs	proquest_miscellaneous_1786195666 proquest_journals_1753379583 crossref_primary_10_1007_s10922_014_9338_0 springer_journals_10_1007_s10922_014_9338_0
PublicationCentury	2000
PublicationDate	2016-01-01
PublicationDateYYYYMMDD	2016-01-01
PublicationDate_xml	– month: 01 year: 2016 text: 2016-01-01 day: 01
PublicationDecade	2010
PublicationPlace	New York
PublicationPlace_xml	– name: New York
PublicationTitle	Journal of network and systems management
PublicationTitleAbbrev	J Netw Syst Manage
PublicationYear	2016
Publisher	Springer US Springer Nature B.V
Publisher_xml	– name: Springer US – name: Springer Nature B.V
References	Zhang (CR21) 2005; 54 Laoutaris, Telelis, Zissimopoulos, Stavrakakis (CR3) 2006; 17 Shi, Beard, Mitchell (CR24) 2009; 66 CR18 Shi, Beard, Mitchell (CR25) 2013; 19 Xueyan, Chanson (CR22) 2004; 15 CR15 Khan, Ahmad (CR4) 2008; 68 CR13 CR10 CR30 Leff, Wolf, Yu (CR1) 1993; 4 Triantafillou, Taylor (CR19) 1994; 5 Krishnan, Raz, Shavitt (CR6) 2000; 8 Kalpakis, Dasgupta, Wolfson (CR12) 2001; 12 Changjie, Zhe, Yuzhuo (CR11) 2001; 2001 Keqiu, Hong, Chin, Weishi (CR14) 2007; 18 Shen, Yang, Chu (CR23) 2003; 14 CR5 Tang, Gupta, Das (CR7) 2008; 7 CR29 CR28 CR27 Zaman, Grosu (CR2) 2011; 22 Yi-Hsuan, Nen-Fu, Yen-Min (CR20) 2011; 22 Baev, Rajaraman, Swamy (CR9) 2008; 38 Loukopoulos, Ahmad (CR16) 2000; 2000 Loukopoulos, Ahmad (CR17) 2004; 64 Shi, Beard, Mitchell (CR26) 2012; 3 Kangasharju, Roberts, Ross (CR8) 2002; 25 SU Khan (9338_CR4) 2008; 68 B Tang (9338_CR7) 2008; 7 J Kangasharju (9338_CR8) 2002; 25 P Triantafillou (9338_CR19) 1994; 5 T Loukopoulos (9338_CR17) 2004; 64 N Laoutaris (9338_CR3) 2006; 17 Z Shi (9338_CR25) 2013; 19 T Loukopoulos (9338_CR16) 2000; 2000 9338_CR27 K Shen (9338_CR23) 2003; 14 9338_CR28 9338_CR29 S Zaman (9338_CR2) 2011; 22 K Kalpakis (9338_CR12) 2001; 12 W Zhang (9338_CR21) 2005; 54 F Yi-Hsuan (9338_CR20) 2011; 22 P Krishnan (9338_CR6) 2000; 8 Z Shi (9338_CR26) 2012; 3 G Changjie (9338_CR11) 2001; 2001 9338_CR30 I Baev (9338_CR9) 2008; 38 9338_CR10 9338_CR5 Z Shi (9338_CR24) 2009; 66 9338_CR13 9338_CR15 9338_CR18 A Leff (9338_CR1) 1993; 4 L Keqiu (9338_CR14) 2007; 18 T Xueyan (9338_CR22) 2004; 15
References_xml	– ident: CR18 – volume: 17 start-page: 1401 issue: 12 year: 2006 end-page: 1413 ident: CR3 article-title: Distributed selfish replication publication-title: IEEE Trans. Parallel Distrib. Syst. doi: 10.1109/TPDS.2006.171 – volume: 22 start-page: 1455 issue: 9 year: 2011 end-page: 1468 ident: CR2 article-title: A distributed algorithm for the replica placement problem publication-title: IEEE Trans. Parallel Distrib. Syst. doi: 10.1109/TPDS.2011.27 – ident: CR30 – volume: 68 start-page: 113 issue: 2 year: 2008 end-page: 136 ident: CR4 article-title: Comparison and analysis of ten static heuristics-based Internet data replication techniques publication-title: J Parallel Distrib. Comput. doi: 10.1016/j.jpdc.2007.06.009 – volume: 25 start-page: 376 issue: 4 year: 2002 end-page: 383 ident: CR8 article-title: Object replication strategies in content distribution networks publication-title: Comput. Commun. doi: 10.1016/S0140-3664(01)00409-1 – ident: CR10 – volume: 5 start-page: 121 issue: 2 year: 1994 end-page: 138 ident: CR19 article-title: Multiclass replicated data management: exploiting replication to improve efficiency publication-title: IEEE Trans. Parallel Distrib. Syst. doi: 10.1109/71.265941 – ident: CR29 – volume: 12 start-page: 628 issue: 6 year: 2001 end-page: 637 ident: CR12 article-title: Optimal placement of replicas in trees with read, write, and storage costs publication-title: IEEE Trans. Parallel Distrib. Syst. doi: 10.1109/71.932716 – ident: CR27 – volume: 22 start-page: 1788 issue: 11 year: 2011 end-page: 1796 ident: CR20 article-title: Efficient and adaptive stateful replication for stream processing engines in high-availability cluster publication-title: IEEE Trans. Parallel Distrib. Syst. doi: 10.1109/TPDS.2011.83 – volume: 15 start-page: 431 issue: 5 year: 2004 end-page: 439 ident: CR22 article-title: Minimal cost replication of dynamic Web contents under flat update delivery publication-title: IEEE Trans. Parallel Distrib. Syst. doi: 10.1109/TPDS.2004.1278100 – volume: 54 start-page: 1547 issue: 12 year: 2005 end-page: 1555 ident: CR21 article-title: Replication cache: a small fully associative cache to improve data cache reliability publication-title: IEEE Trans. Comput. doi: 10.1109/TC.2005.202 – volume: 19 start-page: 393 year: 2013 end-page: 409 ident: CR25 article-title: Analytical models for understanding space, backoff and flow correlation in CSMA wireless networks publication-title: Wirel. Netw. doi: 10.1007/s11276-012-0474-8 – volume: 2000 start-page: 385 year: 2000 end-page: 392 ident: CR16 article-title: Static and adaptive data replication algorithms for fast information access in large distributed systems publication-title: Proc. IEEE Symp. Distrib. Comput. Syst. doi: 10.1109/ICDCS.2000.840950 – volume: 3 start-page: 117 issue: 3 year: 2012 end-page: 120 ident: CR26 article-title: Competition, cooperation, and optimization in multi-hop CSMA networks with correlated traffic publication-title: Int. J. Next-Gener. Comput. – ident: CR15 – volume: 4 start-page: 1185 issue: 11 year: 1993 end-page: 1204 ident: CR1 article-title: Replication algorithms in a remote caching architecture publication-title: IEEE Trans. Parallel Distrib. Syst. doi: 10.1109/71.250099 – volume: 64 start-page: 1270 issue: 11 year: 2004 end-page: 1285 ident: CR17 article-title: Static and adaptive distributed data replication using genetic algorithms publication-title: J. Parallel Distrib. Comput. doi: 10.1016/j.jpdc.2004.04.005 – ident: CR13 – volume: 38 start-page: 1411 issue: 4 year: 2008 end-page: 1429 ident: CR9 article-title: Approximation algorithms for data placement problems publication-title: SIAM J. Comput. doi: 10.1137/080715421 – ident: CR5 – volume: 8 start-page: 568 issue: 5 year: 2000 end-page: 582 ident: CR6 article-title: The cache location problem publication-title: IEEE/ACM Trans. Netw. doi: 10.1109/90.879344 – volume: 2001 start-page: 229 issue: 5 year: 2001 end-page: 234 ident: CR11 article-title: A novel greedy heuristic placement algorithm in distributed cooperative proxy systems publication-title: Proc. IEEE Symp. Info-Tech Info-Net – volume: 14 start-page: 1168 issue: 11 year: 2003 end-page: 1179 ident: CR23 article-title: Clustering support and replication management for scalable network services publication-title: IEEE Trans. Parallel Distrib. Syst. doi: 10.1109/TPDS.2003.1247676 – ident: CR28 – volume: 66 start-page: 469 issue: 9–10 year: 2009 end-page: 487 ident: CR24 article-title: Analytical models for understanding misbehavior and MAC friendliness in CSMA networks publication-title: Perform. Eval. doi: 10.1016/j.peva.2009.02.002 – volume: 7 start-page: 289 issue: 3 year: 2008 end-page: 304 ident: CR7 article-title: Benefit-based data caching in ad hoc networks publication-title: IEEE Trans. Mob. Comput. doi: 10.1109/TMC.2007.70770 – volume: 18 start-page: 212 issue: 2 year: 2007 end-page: 224 ident: CR14 article-title: Multimedia object placement for transparent data replication publication-title: IEEE Trans. Parallel Distrib. Syst. doi: 10.1109/TPDS.2007.29 – ident: 9338_CR18 doi: 10.1109/ICCIT.2009.198 – ident: 9338_CR29 doi: 10.1109/WTS.2013.6566257 – volume: 2001 start-page: 229 issue: 5 year: 2001 ident: 9338_CR11 publication-title: Proc. IEEE Symp. Info-Tech Info-Net – volume: 54 start-page: 1547 issue: 12 year: 2005 ident: 9338_CR21 publication-title: IEEE Trans. Comput. doi: 10.1109/TC.2005.202 – volume: 8 start-page: 568 issue: 5 year: 2000 ident: 9338_CR6 publication-title: IEEE/ACM Trans. Netw. doi: 10.1109/90.879344 – ident: 9338_CR13 doi: 10.1109/ICIAS.2007.4658447 – volume: 3 start-page: 117 issue: 3 year: 2012 ident: 9338_CR26 publication-title: Int. J. Next-Gener. Comput. – volume: 25 start-page: 376 issue: 4 year: 2002 ident: 9338_CR8 publication-title: Comput. Commun. doi: 10.1016/S0140-3664(01)00409-1 – ident: 9338_CR27 – volume: 22 start-page: 1788 issue: 11 year: 2011 ident: 9338_CR20 publication-title: IEEE Trans. Parallel Distrib. Syst. doi: 10.1109/TPDS.2011.83 – volume: 68 start-page: 113 issue: 2 year: 2008 ident: 9338_CR4 publication-title: J Parallel Distrib. Comput. doi: 10.1016/j.jpdc.2007.06.009 – ident: 9338_CR30 doi: 10.4018/978-1-4666-4781-7.ch011 – volume: 14 start-page: 1168 issue: 11 year: 2003 ident: 9338_CR23 publication-title: IEEE Trans. Parallel Distrib. Syst. doi: 10.1109/TPDS.2003.1247676 – volume: 64 start-page: 1270 issue: 11 year: 2004 ident: 9338_CR17 publication-title: J. Parallel Distrib. Comput. doi: 10.1016/j.jpdc.2004.04.005 – ident: 9338_CR10 – volume: 2000 start-page: 385 year: 2000 ident: 9338_CR16 publication-title: Proc. IEEE Symp. Distrib. Comput. Syst. doi: 10.1109/ICDCS.2000.840950 – volume: 22 start-page: 1455 issue: 9 year: 2011 ident: 9338_CR2 publication-title: IEEE Trans. Parallel Distrib. Syst. doi: 10.1109/TPDS.2011.27 – volume: 17 start-page: 1401 issue: 12 year: 2006 ident: 9338_CR3 publication-title: IEEE Trans. Parallel Distrib. Syst. doi: 10.1109/TPDS.2006.171 – volume: 12 start-page: 628 issue: 6 year: 2001 ident: 9338_CR12 publication-title: IEEE Trans. Parallel Distrib. Syst. doi: 10.1109/71.932716 – volume: 18 start-page: 212 issue: 2 year: 2007 ident: 9338_CR14 publication-title: IEEE Trans. Parallel Distrib. Syst. doi: 10.1109/TPDS.2007.29 – volume: 66 start-page: 469 issue: 9–10 year: 2009 ident: 9338_CR24 publication-title: Perform. Eval. doi: 10.1016/j.peva.2009.02.002 – volume: 19 start-page: 393 year: 2013 ident: 9338_CR25 publication-title: Wirel. Netw. doi: 10.1007/s11276-012-0474-8 – volume: 15 start-page: 431 issue: 5 year: 2004 ident: 9338_CR22 publication-title: IEEE Trans. Parallel Distrib. Syst. doi: 10.1109/TPDS.2004.1278100 – volume: 38 start-page: 1411 issue: 4 year: 2008 ident: 9338_CR9 publication-title: SIAM J. Comput. doi: 10.1137/080715421 – ident: 9338_CR15 doi: 10.1007/11590354_88 – ident: 9338_CR5 doi: 10.1109/NCIS.2011.26 – volume: 7 start-page: 289 issue: 3 year: 2008 ident: 9338_CR7 publication-title: IEEE Trans. Mob. Comput. doi: 10.1109/TMC.2007.70770 – ident: 9338_CR28 – volume: 5 start-page: 121 issue: 2 year: 1994 ident: 9338_CR19 publication-title: IEEE Trans. Parallel Distrib. Syst. doi: 10.1109/71.265941 – volume: 4 start-page: 1185 issue: 11 year: 1993 ident: 9338_CR1 publication-title: IEEE Trans. Parallel Distrib. Syst. doi: 10.1109/71.250099
SSID	ssj0008395
Score	2.0100791
Snippet	The replication of popular data objects can effectively reduce the access time and bandwidth requirements of network services. We study the replication problem...
SourceID	proquest crossref springer
SourceType	Aggregation Database Index Database Publisher
StartPage	34
SubjectTerms	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
SummonAdditionalLinks	– databaseName: SpringerLINK Contemporary 1997-Present dbid: RSV link: http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1LT8MwDLbQ4AAHBgNEYaAgcQJF6ittepwY007TBBParUrSFCZBi7aO34_TxzYQHODaRm5lx6849gdwraRiymaCpixIqK-EQ6VKJDUtadJOE4eLCmwiHI34dBqN6z7uRXPbvSlJlpZ6o9ktcs01Ap9iEs4p5unb6O24wWt4eHxamV_0-KwscQY-DVm4KmX-ROKrM1pHmN-KoqWvGbT_9ZcHsF-HlqRX7YVD2NJZB9oNbAOptbgDexszCI9g2Dejcw3qlU5I7_U5n8-Kl7cFwWCWCILxeXOqR8YV9gzJUzIuYb_mZFRdIid9UYhjmAzuJ3dDWsMrUOWFTkGZn9rKkzLVbpgy6XHhuig4zCCYcDTaHRkp6Yamvm0LTwtPKFdxiUFSokw77gm0sjzTp0AihnY1xWeJwISDaaQZer5JppxIRAm34KZhc_xeDdGI1-OSDcNiZFhsGBbbFnQbQcS1Pi1iM0_UCyPGPQuuVq9RE0x5Q2Q6X5o1PDDdj0FgwW0jnA0Sv33w7E-rz2EXY6b6FKYLrWK-1Bewoz6K2WJ-WW7FTymi2Dg priority: 102 providerName: Springer Nature
Title	Distributed Algorithms for a Replication Problem of Popular Network Data
URI	https://link.springer.com/article/10.1007/s10922-014-9338-0 https://www.proquest.com/docview/1753379583 https://www.proquest.com/docview/1786195666
Volume	24
WOSCitedRecordID	wos000367682400002&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText	1
inHoldings	1
isFullTextHit
isPrint
journalDatabaseRights	– providerCode: PRVPQU databaseName: ABI/INFORM Collection customDbUrl: eissn: 1573-7705 dateEnd: 20171231 omitProxy: false ssIdentifier: ssj0008395 issn: 1064-7570 databaseCode: 7WY dateStart: 19990301 isFulltext: true titleUrlDefault: https://www.proquest.com/abicomplete providerName: ProQuest – providerCode: PRVPQU databaseName: ABI/INFORM Global customDbUrl: eissn: 1573-7705 dateEnd: 20171231 omitProxy: false ssIdentifier: ssj0008395 issn: 1064-7570 databaseCode: M0C dateStart: 19990301 isFulltext: true titleUrlDefault: https://search.proquest.com/abiglobal providerName: ProQuest – providerCode: PRVPQU databaseName: Advanced Technologies & Aerospace Database customDbUrl: eissn: 1573-7705 dateEnd: 20171231 omitProxy: false ssIdentifier: ssj0008395 issn: 1064-7570 databaseCode: P5Z dateStart: 19990301 isFulltext: true titleUrlDefault: https://search.proquest.com/hightechjournals providerName: ProQuest – providerCode: PRVPQU databaseName: Computer Science Database customDbUrl: eissn: 1573-7705 dateEnd: 20171231 omitProxy: false ssIdentifier: ssj0008395 issn: 1064-7570 databaseCode: K7- dateStart: 19990301 isFulltext: true titleUrlDefault: http://search.proquest.com/compscijour providerName: ProQuest – providerCode: PRVPQU databaseName: Library Science Database customDbUrl: eissn: 1573-7705 dateEnd: 20171231 omitProxy: false ssIdentifier: ssj0008395 issn: 1064-7570 databaseCode: M1O dateStart: 19990301 isFulltext: true titleUrlDefault: https://search.proquest.com/libraryscience providerName: ProQuest – providerCode: PRVPQU databaseName: ProQuest Central customDbUrl: eissn: 1573-7705 dateEnd: 20171231 omitProxy: false ssIdentifier: ssj0008395 issn: 1064-7570 databaseCode: BENPR dateStart: 19990301 isFulltext: true titleUrlDefault: https://www.proquest.com/central providerName: ProQuest – providerCode: PRVAVX databaseName: SpringerLINK Contemporary 1997-Present customDbUrl: eissn: 1573-7705 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0008395 issn: 1064-7570 databaseCode: RSV dateStart: 19970101 isFulltext: true titleUrlDefault: https://link.springer.com/search?facet-content-type=%22Journal%22 providerName: Springer Nature
link	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1JTxsxFH4ioQd6KLSAmgKRK3FqZTGbxzOniiUoEiKMaFSWy8j2eGilNkkzQ39_35slASS4cLE0i2zLz35--wewb7QRxhGK5yLMeGCUy7XJNKeUNO3kmRupGmxCjkbR9XWcNAa3ogmrbHlixaizqSEb-QFVlPRlLCL_2-wvJ9Qo8q42EBodWCXJhkL6zp3jBSfGy19U3s4w4FLIhVezTp2LPQpKCDiq9BF3Ht9LS2HziX-0unZO11874Q141wic7LDeIe9hxU4-wNsHZQg3YXhC1XMJ-Mpm7PD3HfZS_vxTMJRnmWIooreGPZbU8DNsmrOkQv6as1EdR85OVKm2YHw6GB8PeYOwwI0v3ZKLIHeMr3VuPZkL7UfK85B2qEQI5VpkPTo22pPk4naUb5WvjGcijXJSZigjdxu6k-nEfgQWC2StOb7LFOocwmKf0g9In3JjFWdRD760y5vO6joa6bJiMtEiRVqkRIvU6cFuu6Rpc6SKdLmePfi8-IyHgTwcamKn9_RPFFICZBj24GtLuAddPDfgp5cH3IE1lJMay8sudMv5vd2DN-Zf-auY96Ejr276sHo0GCWX-HQmeb_ah9S6F9gm4hbby-8__gPl8eL6
linkProvider	ProQuest
linkToHtml	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1LTxsxEB5RqAQcyluE8jBSe2llsS-vdw8VQgQUFIhyyIGbZXu9tBIkIVmo-qP4j53ZzSYUCW4cel2vbO9-4_GMxzMfwBdrrLCe0DwXccYjq31ubGY4paQZL8_8RFdkE7LTSa6v0-4cPNW5MHStstaJpaLOBpbOyI-oomQoU5GEx8N7TqxRFF2tKTQqsWi7P7_RZRv_uGgivl-D4Pysd9riE1YBbkPpF1xEuWdDY3IXyFyYMNFBgPNFw1lo3-FyM6k1gaSwrqdDp0NtA5sYtA0yS1mo2O0HWIiwmZZVW_Kp4kdbQ5TB1TjiUshpELXK1EsDugMR8RSdQu79uw3ObNsX4dhylztf-c_-zyp8mpjT7KSS_zWYc_11WH5WZHEDWk2qDUy0Xi5jJ7c3OOni592YobXONEMHpD62ZN2KXIcNctYtec1GrFPdkmdNXehN6L3Hl2zBfH_Qd9vAUoEbR47PMo0elXDYpwwj8hb9VKdZ0oBvNZpqWFUJUbN60AS9QugVQa-8BuzWCKqJwhirGXwNOJw241Kn-I3uu8EDvZPElN4Zxw34XsvJsy5eG3Dn7QEPYLHVu7pUlxed9mdYQotwcsa0C_PF6MHtwUf7WPwaj_ZLcWeg3ll8_gJWtTjP
linkToPdf	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1JT9wwFH6igCo4sLRUDEsxUntpZZHNcXJACDEdgUCjHDigXizbcaBSOwMzAcRP49_xXpYZilRuHHpNItvx-_wWvw3gizVWWE9oXog455HVPjc2N5xS0oxX5H6i62YTst9PLi7SbAYe21wYCqtseWLFqPOhpTvyPaooGcpUJOFe0YRFZN3ewfUNpw5S5Glt22nUEDl1D_dovo33T7pI669B0PtxfnTMmw4D3IbSL7mICs-GxhQukIUwYaKDANeOSrTQvsOjZ1JrAkkuXk-HTofaBjYxqCfkljJScdh3MCfRxKRowkz8nAgB1DtE5WiNIy6FnDhU66y9NKB4iIinaCBy72-RONVzX7hmK4nXW_6P92oFlho1mx3W52IVZtzgAyw-K774EY67VDOY2n25nB3-vsRFl1d_xgy1eKYZGibtdSbL6qY7bFiwrOp3NmL9OnqedXWp1-D8Lf7kE8wOhgO3DiwVKFAKfJZrtLSEwzFlGJEV6ac6zZMOfGspq67r6iFqWieaYKAQBopgoLwObLXUVA0jGaspKTuwO3mNLID8Onrghrf0TRJT2mccd-B7i5lnQ_xrwo3XJ9yB94gadXbSP92EBVQUm6unLZgtR7duG-btXflrPPpcIZ-BemP0PAHJi0Hz
openUrl	ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Distributed+Algorithms+for+a+Replication+Problem+of+Popular+Network+Data&rft.jtitle=Journal+of+network+and+systems+management&rft.au=Jiang%2C+Xiaofeng&rft.au=Li%2C+Jun&rft.au=Xi%2C+Hongsheng&rft.date=2016-01-01&rft.pub=Springer+Nature+B.V&rft.issn=1064-7570&rft.eissn=1573-7705&rft.volume=24&rft.issue=1&rft.spage=34&rft_id=info:doi/10.1007%2Fs10922-014-9338-0&rft.externalDBID=HAS_PDF_LINK&rft.externalDocID=3912261631
thumbnail_l	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1064-7570&client=summon
thumbnail_m	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1064-7570&client=summon
thumbnail_s	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1064-7570&client=summon