{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T17:53:57Z","timestamp":1774374837428,"version":"3.50.1"},"reference-count":28,"publisher":"IEEE","license":[{"start":{"date-parts":[[2023,5,17]],"date-time":"2023-05-17T00:00:00Z","timestamp":1684281600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,5,17]],"date-time":"2023-05-17T00:00:00Z","timestamp":1684281600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100004725","name":"Ministry of Economic Affairs","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100004725","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023,5,17]]},"DOI":"10.1109\/infocom53939.2023.10228865","type":"proceedings-article","created":{"date-parts":[[2023,8,29]],"date-time":"2023-08-29T17:40:43Z","timestamp":1693330843000},"page":"1-10","source":"Crossref","is-referenced-by-count":2,"title":["On the Limit Performance of Floating Gossip"],"prefix":"10.1109","author":[{"given":"Gianluca","family":"Rizzo","sequence":"first","affiliation":[{"name":"HES SO Valais"}]},{"given":"Noelia Perez","family":"Palma","sequence":"additional","affiliation":[{"name":"Institute IMDEA Networks"}]},{"given":"Marco Ajmone","family":"Marsan","sequence":"additional","affiliation":[{"name":"Institute IMDEA Networks"}]},{"given":"Vincenzo","family":"Mancuso","sequence":"additional","affiliation":[{"name":"Institute IMDEA Networks"}]}],"member":"263","reference":[{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.23919\/ITC.2017.8064344"},{"key":"ref12","article-title":"A simple approximate analysis of floating content for context-aware applications","author":"ali","year":"2013","journal-title":"technical report TR-IMDEA-Networks-2013-1"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/BigData47090.2019.9006216"},{"key":"ref14","first-page":"1","article-title":"Opportunistic Federated Learning: An Exploration of Egocentric Collaboration for Pervasive Computing Applications","author":"lee","year":"2021","journal-title":"2021 IEEE International Conference on Pervasive Computing and Communications (PerCom)"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2011.5935160"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/3317689"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/MVT.2017.2752798"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2021.3057017"},{"key":"ref17","article-title":"GossipGraD: Scalable Deep Learning using Gossip Communication based Asynchronous Gradient Descent","volume":"abs 1803 5880","author":"daily","year":"2018","journal-title":"CoRR"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2020.10.006"},{"key":"ref19","first-page":"1791","article-title":"Accelerating Gossip SGD with Periodic Global Averaging","volume":"139","author":"chen","year":"2021","journal-title":"Proceedings of the 38th International Conference on Machine Learning"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2018.11.002"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM53939.2023.10228865"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/PERCOM.2011.5767578"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1016\/j.dcan.2022.07.002"},{"key":"ref25","article-title":"A capacity scaling law for artificial neural networks","author":"friedland","year":"2017"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2022.3160268"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/2492101.1555363"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/WCNCW49093.2021.9420038"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/j.peva.2013.01.001"},{"key":"ref27","article-title":"Applying mean-field approximation to continuous time markov chains","author":"kolesnichenko","year":"2012","journal-title":"Rocks"},{"key":"ref8","article-title":"Millionagents - marketing research for business on the basis of modern technologies","year":"0"},{"key":"ref7","article-title":"Driving directions, live traffic & road conditions updates - Waze","year":"0"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1002\/cpe.2858"},{"key":"ref4","author":"woolley","year":"2020","journal-title":"Bluetooth Core Specification Version 5 2 Feature Overview"},{"key":"ref3","article-title":"Wireless LAN medium access control (MAC) and physical layer (PHY) specifications","year":"1999","journal-title":"ANSI\/IEEE Std 802 11 1999 ed"},{"key":"ref6","article-title":"Gigwalk: We’ve got your brand’s back - Gigwalk","year":"0"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/JSYST.2017.2773633"}],"event":{"name":"IEEE INFOCOM 2023 - IEEE Conference on Computer Communications","location":"New York City, NY, USA","start":{"date-parts":[[2023,5,17]]},"end":{"date-parts":[[2023,5,20]]}},"container-title":["IEEE INFOCOM 2023 - IEEE Conference on Computer Communications"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10228851\/10228852\/10228865.pdf?arnumber=10228865","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,18]],"date-time":"2023-09-18T17:44:58Z","timestamp":1695059098000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10228865\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,5,17]]},"references-count":28,"URL":"https:\/\/doi.org\/10.1109\/infocom53939.2023.10228865","relation":{},"subject":[],"published":{"date-parts":[[2023,5,17]]}}}