Information-centric networking (ICN) has gained attention from network research communities due to its capability of efficient content dissemination. In-network caching function in ICN plays an important role to achieve the design motivation. However, many researchers on in-network caching due to its ability to efficiently disseminate content. The in-network caching function in ICN plays an important role in realizing the design goals. However, many in-network caching researchers have focused on where to cache rather than how to cache: the former is known as content deployment in the network and the latter is known as cache replacement in an ICN router. Although the cache replacement has been intensively researched in the context of web-caching and content delivery network previously, networks, the conventional approaches cannot be directly applied to ICN due to the fine granularity of chunks in ICN, which eventually changes the access patterns. In this paper, we argue that ICN requires a novel cache replacement algorithm to fulfill the requirements in the design of a high performance ICN router. Then, we propose a novel cache replacement algorithm to satisfy the requirements named Compact CLOCK with Adaptive Replacement (Compact CAR), which can reduce the consumption of cache memory to one-tenth compared to conventional approaches. In this paper, we argue that ICN requires a novel cache replacement algorithm to fulfill the requirements set for high performance ICN routers. Our solution, Compact CLOCK with Adaptive Replacement (Compact CAR), is a novel cache replacement algorithm that satisfies the requirements. The evaluation result shows that the consumption of cache memory required to achieve a desired performance can be reduced by 90% compared to conventional approaches such as FIFO and CLOCK.

Topological structure of peer-to-peer (P2P) networks affects their operating performance. Thus, various models have been proposed to construct an efficient topology for the P2P networks. However, due to the simultaneous failures of peers and other disastrous events, it is difficult to maintain the originally designed topological structure that provides the network with some performance benefits. For this reason, in this paper we propose a simple local rewiring method that changes the network topology to have small diameter as well as highly clustered structure. Moreover, the presented evaluation study shows how these topological properties are involved with the performance of P2P networks.

This article proposes a method to improve the performance of Message Exchange Network (MeNW) which is modern data distribution network incorporating the search and obtain mechanism. We explore an idea of shortcut creation which can be widely adapted to a topological structure of various network applications. We first define a metric called Efficiency Coefficient (EC) that quantifies the performance enhancement by a shortcut creation. In the design of EC, we consider not only diameter of the topology but also the amount of messages exchanged in the network. Then, we theoretically analyze the creation of a single optimal shortcut in the system based on the performance metric. The simulation results show that the shortcut by the proposed method reduces the network resource to further 30% compared with conventional approaches.

This article introduces a self-organizing model which builds the topology of a DHT mapping system for ICN. Due to its self-organizing operation and low average degree of maintenance, the management overhead of the system is reduced dramatically, which yields inherent scalability. The proposed model can improve latency by around 10% compared to an existing approach which has a near optimal average distance when the number of nodes and degree are given. In particular, its operation is simple which eases maintenance concerns. Moreover, we analyze the model theoretically to provide a deeper understanding of the proposal.