Melola Discovery

← Melola Discovery

Open access Jurnal SINTA 1

Analytical modelling solution of producer mobility support scheme for named data networking

International Journal of Electrical and Computer Engineering (IJECE) · Vol. 9 No. 5 (2019)

DOI
10.11591/ijece.v9i5.pp3850-3861
ISSN
2722-2578, 2088-8708
Published
2019-10-01
Publisher
Institute of Advanced Engineering and Science
License
creativecommons.org/licenses/by-sa/4.0

Abstract

Named Data Networking (NDN) is a clean-slate future Internet architecture proposed to support content mobility. However, content producer mobility is not supported fundamentally and faces many challenges such as, high handoff latency, signaling overhead cost and unnecessary Interest packet losses. Hence, many approaches indirection-based approach, mapping-based approach, locator-based approach and control/data plane-based approach were proposed to address these problems. Mapping-based and control/data plane-based approach deployed servers for name resolution serveces to provide optimal data path after handoff, but introduces high handoff latency and signalling overhead cost. Indirection-based and locator-based approach schemes provide normal handoff delay, but introduces sub-optimal or tiangular routing path. Therefore, there is needs to provide substantial producer mobility support that minimizes the handoff latency, signaling cost and improve data packets delivery via optimal path once a content producer relocates to new location. This paper proposed a scheme that provides optimal data path using mobility Interest packets and broadcasting strategy. Analytical investigation result shows that our proposed scheme outperforms existing approaches in terms of handoff latency, signaling cost and path optimization.

Collaboration network of the authors

3 authors · 3 co-authorship links

Hover or tap a name to highlight its co-authors. Double-click to open the author's page.

  • Universiti Utara Malaysia
  • Different organisations
  • Same organisation
  • Affiliation unknown
  • Thicker line = more joint articles · bigger circle = more articles
Show as table
Co-authorOrganisationJoint articles

Affiliations come from OpenAlex; journal OAI-PMH metadata carries none. Authors without an OpenAlex ID are matched by name, which can merge or split people.

This record comes from Crossref (what the publisher deposited), because the journal's own OAI-PMH endpoint could not be harvested.

Metadata source: Crossref API (cadangan, berdasarkan ISSN) https://api.crossref.org/journals/2088-8708/works, first harvested 27 Okt 2026, last seen 27 Okt 2026.
Metadata as oai_dc, converted from Crossref
<oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"><dc:title>Analytical modelling solution of producer mobility support scheme for named data networking</dc:title><dc:creator>Hussaini, Muktar</dc:creator><dc:creator>Nor, Shahrudin Awang</dc:creator><dc:creator>Ahmad, Amran</dc:creator><dc:description>&lt;jats:p&gt;Named Data Networking (NDN) is a clean-slate future Internet architecture proposed to support content mobility. However, content producer mobility is not supported fundamentally and faces many challenges such as, high handoff latency, signaling overhead cost and unnecessary Interest packet losses. Hence, many approaches indirection-based approach, mapping-based approach, locator-based approach and control/data plane-based approach were proposed to address these problems. Mapping-based and control/data plane-based approach deployed servers for name resolution serveces to provide optimal data path after handoff, but introduces high handoff latency and signalling overhead cost. Indirection-based and locator-based approach schemes provide normal handoff delay, but introduces sub-optimal or tiangular routing path. Therefore, there is needs to provide substantial producer mobility support that minimizes the handoff latency, signaling cost and improve data packets delivery via optimal path once a content producer relocates to new location. This paper proposed a scheme that provides optimal data path using mobility Interest packets and broadcasting strategy. Analytical investigation result shows that our proposed scheme outperforms existing approaches in terms of handoff latency, signaling cost and path optimization.&lt;/jats:p&gt;</dc:description><dc:publisher>Institute of Advanced Engineering and Science</dc:publisher><dc:date>2019-10-01</dc:date><dc:type>info:eu-repo/semantics/article</dc:type><dc:format>application/pdf</dc:format><dc:identifier>https://doi.org/10.11591/ijece.v9i5.pp3850-3861</dc:identifier><dc:identifier>10.11591/ijece.v9i5.pp3850-3861</dc:identifier><dc:source>International Journal of Electrical and Computer Engineering (IJECE); Vol 9 No 5 (2019); 3850</dc:source><dc:source>2722-2578</dc:source><dc:source>2088-8708</dc:source><dc:relation>http://ijece.iaescore.com/index.php/IJECE/article/viewFile/15805/12983</dc:relation><dc:rights>http://creativecommons.org/licenses/by-sa/4.0</dc:rights></oai_dc:dc>