{"ID":2891334,"CreatedAt":"2026-06-01T04:54:23.091178241Z","UpdatedAt":"2026-06-01T04:54:23.091178241Z","DeletedAt":null,"paper_url":"https://arxiv.org/abs/2507.17458","arxiv_id":"2507.17458","title":"Distributed P2P quantile tracking with relative value error","abstract":"In this paper we present \\textsc{DUDDSketch}, a distributed version of the \\textsc{UDDSketch} algorithm for accurate tracking of quantiles. The algorithm is a fully decentralized, gossip-based distributed protocol working in the context of unstructured P2P networks. We discuss the algorithm's design and formally prove its correctness. We also show, through extensive experimental results, that the algorithm converges to the results provided by the sequential algorithm, which is a fundamental and highly desirable property.","short_abstract":"In this paper we present \\textsc{DUDDSketch}, a distributed version of the \\textsc{UDDSketch} algorithm for accurate tracking of quantiles. The algorithm is a fully decentralized, gossip-based distributed protocol working in the context of unstructured P2P networks. We discuss the algorithm's design and formally prove...","url_abs":"https://arxiv.org/abs/2507.17458","url_pdf":"https://arxiv.org/pdf/2507.17458v1","authors":"[\"Marco Pulimeno\",\"Italo Epicoco\",\"Massimo Cafaro\"]","published":"2025-07-23T12:37:45Z","proceeding":"cs.DC","tasks":"[\"cs.DC\"]","methods":"[]","has_code":false}