{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T14:54:23Z","timestamp":1773240863827,"version":"3.50.1"},"reference-count":27,"publisher":"Oxford University Press (OUP)","issue":"10","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["The Computer Journal"],"published-print":{"date-parts":[[2016,10]]},"DOI":"10.1093\/comjnl\/bxw038","type":"journal-article","created":{"date-parts":[[2016,7,16]],"date-time":"2016-07-16T01:59:28Z","timestamp":1468634368000},"page":"1492-1510","source":"Crossref","is-referenced-by-count":1,"title":["Statistical Estimation and Dynamic Adaptation Algorithms for the iTrust Publication, Search and Retrieval System"],"prefix":"10.1093","volume":"59","author":[{"given":"Yung-Ting","family":"Chuang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P. M.","family":"Melliar-Smith","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Louise E.","family":"Moser","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Isai\u00ed Michel","family":"Lombera","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"286","published-online":{"date-parts":[[2016,7,15]]},"reference":[{"key":"2017011902300837000_59.10.1492.1","doi-asserted-by":"crossref","unstructured":"Peng, B. , Moser, L.E. , Melliar-Smith, P.M. , Chuang, Y.T. and Michel Lombera, I. (2013) A distributed ranking algorithm for the iTrust information search and retrieval system. In Proc. 9th Int. Conf. Web Information Systems and Technologies, Aachen, Germany, May 8\u201310, pp. 199\u2013208. Institute for Systems and Technologies of Information, Control and Communication (INSTICC), Lisbon, Portugal.","DOI":"10.5220\/0004355601990208"},{"key":"2017011902300837000_59.10.1492.2","doi-asserted-by":"crossref","unstructured":"Clarke, I. , Sandberg, O. , Wiley, B. and Hong, T. (2000) Freenet: A distributed anonymous information storage and retrieval system. In Proc. Int. Workshop on Design Issues in Anonymity and Unobservability, Berkeley, CA, July 25\u201326, pp. 46\u201366. Springer, Berlin Heidelberg.","DOI":"10.1007\/3-540-44702-4_4"},{"key":"2017011902300837000_59.10.1492.3","unstructured":"Cohen, B. (2003) Incentives build robustness in BitTorrent. In Proc. First Workshop on the Economics of Peer-to-Peer Systems, Vol. 6. Berkeley, CA, June 5\u20136, pp. 68\u201372. http:\/\/groups.ischool.berkeley.edu\/archive\/p2pecon\/papers\/s4-cohen.pdf (Retrieved March 1, 2016)."},{"key":"2017011902300837000_59.10.1492.4","doi-asserted-by":"crossref","unstructured":"Terpstra, W.W. , Kangasharju, J. , Leng, C. and Buchmann, A.P. (2007) BubbleStorm: Resilient, probabilistic, and exhaustive peer-to-peer search. In Proc. ACM Conf. Applications, Technologies, Architectures and Protocols for Computer Communications, Kyoto, Japan, August 27\u201331, pp. 49\u201360. ACM, New York, NY.","DOI":"10.1145\/1282380.1282387"},{"key":"2017011902300837000_59.10.1492.5","doi-asserted-by":"crossref","unstructured":"Tsoumakos, D. and Roussopoulos, N. (2003) Adaptive probabilistic search for peer-to-peer networks. In Proc. 3rd IEEE Int. Conf. Peer-to-Peer Comput., Linkoping, Sweden, September 1\u20133, pp. 102\u2013109. IEEE Computer Society, Los Alamitos, CA.","DOI":"10.1109\/PTP.2003.1231509"},{"key":"2017011902300837000_59.10.1492.6","doi-asserted-by":"crossref","unstructured":"Condie, T. , Kamvar, S.D. and Garcia-Molina, H. (2004) Adaptive peer-to-peer topologies. In Proc. 4th IEEE Int. Conf. Peer-to-Peer Computing, Zurich, Switzerland, August 25\u201327, pp. 53\u201362. IEEE Computer Society, Los Alamitos, CA.","DOI":"10.1109\/PTP.2004.1334931"},{"key":"2017011902300837000_59.10.1492.7","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2003.1176982"},{"key":"2017011902300837000_59.10.1492.8","doi-asserted-by":"crossref","unstructured":"Zage, D. , Livadas, C. and Schooler, E.M. (2009) A network-aware distributed membership protocol for collaborative defense. In Proc. 12th IEEE Int. Conf. Comput. Sci. Engg, Vol. 4, Vancouver, Canada, August 29\u201331, pp. 1123\u20131130. IEEE Computer Society, Los Alamitos, CA.","DOI":"10.1109\/CSE.2009.173"},{"key":"2017011902300837000_59.10.1492.9","unstructured":"Michel Lombera, I. , Chuang, Y.T. , Melliar-Smith, P.M. and Moser, L.E. (2011) Trustworthy distribution and retrieval of information over HTTP and the Internet. In Proc. 3rd Int. Conf. Evolving Internet, Luxembourg City, Luxembourg, June 19\u201324, pp. 7\u201313. Curran Associates, Inc., Red Hook, NY."},{"key":"2017011902300837000_59.10.1492.10","unstructured":"Chuang, Y.T. , Melliar-Smith, P.M. , Moser, L.E. and Michel Lombera, I. (2013) Discovering joining nodes and detecting leaving nodes in the iTrust membership protocol. In Proc. Int. MultiConf. Eng. Comput. Scientists, Vol. 1, Hong Kong, China, March 13\u201315, pp. 189\u2013194. International Association of Engineers (IAENG), Hong Kong, China."},{"key":"2017011902300837000_59.10.1492.11","doi-asserted-by":"publisher","DOI":"10.5626\/JCSE.2012.6.3.179"},{"key":"2017011902300837000_59.10.1492.12","doi-asserted-by":"crossref","unstructured":"Melliar-Smith, P.M. , Moser, L.E. , Michel Lombera, I. and Chuang, Y.T. (2012) iTrust: Trustworthy information publication, search and retrieval. In Proc. 13th Int. Conf. Distributed Comput. Netw., LNCS 7129, Hong Kong, China, January 3\u20136, pp. 351\u2013366. Springer, Berlin Heidelberg.","DOI":"10.1007\/978-3-642-25959-3_26"},{"key":"2017011902300837000_59.10.1492.13","doi-asserted-by":"crossref","unstructured":"Badger, C.M. , Moser, L.E. , Melliar-Smith, P.M. , Michel Lombera, I. and Chuang, Y.T. (2012) Declustering the iTrust search and retrieval network to increase trustworthiness. In Proc. 8th Int. Conf. Web Information Systems and Technologies, Porto, Portugal, April 18\u201321, pp. 312\u2013322. Institute for Systems and Technologies of Information, Control and Communication (INSTICC), Lisbon, Portugal.","DOI":"10.5220\/0003908503120322"},{"key":"2017011902300837000_59.10.1492.14","doi-asserted-by":"crossref","unstructured":"Ferreira, R.A. , Ramanathan, M.K. , Awan, A. , Grama, A. and Jagannathan, S. (2005) Search with probabilistic guarantees in unstructured peer-to-peer networks. In Proc. 5th IEEE Int. Conf. Peer-to-Peer Computing, Konstanz, Germany, August 31\u2013September 2, pp. 165\u2013172. IEEE Computer Society, Los Alamitos, CA.","DOI":"10.1109\/P2P.2005.33"},{"key":"2017011902300837000_59.10.1492.15","doi-asserted-by":"crossref","unstructured":"Lv, Q. , Cao, P. , Cohen, E. , Li, K. and Shenker, S. (2002) Search and replication in unstructured peer-to-peer networks. In Proc. 16th Int. Conf. Supercomputing, Baltimore, MD, June 22\u201326, pp. 84\u201395. ACM, New York, NY.","DOI":"10.1145\/514203.514206"},{"key":"2017011902300837000_59.10.1492.16","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1109\/MNET.2004.1265831","article-title":"A methodology for the design of distributed search in P2P middleware","volume":"18","author":"Mischke","year":"2004","journal-title":"IEEE Netw."},{"key":"2017011902300837000_59.10.1492.17","unstructured":"Gnutella . (2000) http:\/\/en.wikipedia.org\/wiki\/Gnutella (Retrieved May 1, 2015)."},{"key":"2017011902300837000_59.10.1492.18","doi-asserted-by":"crossref","unstructured":"Chawathe, Y. , Ratnasamy, S. , Breslau, L. Lanham, N. and Shenker, S. (2003) Making Gnutella-like P2P systems scalable. In Proc. ACM Special Interest Group on Data Communications Conference, Karlsruhe, Germany, August 25\u201329, pp. 407\u2013418. ACM, New York, NY.","DOI":"10.1145\/863955.864000"},{"key":"2017011902300837000_59.10.1492.19","doi-asserted-by":"crossref","unstructured":"Cohen, E. and Shenker, S. (2002) Replication strategies in unstructured peer-to-peer networks. In Proc. ACM Special Interest Group on Data Communications Conf., Pittsburgh, PA, August 19\u201323, pp. 177\u2013190. ACM, New York, NY.","DOI":"10.1145\/633025.633043"},{"key":"2017011902300837000_59.10.1492.20","unstructured":"Asthana, H. and Cox, I.J. (2013) Retrieval of highly dynamic information in an unstructured peer-to-peer network. In Proc. Workshop on Large-Scale and Distributed Systems for Information Retrieval, Rome, Italy, February 5, pp. 5\u201310. ACM, New York, NY."},{"key":"2017011902300837000_59.10.1492.21","doi-asserted-by":"crossref","unstructured":"Richardson, S. and Cox, I.J. (2014) Estimating global statistics for unstructured P2P search in the presence of adversarial peers. In Proc. 37th Int. ACM Conf. Research and Development in Information Retrieval, Gold Coast, Queensland, Australia, July 6\u201311, pp. 203\u2013212. ACM, New York, NY.","DOI":"10.1145\/2600428.2609567"},{"key":"2017011902300837000_59.10.1492.22","doi-asserted-by":"crossref","unstructured":"Chandra, T.D. Hadzilacos, V. , Toueg, S. and Charron-Bost, B. (1996) On the impossibility of group membership. In Proc. 15th ACM Symposium on Principles of Distributed Computing, Philadelphia, PA, May 23\u201326, pp. 322\u2013330. ACM, New York, NY.","DOI":"10.1145\/248052.248120"},{"key":"2017011902300837000_59.10.1492.23","doi-asserted-by":"crossref","unstructured":"Cuenca-Acuna, F.M. , Peery, C. , Martin, R.P. and Nguyen, T.D. (2003) PlanetP: Using gossiping to build content addressable peer-to-peer information sharing communities. In Proc. 12th IEEE Int. Symposium on High Performance Distributed Computing, Seattle, WA, June 22\u201324, pp. 236\u2013246. IEEE Computer Society, Los Alamitos, CA.","DOI":"10.1109\/HPDC.2003.1210033"},{"key":"2017011902300837000_59.10.1492.24","doi-asserted-by":"crossref","unstructured":"Leng, C. , Terpstra, W.W. , Kemme, B. , Stannat, W. and Buchmann, A.P. (2008) Maintaining replicas in unstructured P2P systems. In Proc. ACM Conf. Emerging Networking Experiments and Technologies, Madrid, Spain, December 9\u201312, p. 19. ACM, New York, NY.","DOI":"10.1145\/1544012.1544031"},{"key":"2017011902300837000_59.10.1492.25","doi-asserted-by":"crossref","unstructured":"Liu, H. , Liu, X. , Song, W. and Wen, W. (2011) An age-based membership protocol against strong churn in unstructured P2P networks. In Proc. 2011 Int. Conf. Netw. Comput. Infor. Sec., Vol. 2, Guilin, China, May 14\u201315, pp. 195\u2013200. Curran Associates, Inc., Red Hook, NY.","DOI":"10.1109\/NCIS.2011.137"},{"key":"2017011902300837000_59.10.1492.26","doi-asserted-by":"crossref","unstructured":"Gramoli, V. , Kermarrec, A.M. and Le Merrer, E. (2008) Distributed churn measurement in arbitrary networks. In Proc. 27th ACM Symposium on Principles of Distributed Computing, Toronto, Ontario, Canada, August 18\u201321, p. 431. ACM, New York, NY.","DOI":"10.1145\/1400751.1400824"},{"key":"2017011902300837000_59.10.1492.27","doi-asserted-by":"crossref","unstructured":"Pruteanu, A. , Iyer, V. and Dulman, S. (2011) ChurnDetect: A gossip-based churn estimator for large-scale dynamic networks. In Proc. Euro-Par 2011 Conf., LNCS 7155, Bordeaux, France, August 29\u2013September 2, pp. 289\u2013301. Springer, Berlin Heidelberg.","DOI":"10.1007\/978-3-642-23397-5_29"}],"container-title":["The Computer Journal"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/academic.oup.com\/comjnl\/article-pdf\/59\/10\/1492\/10322711\/bxw038.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,4]],"date-time":"2025-06-04T01:36:58Z","timestamp":1749001018000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/comjnl\/article-lookup\/doi\/10.1093\/comjnl\/bxw038"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,7,15]]},"references-count":27,"journal-issue":{"issue":"10","published-online":{"date-parts":[[2016,10,14]]},"published-print":{"date-parts":[[2016,10]]}},"alternative-id":["10.1093\/comjnl\/bxw038"],"URL":"https:\/\/doi.org\/10.1093\/comjnl\/bxw038","relation":{},"ISSN":["0010-4620","1460-2067"],"issn-type":[{"value":"0010-4620","type":"print"},{"value":"1460-2067","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,7,15]]}}}