Zobrazeno 1 - 10
of 44
pro vyhledávání: '"Marco Pulimeno"'
Publikováno v:
Future Internet, Vol 16, Iss 9, p 335 (2024)
In this paper, we deal with the problem of monitoring network latency. Indeed, latency is a key network metric related to both network performance and quality of service, since it directly impacts on the overall user’s experience. High latency lead
Externí odkaz:
https://doaj.org/article/96023149a25e4078a745d9ccc5d1a491
Publikováno v:
Future Internet, Vol 16, Iss 2, p 53 (2024)
This Special Issue aims to provide a comprehensive overview of the current state of the art in Future Internet Technology in Italy [...]
Externí odkaz:
https://doaj.org/article/1e5a22d00902401ea63c595bdd70b8bb
Publikováno v:
IEEE Access, Vol 11, Pp 87047-87061 (2023)
Ship sailing is a complex endeavour, requiring carefully considered proactive and reactive strategies in choosing the course of action that best suits the various events to be managed. Humans are already supported by different technologies for sailin
Externí odkaz:
https://doaj.org/article/303710d2b2234c0c943cc153b42a841c
Publikováno v:
IEEE Access, Vol 10, Pp 106386-106399 (2022)
The heavy hitters $q$ -tail latencies problem has been introduced recently. This problem, framed in the context of data stream monitoring, requires approximating the quantiles of the heavy hitters items of an input stream whose elements are pairs (it
Externí odkaz:
https://doaj.org/article/b3d62e6e87244197b46c551749ba0310
Publikováno v:
IEEE Access, Vol 8, Pp 147604-147617 (2020)
We present UDDSketch (Uniform DDSketch), a novel sketch for fast and accurate tracking of quantiles in data streams. This sketch is heavily inspired by the recently introduced DDSketch, and is based on a novel bucket collapsing procedure that allows
Externí odkaz:
https://doaj.org/article/2068829fd6864062b4a4a04e2fa84153
Publikováno v:
IEEE Access, Vol 5, Pp 24078-24093 (2017)
We deal with the problem of detecting frequent items in a stream under the constraint that items are weighted, and recent items must be weighted more than older ones. This kind of problem naturally arises in a wide class of applications in which rece
Externí odkaz:
https://doaj.org/article/01074363f0a64af2bf9c04617f8c3e40
Publikováno v:
Future Internet, Vol 12, Iss 9, p 158 (2020)
A stream can be thought of as a very large set of data, sometimes even infinite, which arrives sequentially and must be processed without the possibility of being stored. In fact, the memory available to the algorithm is limited and it is not possibl
Externí odkaz:
https://doaj.org/article/9bd2653c640d482b8e2805a9885a1b2b
Publikováno v:
Distributed Computing and Artificial Intelligence, 19th International Conference ISBN: 9783031208584
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::26430af8d8a201d4ad7f67db3d0ee495
https://doi.org/10.1007/978-3-031-20859-1_10
https://doi.org/10.1007/978-3-031-20859-1_10
Publikováno v:
Information Sciences. 545:633-662
We present \textsc{P2PTFHH} (Peer--to--Peer Time--Faded Heavy Hitters) which, to the best of our knowledge, is the first distributed algorithm for mining time--faded heavy hitters on unstructured P2P networks. \textsc{P2PTFHH} is based on the \textsc