Space-code bloom filter for efficient per-flow traffic measurement

IEEE Journal on Selected Areas in Communications

Volumn 24, Issue 12, 2006, Pages 2327-2339

  Kumar, Abhishek ^a,b   JimXu, Jun ^a,b   Wang, Jia ^a,c  

^a IEEE   (United States)

^b Georgia Institute of Technology   (United States)

^c AT AND T LABS RESEARCH   (United States)

Author keywords

Bloom filter (BF); Data structures; Network measurement; Statistical inference; Traffic analysis

Indexed keywords

BLOOM FILTERS (BF); NETWORK MEASUREMENTS; STATISTICAL INFERENCE; TRAFFIC ANALYSIS;

APPROXIMATION THEORY; DATA STRUCTURES; DIGITAL FILTERS; MAXIMUM LIKELIHOOD ESTIMATION; MEASUREMENT THEORY; PARAMETER ESTIMATION; RANDOM PROCESSES; STATISTICAL METHODS;

TELECOMMUNICATION TRAFFIC;

EID: 33845658247     PISSN: 07338716     EISSN: None     Source Type: Journal    
DOI: 10.1109/JSAC.2006.884032     Document Type: Article

References (22)

1. C. Estan and G. Varghese, "New directions in traffic measurement and accounting," in Proc. ACM SIGCOMM, Aug. 2002, pp. 323-336.
2. [Online], Available: http://www.caida.org
3. M. Charikar, K. Chen, and Farach-Colton, "Finding frequent items in data streams," in ICALP. Heidelberg, Germany: Springer-Verlag, 2002, Lecture Notes in Computer Science, pp. 693-703.
4. R. M. Karp, S. Shenker, and C. H. Papadimitriou, "A simple algorithm for finding frequent elements in streams and bags," ACM Trans. Database Syst., vol. 28, pp. 51-55, 2003.
5. B. H. Bloom, "Space/time trade-offs in hash coding with allowable errors," CACM, vol. 13, no. 7, pp. 422-426, 1970.
6. N. Alon, Y. Matias, and M. Szegedy, "The space complexity of approximating the frequency moments," in Proc. ACM Symp. Theory Comput., 1996, pp. 20-29.
7. S. Cohen and Y. Matias, "Spectral Bloom filters," in Proc. ACM SIGMOD Conf. Manage.Data, 2003, pp. 241-252.
8. E. Demaine, J. Munro, and A. Lopez-Ortiz, "Frequency estimation of Internet packet streams with limited space," in European Symposium on Algorithms (ESA). Heidelberg, Germany: Springer-Verlag, 2002, Lecture Notes in Computer Science.
9. R. Motwani and P. Raghavan, Randomized Algorithms. Cambridge, U.K.: Cambridge Univ. Press, 1995, pp. 57-63.
10. C. Estan and G. Varghese, "Bitmap algorithms for counting active flows on high speed links," in Proc. ACM SIGCOMM Internet Measure. Conf., Oct. 2003, pp. 153-166.
11. P. J. Bickel and K. A. Doksum, Mathematical Statistics, Basic Ideas and Selected Topics. Englewood Cliffs, NJ: Prentice-Hall, 2001.
12. C. Cranor, T. Johnson, and O. Spatscheck, "Gigascope: A stream database for network applications," in Proc. SIGMOD, Jun. 2003, pp. 647-651.
13. C. Partridge, P. P. Carvey, E. Burgess, I. Castineyra, T. Clarke, L. Graham, M. Hathaway, P. Herman, A. King, S. Kohalmi, T. Ma, J. Mcallen, T. Mendez, W. C. Milliken, R. Pettyjohn, J. Rokosz, J. Seeger, M. Sollins, S. Storch, B. Tober, and G. D. Troxel, "A 50-Gb/s IP router," IEEE/ACM Trans. Netw., vol. 6, no. 3, pp. 237-248, Jun. 1998.
14. S. Iyer, S. Bhattacharyya, N. Taft, and C. Diot, "An approach to alleviate link overload as observed on an IP backbone," in Proc. IEEE INFOCOM, San Francisco, CA, Mar. 2003, pp. 406-416.
15. C. Fraleigh, S. Moon, B. Lyles, C. Cotton, M. Khan, D. Moll, R. Rockell, T. Seely, and C. Diot, "Packet-level traffic measurement from the sprint IP backbone," IEEE Netw. Mag., vol. 17, no. 6, pp. 6-26, Nov. 2003.
16. K. Shen, H. Tang, T. Yang, and L. Chu, "Integrated resource management for cluster-based Internet services," in Proc. 5th USENIX Symp. Operating Syst. Design Implementation, Boston, MA, Dec. 2002, pp. 225-238.
17. A. Broder and M. Mitzenmacher, "Network applications of Bloom filters: A survey," Internet Mathematics, vol. 1, no. 4, pp. 485-509, 2005.
18. L. Fan, P. Cao, J. Almeida, and A. Broder, "Summary cache: A scalable wide-area Web cache sharing protocol," IEEE/ACM Trans. Netw., vol. 8, no. 3, pp. 281-293, 2000.
19. N. Duffield, C. Lund, and M. Thorup, "Charging from sampled network usage," in Proc. ACM SIGCOMM Workshop Internet Measurement, San Francisco, CA, Nov. 2001, pp. 245-256. [Online]. Available: http://doi.acm.org/10.1145/ 505202.505232
20. A. Kumar and J. Xu, "Sketch guided sampling-using on-line estimates of flow size for adaptive data collection," Proc. IEEE INFOCOM, Apr. 2006.
21. M. Kodialam, T. V. Lakshman, and S. Mohanty, "Runs based traffic estimator (rate): A simple, memory efficient scheme for per-flow rate estimation," in Proc. IEEE INFOCOM, Mar. 2004, pp. 1808-1818.
22. F. Hao, M. Kodialam, and T. Lakshman, "Accel-rate: A faster mechanism for memory efficient per-flow traffic estimation," in Proc Joint Int. Conf. Measure. Modeling Comput. Syst., SIGMETRICS'04/Performance'04: , New York, Jun. 2004, pp. 155-166. [Online]. Available: http://doi.acm.org/10.1145/ 1005686.1005707