Content Routers: Fetching Data on Network Path

Wong, William G.; Giraldi, Marcus; Magalhães, Mauricio Ferreira; Kangasharju, Jussi

doi:10.1109/icc.2011.5963111

Cited by 24 publications

(24 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Moreover, caching redundancy in neighbor nodes has a great impact on the efficiency of request forwarding. In fact, content exploration mechanism [12,13] aims to discover the cached content nearby, in order to improve the cache hit ratio. However, such strat egy fails to bring much gain due to the redundancy.…”

Section: Basic Ideamentioning

confidence: 99%

A Distributed Caching based on Neighbor Cooperation in CCN

Qu¹,

Zhang²,

Zhao³

2014

10th International Conference on Wireless Communications, Networking and Mobile Computing (WiCOM 2014)

View full text Add to dashboard Cite

Content Centric Network is a clean-slate future Internet architecture, which is centered around content distribution. The In-network caching is the main feature of the new network paradigm. However, the default strategy which leaves cache everywhere in CCN results in serious cache redundancy among neighbor nodes. In this paper, we pro pose a Neighbor Cooperation Caching Strategy to tackle the redundancy problem. Our strategy includes a real time strategy called Cooperative Redundancy A voidance and a non-real time strategy called Cooperative Redundancy Elimination to reduce neighborhood redundancy. Our si mulation results show that our approach can effectively reduce reduplicate caches between neighbor nodes to im prove neighborhood cache utilization, as it achieves good performance in improving cache hit and reducing access delay.

show abstract

Section: Basic Ideamentioning

confidence: 99%

A Distributed Caching based on Neighbor Cooperation in CCN

Qu¹,

Zhang²,

Zhao³

2014

10th International Conference on Wireless Communications, Networking and Mobile Computing (WiCOM 2014)

View full text Add to dashboard Cite

show abstract

“…A major feature of this novel networking paradigm is in-network caching [6][7][8][9][10][11][12]. In CCN, each content router can cache content objects to shorten the distance of user requests.…”

Section: Introductionmentioning

confidence: 99%

Modeling of miss-probability in content-centric networking

Huang

Wang

et al. 2015

Sci. China Inf. Sci.

View full text Add to dashboard Cite

Content-Centric Networking (CCN), one of the most promising Future Internet architectures, is a hot research topic because of its advantages of content delivery over the Internet. Based on the Least Recently Used (LRU) replacement policy in CCN, the closed-form expression of the miss-probability is first derived by considering the sequence of arriving requests under single cache scenario, and then extended to linear and binary tree topologies. Consequently, the virtual round trip time (VRTT) is determined to be influenced by cache capacity and link bandwidth. The simulation results show that the proposed miss-probability model accords with realistic CCN network conditions, being much better than the existing model.

show abstract

“…The basic in-network caching mechanism is performed by a content router (CR) [7]. A CR is a data forwarder similar to a regular router, but it also has internal memory that can be used to store data in transit.…”

Section: Introductionmentioning

confidence: 99%

Neighborhood search and admission control in cooperative caching networks

Wong

Wang

Kangasharju

2012

2012 IEEE Global Communications Conference (GLOBECOM)

Self Cite

View full text Add to dashboard Cite

In-network caching of content is a popular technique for eliminating redundant traffic from the network and improve the performance of network applications. In this paper we present a novel cooperative caching strategy to improve performance of in-network caches. Our cooperative scheme is composed of an admission policy for the incoming data and a content exchange protocol between neighbor network caches to improve the search zone. The admission policy enforces that a previously cached data is not unnecessary replicated in other caches, resulting in more space for new data. The content exchange protocol allows for exchange on cached data, increasing the hit rate for incoming requests. The benefits are twofold: first, we reduce the redundant content caching in the network, and second, we improve the hit rate by informing the content cached in the nearby caches. As a proof-of-concept, we have implemented a prototype and evaluated its performance using different large-scale topologies against standard non-cooperative caching algorithms. Our numerical results show that both admission and content exchange policies yield large performance gains over standard algorithms.

show abstract

Content Routers: Fetching Data on Network Path

Cited by 24 publications

References 16 publications

A Distributed Caching based on Neighbor Cooperation in CCN

A Distributed Caching based on Neighbor Cooperation in CCN

Modeling of miss-probability in content-centric networking

Neighborhood search and admission control in cooperative caching networks

Contact Info

Product

Resources

About