A. Forcina

dblp:84/2249 · 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 · 60% Network performance modeling · 30% Routing and switching · 10%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Interconnection networks and networks-on-chip · 100%

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

TopicWeightPapersLastEvidence papers
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 policing
0.011992
Dimensioning Criteria for Policing Functions in ATM Networks · INFOCOM 1992
Interconnection networks and networks-on-chip › switching network
multistage interconnection network
0.011988
On non-blocking properties of parallel delta networks · INFOCOM 1988
Interconnection networks and networks-on-chip › switching network
nonblocking condition
0.011988
On non-blocking properties of parallel delta networks · INFOCOM 1988
Routing and switching › switching networks
permutation routing
0.011988
On non-blocking properties of parallel delta networks · INFOCOM 1988
Routing and switching
routing algorithms
0.011988
On non-blocking properties of parallel delta networks · INFOCOM 1988

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

graph colouring · 0.0queueing analysis · 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
INFOCOM3
1988 On non-blocking properties of parallel delta networks
abstract
This paper deals with the definition of a class of NxN interconnection networks called Parallel Delta Network (PDN). For this class of networks the non-blocking conditions are given. In particular, by means of the graph colouring technique, it has been proved that the minimum number of Delta subnetworks (L) necessary to provide the non-blocking property is L=nfS/21-1 where n is the size of the basic switching element and S the number of stages required by an NxN Delta network. A routing algorithm for the establishment of any permutation has been defined. \nIt operates for any value of n and shows a polynomial time \ncomplexity equal to O(N3/2). Moreover, in case of the setup \nof a single connection request, this algorithm assures a \ntime complexity equal to O(VN). This property makes it \nwell suitable to an asynchronous telecommunication \nenvironment.
Francesco Bernabei, A. Forcina, Marco Listanti
INFOCOM2