Supporting multi-dimensional naming for NDN applications

Shuai Gao, Hongke Zhang, Beichuan Zhang

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Named Data Networking (NDN) adopts one-dimensional hierarchical naming and lookup operations based on longest prefix matching. On the other hand, users may express their requests with multi-dimensional attributes in order to meet the intrinsic spatial-temporal nature of the data existing in IoT applications. To bridge the gap between multi-dimensional user requests and one-dimensional hierarchical names in NDN applications, a novel middleware supporting multi-dimensional naming is designed to support efficient Interest expressions through name translation and optimization, as well as keep original NDN operations unchanged. Simulation experiments show that the proposed solution can improve the content retrieval efficiency and outperform the other baseline schemes in terms of the number of Interest packets and content retrieval time.

Original languageEnglish (US)
Title of host publication2016 IEEE Globecom Workshops, GC Wkshps 2016 - Proceedings
PublisherInstitute of Electrical and Electronics Engineers Inc.
ISBN (Electronic)9781509024827
DOIs
StatePublished - Feb 8 2017
Event2016 IEEE Globecom Workshops, GC Wkshps 2016 - Washington, United States
Duration: Dec 4 2016Dec 8 2016

Other

Other2016 IEEE Globecom Workshops, GC Wkshps 2016
CountryUnited States
CityWashington
Period12/4/1612/8/16

Fingerprint

networking
Middleware
Experiments
efficiency
simulation
experiment
Internet of things

ASJC Scopus subject areas

  • Communication
  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Cite this

Gao, S., Zhang, H., & Zhang, B. (2017). Supporting multi-dimensional naming for NDN applications. In 2016 IEEE Globecom Workshops, GC Wkshps 2016 - Proceedings [7849054] Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/GLOCOMW.2016.7849054

Supporting multi-dimensional naming for NDN applications. / Gao, Shuai; Zhang, Hongke; Zhang, Beichuan.

2016 IEEE Globecom Workshops, GC Wkshps 2016 - Proceedings. Institute of Electrical and Electronics Engineers Inc., 2017. 7849054.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Gao, S, Zhang, H & Zhang, B 2017, Supporting multi-dimensional naming for NDN applications. in 2016 IEEE Globecom Workshops, GC Wkshps 2016 - Proceedings., 7849054, Institute of Electrical and Electronics Engineers Inc., 2016 IEEE Globecom Workshops, GC Wkshps 2016, Washington, United States, 12/4/16. https://doi.org/10.1109/GLOCOMW.2016.7849054
Gao S, Zhang H, Zhang B. Supporting multi-dimensional naming for NDN applications. In 2016 IEEE Globecom Workshops, GC Wkshps 2016 - Proceedings. Institute of Electrical and Electronics Engineers Inc. 2017. 7849054 https://doi.org/10.1109/GLOCOMW.2016.7849054
Gao, Shuai ; Zhang, Hongke ; Zhang, Beichuan. / Supporting multi-dimensional naming for NDN applications. 2016 IEEE Globecom Workshops, GC Wkshps 2016 - Proceedings. Institute of Electrical and Electronics Engineers Inc., 2017.
@inproceedings{53f2d4042b3b4a0fa3793b9291fb34e5,
title = "Supporting multi-dimensional naming for NDN applications",
abstract = "Named Data Networking (NDN) adopts one-dimensional hierarchical naming and lookup operations based on longest prefix matching. On the other hand, users may express their requests with multi-dimensional attributes in order to meet the intrinsic spatial-temporal nature of the data existing in IoT applications. To bridge the gap between multi-dimensional user requests and one-dimensional hierarchical names in NDN applications, a novel middleware supporting multi-dimensional naming is designed to support efficient Interest expressions through name translation and optimization, as well as keep original NDN operations unchanged. Simulation experiments show that the proposed solution can improve the content retrieval efficiency and outperform the other baseline schemes in terms of the number of Interest packets and content retrieval time.",
author = "Shuai Gao and Hongke Zhang and Beichuan Zhang",
year = "2017",
month = "2",
day = "8",
doi = "10.1109/GLOCOMW.2016.7849054",
language = "English (US)",
booktitle = "2016 IEEE Globecom Workshops, GC Wkshps 2016 - Proceedings",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
address = "United States",

}

TY - GEN

T1 - Supporting multi-dimensional naming for NDN applications

AU - Gao, Shuai

AU - Zhang, Hongke

AU - Zhang, Beichuan

PY - 2017/2/8

Y1 - 2017/2/8

N2 - Named Data Networking (NDN) adopts one-dimensional hierarchical naming and lookup operations based on longest prefix matching. On the other hand, users may express their requests with multi-dimensional attributes in order to meet the intrinsic spatial-temporal nature of the data existing in IoT applications. To bridge the gap between multi-dimensional user requests and one-dimensional hierarchical names in NDN applications, a novel middleware supporting multi-dimensional naming is designed to support efficient Interest expressions through name translation and optimization, as well as keep original NDN operations unchanged. Simulation experiments show that the proposed solution can improve the content retrieval efficiency and outperform the other baseline schemes in terms of the number of Interest packets and content retrieval time.

AB - Named Data Networking (NDN) adopts one-dimensional hierarchical naming and lookup operations based on longest prefix matching. On the other hand, users may express their requests with multi-dimensional attributes in order to meet the intrinsic spatial-temporal nature of the data existing in IoT applications. To bridge the gap between multi-dimensional user requests and one-dimensional hierarchical names in NDN applications, a novel middleware supporting multi-dimensional naming is designed to support efficient Interest expressions through name translation and optimization, as well as keep original NDN operations unchanged. Simulation experiments show that the proposed solution can improve the content retrieval efficiency and outperform the other baseline schemes in terms of the number of Interest packets and content retrieval time.

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

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

U2 - 10.1109/GLOCOMW.2016.7849054

DO - 10.1109/GLOCOMW.2016.7849054

M3 - Conference contribution

AN - SCOPUS:85015931707

BT - 2016 IEEE Globecom Workshops, GC Wkshps 2016 - Proceedings

PB - Institute of Electrical and Electronics Engineers Inc.

ER -