Nozomu Nishinaga

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.

Airtime-based resource control in wireless LANs for wireless network virtualization

Wireless network virtualization is needed to build a virtual network over wireless and wired networks, which enables a rapid deployment of novel mobile services or novel mobile network architectures on a shared infrastructure. This paper proposes an airtime-based resource control technique for wireless network virtualization, in which wireless network resources are allocated among competing virtual networks while keeping their programmability. A WLAN system adopting the proposed technique is developed by enhancing an IEEE 802.11e EDCA (Enhanced Distributed Channel Access) MAC (Media Access Control) mechanism. The operation of the resource control technique is demonstrated by a simulation and the performance of airtime usage and throughput are investigated. It is shown that technique can successfully control the wireless network resource allocations with a target ratio even under conditions when the WLAN system suffers interferences.

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.

Open the Way to Future Networks – A Viewpoint Framework from ITU-T

Advancements concerning research and development of Future Networks (FNs) technologies have been introduced in recent years, such as network virtualization and software defined/driven network (SDN), information centric networking (ICN), cloud networking, autonomic management, and open connectivity. In this context ITU-T has developed initial Recommendations that lay out the essential directions for subsequent detailed work including further standardization of Future Networks. This paper presents the background and the context of FNs’ standardization, the results and future plans originated from the initial standardization work performed by ITU-T.

Service-Specific Network Virtualization to Reduce Signaling Processing Loads in EPC/IMS

This paper proposes a service-specific network virtualization to address the tremendous increase in the signaling processing load in the evolved packet core and IP multimedia subsystem of a fifth-generation mobile communication system. The proposal creates several virtual networks that are composed of functions specialized for particular services on a mobile communication network and efficiently forwards a sequence of signaling messages to the appropriate virtual networks. Using a prototype system, this paper verifies the overheads costs of the proposal that are incurred during the inspection of packet application headers needed to appropriately forward signaling messages as well as the overheads incurred when replicating state information from one virtual network to another. This paper shows that the proposal can reduce the signaling processing load by ~25% under certain assumptions.

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.

An efficient load-balancing mechanism for heterogeneous range-queriable cloud storage☆

Abstract The rising popularity of big data processing for semantically rich applications such as social networks and IoT (Internet of Things) has made the range-queriable cloud storage increasingly important. To support range queries, the data locality is preserved strictly, which makes the load balancing among nodes a challenging task. Currently, most of the range-queriable cloud storage adopts the combination of neighbor item exchange and neighbor migration methods, which incurs large overhead, and suffers from slow convergence. In this work, we present a novel virtual node based decentralized load-balancing method for range-queriable cloud storage. In our method, each physical node is partitioned into multiple virtual nodes, and all the virtual nodes are organized with range-queriable P2P network. Load balancing is conducted in both overlay level (between neighboring virtual nodes) without global knowledge and physical level (among physical nodes) with limited global knowledge. Both theoretical analysis and simulations show that our method can significantly reduce the overhead and shorten the convergence time.