{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T03:46:25Z","timestamp":1725680785462},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642300448"},{"type":"electronic","value":"9783642300455"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-30045-5_23","type":"book-chapter","created":{"date-parts":[[2012,5,15]],"date-time":"2012-05-15T04:33:29Z","timestamp":1337056409000},"page":"304-317","source":"Crossref","is-referenced-by-count":7,"title":["Efficient and Secure Decentralized Network Size Estimation"],"prefix":"10.1007","author":[{"given":"Nathan","family":"Evans","sequence":"first","affiliation":[]},{"given":"Bartlomiej","family":"Polot","sequence":"additional","affiliation":[]},{"given":"Christian","family":"Grothoff","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"23_CR1","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/978-0-387-09457-1_6","volume-title":"Grid Computing","author":"J. Bustos-Jimenez","year":"2008","unstructured":"Bustos-Jimenez, J., Bersano, N., Schaeffer, S.E., Piquer, J.M., Iosup, A., Ciuffoletti, A.: Estimating the size of peer-to-peer networks using lambert\u2019s w function. In: Gorlatch, S., Fragopoulou, P., Priol, T. (eds.) Grid Computing, pp. 61\u201372. Springer, US (2008)"},{"key":"23_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/3-540-45748-8_24","volume-title":"Peer-to-Peer Systems","author":"J.R. Douceur","year":"2002","unstructured":"Douceur, J.R.: The Sybil Attack. In: Druschel, P., Kaashoek, M.F., Rowstron, A. (eds.) IPTPS 2002. LNCS, vol.\u00a02429, pp. 251\u2013260. Springer, Heidelberg (2002)"},{"key":"23_CR3","doi-asserted-by":"crossref","first-page":"290","DOI":"10.5486\/PMD.1959.6.3-4.12","volume":"6","author":"P. Erd\u0151s","year":"1959","unstructured":"Erd\u0151s, P., R\u00e9nyi, A.: On random graphs. I. Publ. Math. Debrecen\u00a06, 290\u2013297 (1959)","journal-title":"Publ. Math. Debrecen"},{"key":"23_CR4","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1145\/945506.945507","volume":"21","author":"P.T.. Eugster","year":"2003","unstructured":"Eugster, P.T., Guerraoui, R., Handurukande, S.B., Kouznetsov, P., Kermarrec, A.-M.: Lightweight probabilistic broadcast. ACM Trans. Comput. Syst.\u00a021, 341\u2013374 (2003)","journal-title":"ACM Trans. Comput. Syst."},{"key":"23_CR5","unstructured":"Evans, N., Grothoff, C.: Beyond simulation: Large-scale distributed emulation of p2p protocols. In: 4th Workshop on Cyber Security Experimentation and Test (CSET 2011). USENIX Association (2011)"},{"key":"23_CR6","doi-asserted-by":"crossref","unstructured":"Evans, N., Grothoff, C.: R5n: Randomized recursive routing for restricted-route networks. In: 5th International Conference on Network and System Security. IEEE, Milan (2011)","DOI":"10.1109\/ICNSS.2011.6060022"},{"key":"23_CR7","doi-asserted-by":"crossref","unstructured":"Evans, N., Grothoff, C., Polot, B.: Efficient and secure decentralized network size estimation. Technical report, Technische Universit\u00e4t M\u00fcnchen (2011)","DOI":"10.1007\/978-3-642-30045-5_23"},{"key":"23_CR8","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1145\/1082469.1082470","volume":"23","author":"M. Jelasity","year":"2005","unstructured":"Jelasity, M., Montresor, A., Babaoglu, O.: Gossip-based aggregation in large dynamic networks. ACM Trans. Comput. Syst.\u00a023, 219\u2013252 (2005)","journal-title":"ACM Trans. Comput. Syst."},{"issue":"1","key":"23_CR9","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1002\/j.1538-7305.1970.tb01770.x","volume":"49","author":"B.W. Kernighan","year":"1970","unstructured":"Kernighan, B.W., Lin, S.: An Efficient Heuristic Procedure for Partitioning Graphs. The Bell System Technical Journal\u00a049(1), 291\u2013307 (1970)","journal-title":"The Bell System Technical Journal"},{"key":"23_CR10","doi-asserted-by":"publisher","first-page":"1330","DOI":"10.1137\/070697793","volume":"38","author":"J. Kleinberg","year":"2008","unstructured":"Kleinberg, J., Sandler, M., Slivkins, A.: Network failure detection and graph connectivity. SIAM J. Comput.\u00a038, 1330\u20131346 (2008)","journal-title":"SIAM J. Comput."},{"key":"23_CR11","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1109\/NCA.2005.15","volume-title":"Proceedings of the Fourth IEEE International Symposium on Network Computing and Applications","author":"D. Kostoulas","year":"2005","unstructured":"Kostoulas, D., Psaltoulis, D., Gupta, I., Birman, K., Demers, A.: Decentralized schemes for size estimation in large and dynamic groups. In: Proceedings of the Fourth IEEE International Symposium on Network Computing and Applications, pp. 41\u201348. IEEE Computer Society, Washington, DC (2005)"},{"key":"23_CR12","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1145\/571825.571857","volume-title":"PODC 2002: Proceedings of the Twenty-First Annual Symposium on Principles of Distributed Computing","author":"D. Malkhi","year":"2002","unstructured":"Malkhi, D., Naor, M., Ratajczak, D.: Viceroy: a scalable and dynamic emulation of the butterfly. In: PODC 2002: Proceedings of the Twenty-First Annual Symposium on Principles of Distributed Computing, pp. 183\u2013192. ACM, New York (2002)"},{"key":"23_CR13","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1016\/j.tcs.2005.10.007","volume":"351","author":"D. Marx","year":"2006","unstructured":"Marx, D.: Parameterized graph separation problems. Theor. Comput. Sci.\u00a0351, 394\u2013406 (2006)","journal-title":"Theor. Comput. Sci."},{"key":"23_CR14","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1145\/1146381.1146402","volume-title":"Proceedings of the Twenty-Fifth Annual ACM Symposium on Principles of Distributed Computing, PODC 2006","author":"L. Massouli\u00e9","year":"2006","unstructured":"Massouli\u00e9, L., Le Merrer, E., Kermarrec, A.-M., Ganesh, A.: Peer counting and sampling in overlay networks: random walk methods. In: Proceedings of the Twenty-Fifth Annual ACM Symposium on Principles of Distributed Computing, PODC 2006, pp. 123\u2013132. ACM, New York (2006)"},{"key":"23_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/3-540-45748-8_5","volume-title":"Peer-to-Peer Systems","author":"P. Maymounkov","year":"2002","unstructured":"Maymounkov, P., Mazi\u00e8res, D.: Kademlia: A Peer-to-Peer Information System Based on the XOR Metric. In: Druschel, P., Kaashoek, M.F., Rowstron, A. (eds.) IPTPS 2002. LNCS, vol.\u00a02429, pp. 53\u201365. Springer, Heidelberg (2002)"},{"key":"23_CR16","unstructured":"Le Merrer, E., Kermarrec, A.-M., Massouli, L.: Peer to peer size estimation in large and dynamic networks: A comparative study. In: 15th IEEE International Symposium on High Performance Distributed Computing 2006, pp. 7\u201317 (2006)"},{"key":"23_CR17","unstructured":"Polot, B.: Adapting blackhat approaches to increase the resilience of whitehat application scenarios. Master\u2019s thesis, Technische Universit\u00e4t M\u00fcnchen (2010)"},{"key":"23_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/3-540-45518-3_18","volume-title":"Middleware 2001","author":"A. Rowstron","year":"2001","unstructured":"Rowstron, A., Druschel, P.: Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems. In: Guerraoui, R. (ed.) Middleware 2001. LNCS, vol.\u00a02218, pp. 329\u2013350. Springer, Heidelberg (2001)"},{"key":"23_CR19","unstructured":"Serjantov, A., Lewis, S.: Puzzles in p2p systems. In: 8th CaberNet Radicals Workshop, Corsica (2003)"},{"key":"23_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/978-3-540-92157-8_7","volume-title":"Self-Organizing Systems","author":"T.M. Shafaat","year":"2008","unstructured":"Shafaat, T.M., Ghodsi, A., Haridi, S.: A Practical Approach to Network Size Estimation for Structured Overlays. In: Hummel, K.A., Sterbenz, J.P.G. (eds.) IWSOS 2008. LNCS, vol.\u00a05343, pp. 71\u201383. Springer, Heidelberg (2008)"}],"container-title":["Lecture Notes in Computer Science","NETWORKING 2012"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-30045-5_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,22]],"date-time":"2023-06-22T19:03:38Z","timestamp":1687460618000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-30045-5_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642300448","9783642300455"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-30045-5_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}