skip to main content
10.1145/2377310.2377326acmotherconferencesArticle/Chapter ViewAbstractPublication PagescfiConference Proceedingsconference-collections
research-article

Compression of pending interest table with Bloom filter in content centric network

Published:11 September 2012Publication History

ABSTRACT

We propose compressed PIT structure based on Bloom Filter. And we argue that United Bloom Filter is better than Counting Bloom Filter in the PIT compression.

Recommendations

Comments

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Sign in
  • Published in

    cover image ACM Other conferences
    CFI '12: Proceedings of the 7th International Conference on Future Internet Technologies
    September 2012
    78 pages
    ISBN:9781450316903
    DOI:10.1145/2377310

    Copyright © 2012 Authors

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    • Published: 11 September 2012

    Permissions

    Request permissions about this article.

    Request Permissions

    Check for updates

    Qualifiers

    • research-article

    Acceptance Rates

    Overall Acceptance Rate29of55submissions,53%

PDF Format

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader