Eiji Kawai
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Eiji Kawai has a total of 19 co-authors. Here are the top co-authors by number of shared publications:
- Hiroaki Yamanaka
National Institute of Information and Communications Technology, Tokyo 184-8795, Japan
3 shared publications - Hiroaki Harai
National Institute of Information and Communications Technology
2 shared publications - Yuuichi Teranishi
ICT Testbed Research and Development Promotion Center, NICT, Tokyo, Japan
2 shared publications - Domenico Garlisi
CNIT, Parma, Italy
1 shared publication - Ezra Kissel
Lawrence Berkeley National Laboratory
1 shared publication - Haruo Takemura
University of Osaka, Osaka, Japan
1 shared publication
Latest Publications
- Open Access
- 2 May 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE)
CNERT 2022 TPC
- 2 May 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Open AccessCNERT 2022 TPC
- 1 December 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-7
Supporting k-Nearest Service Discoveries for Large-Scale Edge Computing Environments
This paper presents an overlay network protocol called “LASK: Locality-Aware Service discovery protocol for K-nearest search”, for supporting scalable and locality-aware distributed k-Nearest Service Discovery (kNSD). The kNSD provides a lookup function to find k service nodes located close to the requester. Importance of such function increases under the situation of growth in size and the diversity of the resources in the so-called edge computing environments. In LASK, efficient cooperative routing algorithm is implemented utilizing the two-dimensional structure of key-order preserving structured overlay networks that are constructed according to the network topology and the name of the service. This structure achieves scalable and locality-aware routing of the lookup messages to the matched nodes avoiding redundant data transmissions across the edge networks. Extensive simulation evaluations show that LASK could achieve small discovery latency in the large-scale edge computing environments; a typical kNSD took less than 5 ms in a data center network model and less than 100 ms in the Internet model even when there are 100,000 nodes in the entire network.
- 1 December 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-7
Supporting k-Nearest Service Discoveries for Large-Scale Edge Computing Environments
This paper presents an overlay network protocol called “LASK: Locality-Aware Service discovery protocol for K-nearest search”, for supporting scalable and locality-aware distributed k-Nearest Service Discovery (kNSD). The kNSD provides a lookup function to find k service nodes located close to the requester. Importance of such function increases under the situation of growth in size and the diversity of the resources in the so-called edge computing environments. In LASK, efficient cooperative routing algorithm is implemented utilizing the two-dimensional structure of key-order preserving structured overlay networks that are constructed according to the network topology and the name of the service. This structure achieves scalable and locality-aware routing of the lookup messages to the matched nodes avoiding redundant data transmissions across the edge networks. Extensive simulation evaluations show that LASK could achieve small discovery latency in the large-scale edge computing environments; a typical kNSD took less than 5 ms in a data center network model and less than 100 ms in the Internet model even when there are 100,000 nodes in the entire network.
- 1 July 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-10
Proximity-Aware IaaS for Edge Computing Environment
Edge computing enables application services to leverage low-latency responses, e.g., for augmented reality. Infrastructure-as-a-service for edge computing (EC-IaaS) allows multiple application service providers (ASPs) to use a virtualized resource (i.e., virtual machines (VMs) and virtual networks) for various applications services on the common edge computing infrastructure. For ASPs, the proximity of the VMs to the end-user devices (i.e., the location of the host edge servers) is a significant factor in guaranteeing low-latency response times. The existing method allows ASPs to select the edge server locations so that the VMs satisfy the proximity requirement. However, the amount of information transmitted from the EC-IaaS provider to the ASP becomes large, because it has to include the latencies between all edge server locations and all wireless base stations. We propose a method that reduces the amount of information while ensuring that ASPs obtain VMs that satisfy the proximity requirement. An EC-IaaS provider suggests groups of wireless base stations that have VMs within a suitable proximity, which helps the ASPs to estimate the necessary number of VMs. Instead of the ASP, the EC-IaaS provider determines which edge servers should contain the VMs. We confirm that the proposed method reduces the transmitted information. The EC-IaaS provider also has a benefit that detail latency information is kept closed to ASPs and the power draw is sustained compared to the existing method.
- 1 July 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-10
Proximity-Aware IaaS for Edge Computing Environment
Edge computing enables application services to leverage low-latency responses, e.g., for augmented reality. Infrastructure-as-a-service for edge computing (EC-IaaS) allows multiple application service providers (ASPs) to use a virtualized resource (i.e., virtual machines (VMs) and virtual networks) for various applications services on the common edge computing infrastructure. For ASPs, the proximity of the VMs to the end-user devices (i.e., the location of the host edge servers) is a significant factor in guaranteeing low-latency response times. The existing method allows ASPs to select the edge server locations so that the VMs satisfy the proximity requirement. However, the amount of information transmitted from the EC-IaaS provider to the ASP becomes large, because it has to include the latencies between all edge server locations and all wireless base stations. We propose a method that reduces the amount of information while ensuring that ASPs obtain VMs that satisfy the proximity requirement. An EC-IaaS provider suggests groups of wireless base stations that have VMs within a suitable proximity, which helps the ASPs to estimate the necessary number of VMs. Instead of the ASP, the EC-IaaS provider determines which edge servers should contain the VMs. We confirm that the proposed method reduces the transmitted information. The EC-IaaS provider also has a benefit that detail latency information is kept closed to ASPs and the power draw is sustained compared to the existing method.
- 1 December 2014
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 781-786
Performance Characteristics of an SDN-Enhanced Job Management System for Cluster Systems with Fat-Tree Interconnect
In the era of cloud computing, data centers that accommodate a series of user-requested jobs with a diversity of resource usage pattern need to have the capability of efficiently distributing resources to each user job, based on individual resource usage patterns. In particular, for high-performance computing as a cloud service which allows many users to benefit from a large-scale computing system, a new framework for resource management that treats not only the CPU resources, but also the network resources in the data center is essential. In this paper, an SDN-enhanced JMS that efficiently handles both network and CPU resources and as a result accelerates the execution time of user jobs is introduced as a building block technology for such a HPC cloud. Our evaluation shows that the SDN-enhanced JMS efficiently leverages the fat-tree interconnect of cluster systems running behind the cloud to suppress the collision of communications generated by different jobs.
- 1 December 2014
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 781-786
Performance Characteristics of an SDN-Enhanced Job Management System for Cluster Systems with Fat-Tree Interconnect
In the era of cloud computing, data centers that accommodate a series of user-requested jobs with a diversity of resource usage pattern need to have the capability of efficiently distributing resources to each user job, based on individual resource usage patterns. In particular, for high-performance computing as a cloud service which allows many users to benefit from a large-scale computing system, a new framework for resource management that treats not only the CPU resources, but also the network resources in the data center is essential. In this paper, an SDN-enhanced JMS that efficiently handles both network and CPU resources and as a result accelerates the execution time of user jobs is introduced as a building block technology for such a HPC cloud. Our evaluation shows that the SDN-enhanced JMS efficiently leverages the fat-tree interconnect of cluster systems running behind the cloud to suppress the collision of communications generated by different jobs.