Clegg, R;
Landa, R;
Haddadi, H;
Rio, M;
Moore, AW;
(2008)
Techniques for flow inversion on sampled data.
In:
INFOCOM 2008 Global Internet Symposium, Phoenix, USA, April 2008.
IEEE: Piscataway, US.
Preview |
PDF
14963.pdf Download (260kB) |
Abstract
The distribution of flow sizes is a quantity of interest fundamental to traffic engineering and network modelling and only likely to become more important in the future. The recovery of the flow-length distribution from (sampled) packet data is referred to as flow-inversion. Traditional packet sampling methods cause distortions in a recovered distribution of flow-length. We propose an improved method for inverting data sampled using the technique known as sample-and-hold. We show that the technique improves upon existing inversion techniques illustrated using both real and artificial data sets. The technique described may have applications to other inversion problems.
Type: | Proceedings paper |
---|---|
Title: | Techniques for flow inversion on sampled data |
ISBN-13: | 978-1-4244-2219-7 |
Open access status: | An open access version is available from UCL Discovery |
DOI: | 10.1109/INFOCOM.2008.4544600 |
Publisher version: | http://dx.doi.org/10.1109/INFOCOM.2008.4544600 |
Language: | English |
Additional information: | (c) 2008 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other users, including reprinting/ republishing this material for advertising or promotional purposes, creating new collective works for resale or redistribution to servers or lists, or reuse of any copyrighted components of this work in other works. |
UCL classification: | UCL UCL > Provost and Vice Provost Offices UCL > Provost and Vice Provost Offices > UCL BEAMS UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Engineering Science UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Engineering Science > Dept of Electronic and Electrical Eng |
URI: | https://discovery.ucl.ac.uk/id/eprint/14963 |
Archive Staff Only
View Item |