{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,2]],"date-time":"2025-08-02T18:05:19Z","timestamp":1754157919512,"version":"3.41.2"},"reference-count":25,"publisher":"Emerald","issue":"1","license":[{"start":{"date-parts":[[2009,4,3]],"date-time":"2009-04-03T00:00:00Z","timestamp":1238716800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.emerald.com\/insight\/site-policies"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009,4,3]]},"abstract":"<jats:sec><jats:title content-type=\"abstract-heading\">Purpose<\/jats:title><jats:p>The purpose of this paper is to propose MUREX, a mutable replica control scheme, to keep one\u2010copy equivalence for synchronous replication in structured peer\u2010to\u2010peer (P2P) storage systems.<\/jats:p><\/jats:sec><jats:sec><jats:title content-type=\"abstract-heading\">Design\/methodology\/approach<\/jats:title><jats:p>For synchronous replication in P2P networks, it is proper to adopt crash\u2010recovery as the fault model; that is, nodes are fail\u2010stop and can recover and rejoin the system after synchronizing their states with other active nodes. In addition to the state synchronization problem, the paper identifies other two problems to solve for synchronous replication in P2P storage systems. They are the replica acquisition and the replica migration problems.<\/jats:p><\/jats:sec><jats:sec><jats:title content-type=\"abstract-heading\">Findings<\/jats:title><jats:p>On the basis of multi\u2010column read\/write quorums, MUREX conquers the problems by the replica pointer, the on\u2010demand replica regeneration, and the leased lock techniques.<\/jats:p><\/jats:sec><jats:sec><jats:title content-type=\"abstract-heading\">Originality\/value<\/jats:title><jats:p>The paper proves the correctness of MUREX, analyzes and also simulates it in terms of communication cost and operation success rate.<\/jats:p><\/jats:sec>","DOI":"10.1108\/17427370910950285","type":"journal-article","created":{"date-parts":[[2009,4,27]],"date-time":"2009-04-27T05:19:01Z","timestamp":1240809541000},"page":"9-24","source":"Crossref","is-referenced-by-count":3,"title":["MUREX"],"prefix":"10.1108","volume":"5","author":[{"given":"Jehn\u2010Ruey","family":"Jiang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chung\u2010Ta","family":"King","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chi\u2010Shiang","family":"Liao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ching\u2010Hao","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"140","reference":[{"key":"key2022032220042373400_b1","unstructured":"Agrawal, D. and Abbadi, A.E. (1990), \u201cThe tree quorum protocol: an efficient approach for managing replicated data\u201d, Proceedings of the 16th International Conference on Very Large Data Bases, Brisbane, pp. 243\u201054."},{"key":"key2022032220042373400_b2","doi-asserted-by":"crossref","unstructured":"Bhagwan, R., Moore, D., Savage, S. and Voelker, G. (2003), \u201cReplication strategies for highly available peer\u2010to\u2010peer storage\u201d, Proceedings of the International Workshop on Future Directions in Distributed Computing, Bertinoro (Forl\u00ed), pp. 153\u20108, available at: www.cs.unibo.it\/fudico\/","DOI":"10.1007\/3-540-37795-6_28"},{"key":"key2022032220042373400_b3","unstructured":"Castro, M. and Liskov, B. (1999), \u201cPractical Byzantine fault tolerance\u201d, Proceedings of the 3rd Symposium on Operating Systems Design and Implementation, New Orleans, 22\u201025 February."},{"key":"key2022032220042373400_b4","doi-asserted-by":"crossref","unstructured":"Cheung, S.Y., Ammar, M.H. and Ahamad, M. (1992), \u201cThe grid protocol: a high performance scheme for maintaining replicated data\u201d, IEEE Transactions on Knowledge and Data Engineering, Vol. 4 No. 6, pp. 582\u201092.","DOI":"10.1109\/69.180609"},{"key":"key2022032220042373400_b5","unstructured":"Chockler, G., Malkhi, D. and Reiter, M.K. (2001), \u201cBackoff protocols for distributed mutual exclusion and ordering\u201d, Proceedings of the 21st International Conference on Distributed Computing Systems, pp. 11\u201020."},{"key":"key2022032220042373400_b6","unstructured":"Cohen, E. and Shenker, S. (2002a), \u201cThe Gnutella 0.6 protocol draft\u201d, June, available at: http:\/\/rfc\u2010gnutella.sourceforge.net\/src\/rfc\u20100_6\u2010draft.html"},{"key":"key2022032220042373400_b7","doi-asserted-by":"crossref","unstructured":"Cohen, E. and Shenker, S. (2002b), \u201cReplication strategies in unstructured peer\u2010to\u2010peer networks\u201d, Proceedings of the SIGCOMM, Pittsburgh Supercomputing Center, available at: http:\/\/conferences.sigcomm.org\/sigcomm\/2002\/","DOI":"10.1145\/633025.633043"},{"key":"key2022032220042373400_b8","doi-asserted-by":"crossref","unstructured":"Dabek, F., Kaashoek, M., Karger, D., Morris, R. and Stoica, I. (2001), \u201cWide\u2010area cooperative storage with CFS\u201d, Proceedings of the 18th ACM Symposium on Operating Systems Principles (SOSP '01), Chateau Lake Louise, Banff, available at: http:\/\/sosp.org\/2001\/","DOI":"10.1145\/502034.502054"},{"key":"key2022032220042373400_b9","doi-asserted-by":"crossref","unstructured":"Druschel, P. and Rowstron, A. (2001), \u201cPast: a large\u2010scale, persistent peer\u2010to\u2010peer storage utility\u201d, Proceedings of the HotOS VIII, 82493 Elmau\/Oberbayern, pp. 75\u201080, available at: http:\/\/i30www.ira.uka.de\/conferences\/HotOS\/","DOI":"10.1145\/502034.502053"},{"key":"key2022032220042373400_b10","doi-asserted-by":"crossref","unstructured":"Gifford, D.K. (1979), \u201cWeighted voting for replicated data\u201d, Proceedings of the 7th ACM Symposium on Operating Systems Principles, Pacific Grove, CA, pp. 150\u201062, available at: www.informatik.uni\u2010trier.de\/\u223cley\/db\/conf\/sosp\/sosp79.html","DOI":"10.1145\/800215.806583"},{"key":"key2022032220042373400_b11","doi-asserted-by":"crossref","unstructured":"Gopalakrishnan, V., Silaghi, B., Bhattacharjee, B. and Keleher, P. (2004), \u201cAdaptive replication in peer\u2010to\u2010peer systems\u201d, Proceedings of the International Conference on Distributed Computing Systems, pp. 360\u20109.","DOI":"10.1109\/ICDCS.2004.1281601"},{"key":"key2022032220042373400_b12","doi-asserted-by":"crossref","unstructured":"Hsiao, H.C. and King, C.T. (2004), \u201cTornado: a capability\u2010aware peer\u2010to\u2010peer storage overlay\u201d, Journal of Parallel and Distributed Computing, Vol. 64 No. 6, pp. 747\u201058.","DOI":"10.1016\/j.jpdc.2003.10.008"},{"key":"key2022032220042373400_b13","doi-asserted-by":"crossref","unstructured":"Jiang, J.R. (1995), \u201cThe column protocol: a high availability and low message cost solution for managing replicated data\u201d, International Journal of Information Systems, Vol. 20 No. 8, pp. 687\u201096.","DOI":"10.1016\/0306-4379(95)00037-2"},{"key":"key2022032220042373400_b14","doi-asserted-by":"crossref","unstructured":"Lamport, L., Shostak, R. and Pease, M. (1982), \u201cThe Byzantine generals problem\u201d, ACM Transactions on Programming Languages and Systems, Vol. 4 No. 3, pp. 382\u2010401.","DOI":"10.1145\/357172.357176"},{"key":"key2022032220042373400_b15","doi-asserted-by":"crossref","unstructured":"Lin, S., Lian, M. and Zhang, Z. (2004), \u201cA practical distributed mutual exclusion protocol in dynamic peer\u2010to\u2010peer systems\u201d, Proceedings of the 3rd International Workshop on Peer\u2010to\u2010Peer Systems (IPTPS'04), San Diego, CA, available at: www.iptps.org\/","DOI":"10.1007\/978-3-540-30183-7_2"},{"key":"key2022032220042373400_b16","doi-asserted-by":"crossref","unstructured":"Muthitacharoen, A., Morris, R. Gil, T. and Chen, B. (2002), \u201cIvy: a read\/write peer\u2010to\u2010peer file system\u201d, Proceedings of the 5th Symposium on Operating Systems Design and Implementation, Boston Park Plaza, Boston, MA, available at: www.usenix.org\/events\/osdi02\/","DOI":"10.1145\/1060289.1060293"},{"key":"key2022032220042373400_b17","unstructured":"Napster (n.d.), Napster Website, available at: www.napster.com"},{"key":"key2022032220042373400_b18","doi-asserted-by":"crossref","unstructured":"Ratnasamy, S., Francis, P., Handley, M., Karp, R. and Schenker, S. (2001), \u201cA scalable content\u2010addressable network\u201d, Proceedings of the ACM SIGCOMM, Mandeville Auditorium, UC San Diego, CA, ACM Press, pp. 161\u201072, available at: http:\/\/conferences.sigcomm.org\/sigcomm\/2001\/","DOI":"10.1145\/964723.383072"},{"key":"key2022032220042373400_b19","doi-asserted-by":"crossref","unstructured":"Rodrig, M. and Lamarca, A. (2003), \u201cDecentralized weighted voting for P2P data management\u201d, Proceedings of the 3rd ACM International Workshop on Data Engineering for Wireless and Mobile Access, San Diego, CA, pp. 85\u201092.","DOI":"10.1145\/940923.940939"},{"key":"key2022032220042373400_b20","doi-asserted-by":"crossref","unstructured":"Rowstron, A. and Druschel, P. (2001), \u201cPastry: scalable, decentralized object location, and routing for large\u2010scale peer\u2010to\u2010peer systems\u201d, Proceedings of the 18th IFIP\/ACM International Conference on Distributed Systems Platforms (Middleware 2001), Heidelberg, November 2001, pp. 329\u201050.","DOI":"10.1007\/3-540-45518-3_18"},{"key":"key2022032220042373400_b21","doi-asserted-by":"crossref","unstructured":"Stein, C., Tucker, M. and Seltzer, M. (2002), \u201cBuilding a reliable mutable file system on peer\u2010to\u2010peer storage\u201d, Proceedings of the 21st IEEE Symposium on Reliable Distributed Systems (SRDS'02), Convention Center, Osaka University, Suita, p. 324, available at: www.ise4.ist.osaka\u2010u.ac.jp\/SRDS2002\/","DOI":"10.1109\/RELDIS.2002.1180204"},{"key":"key2022032220042373400_b22","doi-asserted-by":"crossref","unstructured":"Stoica, I., Morris, R., Karger, D., Kaashoek, F. and Balakrishnan, H. (2001), \u201cChord: a scalable peer\u2010to\u2010peer lookup service for internet applications\u201d, Proceedings of the ACM SIGCOMM, Mandeville Auditorium, UC San Diego, CA, pp. 149\u201060, available at: http:\/\/conferences.sigcomm.org\/sigcomm\/2001\/","DOI":"10.1145\/964723.383071"},{"key":"key2022032220042373400_b23","doi-asserted-by":"crossref","unstructured":"Thomas, R.H. (1979), \u201cA majority consensus approach to concurrency control for multiple copy databases\u201d, ACM Transactions on Database Systems (TODS), Vol. 4 No. 2, pp. 180\u2010209.","DOI":"10.1145\/320071.320076"},{"key":"key2022032220042373400_b24","doi-asserted-by":"crossref","unstructured":"Yu, H. and Vahdat, A. (2005), \u201cConsistent and automatic replica regeneration\u201d, Transactions on Storage, Vol. 1 No. 1, pp. 3\u201037.","DOI":"10.1145\/1044956.1044958"},{"key":"key2022032220042373400_b25","doi-asserted-by":"crossref","unstructured":"Zhao, B.Y., Kubiatowicz, J. and Joseph, A. (2002), \u201cTapestry: a fault\u2010tolerant wide\u2010area application infrastructure\u201d, Computer Communication Review, Vol. 32 No. 1, p. 81.","DOI":"10.1145\/510726.510755"}],"container-title":["International Journal of Pervasive Computing and Communications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.emeraldinsight.com\/doi\/full-xml\/10.1108\/17427370910950285","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.emerald.com\/insight\/content\/doi\/10.1108\/17427370910950285\/full\/xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.emerald.com\/insight\/content\/doi\/10.1108\/17427370910950285\/full\/html","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,25]],"date-time":"2025-07-25T00:24:12Z","timestamp":1753403052000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.emerald.com\/ijpcc\/article\/5\/1\/9-24\/161544"}},"subtitle":["A mutable replica control scheme for structured peer\u2010to\u2010peer storage systems"],"editor":[{"given":"J.H.","family":"Abawajy","sequence":"first","affiliation":[],"role":[{"role":"editor","vocabulary":"crossref"}]}],"short-title":[],"issued":{"date-parts":[[2009,4,3]]},"references-count":25,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2009,4,3]]}},"alternative-id":["10.1108\/17427370910950285"],"URL":"https:\/\/doi.org\/10.1108\/17427370910950285","relation":{},"ISSN":["1742-7371"],"issn-type":[{"type":"print","value":"1742-7371"}],"subject":[],"published":{"date-parts":[[2009,4,3]]}}}