Estimating Original Flow Length from Sampled Flow Statistics

Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3994)


Packet sampling has become an attractive and scalable means to measure flow data on high-speed links. Passive traffic measurement increasingly employs sampling at the packet level and makes inferences from sampled network traffic. This paper proposes a maximum probability method that estimates the length of the corresponding original flow from the length of a sampled flow. We construct the probability models of the original flow length distributions of a sampled flow under the assumptions of various flow length distributions, respectively. Through recovery analyzing with different parameters, we obtain a consistent linear expression that reflects the relationship between the length of sampled flow and that of the corresponding original flow. Furthermore, after using publicly available traces and traces collected from CERNET to do recovery experiments and comparing the experiment outcomes and theoretic values calculated with Pareto distributions, we may conclude that the maximum probability method calculated by using the Pareto distribution with 1.0 can be used to estimate original flow length in the concerned network.


  1. 1.
    Duffield, N.G., Lund, C., Thorup, M.: Properties and Prediction of Flow Statistics from Sampled Packet Streams. In: ACM SIGCOMM Internet Measurement Workshop 2002, November 2002, pp. 159–171 (2002)Google Scholar
  2. 2.
    Duffield, N.G., Lund, C., Thorup, M.: Estimating Flow Distributions from Sampled Flow Statistics. IEEE/ACM Transation on Networking 13, 325–336 (2005)Google Scholar
  3. 3.
    Mori, T., Uchida, M., Kawahara, R.: Identifying Elephant Flows Through Periodically Sampled Packets. In: ACM SIGCOMM Internet Measurement Conference 2004, pp. 115–120 (2004)Google Scholar
  4. 4.
    Kamiyama, N.: Identifying High-Rate Flows With Less Memory. In: IEEE Infocom 2005, March 2005, pp. 2781–2785 (2005)Google Scholar
  5. 5.

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  1. 1.Department of Computer Science and EngineeringSoutheast UniversityNanjingChina

Personalised recommendations