{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:37:14Z","timestamp":1725518234221},"publisher-location":"Boston, MA","reference-count":14,"publisher":"Springer US","isbn-type":[{"type":"print","value":"9780387094892"},{"type":"electronic","value":"9780387094908"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-0-387-09490-8_3","type":"book-chapter","created":{"date-parts":[[2008,8,28]],"date-time":"2008-08-28T05:21:58Z","timestamp":1219900918000},"page":"25-36","source":"Crossref","is-referenced-by-count":0,"title":["Replicated Random Walks for Service Advertising in Unstructured Environments"],"prefix":"10.1007","author":[{"given":"Dimitris","family":"Kogias","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Konstantions","family":"Oikonomou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ioannis","family":"Stavrakakis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"3_CR1","unstructured":"Gnutella. Gnutella rfc. http:\/\/rfc-gnutella.sourceforge.net\/, 2002."},{"key":"3_CR2","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1109\/TIT.1983.1056620","volume":"29","author":"A. Segall","year":"1983","unstructured":"A. Segall, \u201cDistributed network protocols\u201d, IEEE Transactions on Information Theory, vol. IT-29, pp. 23\u201335, 1983.","journal-title":"IEEE Transactions on Information Theory"},{"key":"3_CR3","doi-asserted-by":"crossref","unstructured":"B. Williams, T. Camp, \u201cComparison of broadcasting techniques for mobile ad hoc networks\u201d, MOBIHOC 2002, pp.194\u2013205, 2002.","DOI":"10.1145\/513824.513825"},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"F. Banaei-Kashani and C. Shahabi, \u201cCriticality-based analysis and design of unstructured peerto-peer network as \u201ccomplex\u201d systems\u201d, in Proceedings of the Third International Symposium on Cluster Computing and the Grid, pages 351\u2013358, 2003.","DOI":"10.1109\/CCGRID.2003.1199387"},{"issue":"11","key":"3_CR5","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1109\/TPDS.2006.161","volume":"17","author":"V. Dimakopoulos","year":"2006","unstructured":"V. Dimakopoulos and E. Pitoura, \u201cOn the performance of flooding-based resource discovery\u201d, IEEE Transactions on Parallel and Distributed Systems, 17(11):290\u2013297, November 2006.","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"K. Oikonomou and I. Stavrakakis, \u201cPerformance analysis of probabilistic flooding using random graphs\u201d, in The First International IEEE WoWMoM Workshop on Autonomic and Opportunistic Communications (AOC 2007), Helsinki, Finland, 18 June, 2007.","DOI":"10.1109\/WOWMOM.2007.4351694"},{"key":"3_CR7","unstructured":"Y. Sasson, D. Cavin, and A. Schiper, \u201cProbabilistic broadcast for flooding in wireless mobile ad hoc networks\u201d, in Swiss Federal Institute of Technology (EPFL), Technical Report IC\/2002\/54, 2002."},{"key":"3_CR8","unstructured":"D. Tsoumakos and N. Roussopoulos, \u201cAdaptive probabilistic search for peer-to-peer networks\u201d, in 3rd IEEE International Conference on P2P Computing, 2003."},{"key":"3_CR9","unstructured":"M. Bani Yassein, M. Ould-Khaoua and S. Papanastasiou, \u201cOn the Performance of Probabilistic Flooding in Mobile Ad Hoc Networks\u201d, in 11th International Conference on Parallel and Distributed Systems (ICPAD \u203205), 2005."},{"key":"3_CR10","doi-asserted-by":"crossref","unstructured":"N. Alon, C. Avin, M. Koucky, G. Kozma, Z. Lotker, M. Tuttle, \u201cMany Random Walks Are Faster Than One\u201d, ArXiv e-prints. Vol. 705, May 2007.","DOI":"10.1145\/1378533.1378557"},{"key":"3_CR11","doi-asserted-by":"crossref","unstructured":"C. Gkantsidis, M. Mihail and A. Saberi, \u201cRandom Walks in Peer-to-Peer Networks\u201d, in Proceedings of IEEE INFOCOM, 2004.","DOI":"10.1109\/INFCOM.2004.1354487"},{"key":"3_CR12","doi-asserted-by":"publisher","first-page":"1526","DOI":"10.1109\/INFCOM.2005.1498436","volume":"3","author":"C. Gkantsidis","year":"2005","unstructured":"C. Gkantsidis, M. Mihail and A. Saberi, \u201cHybrid Search Scemes for Unstructured Peer-to-Peer networks\u201d, in Proceedings of the 24th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM\u203205), vol. 3, pp. 1526\u20131537, Miami, Fla, USA, March 2005.","journal-title":"Proceedings of the 24th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM\u203205)"},{"key":"3_CR13","volume-title":"Fundamentals of Domination in Graphs","author":"T. Haynes","year":"1998","unstructured":"T. Haynes, S. Hedetniemi and P. Slater, \u201cFundamentals of Domination in Graphs\u201d, Marcel Dekker, New York, 1998."},{"key":"3_CR14","unstructured":"P.B. Mirchandani and R.L. Francis, \u201cDiscrete Location Theory\u201d, John Wiley and Sons, 1990."}],"container-title":["IFIP International Federation for Information Processing","Advances in Ad Hoc Networking"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-09490-8_3.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T16:33:40Z","timestamp":1605630820000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-0-387-09490-8_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9780387094892","9780387094908"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-09490-8_3","relation":{},"ISSN":["1571-5736"],"issn-type":[{"type":"print","value":"1571-5736"}],"subject":[]}}