Exploit the known or explore the unknown?

Chiocchetti, Raffaele; Rossi, Dario; Rossini, Giuseppe; Carofiglio, Giovanna; Perino, Diego

doi:10.1145/2342488.2342491

Cited by 67 publications

(57 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The benefit of routing towards nearest replicas, rather than towards nearest designated servers, has been observed empirically [13,15,21]. Deghan et al [19], Abedini and Shakkotai [1], and Xie et al [56] all study joint routing and content placement schemes in a bipartite, single-hop setting.…”

Section: Related Workmentioning

confidence: 99%

Jointly optimal routing and caching for arbitrary network topologies

Ioannidis

Yeh

2017

Proceedings of the 4th ACM Conference on Information-Centric Networking

View full text Add to dashboard Cite

We study a problem of fundamental importance to ICNs, namely, minimizing routing costs by jointly optimizing caching and routing decisions over an arbitrary network topology. We consider both source routing and hop-by-hop routing settings. The respective offline problems are NP-hard. Nevertheless, we show that there exist polynomial time approximation algorithms producing solutions within a constant approximation from the optimal. We also produce distributed, adaptive algorithms with the same approximation guarantees. We simulate our adaptive algorithms over a broad array of different topologies. Our algorithms reduce routing costs by several orders of magnitude compared to prior art, including algorithms optimizing caching under fixed routing.

show abstract

Section: Related Workmentioning

confidence: 99%

Jointly optimal routing and caching for arbitrary network topologies

Ioannidis

Yeh

2017

Proceedings of the 4th ACM Conference on Information-Centric Networking

View full text Add to dashboard Cite

show abstract

“…Chiocchatti et al [61] evaluated two forwarding approaches, exploitation and exploration. Exploitation is forwarding by FIB, i.e.…”

Section: Data Plane Approachmentioning

confidence: 99%

A Survey of Caching Networks in Content Oriented Networks

Yamamoto

2016

IEICE Trans. Commun.

View full text Add to dashboard Cite

SUMMARY Content oriented network is expected to be one of the most promising approaches for resolving design concept difference between content oriented network services and location oriented architecture of current network infrastructure. There have been proposed several content oriented network architectures, but research efforts for content oriented networks have just started and technical issues to be resolved are still remained. Because of content oriented feature, content data transmitted in a network can be reused by content requests from other users. Pervasive cache is one of the most important benefits brought by the content oriented network architecture, which forms interconnected caching networks. Caching network is the hottest research area and lots of research activities have been published. This paper surveys recent research activities for caching networks in content oriented networks, with focusing on important factors which affect caching network performance, i.e. content request routing, caching decision, and replacement policy of cache. And this paper also discusses future direction of caching network researches. key words: cache networks, content oriented networks, in-network cache

show abstract

“…However, we provide 8 built-in topologies: five of them are realistic ISP networks (Geant, Abilene, Level3, Qwest, Sprint), and three are synthetic (random, torus and tree). For each network, ccnSim is able to build different routing FIBs (either precomputing the shortest-path and multiple-path based on standard graph algorithms [15] or possibly with a dynamic flooding-based exploration [14]). As we can observe from Fig.…”

Section: Node Architecturementioning

confidence: 99%

“…Other multi-path strategies, both static [15] and dynamic [14] are already available, while further strategies can be implemented by overwriting the getDecision() method.…”

Section: Node Architecturementioning

confidence: 99%

“…While our previous research has focused on the performance of CCN gathered through ccnSim [14]- [16], [21], this paper focuses on the performance of the ccnSim tool itself. Specifically, two crucial aspects have been taken into account in the design of ccnSim, namely a) Memory occupancy: The simulation of very large catalogs and very large cache size is essential to gather CCN performance under realistic settings.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

ccnSim: An highly scalable CCN simulator

Chiocchetti

Rossi

Rossini

2013

2013 IEEE International Conference on Communications (ICC)

Self Cite

View full text Add to dashboard Cite

Abstract-Research interest about Information Centric Networking (ICN) has grown at a very fast pace over the last few years, especially after the 2009 seminal paper of Van Jacobson et al. describing a Content Centric Network (CCN) architecture. While significant research effort has been produced in terms of architectures, algorithms, and models, the scientific community currently lacks common tools and scenarios to allow a fair crosscomparison among the different proposals.The situation is particularly complex as the commonly used general-purpose simulators cannot cope with the expected system scale: thus, many proposals are currently evaluated over small and unrealistic scale, especially in terms of dominant factors like catalog and cache sizes. As such, there is need of a scalable tool under which different algorithms can be tested and compared.Over the last years, we have developed and optimized ccnSim, an highly scalable chunk-level simulator especially suitable for the analysis of caching performance of CCN network. In this paper, we briefly describe the tool, and present an extensive benchmark of its performance. To give an idea of ccnSim scalability, a common off-the-shelf PC equipped with 8GB of RAM memory is able to simulate 2-hours of a 50-nodes CCN network, where each nodes is equipped with 10 GB caches, serving a 1 PB catalog in about 20 min CPU time.

show abstract

Exploit the known or explore the unknown?

Cited by 67 publications

References 15 publications

Jointly optimal routing and caching for arbitrary network topologies

Jointly optimal routing and caching for arbitrary network topologies

A Survey of Caching Networks in Content Oriented Networks

ccnSim: An highly scalable CCN simulator

Contact Info

Product

Resources

About