Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Gonçalo Jacinto

dblp:33/5824 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 2019
0000-0002-3292-2208ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 1Computer networks · 1Software engineering, systems software and programming languages · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer networks
2 papers
Network measurement and analytics · 89% Network performance modeling · 8% Wireless networking · 3%

Topics — the 4 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Network measurement and analytics › per-flow measurement
flow size distribution estimation
0.412019
Regularized inversion of flow size distribution · INFOCOM 2019
Network measurement and analytics › sampling
packet sampling
0.412019
Regularized inversion of flow size distribution · INFOCOM 2019
Network measurement and analytics
traffic measurement
0.412019
Regularized inversion of flow size distribution · INFOCOM 2019
Wireless networking
mobile ad hoc networks
0.012010
An analytical framework to infer multihop path reliability in MANETs · SIGMETRICS 2010

Methods — techniques the papers use, named apart from their topics

singular value decomposition · 0.4regularized weighted least squares · 0.4penalized estimation · 0.4piecewise deterministic markov process · 0.1integro-differential equations · 0.1
YearPublicationVenuePosition
2019 Regularized inversion of flow size distribution
abstract
In this paper, we revisit the estimation of the size distribution of packet flows in Internet traffic through an inversion approach for several packet sampling schemes which are based on probabilistic sampling (PS). We first study the statistical properties of the previously introduced inversion estimator in its general form and make connections to the singular value decomposition. This motivates the use of a regularization technique in the estimation of the flow size distribution. More specifically, a penalized weighted least square approach is proposed. We compare theoretically the penalized estimator under simplified assumptions against the (non-penalized) inversion approach in order to explain differences in their statistical behaviors. A data study with two real traces shows that the proposed penalized estimator outperforms the inversion estimator for all sampling schemes, corroborating the theoretical analysis. This work reveals that the simplest sampling schemes based on PS, that do not work with small sampling probabilities under the inversion approach, can be used with the penalized approach. Furthermore, the penalized approach allows considering smaller packet sampling rates for all the other sampling schemes.
Nelson Antunes, Vladas Pipiras, Gonçalo Jacinto
INFOCOM3
2010 An analytical framework to infer multihop path reliability in MANETs
abstract
Due to complexity and intractability reasons, most of the analytical studies on the reliability of communication paths in mobile ad hoc networks are based on the assumption of link independence. In this paper, an analytical framework is developed to characterize the random behavior of a multihop path and derive path metrics to characterize the reliability of paths. This is achieved through the modeling of a multihop path as a PDMP (piecewise deterministic Markov process). Two path based metrics are obtained as expectations of functionals of the process: the mean path duration and the path persistence. We show that these metrics are the unique solution of a set of integro-differential equations and provide a recursive scheme for their computation. Finally, numerical results illustrate the computation of the metrics; these results are compared with independent link approximation results.
Nelson Antunes, Gonçalo Jacinto, António Pacheco 0001
SIGMETRICS2