2019
DOI: 10.1016/j.comnet.2019.04.003
|View full text |Cite
|
Sign up to set email alerts
|

A diversity-based search-and-routing approach for named-data networking

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
20
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 26 publications
(20 citation statements)
references
References 12 publications
0
20
0
Order By: Relevance
“…The storage space of the router's CSes has a direct huge impact on the performance of the CCN [18]. In this paper, we evaluate the performance of basic CCN and our optimization mechanism, for different normalized cache sizes from 0.4 to 0.7.…”
Section: Resultsmentioning
confidence: 99%
See 1 more Smart Citation
“…The storage space of the router's CSes has a direct huge impact on the performance of the CCN [18]. In this paper, we evaluate the performance of basic CCN and our optimization mechanism, for different normalized cache sizes from 0.4 to 0.7.…”
Section: Resultsmentioning
confidence: 99%
“…The data packet forwarding process is shown in Fig. 4 [18,20]. After receiving the returned data packet, the router forwards the data packet according to the incoming interface in the PIT entry and deletes the PIT entry at the same time.…”
Section: B Basic Ccn Packet Forwarding Processmentioning
confidence: 99%
“…The Scenario-based performance evaluation of CCJRF-ICN execution and mathematical analysis of the protocol impart strength to our proposal. In contradiction to the proposed approach, most stateof-the-art research works [14,17,18,19,20,21,22] have contributed separate, isolated, and non-cooperative solutions in the context of routing or caching in ICN. Thus, the in-network caching capability of ICN cannot be fully utilized to reduce data retrieval delay.…”
Section: Figure 1 the State-of-the-art Scenario In Icnmentioning
confidence: 94%
“…The scalability of protocol and an approach that smartly integrates the shortest path routing with the given search procedure needs attention from the research community. The research work presented in [22] extends a routing algorithm named DIVER that explores inside a network to locate and fetch router's copies that are nearer to the end-users. The performance evaluation of protocol has not considered a scenario with multiple producers providing various data chunks with distinct sizes over different network topologies.…”
Section: Related Workmentioning
confidence: 99%
“…Bastos et al DIVER [92,95] introduce Diversity-based Search and Routing mechanism (DIVER) which focuses on guaranteeing content reachability from volatile copies in the network. With a given probability, DIVER routers send out probe packets to collect information about the availability of content chunks in neighboring routers (based on a round robin mechanism), then evaluate whether the availability is up to date.…”
Section: Probing-based Forwarding Strategiesmentioning
confidence: 99%