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

Alberto Tonietti

dblp:89/461 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 1992
—ORCID · none

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

Computer networks · 2

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
Internet architecture and protocols · 64% Network performance modeling · 32% Transport protocols and congestion control · 4%

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

TopicWeightPapersLastEvidence papers
Internet architecture and protocols
traffic policing
0.021992
Dimensioning Criteria for Policing Functions in ATM Networks · INFOCOM 1992
Effectiveness of the "Leaky Bucket" Policing Mechanism in ATM Networks · IEEE J. Sel. Areas Commun. 1991
Internet architecture and protocols
ATM networks
0.011992
Dimensioning Criteria for Policing Functions in ATM Networks · INFOCOM 1992
Network performance modeling › delay analysis
cell delay variation
0.011992
Dimensioning Criteria for Policing Functions in ATM Networks · INFOCOM 1992
Internet architecture and protocols › traffic shaping
leaky bucket
0.011991
Effectiveness of the "Leaky Bucket" Policing Mechanism in ATM Networks · IEEE J. Sel. Areas Commun. 1991
Network performance modeling
queueing analysis
0.011991
Effectiveness of the "Leaky Bucket" Policing Mechanism in ATM Networks · IEEE J. Sel. Areas Commun. 1991

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

queueing analysis · 0.0queueing theory · 0.0fluid flow approximation · 0.0
YearPublicationVenuePosition
1992 Dimensioning Criteria for Policing Functions in ATM Networks
abstract
The authors discuss some basic issues relevant to the policing function in asynchronous transfer mode (ATM) networks. The problem of controlling the source peak rate in the presence of the cell delay variation introduced in the customer premises network is considered. A model for analyzing the cell delay variation is presented, under the assumption of a constant bit rate source multiplexed with a Poisson stream. On the basis of the distribution obtained, the relevant parameters of two policing devices (the jumping window and the leaky bucket) are dimensioned. The numerical results lead to the conclusion that the leaky bucket allows a tighter source control then the jumping window.>
P. Castelli, Alberto Tonietti, A. Forcina
INFOCOM2
1991 Effectiveness of the "Leaky Bucket" Policing Mechanism in ATM Networks
abstract
The performance of the leaky bucket, a device for controlling the source traffic parameters of an ATM network is analyzed. The most critical situation, i.e., an on/off bursty source, is assumed. Moreover, the delay jitter introduced by a possible multiplexing of sources inside the customer premises network is not considered. The leaky bucket can be analyzed as a G/D/1/N queue with finite waiting room N and a suitable arrival process. An alternative approach, the fluid flow approximation, in which the bit flow is considered as a continuous variable, is presented. By comparison with the exact model, it is shown that the accuracy of the fluid flow approach is sufficient for practical purposes. An explicit formula for the cell loss probability, in case of exponential distributions for both the burst duration and the inactivity period of the source, is derived. On the basis of that formula, some numerical evaluations are presented with the aim of assessing the effectiveness of the leaky bucket mechanism. It is concluded that while the leaky bucket can easily control the peak rate, difficulties arise in controlling the mean bit rate (because of the long time required) and the burst duration (because of the poor selectivity).>
Milena Butto, Elisa Cavallero, Alberto Tonietti
IEEE J. Sel. Areas Commun.3