Home > Research > Publications & Outputs > Vicinity-based Replica Finding in Named Data Ne...

Electronic data

  • NDN_Paper_1__Draft_

    Rights statement: ©2020 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.

    Accepted author manuscript, 315 KB, PDF document

    Available under license: CC BY-NC: Creative Commons Attribution-NonCommercial 4.0 International License

Links

Text available via DOI:

View graph of relations

Vicinity-based Replica Finding in Named Data Networking

Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSNConference contribution/Paperpeer-review

Published

Standard

Vicinity-based Replica Finding in Named Data Networking. / Suwannasa, A.; Broadbent, M.; Mauthe, A.

2020 International Conference on Information Networking (ICOIN). IEEE, 2020. p. 146-151 9016429.

Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSNConference contribution/Paperpeer-review

Harvard

Suwannasa, A, Broadbent, M & Mauthe, A 2020, Vicinity-based Replica Finding in Named Data Networking. in 2020 International Conference on Information Networking (ICOIN)., 9016429, IEEE, pp. 146-151. https://doi.org/10.1109/ICOIN48656.2020.9016429

APA

Suwannasa, A., Broadbent, M., & Mauthe, A. (2020). Vicinity-based Replica Finding in Named Data Networking. In 2020 International Conference on Information Networking (ICOIN) (pp. 146-151). [9016429] IEEE. https://doi.org/10.1109/ICOIN48656.2020.9016429

Vancouver

Suwannasa A, Broadbent M, Mauthe A. Vicinity-based Replica Finding in Named Data Networking. In 2020 International Conference on Information Networking (ICOIN). IEEE. 2020. p. 146-151. 9016429 doi: 10.1109/ICOIN48656.2020.9016429

Author

Suwannasa, A. ; Broadbent, M. ; Mauthe, A. / Vicinity-based Replica Finding in Named Data Networking. 2020 International Conference on Information Networking (ICOIN). IEEE, 2020. pp. 146-151

Bibtex

@inproceedings{6ad11243468d4b81995455b6b029690f,
title = "Vicinity-based Replica Finding in Named Data Networking",
abstract = "In Named Data Networking (NDN) architectures, a content object is located according to the content's identifier and can be retrieved from all nodes that hold a replica of the content. The default forwarding strategy of NDN is to forward an Interest packet along the default path from the requester to the server to find a content object according to its name prefix. However, the best path may not be the default path, since content might also be located nearby. Hence, the default strategy could result in a sub-optimal delivery efficiency. To address this issue we introduce a vicinity-based replica finding scheme. This is based on the observation that content objects might be requested several times. Therefore, replicas can be often cached within a particular neighbourhood and thus it might be efficient to specifically look for them in order to improve the content delivery performance. Within this paper, we evaluate the optimal size of the vicinity within which content should be located (i.e. the distance between the requester and its neighbours that are considered within the content search). We also compare the proposed scheme with the default NDN forwarding strategy with respect to replica finding efficiency and network overhead. Using the proposed scheme, we demonstrate that the replica finding mechanism reduces the delivery time effectively with acceptable overhead costs.",
keywords = "Content delivery performance, Content search, Finding efficiency, Forwarding strategies, Named data networkings, Neighbourhood, Network overhead, Overhead costs, Efficiency",
author = "A. Suwannasa and M. Broadbent and A. Mauthe",
note = "{\textcopyright}2020 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE. ",
year = "2020",
month = mar,
day = "2",
doi = "10.1109/ICOIN48656.2020.9016429",
language = "English",
isbn = "9781728142005",
pages = "146--151",
booktitle = "2020 International Conference on Information Networking (ICOIN)",
publisher = "IEEE",

}

RIS

TY - GEN

T1 - Vicinity-based Replica Finding in Named Data Networking

AU - Suwannasa, A.

AU - Broadbent, M.

AU - Mauthe, A.

N1 - ©2020 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.

PY - 2020/3/2

Y1 - 2020/3/2

N2 - In Named Data Networking (NDN) architectures, a content object is located according to the content's identifier and can be retrieved from all nodes that hold a replica of the content. The default forwarding strategy of NDN is to forward an Interest packet along the default path from the requester to the server to find a content object according to its name prefix. However, the best path may not be the default path, since content might also be located nearby. Hence, the default strategy could result in a sub-optimal delivery efficiency. To address this issue we introduce a vicinity-based replica finding scheme. This is based on the observation that content objects might be requested several times. Therefore, replicas can be often cached within a particular neighbourhood and thus it might be efficient to specifically look for them in order to improve the content delivery performance. Within this paper, we evaluate the optimal size of the vicinity within which content should be located (i.e. the distance between the requester and its neighbours that are considered within the content search). We also compare the proposed scheme with the default NDN forwarding strategy with respect to replica finding efficiency and network overhead. Using the proposed scheme, we demonstrate that the replica finding mechanism reduces the delivery time effectively with acceptable overhead costs.

AB - In Named Data Networking (NDN) architectures, a content object is located according to the content's identifier and can be retrieved from all nodes that hold a replica of the content. The default forwarding strategy of NDN is to forward an Interest packet along the default path from the requester to the server to find a content object according to its name prefix. However, the best path may not be the default path, since content might also be located nearby. Hence, the default strategy could result in a sub-optimal delivery efficiency. To address this issue we introduce a vicinity-based replica finding scheme. This is based on the observation that content objects might be requested several times. Therefore, replicas can be often cached within a particular neighbourhood and thus it might be efficient to specifically look for them in order to improve the content delivery performance. Within this paper, we evaluate the optimal size of the vicinity within which content should be located (i.e. the distance between the requester and its neighbours that are considered within the content search). We also compare the proposed scheme with the default NDN forwarding strategy with respect to replica finding efficiency and network overhead. Using the proposed scheme, we demonstrate that the replica finding mechanism reduces the delivery time effectively with acceptable overhead costs.

KW - Content delivery performance

KW - Content search

KW - Finding efficiency

KW - Forwarding strategies

KW - Named data networkings

KW - Neighbourhood

KW - Network overhead

KW - Overhead costs

KW - Efficiency

U2 - 10.1109/ICOIN48656.2020.9016429

DO - 10.1109/ICOIN48656.2020.9016429

M3 - Conference contribution/Paper

SN - 9781728142005

SP - 146

EP - 151

BT - 2020 International Conference on Information Networking (ICOIN)

PB - IEEE

ER -