Suyong Eum

CATT: potential based routing with content caching for ICN

Information Centric Networking (ICN) has shown possibilities to solve several problems of the Internet. At the same time, some problems need to be tackled in order to advance this promising architecture. In this paper we address two of the problems, namely routing and content caching. For the routing, we introduce the Potential Based Routing (PBR) to achieve several design goals such as availability, adaptability, diversity, and robustness. In addition, we examine the performance of a random caching policy which can be a promising candidate for ICN. The integrated system of both PBR and a caching policy is named the Cache Aware Target idenTification (CATT). Simulation results demonstrate that PBR with replications located on less than 1% of total nodes can achieve a near optimal routing performance (close to the shortest path routing) even though a request message is randomly forwarded.

CATT: Cache aware target identification for ICN

The role of the Internet has been changed to a content oriented data sharing network. This new paradigm requires a major transformation of the current Internet architecture, which leads to the birth of the Information Centric Networking (ICN) concept in todays Internet. In this article, we propose an ICN architecture named Cache Aware Target identification (CATT) and introduce the architecture by focusing on two of its major components: routing and content caching. For each component of the CATT, Potential Based Routing (PBR) and topology aware caching policy are proposed respectively, and their cooperated operation is illustrated. Due to the synergy effect of both components, the CATT provides an efficient solution of content dissemination in the ICN environment.

Potential based routing as a secondary best-effort routing for Information Centric Networking (ICN)

One challenge to the retrieval process of ICN is to take advantage of largely distributed copies in in-network caches. This paper proposes Potential Based Routing (PBR) as a secondary best-effort routing mechanism to boost availability of copies in ICN architectures. The control overhead issue of the PBR is evaluated through both theoretical analysis and numerical simulation. In addition, the paper provides the PBR with a recovery mechanism from a failure, which can reduce the control overhead traffic by at least 40% in the simulation environment. Lastly, it is demonstrated how an ICN architecture can benefit from this PBR in terms of cache hit and delay reduction ratios.

A New Approach for Discovering and Quantifying Hierarchical Structure of Complex Networks

Biological robustness has been understood in many different ways. One of them is based on analysis of topological structures such as modularity, and hierarchy. While modularity has been studied in various areas intensively, only a few methods have been proposed to study hierarchical structure of networks. In this paper we propose a new algorithm to discover and quantify hierarchical structure of complex networks. This new algorithm identifies nodes on the top layer of hierarchical structure based on betweenness calculation among links, and groups the rest of nodes according to the distance from nodes on the top layer in order to locate them in different layers. The rearranged structure is quantified to represent the strength of hierarchy structure. In addition, we show the difference between hierarchy and modularity that have been regarded as similar properties.

A design of an ICN architecture within the framework of SDN

The core design principle of Information-Centric Networking (ICN) is in the name based routing that enables users to ask for a data object by its name and makes the network deliver it to users from a nearby cache if available. Software-Defined Networking (SDN) lowers the cost and complexity of network management by decoupling architecture from infrastructure, which promises the continuous evolution of the network architecture in a flexible manner. The synergy between ICN supporting efficient data dissemination as the norm and SDN providing flexible management framework enables the combination to be a fully controllable framework for efficient data dissemination. In this paper, we propose a design of an ICN architecture within the framework of SDN.

Design and implementation of ICN-enabled IEEE 802.11 access points as nano data centers

Network operators have suffered from explosive increase in mobile users, especially who are eager to watch all forms of video. At the same time, the mobile users tend to experience unexpected delay and disruption due to content retrieval from inappropriate location and frequent handover. To address the problems, this paper introduces an application scenario of Information Centric Networking (ICN) named CATT (Cache Aware Target idenTification), more specifically ICN-enabled IEEE 802.11 wireless access points as nano data centers. We describe its design tenet and implementation, and current deployment over the virtualization platform of JGN-X in Japan. The synergy between ICN supporting mobility as the norm and widely deployed broadband IEEE 802.11 wireless access points makes this proposal attractive as a potential application scenario for ICN.

Potential based routing for ICN

In this paper we address two of the problems, namely routing and content caching. For the routing problem, we introduce the Potential Based Routing (PBR) which provides not only availability but also diversity and adaptability. In addition, we examine three caching policies to select a possible candidate for ICN. The integrated system of both PBR and a content caching policy is called the Cache Aware Target idenTiŒcation (CATT). We present some simulation results to evaluate its performance.

Toward bio-inspired network robustness - Step 1. Modularity

Biological systems have evolved themselves to withstand against perturbations so that a characteristic, called robustness, is the most commonly observed feature in all living organisms. To find out the secret of robustness in biological systems, many researchers have investigated the system level structure of biological organizations. One of the known structural features that enable biological systems to be robust is modularity. In this paper we study the correlation between modularity structure and robustness in IP networks. We carry out a simulation study to observe resistibility of different topologies, which have different level of modularity structure, against a perturbation created synthetically. The numerical results show that the quantified modularity seems to be more important measure to understand robustness of IP networks than any other common properties such as clustering coefficient, degree distribution, and average path length.

BE-DCF: Barring-Enhanced Distributed Coordination Function for Machine Type Communications in IEEE 802.11 networks

In contention-based wireless networks, the efficiency of channel access mechanism is greatly affected by the contention level. The basic channel access mechanism, i.e. distributed coordination function (DCF), of IEEE 802.11 networks employs the exponential backoff scheme to alleviate the channel contention, which works efficiently in practice with small number of stations and traditional human-centric traffic. However, the emerging Machine-Type Communications (MTC) is bringing new challenges on IEEE 802.11 networks due to its massive access and special traffic pattern. Therefore, in this paper, we address the collisional collapse problem in the MTC scenario where the efficiency of DCF is extremely low because of high-level collision. To solve this problem, we propose a Barring-Enhanced Distributed Coordination Function (BE-DCF) at each Machine-Type Device (MTD) to coordinately restrict the contention to a reasonable low level by randomly barring its transmit attempt. Simulation results show that, the proposed BE-DCF achieves higher and stable throughput and lower frame drop ratio than legacy DCF mechanism at the cost of a slight increase on channel access delay in MTC scenario, especially when the MTC traffic is highly correlated.Japan

Design of ICN-enabled IEEE 802.11 wireless access points

This article introduces the idea of ICN-enabled IEEE 802.11 wireless access points (APs) as nano data centers. After elaborating its design, we evaluate the performance with trace-based simulation and prototype-based experiment. The evaluation shows that even a small size cache, e.g. 1Gbyte nearby mobile users can reduce traffic load by 15%, which enables mobile operators to reduce operational cost in the mobile back-haul areas. Moreover, a mobile user can download content files with less delay and interruption, especially when the performance of network becomes degraded or unstable. The synergy between ICN supporting mobility as the norm and widely deployed broadband IEEE 802.11 wireless access points makes this proposal attractive as a potential application scenario for ICN.