{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T14:41:24Z","timestamp":1740148884331,"version":"3.37.3"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2020,11,13]],"date-time":"2020-11-13T00:00:00Z","timestamp":1605225600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,11,13]],"date-time":"2020-11-13T00:00:00Z","timestamp":1605225600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100002322","name":"Coordena\u00e7\u00e3o de Aperfei\u00e7oamento de Pessoal de N\u00edvel Superior","doi-asserted-by":"publisher","award":["Finance Code 001"],"award-info":[{"award-number":["Finance Code 001"]}],"id":[{"id":"10.13039\/501100002322","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Peer-to-Peer Netw. Appl."],"published-print":{"date-parts":[[2021,3]]},"DOI":"10.1007\/s12083-020-01012-2","type":"journal-article","created":{"date-parts":[[2020,11,13]],"date-time":"2020-11-13T15:02:38Z","timestamp":1605279758000},"page":"687-707","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Revisiting the coupon collector\u2019s problem to unveil users\u2019 online sessions in networked systems"],"prefix":"10.1007","volume":"14","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7536-0586","authenticated-orcid":false,"given":"Weverton","family":"Cordeiro","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luciano","family":"Gaspary","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rafael","family":"Beltran","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kayu\u00e3","family":"Paim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rodrigo","family":"Mansilha","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,11,13]]},"reference":[{"key":"1012_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jnca.2015.02.001","volume":"52","author":"AV Vasilakos","year":"2015","unstructured":"Vasilakos AV, Li Z, Simon G, You W (2015) Information centric network: Research challenges and opportunities. J Netw Comput Appl 52:1\u201310","journal-title":"J Netw Comput Appl"},{"key":"1012_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jnca.2019.01.030","volume":"132","author":"J Han","year":"2019","unstructured":"Han J, Choi D, Chung T, Chuah C-N, Kim H-C, Kwon TT (2019) Predicting content consumption from content-to-content relationships. J Netw Comput Appl 132:1\u20139","journal-title":"J Netw Comput Appl"},{"key":"1012_CR3","doi-asserted-by":"crossref","unstructured":"Tokuyama K, Miyoshi N (2018) Data rate and handoff rate analysis for user mobility in cellular networks. In: 2018 IEEE wireless communications and networking conference (WCNC). IEEE, pp 1\u20136","DOI":"10.1109\/WCNC.2018.8377167"},{"key":"1012_CR4","doi-asserted-by":"crossref","unstructured":"Lareida A, Ho\u00dffeld T, Stiller B (2017) The bittorrent peer collector problem. In: 2017 IFIP\/IEEE symposium on integrated network and service management (IM). IEEE, pp 449\u2013455","DOI":"10.23919\/INM.2017.7987311"},{"key":"1012_CR5","unstructured":"Zannettou S, Caulfield T, Blackburn J, De Cristofaro E, Sirivianos M, Stringhini G, Suarez-Tangil G (2018), NY, USA"},{"issue":"5","key":"1012_CR6","doi-asserted-by":"publisher","first-page":"1197","DOI":"10.1016\/j.comnet.2010.11.011","volume":"55","author":"T Ho\u00dffeld","year":"2011","unstructured":"Ho\u00dffeld T, Lehrieder F, Hock D, Oechsner S, Despotovic Z, Kellerer W, Michel M (2011) Characterization of BitTorrent swarms and their distribution in the Internet. Comput Netw 55(5):1197\u20131215","journal-title":"Comput Netw"},{"issue":"4","key":"1012_CR7","doi-asserted-by":"publisher","first-page":"866","DOI":"10.2307\/1427566","volume":"22","author":"W Stadje","year":"1990","unstructured":"Stadje W (1990) The collector\u2019s problem with group drawings. Adv Appl Probab 22(4):866\u2013882","journal-title":"Adv Appl Probab"},{"key":"1012_CR8","doi-asserted-by":"crossref","unstructured":"Cuevas R, Kryczka M, Cuevas A, Kaune S, Guerrero C, Rejaie R (2010) Is content publishing in BitTorrent altruistic or profit-driven?. In: 6Th international conference on emerging networking EXperiments and technologies (co-NEXT\u201910)","DOI":"10.1145\/1921168.1921183"},{"key":"1012_CR9","doi-asserted-by":"crossref","unstructured":"Yoshida M, Nakao A (2011) Measuring BitTorrent swarms beyond reach. In: IEEE international conference on peer-to-peer computing (P2P 2011), pp 220\u2013229","DOI":"10.1109\/P2P.2011.6038740"},{"key":"1012_CR10","doi-asserted-by":"crossref","unstructured":"Mansilha RB, Bays LR, Lehmann MB, Mezzomo A, Facchini G, Gaspary LP, Barcellos MP (2011) Observing the bittorrent universe through telescopes. In: 2011 IFIP\/IEEE international symposium on integrated network management","DOI":"10.1109\/INM.2011.5990707"},{"issue":"5","key":"1012_CR11","doi-asserted-by":"publisher","first-page":"3191","DOI":"10.1109\/TNET.2016.2514523","volume":"24","author":"D Nyang","year":"2016","unstructured":"Nyang D, Shin D (2016) Recyclable counter with confinement for real-time per-flow measurement. IEEE\/ACM Trans Netw 24(5):3191\u20133203","journal-title":"IEEE\/ACM Trans Netw"},{"key":"1012_CR12","doi-asserted-by":"crossref","unstructured":"Tan R, Kong X, Zhang Y, Tan Q, Lu H, Li M, Sun Y (2019) Bitcoin network size estimation based on coupon collection model. In: International conference on artificial intelligence and security. Springer, pp 298\u2013307","DOI":"10.1007\/978-3-030-24268-8_28"},{"key":"1012_CR13","doi-asserted-by":"publisher","unstructured":"Smith JA, Moody J, Morgan JH (2017) Network sampling coverage ii: The effect of non-random missing data on network measurement. Soc Netw 48:78\u201399. https:\/\/doi.org\/10.1016\/j.socnet.2016.04.005, http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0378873316301551","DOI":"10.1016\/j.socnet.2016.04.005"},{"issue":"8","key":"1012_CR14","doi-asserted-by":"publisher","first-page":"1834","DOI":"10.1109\/TMC.2017.2777491","volume":"17","author":"H Flores","year":"2017","unstructured":"Flores H, Hui P, Nurmi P, Lagerspetz E, Tarkoma S, Manner J, Kostakos V, Li Y, Su X (2017) Evidence-aware mobile computational offloading. IEEE Trans Mob Comput 17(8):1834\u20131850","journal-title":"IEEE Trans Mob Comput"},{"key":"1012_CR15","doi-asserted-by":"crossref","unstructured":"Lareida A, Stiller B (2018) Big torrent measurement: a country-, network-, and content-centric analysis of video sharing in bittorrent. In: NOMS 2018\u20132018 IEEE\/IFIP network operations and management symposium. IEEE, pp 1\u20139","DOI":"10.1109\/NOMS.2018.8406243"},{"key":"1012_CR16","doi-asserted-by":"crossref","unstructured":"Padmanabhan R, Schulman A, Levin D, Spring N (2019) Residential links under the weather. In: Proceedings of the ACM special interest group on data communication, SIGCOMM \u201919. ACM, New York, pp 145\u2013158","DOI":"10.1145\/3341302.3342084"},{"key":"1012_CR17","doi-asserted-by":"crossref","unstructured":"Xie K, Wang L, Wang X, Xie G, Wen J, Zhang G (2016) Accurate recovery of internet traffic data: A tensor completion approach. In: IEEE INFOCOM 2016 - the 35th annual IEEE international conference on computer communications, pp 1\u20139","DOI":"10.1109\/INFOCOM.2016.7524463"},{"key":"1012_CR18","doi-asserted-by":"publisher","unstructured":"Xie K, Peng C, Wang X, Xie G, Wen J (2017) Accurate recovery of internet traffic data under dynamic measurements. In: IEEE INFOCOM 2017 - the 36th annual IEEE international conference on computer communications, pp 1\u20139. https:\/\/doi.org\/10.1109\/INFOCOM.2017.8057218","DOI":"10.1109\/INFOCOM.2017.8057218"},{"key":"1012_CR19","doi-asserted-by":"publisher","unstructured":"Zhou H, Tan L, Zeng Q, Wu C (2016) Traffic matrix estimation: A neural network approach with extended input and expectation maximization iteration. J Netw Comput Appl 60:220\u2013232. https:\/\/doi.org\/10.1016\/j.jnca.2015.11.013","DOI":"10.1016\/j.jnca.2015.11.013"},{"issue":"2","key":"1012_CR20","doi-asserted-by":"publisher","first-page":"793","DOI":"10.1109\/TNET.2018.2797094","volume":"26","author":"K Xie","year":"2018","unstructured":"Xie K, Wang L, Wang X, Xie G, Wen J, Zhang G, Cao J, Zhang D (2018) Accurate recovery of internet traffic data: A sequential tensor completion approach. IEEE\/ACM Trans Netw 26 (2):793\u2013806","journal-title":"IEEE\/ACM Trans Netw"},{"key":"1012_CR21","doi-asserted-by":"publisher","unstructured":"Cheng L, Niu J, Kong L, Luo C, Gu Y, He W, Das SK (2017) Co mpressive sensing based data quality improvement for crowd-sensing applications. J Netw Comput Appl 77:123\u2013134. https:\/\/doi.org\/10.1016\/j.jnca.2016.10.004, http:\/\/www.sciencedirect.com\/science\/article\/pii\/S1084804516302338","DOI":"10.1016\/j.jnca.2016.10.004"},{"key":"1012_CR22","doi-asserted-by":"crossref","unstructured":"Xie K, Chen Y, Wang X, Xie G, Cao J, Wen J (2020) Accurate and fast recovery of network monitoring data: A gpu accelerated matrix completion. IEEE\/ACM Trans Netw:1\u201314","DOI":"10.1109\/TNET.2020.2976129"},{"issue":"6","key":"1012_CR23","doi-asserted-by":"publisher","first-page":"2222","DOI":"10.1109\/TNET.2019.2940147","volume":"27","author":"K Xie","year":"2019","unstructured":"Xie K, Wang L, Wang X, Xie G, Wen J, Zhang G, Cao J, Zhang D (2019) Accurate recovery of missing network measurement data with localized tensor completion. IEEE\/ACM Trans Netw 27 (6):2222\u20132235","journal-title":"IEEE\/ACM Trans Netw"},{"key":"1012_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TMC.2016.2595569","volume":"16","author":"K Xie","year":"2016","unstructured":"Xie K, Ning X, Wang G, Xie D, Cao J, Xie G, Wen J (2016) Recover corrupted data in sensor networks: a matrix completion solution. IEEE Trans Mob Comput 16:1\u20131. https:\/\/doi.org\/10.1109\/TMC.2016.2595569","journal-title":"IEEE Trans Mob Comput"},{"key":"1012_CR25","doi-asserted-by":"publisher","unstructured":"Wang J, Shen J, Li P, Xu H (2017) Online matrix completion for signed link prediction. In: Proceedings of the tenth acm international conference on web search and data mining, WSDM \u201917, association for computing machinery, New York, pp 475\u2013484. https:\/\/doi.org\/10.1145\/3018661.3018681","DOI":"10.1145\/3018661.3018681"},{"key":"1012_CR26","doi-asserted-by":"crossref","unstructured":"Izal M, Urvoy-Keller G, Biersack E, Felber P, Al Hamra A, Garc\u00e9s-Erice L. (2004) Dissecting bittorrent: Five months in a torrent\u2019s lifetime. In: Passive and active network measurement, vol 3015. Springer, Berlin, pp 1\u201311","DOI":"10.1007\/978-3-540-24668-8_1"},{"key":"1012_CR27","doi-asserted-by":"crossref","unstructured":"Guo L, Chen S, Xiao Z, Tan E, Ding X, Zhang X (2005) Measurements, analysis, and modeling of bittorrent-like systems. In: 5th ACM SIGCOMM conference on internet measurement, IMC \u201905. USENIX Association, Berkeley, pp 4\u20134","DOI":"10.1145\/1330107.1330113"},{"issue":"5","key":"1012_CR28","doi-asserted-by":"publisher","first-page":"1371","DOI":"10.1109\/TNET.2008.2009053","volume":"17","author":"M Steiner","year":"2009","unstructured":"Steiner M, En-Najjary T, Biersack EW (2009) Long term study of peer behavior in the kad dht. IEEE\/ACM Trans Netw 17(5):1371\u20131384","journal-title":"IEEE\/ACM Trans Netw"},{"key":"1012_CR29","unstructured":"Jiang J-Y, Li C-T, Chen Y, Wang W (2018) Identifying users behind shared accounts in online streaming services. In: The 41st international ACM SIGIR conference on research & development in information retrieval, SIGIR \u201918. ACM, New York, pp 65\u201374"},{"key":"1012_CR30","doi-asserted-by":"crossref","unstructured":"Sottocornola G., Symeonidis P., Zanker M. (2018) Session-based news recommendations. In: Companion Proceedings of the The Web Conference 2018, WWW \u201918, pp 1395\u20131399","DOI":"10.1145\/3184558.3191582"},{"issue":"7","key":"1012_CR31","doi-asserted-by":"publisher","first-page":"1164","DOI":"10.1109\/TPDS.2010.123","volume":"22","author":"C Zhang","year":"2011","unstructured":"Zhang C, Dhungel P, Wu D, Ross KW (2011) Unraveling the bittorrent ecosystem. IEEE Trans Parallel Distrib Syst 22(7):1164\u20131177","journal-title":"IEEE Trans Parallel Distrib Syst"},{"issue":"C","key":"1012_CR32","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1016\/j.jnca.2016.03.007","volume":"66","author":"A Qureshi","year":"2016","unstructured":"Qureshi A, Meg\u00edas D, Rif\u00e0-pous H (2016) PSUM. J Netw Comput Appl 66(C):180\u2013197. https:\/\/doi.org\/10.1016\/j.jnca.2016.03.007","journal-title":"J Netw Comput Appl"},{"key":"1012_CR33","doi-asserted-by":"publisher","unstructured":"Ojo OE, Iyadi CO, Oluwatope AO, Akinwale AT AyoPeer: The adapted ayo-game for minimizing free riding in peer-assisted network, Peer-to-Peer Networking and Applications. https:\/\/doi.org\/10.1007\/s12083-020-00913-6","DOI":"10.1007\/s12083-020-00913-6"},{"issue":"3","key":"1012_CR34","doi-asserted-by":"publisher","first-page":"905","DOI":"10.1007\/s12083-019-00839-8","volume":"13","author":"AR Naik","year":"2020","unstructured":"Naik AR, Keshavamurthy BN (2020) Next level peer-to-peer overlay networks under high churns: a survey. Peer-to-Peer Netw Appl 13(3):905\u2013931. https:\/\/doi.org\/10.1007\/s12083-019-00839-8","journal-title":"Peer-to-Peer Netw Appl"},{"key":"1012_CR35","doi-asserted-by":"publisher","unstructured":"Bhagatkar N, Dolas K, Ghosh RK, Das SK An integrated P2P framework for E-learning, Peer-to-Peer Networking and Applications. https:\/\/doi.org\/10.1007\/s12083-020-00919-0","DOI":"10.1007\/s12083-020-00919-0"},{"issue":"4","key":"1012_CR36","doi-asserted-by":"publisher","first-page":"951","DOI":"10.1007\/s12083-018-0701-x","volume":"12","author":"FN Nwebonyi","year":"2019","unstructured":"Nwebonyi FN, Martins R, Correia ME (2019) Reputation based approach for improved fairness and robustness in P2P protocols. Peer-to-Peer Netw Appl 12(4):951\u2013968. https:\/\/doi.org\/10.1007\/s12083-018-0701-x","journal-title":"Peer-to-Peer Netw Appl"},{"issue":"4","key":"1012_CR37","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1007\/s11009-006-9013-3","volume":"9","author":"J Kobza","year":"2007","unstructured":"Kobza J, Jacobson S, Vaughan D (2007) A survey of the coupon collector\u2019s problem with random sample sizes. Methodol Comput Appl Probab 9(4):573\u2013584. https:\/\/doi.org\/10.1007\/s11009-006-9013-3","journal-title":"Methodol Comput Appl Probab"},{"key":"1012_CR38","unstructured":"Van Steen M, Tanenbaum AS (2017) Distributed Systems, 3rd Edn. https:\/\/www.distributed-systems.net\/"},{"key":"1012_CR39","unstructured":"Yao Z, Wang X, Leonard D, Loguinov D Node isolation model and age-based neighbor selection in unstructured p2p networks. IEEE\/ACM Trans Netw:17(1)"}],"container-title":["Peer-to-Peer Networking and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12083-020-01012-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12083-020-01012-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12083-020-01012-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,2,22]],"date-time":"2021-02-22T14:53:34Z","timestamp":1614005614000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12083-020-01012-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,11,13]]},"references-count":39,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2021,3]]}},"alternative-id":["1012"],"URL":"https:\/\/doi.org\/10.1007\/s12083-020-01012-2","relation":{},"ISSN":["1936-6442","1936-6450"],"issn-type":[{"type":"print","value":"1936-6442"},{"type":"electronic","value":"1936-6450"}],"subject":[],"published":{"date-parts":[[2020,11,13]]},"assertion":[{"value":"23 April 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 October 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 November 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with Ethical Standards"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"<!--Emphasis Type='Bold' removed-->Conflict of interests"}}]}}