{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T18:23:00Z","timestamp":1743099780586,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540921561"},{"type":"electronic","value":"9783540921578"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-92157-8_7","type":"book-chapter","created":{"date-parts":[[2008,11,28]],"date-time":"2008-11-28T21:54:09Z","timestamp":1227909249000},"page":"71-83","source":"Crossref","is-referenced-by-count":19,"title":["A Practical Approach to Network Size Estimation for Structured Overlays"],"prefix":"10.1007","author":[{"given":"Tallat M.","family":"Shafaat","sequence":"first","affiliation":[]},{"given":"Ali","family":"Ghodsi","sequence":"additional","affiliation":[]},{"given":"Seif","family":"Haridi","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"7_CR1","volume-title":"Proceedings of the ACM SIGCOMM 2004 Symposium on Communication, Architecture, and Protocols","author":"A.R. Bharambe","year":"2004","unstructured":"Bharambe, A.R., Agrawal, M., Seshan, S.: Mercury: Supporting Scalable Multi-Attribute Range Queries. In: Proceedings of the ACM SIGCOMM 2004 Symposium on Communication, Architecture, and Protocols, OR, USA. ACM Press, New York (2004)"},{"key":"7_CR2","unstructured":"Binzenh\u00f6fer, A., Staehle, D., Henjes, R.: On the fly estimation of the peer population in a chord-based p2p system. In: 19th International Teletraffic Congress (ITC19), Beijing, China (September 2005)"},{"key":"7_CR3","unstructured":"Ghodsi, A.: Distributed k-ary System: Algorithms for Distributed Hash Tables. PhD dissertation, KTH\u2014Royal Institute of Technology, Stockholm, Sweden (December 2006)"},{"key":"7_CR4","volume-title":"Proc. of the 24th Annual Joint Conf. of the IEEE Computer and Communications Societies (INFOCOM 2005)","author":"P.B. Godfrey","year":"2005","unstructured":"Godfrey, P.B., Stoica, I.: Heterogeneity and Load Balance in Distributed Hash Tables. In: Proc. of the 24th Annual Joint Conf. of the IEEE Computer and Communications Societies (INFOCOM 2005), FL, USA. IEEE Comp. Society, Los Alamitos (2005)"},{"key":"7_CR5","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1145\/637201.637203","volume-title":"IMW 2002: Proceedings of the 2nd ACM SIGCOMM Workshop on Internet measurment","author":"K.P. Gummadi","year":"2002","unstructured":"Gummadi, K.P., Saroiu, S., Gribble, S.D.: King: estimating latency between arbitrary internet end hosts. In: IMW 2002: Proceedings of the 2nd ACM SIGCOMM Workshop on Internet measurment, pp. 5\u201318. ACM, New York (2002)"},{"issue":"5","key":"7_CR6","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/j.ipl.2003.08.011","volume":"88","author":"K. Horowitz","year":"2003","unstructured":"Horowitz, K., Malkhi, D.: Estimating network size from local information. Information Processing Letters\u00a088(5), 237\u2013243 (2003)","journal-title":"Information Processing Letters"},{"key":"7_CR7","unstructured":"Jelasity, M., Kowalczyk, W., van Steen, M.: Newscast Computing. Technical Report IR\u2013CS\u2013006, Vrije Universiteit (November 2003)"},{"key":"7_CR8","doi-asserted-by":"crossref","unstructured":"Jelasity, M., Montresor, A., Babaoglu, \u00d6.: Gossip-based Aggregation in Large Dynamic Networks. ACM Trans. on Computer Systems (TOCS)\u00a023(3) (August 2005)","DOI":"10.1145\/1082469.1082470"},{"key":"7_CR9","doi-asserted-by":"crossref","unstructured":"Kempe, D., Dobra, A., Gehrke, J.: Gossip-based computation of aggregate information. In: 44th Symp. on Foundations of Computer Science, FOCS (2003)","DOI":"10.1109\/SFCS.2003.1238221"},{"key":"7_CR10","doi-asserted-by":"crossref","unstructured":"Kostoulas, D., Psaltoulis, D., Gupta, I., Birman, K., Demers, A.J.: Decentralized schemes for size estimation in large and dynamic groups. In: 4th IEEE International Symp. on Network Computing and Applications (NCA 2005), pp. 41\u201348 (2005)","DOI":"10.1109\/NCA.2005.15"},{"key":"7_CR11","unstructured":"Li, J., Stribling, J., Morris, R., Kaashoek, M.F.: Bandwidth-efficient management of DHT routing tables. In: Proc. of the 2nd USENIX Symp. on Networked Systems Design and Implementation (NSDI 2005), MA, USA, May 2005, USENIX (2005)"},{"key":"7_CR12","first-page":"233","volume-title":"Proceedings of the 21st Annual ACM Symposium on Principles of Distributed Computing (PODC 2002)","author":"D. Liben-Nowell","year":"2002","unstructured":"Liben-Nowell, D., Balakrishnan, H., Karger, D.R.: Analysis of the Evolution of Peer-to-Peer Systems. In: Proceedings of the 21st Annual ACM Symposium on Principles of Distributed Computing (PODC 2002), pp. 233\u2013242. ACM Press, New York (2002)"},{"key":"7_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/978-3-540-45172-3_2","volume-title":"Peer-to-Peer Systems II","author":"R. Mahajan","year":"2003","unstructured":"Mahajan, R., Castro, M., Rowstron, A.: Controlling the Cost of Reliability in Peer-to-Peer Overlays. In: Kaashoek, M.F., Stoica, I. (eds.) IPTPS 2003. LNCS, vol.\u00a02735, pp. 21\u201332. Springer, Heidelberg (2003)"},{"key":"7_CR14","volume-title":"Proceedings of the 21st Annual ACM Symposium on Principles of Distributed Computing (PODC 2002)","author":"D. Malkhi","year":"2002","unstructured":"Malkhi, D., Naor, M., Ratajczak, D.: Viceroy: A scalable and dynamic emulation of the butterfly. In: Proceedings of the 21st Annual ACM Symposium on Principles of Distributed Computing (PODC 2002). ACM Press, New York (2002)"},{"key":"7_CR15","doi-asserted-by":"crossref","unstructured":"Massouli\u00e9, L., Merrer, E.L., Kermarrec, A., Ganesh, A.J.: Peer counting and sampling in overlay networks: random walk methods. In: Proc. of the 25th Annual ACM Symp. on Principles of Distributed Computing (PODC), pp. 123\u2013132 (2006)","DOI":"10.1145\/1146381.1146402"},{"key":"7_CR16","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., Mazieres, 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":"7_CR17","first-page":"7","volume-title":"Proc. of the 15th IEEE Symposium on High Performance Distributed Computing","author":"E.L. Merrer","year":"2006","unstructured":"Merrer, E.L., Kermarrec, A.-M., Massoulie, L.: Peer to peer size estimation in large and dynamic networks: A comparative study. In: Proc. of the 15th IEEE Symposium on High Performance Distributed Computing, pp. 7\u201317. IEEE, Los Alamitos (2006)"},{"key":"7_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, distributed 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":"7_CR19","unstructured":"SicsSim (2008), http:\/\/dks.sics.se\/iwsos08sizeest\/"},{"key":"7_CR20","first-page":"149","volume-title":"Proceedings of the ACM SIGCOMM 2001 Symposium on Communication, Architecture, and Protocols","author":"I. Stoica","year":"2001","unstructured":"Stoica, I., Morris, R., Karger, D.R., Kaashoek, M.F., Balakrishnan, H.: Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications. In: Proceedings of the ACM SIGCOMM 2001 Symposium on Communication, Architecture, and Protocols, San Deigo, CA, August 2001, pp. 149\u2013160. ACM Press, New York (2001)"}],"container-title":["Lecture Notes in Computer Science","Self-Organizing Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-92157-8_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,15]],"date-time":"2019-05-15T17:09:59Z","timestamp":1557940199000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-92157-8_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540921561","9783540921578"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-92157-8_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}