{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,2]],"date-time":"2025-08-02T17:34:53Z","timestamp":1754156093656,"version":"3.41.2"},"reference-count":38,"publisher":"Emerald","issue":"1","license":[{"start":{"date-parts":[[2018,4,16]],"date-time":"2018-04-16T00:00:00Z","timestamp":1523836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.emerald.com\/insight\/site-policies"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IJWIS"],"published-print":{"date-parts":[[2018,4,16]]},"abstract":"<jats:sec>\n<jats:title content-type=\"abstract-subheading\">Purpose<\/jats:title>\n<jats:p>One of the techniques for improving the performance of distributed systems is data replication, wherein new replicas are created to provide more accessibility, fault tolerance and lower access cost of the data. In this paper, the authors propose a community-based solution for the management of data replication, based on the graph model of communication latency between computing and storage nodes. Communities are the clusters of nodes that the communication latency between the nodes are minimum values. The purpose of this study if to, by using this method, minimize the latency and access cost of the data.<\/jats:p>\n<\/jats:sec>\n<jats:sec>\n<jats:title content-type=\"abstract-subheading\">Design\/methodology\/approach<\/jats:title>\n<jats:p>This paper used the Louvain algorithm for finding the best communities. In the proposed algorithm, by requesting a file according to the nodes of each community, the cost of accessing the file located out of the applicant\u2019s community was calculated and the results were accumulated. On exceeding the accumulated costs from a specified threshold, a new replica of the file was created in the applicant\u2019s community. Besides, the number of replicas of each file should be limited to prevent the system from creating useless and redundant data.<\/jats:p>\n<\/jats:sec>\n<jats:sec>\n<jats:title content-type=\"abstract-subheading\">Findings<\/jats:title>\n<jats:p>To evaluate the method, four metrics were introduced and measured, including communication latency, response time, data access cost and data redundancy. The results indicated acceptable improvement in all of them.<\/jats:p>\n<\/jats:sec>\n<jats:sec>\n<jats:title content-type=\"abstract-subheading\">Originality\/value<\/jats:title>\n<jats:p>So far, this is the first research that aims at managing the replicas via community detection algorithms. It opens many opportunities for further studies in this area.<\/jats:p>\n<\/jats:sec>","DOI":"10.1108\/ijwis-01-2017-0006","type":"journal-article","created":{"date-parts":[[2018,2,27]],"date-time":"2018-02-27T19:07:35Z","timestamp":1519758455000},"page":"41-61","source":"Crossref","is-referenced-by-count":1,"title":["Community-based replica management in distributed systems"],"prefix":"10.1108","volume":"14","author":[{"given":"Masoud","family":"Nosrati","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mahmood","family":"Fazlali","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"140","reference":[{"issue":"4","key":"key2020093012390075700_ref001","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1177\/10943420030174005","article-title":"Optorsim: a grid simulator for studying dynamic data replication strategies","volume":"17","year":"2003","journal-title":"International Journal of High Performance Computing Applications"},{"issue":"10","key":"key2020093012390075700_ref002","doi-asserted-by":"publisher","DOI":"10.1088\/1742-5468\/2008\/10\/P10008","article-title":"Fast unfolding of communities in large networks","volume":"2008","year":"2008","journal-title":"Journal of Statistical Mechanics: Theory and Experiment"},{"issue":"9","key":"key2020093012390075700_ref003","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1145\/362342.362367","article-title":"Algorithm 457: finding all cliques of an undirected graph","volume":"16","year":"1973","journal-title":"Communications of the ACM"},{"key":"key2020093012390075700_ref004","doi-asserted-by":"crossref","unstructured":"Celaya, J. and Arronategui, U. (2010), \u201cDistributed scheduler of workflows with deadlines in a P2P desktop grid\u201d, paper presented at the 18th Euromicro Conference on Parallel, Distributed and Network-based Processing.","DOI":"10.1109\/PDP.2010.41"},{"issue":"3","key":"key2020093012390075700_ref005","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/s11227-008-0172-6","article-title":"A dynamic data replication strategy using access-weights in data grids","volume":"45","year":"2008","journal-title":"The Journal of Supercomputing"},{"issue":"1","key":"key2020093012390075700_ref006","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1016\/j.future.2010.11.009","article-title":"A P2P computing system for overlay networks","volume":"29","year":"2013","journal-title":"Future Generation Computer Systems"},{"issue":"2","key":"key2020093012390075700_ref007","doi-asserted-by":"publisher","first-page":"1277","DOI":"10.14778\/1454159.1454167","article-title":"PNUTS: Yahoo!\u2019s hosted data serving platform","volume":"1","year":"2008","journal-title":"Proceedings of the VLDB Endowment"},{"volume-title":"Distributed Systems: Concepts and Design","year":"2011","key":"key2020093012390075700_ref008"},{"issue":"3","key":"key2020093012390075700_ref009","doi-asserted-by":"publisher","first-page":"036111","DOI":"10.1103\/PhysRevE.77.036111","article-title":"Communicability in complex networks","volume":"77","year":"2008","journal-title":"Physical Review E"},{"issue":"2","key":"key2020093012390075700_ref010","doi-asserted-by":"publisher","first-page":"500","DOI":"10.1016\/j.amc.2009.04.024","article-title":"Communicability graph and community structures in complex networks","volume":"214","year":"2009","journal-title":"Applied Mathematics and Computation"},{"issue":"3\/5","key":"key2020093012390075700_ref011","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.physrep.2009.11.002","article-title":"Community detection in graphs","volume":"486","year":"2010","journal-title":"Physics Reports"},{"issue":"36","key":"key2020093012390075700_ref012","doi-asserted-by":"publisher","first-page":"14534","DOI":"10.1073\/pnas.1221839110","article-title":"Efficient discovery of overlapping communities in massive networks","volume":"110","year":"2013","journal-title":"Proceedings of the National Academy of Sciences"},{"issue":"6","key":"key2020093012390075700_ref013","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1002\/wics.1319","article-title":"Community detection in large\u2010scale networks: a survey and empirical evaluation","volume":"6","year":"2014","journal-title":"Wiley Interdisciplinary Reviews: Computational Statistics"},{"key":"key2020093012390075700_ref014","doi-asserted-by":"crossref","unstructured":"Khodamoradi, P., Fazlali, M., Mardukhi, F. and Nosrati, M. (2015), \u201cHeuristic metamorphic malware detection based on statistics of assembly instructions using classification algorithms\u201d, paper presented at 2015 18th CSI International Symposium on the Computer Architecture and Digital Systems (CADS).","DOI":"10.1109\/CADS.2015.7377792"},{"issue":"3","key":"key2020093012390075700_ref015","doi-asserted-by":"publisher","first-page":"969","DOI":"10.1007\/s00453-015-9978-9","article-title":"New approximation results for resource replication problems","volume":"74","year":"2016","journal-title":"Algorithmica"},{"volume-title":"Distributed Computing: Principles, Algorithms, and Systems","year":"2008","key":"key2020093012390075700_ref016"},{"key":"key2020093012390075700_ref017","unstructured":"Lamehamedi, H., Shentu, Z., Szymanski, B. and Deelman, E. (2003), \u201cSimulation of dynamic data replication strategies in data grids\u201d, paper presented at the Parallel and Distributed Processing Symposium."},{"issue":"5","key":"key2020093012390075700_ref018","doi-asserted-by":"publisher","first-page":"658","DOI":"10.1002\/cpe.1545","article-title":"Mining@ home: toward a public\u2010resource computing framework for distributed data mining","volume":"22","year":"2010","journal-title":"Concurrency and Computation: Practice and Experience"},{"issue":"1\/2","key":"key2020093012390075700_ref019","doi-asserted-by":"publisher","first-page":"693","DOI":"10.14778\/1920841.1920930","article-title":"Scalable discovery of best clusters on large graphs","volume":"3","year":"2010","journal-title":"Proceedings of the VLDB Endowment"},{"key":"key2020093012390075700_ref020","doi-asserted-by":"crossref","unstructured":"Moradi, E., Fazlali, M. and Malazi, H.T. (2015), \u201cFast parallel community detection algorithm based on modularity\u201d, paper presented at the 18th CSI International Symposium on Computer Architecture and Digital Systems (CADS).","DOI":"10.1109\/CADS.2015.7377794"},{"issue":"2","key":"key2020093012390075700_ref021","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.69.026113","article-title":"Finding and evaluating community structure in networks","volume":"69","year":"2004","journal-title":"Physical Review E"},{"key":"key2020093012390075700_ref022","doi-asserted-by":"crossref","unstructured":"Nosrati, M. (2017), \u201cExact requirements engineering for developing business process models\u201d, paper presented at the 3rd International Conference on Web Research.","DOI":"10.1109\/ICWR.2017.7959319"},{"key":"key2020093012390075700_ref023","doi-asserted-by":"crossref","unstructured":"Nosrati, M. and Karimi, R. (2011), \u201cDetection of circular shapes from impulse noisy images using median and Laplacian filter and circular Hough transform\u201d, paper presented at 8th International Conference on the Electrical Engineering Computing Science and Automatic Control (CCE), Mexico.","DOI":"10.1109\/ICEEE.2011.6106710"},{"issue":"1","key":"key2020093012390075700_ref024","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1108\/IJWIS-10-2015-0031","article-title":"Energy efficient and latency optimized media resource allocation","volume":"12","year":"2016","journal-title":"International Journal of Web Information Systems"},{"issue":"1","key":"key2020093012390075700_ref025","doi-asserted-by":"publisher","first-page":"5","DOI":"10.21828\/WAP-06-01-002","article-title":"Investigating a benchmark cloud media resource allocation and optimization","volume":"6","year":"2016","journal-title":"World Applied Programming"},{"key":"key2020093012390075700_ref026","first-page":"355","article-title":"Latency optimization for resource allocation in cloud computing system","volume-title":"Lecture Notes in Computer Science","year":"2015"},{"issue":"7043","key":"key2020093012390075700_ref027","doi-asserted-by":"publisher","first-page":"814","DOI":"10.1038\/nature03607","article-title":"Uncovering the overlapping community structure of complex networks in nature and society","volume":"435","year":"2005","journal-title":"Nature"},{"issue":"3","key":"key2020093012390075700_ref028","doi-asserted-by":"publisher","first-page":"036106","DOI":"10.1103\/PhysRevE.76.036106","article-title":"Near linear time algorithm to detect community structures in large-scale networks","volume":"76","year":"2007","journal-title":"Physical Review E"},{"issue":"1","key":"key2020093012390075700_ref029","first-page":"1","article-title":"Investigating the relationship between IT capabilities and corporate entrepreneurship","volume":"7","year":"2017","journal-title":"World Applied Programming"},{"key":"key2020093012390075700_ref030","first-page":"1014","article-title":"The educational and early occupational status attainment process: replication and revision","year":"1970","journal-title":"American Sociological Review"},{"year":"2013","key":"key2020093012390075700_ref031","article-title":"Resource allocation in a network-based cloud computing environment: design challenges"},{"key":"key2020093012390075700_ref032","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-016-0922-3","article-title":"Cloud resource provisioning: survey, status and future research directions","year":"2016","journal-title":"Knowledge and Information Systems"},{"key":"key2020093012390075700_ref033","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1007\/s10723-015-9359-2","article-title":"A survey on resource scheduling in cloud computing: issues and challenges","volume":"14","year":"2016","journal-title":"Journal of Grid Computing"},{"issue":"2","key":"key2020093012390075700_ref034","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1007\/s11390-012-1221-4","article-title":"Modeling a dynamic data replication strategy to increase system availability in cloud computing environments","volume":"27","year":"2012","journal-title":"Journal of Computer Science and Technology"},{"edition":"2nd","volume-title":"Distributed Systems: Principles and Paradigms","year":"2001","key":"key2020093012390075700_ref035"},{"key":"key2020093012390075700_ref036","doi-asserted-by":"crossref","unstructured":"Wei, Q., Veeravalli, B., Gong, B., Zeng, L. and Feng, D. (2010), \u201cCDRM: A cost-effective dynamic replication management scheme for cloud storage cluster\u201d, paper presented at the 2010 IEEE international conference on cluster computing.","DOI":"10.1109\/CLUSTER.2010.24"},{"volume-title":"The Every Computer Performance Book","year":"2013","key":"key2020093012390075700_ref037"},{"key":"key2020093012390075700_ref038","doi-asserted-by":"crossref","unstructured":"Xie, J. and Szymanski, B.K. (2012). \u201cTowards linear time overlapping community detection in social networks\u201d, paper presented at the Pacific-Asia Conference on Knowledge Discovery and Data Mining.","DOI":"10.1007\/978-3-642-30220-6_3"}],"container-title":["International Journal of Web Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.emerald.com\/insight\/content\/doi\/10.1108\/IJWIS-01-2017-0006\/full\/xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.emerald.com\/insight\/content\/doi\/10.1108\/IJWIS-01-2017-0006\/full\/html","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,24]],"date-time":"2025-07-24T22:23:41Z","timestamp":1753395821000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.emerald.com\/ijwis\/article\/14\/1\/41-61\/165034"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,4,16]]},"references-count":38,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,4,16]]}},"alternative-id":["10.1108\/IJWIS-01-2017-0006"],"URL":"https:\/\/doi.org\/10.1108\/ijwis-01-2017-0006","relation":{},"ISSN":["1744-0084"],"issn-type":[{"type":"print","value":"1744-0084"}],"subject":[],"published":{"date-parts":[[2018,4,16]]}}}