Analytical characterisation of multi-path content delivery in Content Centric Networks

Udugama, Asanga; Palipana, Sameera; Goerg, Carmelita

doi:10.1109/cfic.2013.6566319

Cited by 19 publications

(9 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…[32] tries to make a small enhancement on the model in [27] by enhancing the expression of the residual virtual round trip time (RVRTT). 1 However, both [31,32] continue to use the simple expression of the round trip delay.…”

Section: Related Workmentioning

confidence: 98%

“…Additionally, [31] extends the work in [27] to multi-path scenario considering cache miss probability with LRU caching and verifies the validity of the model using a packet level CCN simulator developed in OPNET. [32] tries to make a small enhancement on the model in [27] by enhancing the expression of the residual virtual round trip time (RVRTT).…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Modeling content transfer performance in information-centric networking

Ren

et al. 2017

Future Generation Computer Systems

View full text Add to dashboard Cite

Section: Related Workmentioning

confidence: 98%

Section: Related Workmentioning

confidence: 99%

Modeling content transfer performance in information-centric networking

Ren

et al. 2017

Future Generation Computer Systems

View full text Add to dashboard Cite

“…The flooding‐based strategies strike multiple sources over different paths, and contents are delivered back to the requester following the reverse directions 15,16,18–22,55 . It guarantees retrieving the content as Interest is forwarded to all available outgoing interfaces.…”

Section: Literature Reviewmentioning

confidence: 99%

“…Each NDN router comprises three unique data structures: Forwarding Information Base ( FIB ), Pending Interest Table ( PIT ), and Content Store ( CS ) 12–14 . A FIB entry includes a name prefix and corresponding interfaces (paths or routes) to reach that prefix 15–25 . Additionally, each router possesses a strategy module that makes forwarding decisions for an Interest 24 .…”

Section: Introductionmentioning

confidence: 99%

A source‐driven probabilistic forwarding and caching strategy in NDN and SDN‐based NDN

Iqbal

Asaduzzaman

Hoque

2022

Int J Communication

View full text Add to dashboard Cite

Summary NDN forwarding strategies are mainly developed receiver‐driven, where Interest forwarding and Data (content) delivery are controlled from the consumers' viewpoint. The receiver‐driven strategies are greedy by nature and emphasize optimizing the Interest forwarding, which is far from the performance bottleneck as an Interest is of tiny size in compared with a content's size. Thus, optimizing the content delivery can improve the forwarding performance. Moreover, source‐driven optimization of content delivery can alleviate the greedy nature of its counterpart. In this work, a source‐driven forwarding strategy is proposed where the content sources respond to Interest requests in a distributed manner. The content requests hit all the sources, but the sources respond probabilistically such that the content retrieval overhead and latency are minimized. The strategy consents the nearer sources to set a high probability of reacting with the matching content. On the contrary, the distant sources answer with an Offer to save transmission overhead. Besides, a caching strategy is proposed, an integral part of the source‐driven scheme, that caches diverse contents considering the gap between successive copies and content availability while admitting new contents. Next, we extend the source‐driven probabilistic forwarding strategy to operate in SDN‐based NDN architecture. The SDN‐based solution controls the content delivery phase using the global knowledge of NDN cache states. Simulation study conducted using ndnSIM reveals that the proposed forwarding and caching strategy improves user satisfaction and network performance in terms of different performance metrics such as transmission overhead, latency, and cache hit.

show abstract

“…Also, another assumption that contents are split into the number of chunks with a mean of , where each chunk could be as long as P bytes, is made. Analogous to Udugama et al, 38 the interest request arrival process is modeled through a Markov-modulated rate process (MMRP). MMRP denotes that requesting content items in the class k is characterized by the Poisson process with intensity k = × q k , where and q k are total incoming interest rate and popularity of content in the class k, respectively.…”

Section: System Descriptionmentioning

confidence: 99%

Analytical characterization of cache replacement policy impact on content delivery time in information‐centric networks

Hashemi

Bohlooli

2019

Int J Communication

View full text Add to dashboard Cite

Summary Information‐centric networking (ICN) has emerged as a promising candidate for designing content‐based future Internet paradigms. ICN increases the utilization of a network through location‐independent content naming and in‐network content caching. In routers, cache replacement policy determines which content to be replaced in the case of cache free space shortage. Thus, it has a direct influence on user experience, especially content delivery time. Meanwhile, content can be provided from different locations simultaneously because of the multi‐source property of the content in ICN. To the best of our knowledge, no work has yet studied the impact of cache replacement policy on the content delivery time considering multi‐source content delivery in ICN, an issue addressed in this paper. As our contribution, we analytically quantify the average content delivery time when different cache replacement policies, namely, least recently used (LRU) and random replacement (RR) policy, are employed. As an impressive result, we report the superiority of these policies in term of the popularity distribution of contents. The expected content delivery time in a supposed network topology was studied by both theoretical and experimental method. On the basis of the obtained results, some interesting findings of the performance of used cache replacement policies are provided.

show abstract

Analytical characterisation of multi-path content delivery in Content Centric Networks

Cited by 19 publications

References 8 publications

Modeling content transfer performance in information-centric networking

Modeling content transfer performance in information-centric networking

A source‐driven probabilistic forwarding and caching strategy in NDN and SDN‐based NDN

Analytical characterization of cache replacement policy impact on content delivery time in information‐centric networks

Contact Info

Product

Resources

About