Self-similarity in World Wide Web traffic: evidence and possible causes
IEEE/ACM Transactions on Networking (TON)
The changing nature of network traffic: scaling phenomena
ACM SIGCOMM Computer Communication Review
Efficient policies for carrying Web traffic over flow-switched networks
IEEE/ACM Transactions on Networking (TON)
A flow-based model for internet backbone traffic
Proceedings of the 2nd ACM SIGCOMM Workshop on Internet measurment
Properties and prediction of flow statistics from sampled packet streams
Proceedings of the 2nd ACM SIGCOMM Workshop on Internet measurment
A pragmatic definition of elephants in internet backbone traffic
Proceedings of the 2nd ACM SIGCOMM Workshop on Internet measurment
New directions in traffic measurement and accounting: Focusing on the elephants, ignoring the mice
ACM Transactions on Computer Systems (TOCS)
Numerical Analysis in Modern Scientific Computing: An Introduction
Numerical Analysis in Modern Scientific Computing: An Introduction
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Estimating flow distributions from sampled flow statistics
IEEE/ACM Transactions on Networking (TON)
IEEE/ACM Transactions on Networking (TON)
A comparative study of different heavy tail index estimators of the flow size from sampled data
Proceedings of the first international conference on Networks for grid applications
Using LiTGen, a realistic IP traffic model, to evaluate the impact of burstiness on performance
Proceedings of the 1st international conference on Simulation tools and techniques for communications, networks and systems & workshops
Maximum likelihood estimation of the flow size distribution tail index from sampled packet data
Proceedings of the eleventh international joint conference on Measurement and modeling of computer systems
Deterministic versus probabilistic packet sampling in the internet
ITC20'07 Proceedings of the 20th international teletraffic conference on Managing traffic performance in converged networks
Wavelet analysis of long-range-dependent traffic
IEEE Transactions on Information Theory
Modeling video traffic using M/G/∞ input processes: a compromise between Markovian and LRD models
IEEE Journal on Selected Areas in Communications
An identification problem in an urn and ball model with heavy tailed distributions
Probability in the Engineering and Informational Sciences
| Hi-index | 0.24 |
A new method of estimating some statistical characteristics of TCP flows in the Internet is developed in this paper. For this purpose, a new set of random variables (referred to as observables) is defined. When dealing with sampled traffic, these observables can easily be computed from sampled data. By adopting a convenient mouse/elephant dichotomy also dependent on traffic, it is shown how these variables give a reliable statistical representation of the number of packets transmitted by large flows during successive time intervals with an appropriate duration. A mathematical framework is developed to estimate the accuracy of the method. As an application, it is shown how one can estimate the number of large TCP flows when only sampled traffic is available. The algorithm proposed is tested against experimental data collected from different types of IP networks.