Low Earth Orbit (LEO) satellite constellation services are expected to be a part of next-generation communication infrastructure. In LEO satellite communications, handover is required to switch communications between satellites and ground stations or terminals, which causes communication breakdown. These communication disruptions affect congestion control in transport protocols, leading to degradation of their performance. To address this degradation, congestion controls tailored for LEO satellites, such as StarQUIC, SatPipe, and TCP LEO, have been proposed. However, comprehensive evaluations of these congestion controls on a real LEO satellite network cannot be found, and evaluations are desired. To this end, this paper compares these LEO satellite congestion controls with one of major LEO satellite communication services, Starlink, evaluating them based on throughput, retransmissions, latencies, and file download time. The evaluation results have shown that TCP LEO employing transmission freeze during handover has shown the best throughput, the minimum latencies, and the shortest download time. Regarding retransmissions, SatPipe has achieved the lowest number of retransmissions.

With the spread and development of 5G technology, network configurations with MEC (Multi-Access Edge Computing) servers in the vicinity of 5G base stations are becoming more common. We have been researching and developing Giocci, a resource permeating distributed processing platform that offloads computation tasks on end devices to MEC servers and cloud servers. In this paper, we propose resource allocation methods to efficiently determine the server to which tasks are allocated in a network configuration that includes MEC servers. In order to construct the proposed methods, we first model the main functions of Giocci and define the resource allocation problem for this work. There are four proposed methods according to each objective and priority; a prioritized allocation by the average number of waiting tasks, by the communication delay, by the task response time, and by the cost of using computing resources. We initially implement these methods assuming that they are task allocation functions in Giocci. Experimental evaluations demonstrate that they could achieve appropriate resource allocation results for each objective. This research contributes to the smooth allocation of computational resources in 5G networks including MEC servers.

Segment Routing over IPv6 (SRv6) is used to control mobile communication backbones and data center networks. SRv6 enables flexible control of packets using a list of segments. Network debugging is important to improve network reliability. In network debugging, it is sometimes necessary to track packets in order to identify where packets are dropped. However, conventional tools such as traceroute and ping have difficulty debugging SRv6 networks. In traceroute and ping, probe packets are sent, and ICMP messages in response are used to check the reachability of the packets. In SRv6, which enables flexible operation, the ICMP messages in response are not always returned. In addition, when load balancing such as Equal Cost MultiPath (ECMP) is used, it is not easy to track packets because the routes change dynamically. Therefore, we have developed a network debugging support system that can track packets by assigning identifiers to SRv6 packets. In our system, packet identifiers are assigned as Segment Routing Header (SRH) options. We use Extended Berkeley Packet Filter (eBPF) for identifier assignment to reduce the overhead. After tracking packets by their identifiers, our system verifies the packet routes and visualizes them on a GUI. Our system facilitates understanding of SRv6 network operation and reduces the burden of packet tracking.

IEEE COMPSAC Workshops series is an established research event that complements the main focus of the IEEE COMPSAC conference, by focusing on specific topics that gain momentum in the research community. This paper introduces the overview of the IEEE COMPSAC 2022 co-located workshops, and discusses some open research issues that have emerged from the different workshops' topics and selected contributions.

COVID-19 has led to a rapid increase in the use of video conferencing and video calls over the Internet. In this paper, we propose a low-cost, portable, and highly confidential occupied information environment. The authors developed a secure input/output device in the NICT's “SecHack365” program for fostering young security innovators. By improving the device and integrating it with traditional Japanese culture, we quanti-tatively evaluated that the device can achieve sufficient up-time, lightweight that does not burden the body, and has a price that does not strict on the wallet.

A wide-area distributed application is affected by network failure due to natural disasters because the servers on which the application operates are distributed geographically in a wide area. Failure Injection Testing (FIT) is a method for verifying fault tolerance of widely distributed applications. In this paper, by limiting network failures only to the connection line, whole FIT scenarios are generated, and exhaustive evaluation of fault tolerance is performed. The authors propose a method to evaluate the resilience quantitatively by specifications of the distributed application and their service level agreements (SLAs) that consist of the distributed network. The authors compare the resilience of several distributed applications in several topologies and show returns of investigation (ROI) in each application and topology.

A wide-area distributed application is affected by network failure due to natural disasters because the servers on which the application operates are distributed geographically in a wide area. Failure Injection Testing (FIT) is a method for verifying fault tolerance of widely distributed applications. In this paper, by limiting network failures only to the connection line, whole FIT scenarios are generated, and exhaustive evaluation of fault tolerance is performed. The authors propose a method to omit the evaluations from the aspect of topological constraint conditions. And they evaluate the visualization method of performance data obtained from this evaluation and the reduction of the fault tolerance evaluation cost by the proposed method.

As the number of Internet users increases, their usage also diversifies, and it is important to prevent Identity on the Internet (Digital Identity) from being violated. Unauthorized authentication is one of the methods to infringe Digital Identity. Multi-factor authentication has been proposed as a method for preventing unauthorized authentication. However, the cryptographic authenticator required for multi-factor authentication is expensive both financially and UX-wise for the user. In this paper, we design, implement and evaluate multi-factor authentication using My Number Card provided by public personal identification service and WebUSB, which is being standardized.

A wide-area distributed application is affected by network failure due to natural disasters because the servers on which the application operates are distributed geographically in a wide-area. Failure Injection Testing (FIT) is a method for verifying fault tolerance of widely distributed applications. In this paper, by limiting network failures to connection line, whole FIT scenarios are generated and exhaustive evaluation of fault tolerance is performed. Authors evaluate the visualization method of performance data obtained from this evaluation and the reduction of the evaluation cost by the proposed method.

Presents the introductory welcome message from the conference proceedings. May include the conference officers' congratulations to all involved with the conference event and publication of the proceedings record.

In recent years, much attention has been paid to wide area distributed storages to backup data remotely and ensure that business processes can continue in terms of disaster recovery. In the 'distcloud' project, authors have been involved in the research of wide area distributed storage by clustering many computer resources located in geographically distributed areas, where the number of sites is more than 2 (N>2). The storage supports a shared single POSIX file system so that LDLM (Long Distance Live Migration) of VMs (Virtual Machines) works well between multiple sites. We introduce the concept and basic architecture of the wide area distributed storage and its technical improvement for LDLM. We describe the result of our experiment, that is, 1) Nation Wide Live Migration (about 500Km) in Japan, and 2) Transpacific Live Migration (over 24,000Km). We show the technical benefit of the current implementation and discuss suitable applications and remaining issues for further research topics.