Distributed P2P quantile tracking with relative value error
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2025
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866908462283227136 |
|---|---|
| author | Pulimeno, Marco Epicoco, Italo Cafaro, Massimo |
| author_facet | Pulimeno, Marco Epicoco, Italo Cafaro, Massimo |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2507_17458 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Distributed P2P quantile tracking with relative value error Pulimeno, Marco Epicoco, Italo Cafaro, Massimo Distributed, Parallel, and Cluster Computing 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. |
| title | Distributed P2P quantile tracking with relative value error |
| topic | Distributed, Parallel, and Cluster Computing |
| url | https://arxiv.org/abs/2507.17458 |