Kohei Sugiyama

Moderator-Controlled Information Sharing by Identity-Based Aggregate Signatures for Information Centric Networking

Information sharing services have been provided via common servers, which not only relay messages but also sometimes moderate them. A peer can become a moderator and control the distribution of messages belonging to his private message group. However, the physical transfer of a message is usually out of the peers control. Originator-signed signatures inherent in Information Centric Networking assure the integrity and provenance of messages exchanged among peers, which makes it possible to realize moderator-controlled information sharing in which a peer can become a moderator and control the distribution of his private message group as a trustable server. However, moderated content requires multiple signatures, which increases the size of the exchanged message and is inadequate, especially for short message services. We propose the use of Identity-Based Aggregate Signatures (IBAS) to decrease this overhead, and provide a proof-of-concept IBAS implementation for Named Data Networking (NDN). We also compare the performance of the proposed IBAS implementation with existing RSA signatures. An overhead reduction of approximately 45% to 60% compared to RSA signatures is achieved for an NDN packet in the proposed configuration. Because of the properties of the identity-based signature, this IBAS implementation is robust and works even during a disaster or when a trustable centralized server is not online.

Proposal on routing-based mobility architecture for ICN-based cellular networks

Forthcoming 5G networks raise an important research issue of seamless mobility management of cellular and non-cellular networks. Adopting Information Centric Networking (ICN) architecture as common mobility management is promising because existing mobility management mechanisms are complicated and incur large signaling overhead. This paper designs a routing-based mobility architecture to provide seamless mobility for the both networks. The architecture consists of routing during longer duration and anchor-less forwarding during shorter duration. A main contribution of the paper is that the architecture is designed by carefully considering how to port it to cellular networks with as few modifications to them as possible.

Congestion price for cache management in information-centric networking

We tightly integrate caching and congestion control into a unified approach to enhance user-centric performance in information-centric networking. To do that, we take advantage of the available congestion price fed back by congestion control to guide caching decision at each content router. The point is to let caching work in a longer time scale to alleviate congestion retrieving expensive content in terms of congestion cost. As a consequence, not only does caching increase throughput for users who request the cached content, but also it contributes to a large extent towards reducing network congestion, which benefits all other users who share the same congested parts of the network. Our use of existing congestion feedback signals eliminates the need for out-of-band congestion measurement such as bandwidth share computation which in reality might not reflect the true congestion state of the delivery paths. The proposed method yields positive performance gain in simulations compared with existing cache schemes.

Efficient multipath forwarding and congestion control without route-labeling in CCN

One advantage of content-centric networking lies in its built-in support for multipath forwarding. In this paper, we propose a multipath forwarding strategy in order to fully utilize available bandwidth in a content-centric network. Using the proposed strategy, each intermediate router sensibly adjusts the amount of traffic forwarded over a given face (among a set of faces) associated with a content name based on the estimated available bandwidth it observes receiving the content through the face. Available bandwidth is sampled and estimated from the actual Data packet flow received at the face. The advantage of our method is that forwarding decision closely matches the congestion status of the forwarding face which results in efficient bandwidth utilization without biasing short round-trip time routes. What is more, by aggregating congestion control states at end users, our method requires neither route labeling nor any other kind of cooperation among routers on the delivery paths. Simulations confirm the effectiveness of our proposed scheme.

Minimum disclosure routing for network virtualization and its experimental evaluation

Although the virtual collocation of service providers (SPs) on top of infrastructure providers (InPs) via network virtualization brings various benefits, we posit that operational confidentiality has not been considered in this network model. We extend and apply the Secure Multiparty Computation (SMC) protocol to solving Minimum Disclosure Routing (MDR), namely, enabling an SP to route packets without disclosing routing information to InPs. We implement the proposed MDR protocol and evaluate its performance via experiments by comparing it against the prediction based on our analytical performance model. Our study reveals that MDR can be securely achieved with marginal latency overhead with regard to the convergence time in well-engineered nonsecure routing algorithms. Our study sheds light on the path for network virtualization to be used to resolve the challenges for the ISPs of today.

Name-based push/pull message dissemination for disaster message board

In the aftermath of natural disasters (e.g., earthquakes and hurricanes), information dissemination to and from citizens and authorities often involves the use of mobile network services. They may do so to seek help, distribute critical information, and possibly to confirm the safety of relatives and friends. The traffic on the cellular network typically increases substantially in the aftermath of such disasters. The situation is further compounded by disruptions caused by damage to the network infrastructure and the non-availability of power. Networks are fragmented, and communication is intermittent and disruption prone. In this paper, we propose a name-based many-to-many communication service for such fragmented networks. The key feature of this service is an integration of several communication methods, such as push-based and pull-based. The service effectively supports a variety of network situations by leveraging the features of information-centric networks.

Demo: Content-Based Push/Pull Message Dissemination for Disaster Message Board

Information Centric Networking (ICN) is one of the promising technologies to support reliable communication in the post-disaster network. This demo presents the integrated framework of push and pull type content-based communication, along with proposed enhancements that make it applicable in a disaster scenario. We will demonstrate these features with the help of an example application -- disaster message board.

Multipath Support for Name-based Information Dissemination in Fragmented Networks

In the aftermath of natural disasters (e.g., earthquakes and hurricanes), networks are fragmented, and communication is intermittent and disruption-prone. In this paper, we propose a multipath support for publish/subscribe name-based information dissemination in such fragmented networks. Our solution helps to reduce unnecessary replication and transmission in disaster scenarios.

Mean free path applied to message dissemination in opportunistic networks

Opportunistic networking including Delay-/Disruption-Tolerant Networking (DTN) has become an increasingly real possibility since there are a huge number of mobile devices, such as smartphones, all over the world. DTN is expected to find promising applications, such as message dissemination in a disaster-struck area, and offloading mobile data traffic onto DTNs in urban areas. One of the potential issues that may confront these applications is that opportunities for message relaying are limited since smartphone users are sparsely distributed among base station cells. In order to disseminate message efficiently, it is important to be able to accurately evaluate DTN performance, such as message dissemination coverage, and time. In this paper, we propose a novel yet simple analytical model of message dissemination in DTNs by applying the concept of mean free path. The mean free path is the average distance that a particle (e.g., an atom or a molecule) travels between successive collisions (in physics jargon). The basic idea is that by mapping a particle in three-dimensional space to a node in two-dimensional space, a meeting between two nodes is represented as a collision between two particles. We also perform simulation experiments in order to validate our model.

Cache the Queues: Caching and Forwarding in ICN from a Congestion Control Perspective

Caching and multipath forwarding are essential ingredients of the Information-Centric Networking (ICN) architecture resulting from ubiquitous content storage and content-based node-by-node forwarding nature of ICN. Much is yet to see how they jointly act towards improving users quality of experience. To this end, we formulate in this paper a unified problem of caching and multipath forwarding as a network optimization problem to maximize user satisfaction which is expressed by their utility function. The formulation allows us to see caching and multipath forwarding in ICN from a congestion control perspective and to reinforce the advantage of a class of congestion-aware caching where in-network caches are used to absorb network congestion and to enhance users satisfaction. In that context, multipath forwarding plays the role of directing content delivery to less congested paths where network capacity is abundant or where requested content has been stored by in-network caches. We evaluate such a congestion control-based, coupled caching and multipath forwarding approach in simulations. The result confirms the advantage of our approach compared with existing ones.