This paper proposes an architecture and route control scheme of the layer 1 repeater-based IAB system, which can expand a high-frequency radio access area with high-quality communication service. Although repeaters just amplify and retransmit radio signals, the proposed system enables building a multi-hop network using beamforming and scanning. It introduces an external route control server to calculate the route tree under the limited hop count requirement and minimize the total route tree cost. This paper also shows its effectiveness through simulations using the NetworkX package.

In Named Data Networking (NDN), consumers can retrieve content from anywhere in the network, including from the server and routers' cache. Therefore, the Round-Trip Time (RTT) of packets can vary when downloading content in NDN compared to TCP, which establishes a session between a client and a specific server. The current transport layer protocol of NDN is mainly designed with reference to TCP. Its timer-based loss detection is not well designed for the nature of NDN, where the RTT of each packet can vary significantly, and leads to false loss detection. In this paper, we attempt to revisit the loss detection mechanism in NDN. We clarify the potential performance degradation of NDN due to the spurious timeouts and propose an NDN-PTO mechanism that improves the accuracy of loss detection by identifying spurious timeouts with a probe Interest. We evaluate the performance of NDN-PTO through a comprehensive simulation and describe its benefits.

Named Data Networking (NDN) is a promising future Internet architecture which can overcome challenges in Multi-Access Edge Computing (MEC). In this paper, we focus on the forwarding strategy which is an essential part for realizing an NDN-based MEC architecture. Through extensive experiments on a testbed, we evaluate each default strategy in NDN with regard to three criteria: reliability, throughput, and overhead. We point out pros and cons of each strategy, and find two missing features, in-network recovery and load balancing, for improving the performance of MEC communication. Finally, we design a forwarding strategy with the above features which achieves higher throughput and reliability for end users than existing strategies while also reducing network congestion.

Motivated by ubiquitous surveillance cameras in a smart city, a monitoring service can be provided to citizens. However, the rise of privacy concerns may disrupt this advanced service. Yet, the existing cloud-based services have not clearly proven that they can preserve Wth-privacy in which the relationship of three types of information, i.e., who requests the service, what the target is and where the camera is, does not leak. We address this problem by proposing a content-centric privacy platform (C2P2) that enables the construction of a Wth-privacy-preserving monitoring service without cloud dependency. C2P2 uses an image classification model of a target serving as the key to access the monitoring service specific to the target. In C2P2, communication is based on information-centric networking (ICN) that enables privacy preservation to be centered on the content itself rather than relying on a centralized system. Moreover, to preserve the privacy of bystanders, C2P2 separates the sensitive information (e.g., human faces) from the non-sensitive information (e.g., image background), while the privacy-aware forwarding strategies in C2P2 enable data aggregation and prevent privacy leakage resulting from false positive of image recognition. We evaluate the privacy leakage of C2P2 compared to that of the cloud-based system. The privacy analysis shows that, compared to the cloud-based system, C2P2 achieves a lower privacy loss ratio while reducing the communication cost significantly.

A global content distribution is one of the important roles of the Internet. Information-Centric Networking (ICN) is a future internet architecture which attempts to redesign the Internet with a focus on content distribution. However, it has the potential performance degradation in the global content distribution. In this paper, we propose an ICN performance enhancing proxy (ICN-PEP) to mitigate this performance degradation. The key idea is to prefetch Data packets and to serve them to the consumer with the shortened round trip time. By utilizing ICN features, it is developed as offline and state-less proxy which has an advantage of scalability. We evaluate the performance of ICN-PEP in both simulation and real network and show that ICN-PEP improves the performance of global content distribution.

In this paper, we reveal the potential performance degradation in the global content distribution over Information-Centric Networking (ICN), and propose an ICN performance enhancing proxy (PEP) to mitigate this degradation. ICN follows a pull-based communication model, and congestion control is done by the consumer. Due to the fact that the consumer increases its congestion window only with the reception of data packets, it requires some round-trip time (RTT) to send large amount of interests. In the global network, which has a large RTT values, consumer's congestion window is increased slowly, and this leads to low throughput. Here we propose the ICN-PEP that can accelerate the growth of the consumer's congestion window by prefetching future data packets. We evaluated the ICN-PEP performance from the video streaming over the global ICN testbed, and our ICN-PEP could reduce the startup time of video streaming.

Many video streaming services employ the dynamic adaptive streaming over HTTP (DASH) technique to achieve better user's QoE. Named-data Networking (NDN) can bring many benefits to the video distribution with in-network cache and stateful forwarding. However, simply applying DASH technique to NDN causes problems. First, in-network cache may affect download time which makes bitrate adaptation a difficult job. Second, various representations of the same video segments can consume cache storage and make caching less efficient. To overcome these problems, cache-friendly bitrate adaptation was proposed in [1] which adopts the bitrate based on the congestion feedback from intermediate routers. In this demonstration, we show the congestion feedback-aware DASH video application. Our contributions are twofold: (1) we customize the NFD to input congestion feedback into a data packet, and (2) we implemented the NDN-plugin for VLC player whose adaptation logic is based on the congestion feedback, and thus it can follow the current network status.

Information-centric networking (ICN) can bring many benefits to network operators, e.g., in-network request resolution via router's cache, and name-based forwarding. However, creating a smooth migration path from the current IP network to the ICN is a challenging task that must be investigated. Network function virtualization (NFV) is one of the key technologies to achieve this migration because of its flexibility in supporting new network services as software. Nevertheless, when we consider the deployment of ICN services over NFV, two performance issues are found: processing delay of name look-up and computational overhead of the virtual machine. In this paper we propose NFV infrastructure-assisted name-based forwarding by integrating the name look-up into the Open vSwitch. The contributions are twofold: 1) First, we provide a novel look-up scheme that can forward ICN packets without costly longest prefix match searching. 2) Second, we integrate this forwarding scheme into the virtualization infrastructure to mitigate computational overhead.

In the latest version of content-centric networking (CCN 1.0), a number of interests are issued when a large content is retrieved, and this could be a serious problem due to routers' heavy workload. In order to solve this problem, this paper proposes a novel strategy of "grouping" multiple interests with the common information and "packing" them to a special interest called the list interest. Our list interest is designed to cooperate with the manifest of CCN 1.0. This paper demonstrates that by using the common information in the list interest, the router can search its FIB/PIT/CS for the list interest-based request with dramatically smaller complexity than the case of the standard interest-based request. Furthermore, we also give a novel TCP-like congestion control method for list interests.

In the research of content-centric networking (CCN), there have been investigated several fragmentation methods of CCN messages in order to implement CCN as an L3 protocol. The latest version of the CCN protocol (CCN 1.0) adopts the end-to-end fragmentation method that fragments CCN messages only at the content publisher. This allows intermediate routers to simply forward fragmentation packets, and hence this can solve the problem of the processing delay at routers in the existing fragmentation methods for the CCN. However, the end-to-end fragmentation has not been well-analyzed and well-evaluated yet. In this paper, we analyze the end-to-end fragmentation and clarify its important parameter for the efficient transmission. Moreover, we evaluate fragmentation methods for the cache-hit ratio and the header overhead, and we clarify advantages and disadvantages of the methods in terms of the transmission efficiency.