2013
DOI: 10.1016/j.comcom.2013.01.008
|View full text |Cite
|
Sign up to set email alerts
|

Evaluating CCN multi-path interest forwarding strategies

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
53
0

Year Published

2013
2013
2022
2022

Publication Types

Select...
4
3

Relationship

0
7

Authors

Journals

citations
Cited by 73 publications
(53 citation statements)
references
References 19 publications
0
53
0
Order By: Relevance
“…When a Data packet arrives at a caching node, it uses a hash function to determine in which of its neighbours (including itself) to cache the packet. However, in [16], the authors argue that explicit coordination policies would likely violate ICN line of speed constraint, while simple randomized caching policies could perform almost as well as more complex ones.…”
Section: Caching Strategies and Replacement Policiesmentioning
confidence: 99%
See 1 more Smart Citation
“…When a Data packet arrives at a caching node, it uses a hash function to determine in which of its neighbours (including itself) to cache the packet. However, in [16], the authors argue that explicit coordination policies would likely violate ICN line of speed constraint, while simple randomized caching policies could perform almost as well as more complex ones.…”
Section: Caching Strategies and Replacement Policiesmentioning
confidence: 99%
“…LFU is computationally more expensive than LRU, which is therefore considered for line speed operations. To maintain ICN simple and scalable, the random replacement, which is agnostic of the frequency and timing of requests, is sometimes preferred [16].…”
Section: Caching Strategies and Replacement Policiesmentioning
confidence: 99%
“…To make comparison we need to obtain the response time for 20KB data in the proposed architecture. To calculate the response time, we used the reference from the cache hit data obtained from [38]. The experiment by them showed the cache hit ratio for different cache replacement and cache decision policy.…”
Section: Simulation Results and Findingmentioning
confidence: 99%
“…We leave the investigation of the most complex arbitrary network topologies to future work. The properties of the underlying topologies are listed in Table 1, which are defined as follows: In spite of various arguments and experiments, there is no typically and properly justification for NDN parameters and they have specified based on authors' experiences and designs [6]. Therefore, the applied control parameters of the ACCPndn are iteratively learned under various network environments to make a real data communication in considered topologies.…”
Section: Evaluation Setupmentioning
confidence: 99%
“…Information-Centric Networking (ICN) [1,2,3] has been proposed as a solution for a viable and vital replacement for the current IP-based Internet due to the fundamental limitations of the Internet in supporting today's content-oriented services [4,5,6,7]. Named Data Networking (NDN) [8] is a prominent example and ongoing research effort of ICN design.…”
Section: Introductionmentioning
confidence: 99%