The demand for streaming services—such as video delivery, online meetings, and cloud gaming—has been rapidly increasing, making the preservation of information timeliness a key communication requirement. Information-Centric Networking (ICN) has emerged as a promising architecture to address this challenge by leveraging in-network caching. However, similar to IP-based networks, ICN relies on retransmissions to recover lost packets, which can introduce delays and degrade timeliness. This paper proposes a transmission scheme that integrates Forward Error Correction (FEC) techniques into ICN. In the proposed scheme, CRs on the transmission path generate FEC chunks and deliver them via a single-path or multi-path strategy. Simulation results demonstrate that the proposed scheme improves the timeliness of content delivery by mitigating the impact of retransmissions.

Internet of Things (loT) services that provide stream-oriented communications have become increasingly popular, and the demand for such services is expected to grow in the future. For example, data stream services used in automated driving and connected cars require low latency and real-time communication, but it is also essential to reduce loss rates as much as possible to provide high-quality services. Therefore, we propose a semi-reliable communication scheme to provide real-time communication with low latency and loss rates by using Forward Error Correction (FEC) technique at relay routers in networks, and show its effectiveness.

Information-centric networking provides low-latency content delivery through in-network caches. To maximize the cache efficiency, the routing scheme based on cache information sharing has been proposed. However, the huge amount of cache information flooded for information sharing causes a heavy load on the network. Therefore, we propose a Bloom filter-based routing scheme that compresses cache information using a Bloom filter to reduce advertisement overhead while maintaining content retrieval efficiency, and evaluate its effectiveness through simulation.

This paper presents a novel content search scheme based on classified content popularity for CCN. Some existing research focuses mainly on improving the cache hit rate to resolve the on-path caching problem. We decide this problem by reducing acquisition hops to obtain requested contents. Our proposed scheme can reduce the number of acquisition hops by determining the forwarding range of search packets using classified content popularity calculated on each CR. In this paper, we clarify that the proposed scheme reduces the number of acquisition hops by up to 10% compared to previous work through simulation evaluation.

Edge computing, which locates edge servers with limited computing and storage resources at the edge of networks, is expected as a novel architecture for low-latency applications. In edge computing, users offload a task to edge servers due to poor computing resources and batteries of mobile devices so that the edge servers execute the offloaded task and return the result of it to users. Users can thus enjoy various applications without depending on the limitations of mobile devices. However, when the edge server's load is too heavy, a large number of tasks will be offloaded to distant cloud servers. The long distance between users and cloud servers significantly degrades the quality of mobile applications. To prevent this problem, we propose flow splitting and aggregation schemes to improve offload delay to cloud servers in edge computing. This scheme splits TCP connections between users and cloud servers at the edge server, and then aggregates TCP connections between the edge server and cloud servers. We show the effectiveness of our scheme through simulation evaluations.

Information-centric networking (ICN) is expected as a novel network architecture for content delivery services. In ICN, content routers (CRs) with a cache function store a chunk received from upstream CRs or servers. Therefore, clients can retrieve distributed chunks from multiple nodes simultaneously. However, it will cause heavy congestion due to competition of multiple flows in a network as well as long time to acquire content. In this study, we propose an efficient congestion control scheme to retrieve distributed chunks from multiple nodes in ICN. This scheme aggregates competing flows and then allocates an adequate transmission rate to the aggregated flows. We show the effictiveness of the proposed scheme through simulation evaluations.

A content-centric networking (CCN) is expected for high quality streaming services with in-network caching. In mobile environment, users cannot frequently receive requested segments due to handovers. This will cause retransmissions of missing segments from a server as well as playback delays and interruptions. In this study, we propose a more effective scheme to utilize caches near users for high quality streaming services in mobile CCN, and demonstrate the effectiveness of our scheme through simulation evaluations.

Most of latency-sensitive mobile applications require computational resources provided through a cloud computing service. The problem of relying on cloud computing is that, sometimes, the physical locations of cloud servers are distant from mobile users and the communication latency is long. As a result, the concept of distributed cloud service, called mobile edge computing (MEC), is being introduced in the 5G network. However, MEC can reduce only the communication latency. The computing latency in MEC must also be considered to satisfy the required total latency of services. In this research, we study the impact of both latencies in MEC architecture with regard to latency-sensitive services. We also consider a centralized model, in which we use a controller to manage flows between users and mobile edge resources to analyze MEC in a practical architecture. The simulation results show that the controller interval and hop delay lead some blocking and error in the system. However the permissive system which relaxes latency constrains and chooses an edge server by the lowest total latency can improve the system performance impressively.

Packet losses significantly degrade TCP performance in high latency networks. To improve TCP performance in such networks, we proposed two methods to suppress the return of duplicate ACKs and to control minimum redundancy because FEC technology cannot work effectively when simply applied to TCP operation. Simulation evaluations show that the proposed methods enable higher throughput than the conventional methods, especially in high latency environments. In our future work, we will consider a scheme to more appropriately determine the appropriate redundancy level for network conditions and to more effectively recover lost packets in a real environment, such as where burst packet losses occur.

Future pervasive networks will be constructed by various access networks, which will be managed by different operators. Host-based mobility mechanisms are promising for achieving efficient mobile computing in such an environment, because of their ability to handle the multihomed environment. However, the impact of switching network media will significantly degrade performance of communications with large RTT and high moving intensity. Therefore, we propose an adaptive handover scheme on host-based mobility to mitigate the impact of the switching media under such circumstances. This scheme switches the way of handover according to the network conditions. Furthermore, we demonstrate the effectiveness of the proposed scheme through simulation results.

Abstract IMT‐2000 has attracted much attention as the Next Generation Mobile Communication System. IMT‐2000 can provide high‐bit‐rate data communication service, so that a great number of packets conveyed by TCP (transmission control protocol) can be transmitted over a wireless link. W‐CDMA, standardized in 3GPP (which standardizes IMT‐2000), allows dynamically allocating transmission rates to flow over a wireless link in response to a changing FER for each flow, which is thought to be essential for a next generation mobile communication system. Therefore, in this paper, we study the characteristics of the dynamic allocation scheme when TCP flows share a wireless link, and, in particular, we focus on the throughput performance of these TCP flows. First, we use simulations to examine the effectiveness of the dynamically allocating down‐link transmission rate for TCP flows in response to changing the frame error rate (FER). Through the simulation results, we will show how it can improve the total throughput performance of TCP flows. Furthermore, we can obtain an effective way to allocate transmission rates to flows with different FERs in order to achieve high total throughput. Finally, we will deal with a case of multiple flows from a fixed host to a mobile host. In actual networks, this often happens. In this case, we will show that the total throughput of TCP flows degrades less than in the single‐flow case, even when the FER is high. Copyright © 2004 John Wiley & Sons, Ltd.