Recently, information centric network (ICN) has attracted attention because cached content delivery from router's cache storage improves quality of service (QoS) by reducing redundant traffic. Then, adaptive video streaming is applied to ICN to improve client's quality of experience (QoE). However, in the previous approaches for the cache control, the router implicitly caches the content requested by a user for the other users who may request the same content subsequently. As a result, these approaches are not able to use the cache effectively to improve client's QoE because the cached contents are not always requested by the other users. In addition, since the previous cache control does not consider network congestion state, the adaptive bitrate (ABR) algorithm works incorrectly and causes congestion, and then QoE degrades due to unnecessary congestion. In this paper, we propose an explicit cache placement notification for congestion-aware adaptive video streaming over ICN (CASwECPN) to mitigate congestion. CASwECPN encourages explicit feedback according to the congestion detection in the router on the communication path. While congestion is detected, the router caches the requested content to its cache storage and explicitly notifies the client that the requested content is cached (explicit cache placement and notification) to mitigate congestion quickly. Then the client retrieve the explicitly cached content in the router detecting congestion according to the general procedures of ICN. The simulation experiments show that CASwECPN improves both QoS and client's QoE in adaptive video streaming that adjusts the bitrate adaptively every video segment download. As a result, CASwECPN effectively uses router's cache storage as compared to the conventional cache control policies.

Recently, adaptive streaming over information centric network (ICN) has attracted attention. In adaptive streaming over ICN, the bitrate adaptation of the client often overestimates a bitrate for available bandwidth due to congestion because the client implicitly estimates congestion status from the content download procedures of ICN. As a result, streaming overestimated bitrate results in QoE degradation of clients such as cause of a stall time and frequent variation of the bitrate. In this paper, we propose a congestion-aware adaptive streaming over ICN combined with the explicit congestion notification (CAAS with ECN) to avoid QoE degradation. CAAS with ECN encourages explicit feedback of congestion detected in the router on the communication path, and introduces the upper band of the selectable bitrate (bitrate-cap) based on explicit feedback from the router to the bitrate adaptation of the clients. We evaluate the effectiveness of CAAS with ECN for client's QoE degradation due to congestion and behavior on the QoS metrics based on throughput. The simulation experiments show that the bitrate adjustment for all the clients improves QoE degradation and QoE fairness due to effective congestion avoidance.

Location-based forwarding is a key driver for location-based services. This paper designs forwarding information data structures for location-based forwarding in Internet Service Provider (ISP) scale networks based on Named Data Networking (NDN). Its important feature is a naming scheme which represents locations by leveraging space-filling curves.

In content oriented networks (CON), routers in a network are generally equipped with local cache storages and store incoming contents temporarily. Efficient utilization of total cache storage in networks is one of the most important technical issues in CON, as it can reduce content server load, content download latency and network traffic. Performance of networked cache is reported to strongly depend on both cache decision and content request routing. In this paper, we evaluate several combinations of these two strategies. Especially for routing, we take up off-path cache routing, Breadcrumbs, as one of the content request routing proposals. Our performance evaluation results show that off-path cache routing, Breadcrumbs, suffers low performance with cache decisions which generally has high performance with shortest path routing (SPR), and obtains excellent performance with TERC (Transparent En-Route Cache) which is well-known to have low performance with widely used SPR. Our detailed evaluation results in two network environments, emerging CONs and conventional IP, show these insights hold in both of these two network environments.

This paper argues that a layered approach is more suitable for Information Centric Networking (ICN) than a narrow-waist approach and proposes an ICN mechanism called ZINK. In ZINK, a location-independent content name is resolved to a list of node IDs of content servers in the application layer and a node ID is mapped to a node locator in the network layer, which results in scalable locator-based routing. An ID/Locator split approach in the network layer can efficiently support client/serever mobility. Efficient content transfer is achieved by using sophisticated functions in the transport layer such as multipath transfer for bandwidth aggregation or fault tolerance. Existing well-tuned congestion control in the transport layer achieves fairness not only among ICN flows but also among ICN flows and other flows. A proof-of concept prototype of ZINK is implemented on an IPv6 stack. Evaluation results show that the time for content finding is practical, efficient content transfer is possible by using multipath transfer, and the mobility support mechanism is scalable as shown in a nationwide experiment environment in Japan.

