Improving the freshness of NDN forwarding states

Cao, Jianxun; Pei, Dan; Wu, Zhelun; Zhang, Xiaoping; Zhang, Beichuan; Wang, Lan; Zhao, Youjian

doi:10.1109/ifipnetworking.2016.7497213

Cited by 9 publications

(4 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…These include Heterogeneous-Latency Adaptive Forwarding (HLAF) by [6], adaptive forwarding strategy with quality of service (QoS-FS) by [7], Adaptive SRTT Update (ASU) by [8], Probability-based Adaptive Forwarding (PAF) by [9] and On-demand Multi-Path Interest Forwarding (OMP-IF) by [10].…”

Section: Few Researchers Use Round Trip Time (Rtt) As a Basis Indication To Find Alternative Linksmentioning

confidence: 99%

“…However, it was compared to Best Route which is not suitable as it is not the same type of forwarding strategy which manage QoS. ASU [8] is the first paper illustrated the effect of outdated forwarding states in the current scheme in interface ranking: probing oscillation and SRTT slow convergence. However, it only focused on interface ranking and does not impact the strategy of managing congestion and NACK.…”

Section: Few Researchers Use Round Trip Time (Rtt) As a Basis Indication To Find Alternative Linksmentioning

confidence: 99%

See 1 more Smart Citation

Performance Evaluation of an Adaptive Forwarding Strategy in Named Data Networking

Mahmood¹

2019

IJATCSE

View full text Add to dashboard Cite

Named Data Networking (NDN) is an envisioned Internet architecture that uses named data to locate the data of interest as opposed to the IP address of the stored data.The forwarding strategy is critical in this network to ensure the data is well received in a timely manner. Stochastic Adaptive Forwarding (SAF) is said to have an increased throughput and provide quick recovery as it efficiently chooses the potential forwarding link whenever there is a failure on the existing link. SAF is designed to consider both the context and content of the networks to optimize its forwarding behavior. This paper compares the performance of SAF and Best Route algorithms, in terms of Interest satisfaction ratio, cache hit ratio, delay, Interest retransmission rate and hop count value. The results show SAF outperforms Best Route except for the hop count value.

show abstract

Section: Few Researchers Use Round Trip Time (Rtt) As a Basis Indication To Find Alternative Linksmentioning

confidence: 99%

Section: Few Researchers Use Round Trip Time (Rtt) As a Basis Indication To Find Alternative Linksmentioning

confidence: 99%

Performance Evaluation of an Adaptive Forwarding Strategy in Named Data Networking

Mahmood¹

2019

IJATCSE

View full text Add to dashboard Cite

show abstract

“…The second experiment aims to verify the effectiveness of PTP in a diamond topology [22], which can be used to test the performance of the cases with shared links. The traffic is aggregated and split at certain nodes.…”

Section: Scenario 2: Diamond Topologymentioning

confidence: 99%

PTP: Path-specified transport protocol for concurrent multipath transmission in named data networks

Lee

Flynn

et al. 2018

Computer Networks

View full text Add to dashboard Cite

“…When a router receives an Interest, it checks whether there is a match in its CS for the CO requested in the Interest. e Based on the information in its FIB and PIT, each router establishes an interface ranking [6] to determine the interfaces that should be used to forward Interests in order use the best paths over which content should be retrieved. e ranking of interfaces classi es interfaces into classes based on perceived performance, and uses periodic measurement of performance and probing.…”

Section: The Ndn Forwarding Planementioning

confidence: 99%

Adn

Garcia-Luna-Aceves

2017

Proceedings of the Second International Conference on Internet-of-Things Design and Implementation

View full text Add to dashboard Cite

Forwarding data by name has been assumed to be a necessary aspect of an information-centric redesign of the current Internet architecture that makes content access, dissemination, and storage more e cient. e Named Data Networking (NDN) and ContentCentric Networking (CCNx) architectures are the leading examples of such an approach. However, forwarding data by name incurs storage and communication complexities that are orders of magnitude larger than solutions based on forwarding data using addresses. Furthermore, the speci c algorithms used in NDN and CCNx have been shown to have a number of limitations. e Addressable Data Networking (ADN) architecture is introduced as an alternative to NDN and CCNx. ADN is particularly a ractive for large-scale deployments of the Internet of ings (IoT), because it requires far less storage and processing in relaying nodes than NDN. ADN allows things and data to be denoted by names, just like NDN and CCNx do. However, instead of replacing the waist of the Internet with named-data forwarding, ADN uses an address-based forwarding plane and introduces an information plane that seamlessly maps names to addresses without the involvement of end-user applications. Simulation results illustrate the order of magnitude savings in complexity that can be a ained with ADN compared to NDN. CCS CONCEPTS•Networks →Network architectures; Network design principles; Naming and addressing; KEYWORDS Content-centric networking, IoT, forwarding ACM Reference format:

show abstract

Improving the freshness of NDN forwarding states

Cited by 9 publications

References 13 publications

Performance Evaluation of an Adaptive Forwarding Strategy in Named Data Networking

Performance Evaluation of an Adaptive Forwarding Strategy in Named Data Networking

PTP: Path-specified transport protocol for concurrent multipath transmission in named data networks

Adn

Contact Info

Product

Resources

About