Flaminio Borgonovo

Flaminio Borgonovo

Auto-generated profile, based on publicly available information

Flaminio Borgonovo

Dipartimento di Elettronica, Informazione e Bioingegneria, Politecnico di Milano, Milan, Italy

Research Focus & Metrics

Academic Career Length

35Years (1992-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
28 December 2017 in IEEE/ACM Transactions on Networking
Verified
Journal Article
Closed access
LBLuca Barletta
Luca Barletta
FBFlaminio Borgonovo
Flaminio Borgonovo
IFIlario Filippini
Ilario Filippini
The behavior of exponential backoff (EB) has challenged researchers ever since its introduction, but only approximate and partial results have been produced up to this date. This paper presents accurate results about the effect of protocol parameters on throughput and delay, assuming queues in saturation. Among the manifold results, we first introduce a simple model that provides close-form results for the approximated model known as “decoupling assumption.” Since the latter fails to provide well approximated results in many cases, we also introduce a Markovian model able to trade the precision of the results with complexity even with an infinite number of users, enabling us to get definite throughput results, such as 0.3706 with binary EB, and 0.4303 with an optimized base. Analytical considerations allow to derive the tail of the access-delay distribution, found to be slowly decreasing and with no variance as the number of users goes to infinity. Taking into account the overall performance, preliminary results seem to indicate that the exponential base b=1.35 is more appealing than the standard value b=2.

1 March 1992 in European Transactions on Telecommunications
Verified
Journal Article
Closed access
PDF file
GAGuido Albertengo
Guido Albertengo
PCPier Luigi Civera
Pier Luigi Civera
RCRenato Lo Cigno
Renato Lo Cigno
GPGianluca Piccinini
Gianluca Piccinini
MZMaurizio Zamboni
Maurizio Zamboni
GPGiuseppe Panizzardi
Giuseppe Panizzardi

14 March 2016 in Journal of Communications Software and Systems
Verified
Journal Article
Open access
PDF file
LBLuca Barletta
Luca Barletta
FBFlaminio Borgonovo
Flaminio Borgonovo
IFIlario Filippini
Ilario Filippini
In this paper a new analysis is presented that allowsto investigate the asymptotic behavior of some backlog estimation procedures for Dynamic Frame Aloha (DFA) in Radio Frequency Identification (RFID) environment. Although efficiency e-1 can theoretically be reached, none of the solution proposed in the literature has been shown to reach such value. Here we analyze first the Schoute’s backlog estimate, which is very attractive for its simplicity, and formally show that its asymptotic efficiency is 0:311 for any finite initial frame length. Since the analysis shows how the Schoute’s estimate impairment can be avoided, wefurther propose the Asymptotic Efficient Estimate (AE2), an improvement of the Schoute’s one, that exploits the Frame Restart property of the standard and that is proved to asymptotically reach efficiency e-1.