Energy efficiency is an important requirement to forth-coming NDN (Named Data Networking) networks and caching inherent to NDN is a main driver of energy reduction in such networks. This paper addresses the research question “Does caching really reduce the energy consumption of the entire network?”. To answer the question, we precisely estimate how caching reduces energy consumption of forth-coming commercial NDN networks by carefully considering configurations of NDN routers. This estimation reveals that energy reduction due to caching depends on energy-proportionality of NDN routers.

Communication infrastructures under the influence of the disaster strike, e.g., earthquake, will be partitioned due to the significant damage of network components such as base stations. The communication model of the Internet bases on a location-oriented ID, i.e., IP address, and depends on the DNS (Domain Name System) for name resolution. Therefore such damage remarkably deprives the reachability to the information. To achieve robustness of information retrieval in disaster situation, we try to apply CCN/NDN (Content-Centric Networking/Named-Data Networking) to information networks fragmented by the disaster strike. However, existing retransmission control in CCN is not suitable for the fragmented networks with intermittent links due to the timer-based end-to-end behavior. Also, the intermittent links cause a problem for cache behavior. In order to resolve these technical issues, we propose a new packet forwarding scheme with the dynamic routing protocol which resolves retransmission control problem and cache control scheme suitable for the fragmented networks. Our simulation results reveal that the proposed caching scheme can stably store popular contents into cache storages of routers and improve cache hit ratio. And they also reveal that our proposed packet forwarding method significantly improves traffic load, energy consumption and content retrieval delay in fragmented networks.

As a research project supported jointly by the National Institute of Information and Communications Technology (NICT) in Japan and the European Commission under its 7th Framework Program, the GreenICN Project has been in operation from 2013 to 2016. The GreenICN project focused on two typical application scenarios, one a disaster scenario and the other a video delivery scenario. The disaster scenario assumed a situation of limited resources, and the video delivery scenario assumed a situation of large-scale content delivery. In both situations, the project challenged to provide “green”, i.e. energy-efficient, content delivery mechanism. For this goal, we designed an energy consumption model to lay out energy reduction policies. For the achievement of the policies, we improved ICN architecture, for example a name-based publish/subscribe mechanism, an effective cache management policy,energy-efficient security scheme and a new energy API. This paper provides a summary of our achievements and descriptions of some outcome.

Information-Centric Networking (ICN) technology has recently been attracting substantial interest in the research community as one of the most promising future Internet architectures. The Named Data Networking (NDN) approach, which is one of the most recent instantiations of the ICN approach, would be a good choice for multimedia services, because NDN utilizes in-network storage embedded in NDN routers by caching recently or frequently requested contents. It is important to determine which data to cache at which NDN routers in order to achieve high performance, by considering not only the popularity of contents but also the inter-chunk popularity of a content item. This paper presents a chunk-block-based incremental caching scheme that considers both content and inter-chunk popularity. Our proposed scheme employs an incremental cache populating mechanism, which utilizes not only core-side but also edge-side NDN routers according to the request rate of the content item. Through simulations, we show that the proposed scheme achieves less delay, reduced redundant network traffic, and a higher cache hit ratio than legacy schemes.

Named Data Networking (NDN) is a proposed future Internet architecture that shifts the fundamental abstraction of the network from host-to-host communication to request-response for named, signed data-an information dissemination focused approach. This paper describes a general design for receiver-driven, real-time streaming data (RTSD) applications over the current NDN implementation that aims to take advantage of the architecture's unique affordances. It is based on experimental development and testing of running code for real-time video conferencing, a positional tracking system for interactive multimedia, and a distributed control system for live performance. The design includes initial approaches to minimizing latency, managing buffer size and Interest retransmission, and adapting retrieval to maximize bandwidth and control congestion. Initial implementations of these approaches are evaluated for functionality and performance results, and the potential for future research in this area, and improved performance as new features of the architecture become available, is discussed.

Information Centric Networking (ICN) had merits in terms of mobility, security, power consumption and network traffic. When a large-scale disaster occurred, the current communication system might be fragile and the server based network service might be unavailable due to the damages, network congestions, and power failure, etc. In this paper, we proposed an ICN based Disaster Information Sharing Service (DISS) [1], [2] system. DISS could provide robust information sharing service. Users could publish disaster information as a content message with the help of our DISS. In addition, by utilizing DISS's message naming strategy, users could retrieve disaster information even without a server connection. The ICN based DISS could reduce the probability of network congestion when a large number of simultaneous connections occurring. It could provide server-less service in poor network condition. DISS allows users retrieve disaster information from terminals or ICN nodes. During disasters, sharing information timely and effective could protect people from disaster, ensure people's safety.

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.