Hash-Table and balanced-Tree based fib architecture for ccn routers

Kenta Shimazaki, Takashi Aoki, Takahiro Hatano, Takuya Otsuka, Akihiko Miyazaki, Toshitaka Tsuda, Nozomu Togawa

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

    1 Citation (Scopus)

    Abstract

    Recently, content centric networking (CCN) attracts attention as a next generation network on which every router forwards a packet to another router and also functions as a server. A CCN router has a forwarding table called FIB (Forwarding Information Base) but its table look-up can become a bottleneck. In this paper, we propose FIB data structure for CCN routers which can reduce the number of comparisons in its look-up table. Our proposed FIB is composed of a bloom filter and a hash table and each hash entry is connected to a balanced binarysearch tree. By using our FIB, the number of comparisons cannot much increase even if hash collisions occur. Experimental results demonstrate the effectiveness of the proposed FIB over the several existing methods.

    Original languageEnglish
    Title of host publicationISOCC 2016 - International SoC Design Conference: Smart SoC for Intelligent Things
    PublisherInstitute of Electrical and Electronics Engineers Inc.
    Pages67-68
    Number of pages2
    ISBN (Electronic)9781467393089
    DOIs
    Publication statusPublished - 2016 Dec 27
    Event13th International SoC Design Conference, ISOCC 2016 - Jeju, Korea, Republic of
    Duration: 2016 Oct 23 → 2016 Oct 26

    Other

    Other13th International SoC Design Conference, ISOCC 2016
    CountryKorea, Republic of
    CityJeju
    Period16/10/23 → 16/10/26

    Fingerprint

    Routers
    Next generation networks
    data structures
    Data structures
    Servers
    entry
    filters
    collisions

    ASJC Scopus subject areas

    • Hardware and Architecture
    • Electrical and Electronic Engineering
    • Instrumentation

    Cite this

    Shimazaki, K., Aoki, T., Hatano, T., Otsuka, T., Miyazaki, A., Tsuda, T., & Togawa, N. (2016). Hash-Table and balanced-Tree based fib architecture for ccn routers. In ISOCC 2016 - International SoC Design Conference: Smart SoC for Intelligent Things (pp. 67-68). [7799736] Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ISOCC.2016.7799736

    Hash-Table and balanced-Tree based fib architecture for ccn routers. / Shimazaki, Kenta; Aoki, Takashi; Hatano, Takahiro; Otsuka, Takuya; Miyazaki, Akihiko; Tsuda, Toshitaka; Togawa, Nozomu.

    ISOCC 2016 - International SoC Design Conference: Smart SoC for Intelligent Things. Institute of Electrical and Electronics Engineers Inc., 2016. p. 67-68 7799736.

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

    Shimazaki, K, Aoki, T, Hatano, T, Otsuka, T, Miyazaki, A, Tsuda, T & Togawa, N 2016, Hash-Table and balanced-Tree based fib architecture for ccn routers. in ISOCC 2016 - International SoC Design Conference: Smart SoC for Intelligent Things., 7799736, Institute of Electrical and Electronics Engineers Inc., pp. 67-68, 13th International SoC Design Conference, ISOCC 2016, Jeju, Korea, Republic of, 16/10/23. https://doi.org/10.1109/ISOCC.2016.7799736
    Shimazaki K, Aoki T, Hatano T, Otsuka T, Miyazaki A, Tsuda T et al. Hash-Table and balanced-Tree based fib architecture for ccn routers. In ISOCC 2016 - International SoC Design Conference: Smart SoC for Intelligent Things. Institute of Electrical and Electronics Engineers Inc. 2016. p. 67-68. 7799736 https://doi.org/10.1109/ISOCC.2016.7799736
    Shimazaki, Kenta ; Aoki, Takashi ; Hatano, Takahiro ; Otsuka, Takuya ; Miyazaki, Akihiko ; Tsuda, Toshitaka ; Togawa, Nozomu. / Hash-Table and balanced-Tree based fib architecture for ccn routers. ISOCC 2016 - International SoC Design Conference: Smart SoC for Intelligent Things. Institute of Electrical and Electronics Engineers Inc., 2016. pp. 67-68
    @inproceedings{5959d76d21b04d71b66bc1786552ea4b,
    title = "Hash-Table and balanced-Tree based fib architecture for ccn routers",
    abstract = "Recently, content centric networking (CCN) attracts attention as a next generation network on which every router forwards a packet to another router and also functions as a server. A CCN router has a forwarding table called FIB (Forwarding Information Base) but its table look-up can become a bottleneck. In this paper, we propose FIB data structure for CCN routers which can reduce the number of comparisons in its look-up table. Our proposed FIB is composed of a bloom filter and a hash table and each hash entry is connected to a balanced binarysearch tree. By using our FIB, the number of comparisons cannot much increase even if hash collisions occur. Experimental results demonstrate the effectiveness of the proposed FIB over the several existing methods.",
    author = "Kenta Shimazaki and Takashi Aoki and Takahiro Hatano and Takuya Otsuka and Akihiko Miyazaki and Toshitaka Tsuda and Nozomu Togawa",
    year = "2016",
    month = "12",
    day = "27",
    doi = "10.1109/ISOCC.2016.7799736",
    language = "English",
    pages = "67--68",
    booktitle = "ISOCC 2016 - International SoC Design Conference: Smart SoC for Intelligent Things",
    publisher = "Institute of Electrical and Electronics Engineers Inc.",
    address = "United States",

    }

    TY - GEN

    T1 - Hash-Table and balanced-Tree based fib architecture for ccn routers

    AU - Shimazaki, Kenta

    AU - Aoki, Takashi

    AU - Hatano, Takahiro

    AU - Otsuka, Takuya

    AU - Miyazaki, Akihiko

    AU - Tsuda, Toshitaka

    AU - Togawa, Nozomu

    PY - 2016/12/27

    Y1 - 2016/12/27

    N2 - Recently, content centric networking (CCN) attracts attention as a next generation network on which every router forwards a packet to another router and also functions as a server. A CCN router has a forwarding table called FIB (Forwarding Information Base) but its table look-up can become a bottleneck. In this paper, we propose FIB data structure for CCN routers which can reduce the number of comparisons in its look-up table. Our proposed FIB is composed of a bloom filter and a hash table and each hash entry is connected to a balanced binarysearch tree. By using our FIB, the number of comparisons cannot much increase even if hash collisions occur. Experimental results demonstrate the effectiveness of the proposed FIB over the several existing methods.

    AB - Recently, content centric networking (CCN) attracts attention as a next generation network on which every router forwards a packet to another router and also functions as a server. A CCN router has a forwarding table called FIB (Forwarding Information Base) but its table look-up can become a bottleneck. In this paper, we propose FIB data structure for CCN routers which can reduce the number of comparisons in its look-up table. Our proposed FIB is composed of a bloom filter and a hash table and each hash entry is connected to a balanced binarysearch tree. By using our FIB, the number of comparisons cannot much increase even if hash collisions occur. Experimental results demonstrate the effectiveness of the proposed FIB over the several existing methods.

    UR - http://www.scopus.com/inward/record.url?scp=85010369626&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=85010369626&partnerID=8YFLogxK

    U2 - 10.1109/ISOCC.2016.7799736

    DO - 10.1109/ISOCC.2016.7799736

    M3 - Conference contribution

    AN - SCOPUS:85010369626

    SP - 67

    EP - 68

    BT - ISOCC 2016 - International SoC Design Conference: Smart SoC for Intelligent Things

    PB - Institute of Electrical and Electronics Engineers Inc.

    ER -

    Access to Document