Bruno Ribeiro was born in Rio de Janeiro / Brazil.
He received his B.Sc. and M.Sc. degrees in 2001 and 2003 from UFRJ/COPPE-
Federal University of Rio de Janeiro. From 1997 to 1999 he worked
with commutative algebraic fields under the supervision of professor S. C. Coutinho.
He is a former research associate of LAND -
Laboratory for Modeling, Analysis and Development of Networks and Computer System at UFRJ -
led by professor Edmundo de Souza e Silva.
Publications:
Bruno Ribeiro, William Gauvin, Benyuan Liu, and Don Towsley, On the random nature of MySpace friendships, May, 2009
A version is available as UMass CMPSCI Technical Report UM-CS-2009-021 [pdf].
Bruno Ribeiro, Tao Ye, and Don Towsley, A Resource-minimalist Flow Size Histogram Estimator ACM/USENIX Internet Measurement Conference, Oct, 2008
A version is available as UMass CMPSCI Technical Report 29-08 [pdf].
The IMC 2008 slides: [ppt]
This work presents a data stream algorithm for coarse-grained Internet flow size histogram estimation.
This algorithm is a fast sub-optimal estimator that also has a small memory footprint.
The memory savings comes from the application of a probabilistic counting technique proposed by Robert Morris in 1978 and from our hash folding technique.
In this work we present two tools that are possibly of interest in their own:
hash folding (multiplexing two or more hash tables into the space of one table)
semi-probabilistic sampling of packets in a flow.
Bruno Ribeiro, Weifeng Chen, Gerome Miklau, and Don Towsley Analyzing Privacy in Enterprise Packet Trace Anonymization Proceedings of the 15th Annual Network & Distributed System Security Symposium (NDSS), Feb, 2008 [pdf] and [ppt] An extended version is currently available as UMass CMPSCI Technical Report TR 48-07. (BibTeX) [pdf].
The source code of the software used in this work is available at [src].
In this work we show (and present the formal background of) an attack on anonymized IP addresses of (full and partial) prefix-preserved
anonymized traces. This attack that combines the use of external information (fingerprints) and the matching
contrains imposed by prefix preservation.
Perhaps most importantly, we develop analysis tools that allow data publishers to quantify the worst-case
vulnerability of their trace given assumptions about the adversary's external information.
Bruno Ribeiro, Don Towsley, Tao Ye, and Jean Bolot, Fisher Information of Sampled Packets: an Application to Flow Size Estimation ACM/USENIX Internet Measurement Conference (IMC 2006), Rio de Janeiro, Brazil, October 2006. (BibTeX)
The camera-ready version and the IMC'06 slides are available (also an errata) here [pdf][ppt] (recommended).
An older version is also available as UMass CMPSCI Technical Report 06-37
[pdf][ps]
Also available is a tar.gz file with the source code that computes the Cramer-Rao bounds found in the paper. It needs R 2.4 or newer: [src].
The source code to numerically obtain the MLE can be found at [src]. It contains the version of wnlib that I used. Wnlib needs csh to compile.
In this work we look at the amount of statistical information, more specifically the flow size distribution, obtained from probabilistic packet sampling.
We focus primarily on TCP flows and ask if it is possible to extract enough information from a
sampled packet stream in order to recover its original flow size distribution. We look at single and multiple
monitor cases.
This work also provides some insights of which TCP/IP fields can be used to improve flow size estimation.
We also provide tools to pre-compute the number of samples needed to achieve a given confidence interval.
Bruno Ribeiro, Edmundo de Souza e Silva, and Don Towsley, On the Efficiency of Path Diversity for Continuous Media Applications
A version is currently available as UMass CMPSCI Technical Report 05-19
[pdf].
Path diversity is beneficial for multimedia application in the presence of loss.
It ameliorates the effect of end-to-end burst losses by spreading such losses.
Multimedia applications using path diversity are known to achieve better error performance over the single path case.
Packet interleaving is an older and more widespread technique that also spread burst losses.
To the best of my knowledge, this work is the first to provide evidence (and a mathematical proof :) that packet interleaving can
also be used to achieve good error performance on multimedia applications.
Weifeng Chen, Yong Huang, Bruno Ribeiro, Kyoungwon Suh, Honggang Zhang, Edmundo de Souza e Silva, Jim Kurose, and Don Towsley, Exploiting the IPID field to infer network path and end-system characteristics Passive and Active Measurement Workshop (PAM'05), Boston, March 2005.
[pdf]
(BibTeX)
This work shows the many uses of the IPID field for network measurements.
Among many other applications, it presents a technique to measure end-to-end one way delay differences that does
not require the end host to be instrumented.
This means that two hosts A and B can measure their one-way delay difference to a
Windows 2000/XP end host C without the need to instrument host C -- or without the knowledge or consent of host C :-O .
S. C. Coutinho, Bruno Ribeiro, On Holomorphic Foliations without Algebraic Solutions Experimental Mathematics, v.10, n.4, p.529 - 536, 2001.
[pdf]
This work uses Groebner basis through the Buchberger algorithm to find if an holomorphic foliation has an algebraic solution.
On a personal note, my sister Aline Ribeiro owns a consulting company in Brazil that works on supply chain optimization. They deal with interesting operations research problems there.
