A unified data structure of name lookup for NDN data plane

Miaomiao Liu, Tian Song, Yating Yang, Beichuan Zhang

Research output: ResearchConference contribution

Abstract

NDN data plane relays name-based packets by maintaining three tables: Content Store, Pending Interest Table and Forwarding Information Base. The three tables require similar but different schemes to be matched and updated in a nearly per-packet fashion, thus individual data structure is required for each table. In this work, we propose a unified data structure of name lookup for all three tables, namely CTrie, aiming at reducing the computational cost from three pipelined lookup rounds down to one unified round. CTrie extends the original Patricia trie to a combinational trie structure built from both component-based and byte-based hierarchical names. We compared CTrie with other approaches in speed and memory. The results show that CTrie runs 3.2 times faster and consumes about 38% memory than the current ones in terms of the whole data plane. CTrie fits for all application scenarios of NDN and especially well for IoT like lightweight-deployed scenarios.

LanguageEnglish (US)
Title of host publicationICN 2017 - Proceedings of the 4th ACM Conference on Information Centric Networking
PublisherAssociation for Computing Machinery, Inc
Pages188-189
Number of pages2
ISBN (Electronic)9781450351225
DOIs
StatePublished - Sep 26 2017
Event4th ACM Conference on Information-Centric Networking, ICN 2017 - Berlin, Germany
Duration: Sep 26 2017Sep 28 2017

Other

Other4th ACM Conference on Information-Centric Networking, ICN 2017
CountryGermany
CityBerlin
Period9/26/179/28/17

Fingerprint

Data structures
Data storage equipment
Costs
Internet of things

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Information Systems

Cite this

Liu, M., Song, T., Yang, Y., & Zhang, B. (2017). A unified data structure of name lookup for NDN data plane. In ICN 2017 - Proceedings of the 4th ACM Conference on Information Centric Networking (pp. 188-189). Association for Computing Machinery, Inc. DOI: 10.1145/3125719.3132103

A unified data structure of name lookup for NDN data plane. / Liu, Miaomiao; Song, Tian; Yang, Yating; Zhang, Beichuan.

ICN 2017 - Proceedings of the 4th ACM Conference on Information Centric Networking. Association for Computing Machinery, Inc, 2017. p. 188-189.

Research output: ResearchConference contribution

Liu, M, Song, T, Yang, Y & Zhang, B 2017, A unified data structure of name lookup for NDN data plane. in ICN 2017 - Proceedings of the 4th ACM Conference on Information Centric Networking. Association for Computing Machinery, Inc, pp. 188-189, 4th ACM Conference on Information-Centric Networking, ICN 2017, Berlin, Germany, 9/26/17. DOI: 10.1145/3125719.3132103
Liu M, Song T, Yang Y, Zhang B. A unified data structure of name lookup for NDN data plane. In ICN 2017 - Proceedings of the 4th ACM Conference on Information Centric Networking. Association for Computing Machinery, Inc. 2017. p. 188-189. Available from, DOI: 10.1145/3125719.3132103
Liu, Miaomiao ; Song, Tian ; Yang, Yating ; Zhang, Beichuan. / A unified data structure of name lookup for NDN data plane. ICN 2017 - Proceedings of the 4th ACM Conference on Information Centric Networking. Association for Computing Machinery, Inc, 2017. pp. 188-189
@inbook{591c62f4335246eea3a10091a5de44a7,
title = "A unified data structure of name lookup for NDN data plane",
abstract = "NDN data plane relays name-based packets by maintaining three tables: Content Store, Pending Interest Table and Forwarding Information Base. The three tables require similar but different schemes to be matched and updated in a nearly per-packet fashion, thus individual data structure is required for each table. In this work, we propose a unified data structure of name lookup for all three tables, namely CTrie, aiming at reducing the computational cost from three pipelined lookup rounds down to one unified round. CTrie extends the original Patricia trie to a combinational trie structure built from both component-based and byte-based hierarchical names. We compared CTrie with other approaches in speed and memory. The results show that CTrie runs 3.2 times faster and consumes about 38% memory than the current ones in terms of the whole data plane. CTrie fits for all application scenarios of NDN and especially well for IoT like lightweight-deployed scenarios.",
author = "Miaomiao Liu and Tian Song and Yating Yang and Beichuan Zhang",
year = "2017",
month = "9",
doi = "10.1145/3125719.3132103",
pages = "188--189",
booktitle = "ICN 2017 - Proceedings of the 4th ACM Conference on Information Centric Networking",
publisher = "Association for Computing Machinery, Inc",

}

TY - CHAP

T1 - A unified data structure of name lookup for NDN data plane

AU - Liu,Miaomiao

AU - Song,Tian

AU - Yang,Yating

AU - Zhang,Beichuan

PY - 2017/9/26

Y1 - 2017/9/26

N2 - NDN data plane relays name-based packets by maintaining three tables: Content Store, Pending Interest Table and Forwarding Information Base. The three tables require similar but different schemes to be matched and updated in a nearly per-packet fashion, thus individual data structure is required for each table. In this work, we propose a unified data structure of name lookup for all three tables, namely CTrie, aiming at reducing the computational cost from three pipelined lookup rounds down to one unified round. CTrie extends the original Patricia trie to a combinational trie structure built from both component-based and byte-based hierarchical names. We compared CTrie with other approaches in speed and memory. The results show that CTrie runs 3.2 times faster and consumes about 38% memory than the current ones in terms of the whole data plane. CTrie fits for all application scenarios of NDN and especially well for IoT like lightweight-deployed scenarios.

AB - NDN data plane relays name-based packets by maintaining three tables: Content Store, Pending Interest Table and Forwarding Information Base. The three tables require similar but different schemes to be matched and updated in a nearly per-packet fashion, thus individual data structure is required for each table. In this work, we propose a unified data structure of name lookup for all three tables, namely CTrie, aiming at reducing the computational cost from three pipelined lookup rounds down to one unified round. CTrie extends the original Patricia trie to a combinational trie structure built from both component-based and byte-based hierarchical names. We compared CTrie with other approaches in speed and memory. The results show that CTrie runs 3.2 times faster and consumes about 38% memory than the current ones in terms of the whole data plane. CTrie fits for all application scenarios of NDN and especially well for IoT like lightweight-deployed scenarios.

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

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

U2 - 10.1145/3125719.3132103

DO - 10.1145/3125719.3132103

M3 - Conference contribution

SP - 188

EP - 189

BT - ICN 2017 - Proceedings of the 4th ACM Conference on Information Centric Networking

PB - Association for Computing Machinery, Inc

ER -