Adaptive Bloom Filter: A Space-Efficient Counting Algorithm for Unpredictable Network Traffic

Published 2008 View Full Article

  1. Home
  2. Publications
  3. Publication Search
  4. Publication Details
Title
Adaptive Bloom Filter: A Space-Efficient Counting Algorithm for Unpredictable Network Traffic
Authors
Keywords
-
Journal
IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS
Volume E91-D, Issue 5, Pages 1292-1299
Publisher
Institute of Electronics, Information and Communications Engineers (IEICE)
Online
2008-05-16
DOI
10.1093/ietisy/e91-d.5.1292

Ask authors/readers for more resources

Protocol

Community support

Reagent

Community support

Reprint

Contact the author

Publish scientific posters with Peeref

Peeref publishes scientific posters from all research disciplines. Our Diamond Open Access policy means free access to content and no publication fees for authors.

Learn More

Become a Peeref-certified reviewer

The Peeref Institute provides free reviewer training that teaches the core competencies of the academic peer review process.

Get Started
Webinars Posters Questions Hubs Funding Journals Articles Connect Collections Reviewers About Us FAQs Mobile App Privacy Policy Terms of Use
© Peeref 2019-2024. All rights reserved.