Osamu Akashi
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
Osamu Akashi has a total of 18 co-authors. Here are the top co-authors by number of shared publications:
- Kensuke Fukuda
National Institute of Informatics Tokyo Japan
3 shared publications - Kimihiro Mizutani
Kindai University
3 shared publications - Takeru Inoue
NTT Network Innovation Laboratories, NTT Corporation, Yokohama, Kanagawa, Japan
3 shared publications - Ryusei Shiiba
SOKENDAI, Tokyo, Japan
2 shared publications - Satoru Kobayashi
Faculty of Environmental, Life, Natural Science and Technology, Okayama University, Okayama, Japan
2 shared publications - Toru Mano
NTT Network Innovation Laboratories, Yokosuka, Japan
2 shared publications
Latest Publications
- Open Access
- 1 June 2026
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Networking
- Vol. 4 (CoNEXT2) , 1-25
Iterative Specification Refinement towards Side Effect Free Configuration Repair
Configuration changes on network devices are a routine task for network operators; however, misconfigurations sometimes cause significant network downtime. Configuration repair aims to safely automate this task by inferring new configuration parameters that satisfy operators' high-level network change intents. Despite its benefit, existing repair tools could introduce unexpected forwarding path changes not described by the change intents (i.e., side effects). These side effects hinder their real-world deployment, as such path changes occur without the operators' awareness. We propose ISR, a new augmentative framework for repair tools to prevent undesired side effects in satisfying network change intents. The key idea is iterative specification refinement: ISR (1) identifies side effects in configurations after repair, (2) generates minimal repair specifications to prevent them, and (3) feeds these specifications back into the next repair. This iterative process guides repair tools to find configuration parameters that satisfy change intents without introducing undesired side effects. We evaluate the effectiveness and scalability of ISR on real network topologies. We first demonstrate that ISR successfully guides three repair tools (SMT/Simulation/LLM-based) to generate configurations that satisfy change intents without introducing undesired side effects in OSPF and BGP networks. Second, the scalability evaluation shows that ISR completes a refinement iteration within seconds for varying numbers of side effects on the topologies with up to 200 nodes.
- 1 June 2026
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Networking
- Vol. 4 (CoNEXT2) , 1-25
Open AccessIterative Specification Refinement towards Side Effect Free Configuration Repair
Configuration changes on network devices are a routine task for network operators; however, misconfigurations sometimes cause significant network downtime. Configuration repair aims to safely automate this task by inferring new configuration parameters that satisfy operators' high-level network change intents. Despite its benefit, existing repair tools could introduce unexpected forwarding path changes not described by the change intents (i.e., side effects). These side effects hinder their real-world deployment, as such path changes occur without the operators' awareness. We propose ISR, a new augmentative framework for repair tools to prevent undesired side effects in satisfying network change intents. The key idea is iterative specification refinement: ISR (1) identifies side effects in configurations after repair, (2) generates minimal repair specifications to prevent them, and (3) feeds these specifications back into the next repair. This iterative process guides repair tools to find configuration parameters that satisfy change intents without introducing undesired side effects. We evaluate the effectiveness and scalability of ISR on real network topologies. We first demonstrate that ISR successfully guides three repair tools (SMT/Simulation/LLM-based) to generate configurations that satisfy change intents without introducing undesired side effects in OSPF and BGP networks. Second, the scalability evaluation shows that ISR completes a refinement iteration within seconds for varying numbers of side effects on the topologies with up to 200 nodes.
- Open Access
- 8 September 2025
- Published by Association for Computing Machinery (ACM)
- p. 43-48
Refining Specifications for Configuration Repair with Side Effect Diagnosis
- 8 September 2025
- Published by Association for Computing Machinery (ACM)
- p. 43-48
Open AccessRefining Specifications for Configuration Repair with Side Effect Diagnosis
- Open Access
- 1 March 2021
- Published by NTT, Inc. in NTT Technical Review
- Vol. 19 (3) , 53-62
Increasing Capacity of a Strictly Non-blocking Clos Network Composed of Optical Switches
- 1 March 2021
- Published by NTT, Inc. in NTT Technical Review
- Vol. 19 (3) , 53-62
Open AccessIncreasing Capacity of a Strictly Non-blocking Clos Network Composed of Optical Switches
- 20 March 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-5
Towards a Low-Delay Edge Cloud Computing through a Combined Communication and Computation Approach
There are many applications which cannot be executed by mobile devices due to their limitations in memory, processing, battery, among others. One solution to this would be offloading heavy tasks to cloud servers in the edge of the network, in a service model called Edge Cloud Computing. The main Quality of Service requirement of this model is a low Service Delay, which can be achieved by lowering Transmission Delay and Processing Delay. Works in literature focus on either one of those two types of delay. This paper, however, argues that an approach which combines transmission and processing technologies to lower Service Delay would be more efficient. This idea is defended by an analysis of the service model and existing stochastic modeling of the Edge Cloud Computing system. We conclude that a dual focus approach would be the only way of truly minimizing the Service Delay, therefore being the desired method to improve Quality of Service. We conclude by laying the foundation for a future model that follows such concept.
- 20 March 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-5
Towards a Low-Delay Edge Cloud Computing through a Combined Communication and Computation Approach
There are many applications which cannot be executed by mobile devices due to their limitations in memory, processing, battery, among others. One solution to this would be offloading heavy tasks to cloud servers in the edge of the network, in a service model called Edge Cloud Computing. The main Quality of Service requirement of this model is a low Service Delay, which can be achieved by lowering Transmission Delay and Processing Delay. Works in literature focus on either one of those two types of delay. This paper, however, argues that an approach which combines transmission and processing technologies to lower Service Delay would be more efficient. This idea is defended by an analysis of the service model and existing stochastic modeling of the Edge Cloud Computing system. We conclude that a dual focus approach would be the only way of truly minimizing the Service Delay, therefore being the desired method to improve Quality of Service. We conclude by laying the foundation for a future model that follows such concept.
- 1 August 2014
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-8
Efficient virtual network optimization across multiple domains without revealing private information
Building optimal virtual networks across multiple domains is an essential technology to offer flexible network services. However, existing research is founded on an unrealistic assumption; providers will share their private information including resource costs. Providers, as is well known, never actually do that to remain competitive. Technically, secure multiparty computation, which is a computational technique based on the cryptography, can be used to secure optimization, but it is too time-consuming. This paper presents a novel method to optimize virtual networks built over multiple domains, with great efficiency but without revealing any private information. Our method employs secure multi-party computation but only for masking sensitive values; it can optimize virtual networks under limited information without any time-consuming technique. It is solidly based on the theory of optimality, and is assured of finding reasonably optimal solutions. Experiments show that our method is fast and optimal in practice even concealing private information; it finds nearly optimal solutions in just a few minutes for large virtual networks with tens of nodes. This is the first work that can be implemented in practice for building optimal virtual networks across multiple domains.
- 1 August 2014
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-8
Efficient virtual network optimization across multiple domains without revealing private information
Building optimal virtual networks across multiple domains is an essential technology to offer flexible network services. However, existing research is founded on an unrealistic assumption; providers will share their private information including resource costs. Providers, as is well known, never actually do that to remain competitive. Technically, secure multiparty computation, which is a computational technique based on the cryptography, can be used to secure optimization, but it is too time-consuming. This paper presents a novel method to optimize virtual networks built over multiple domains, with great efficiency but without revealing any private information. Our method employs secure multi-party computation but only for masking sensitive values; it can optimize virtual networks under limited information without any time-consuming technique. It is solidly based on the theory of optimality, and is assured of finding reasonably optimal solutions. Experiments show that our method is fast and optimal in practice even concealing private information; it finds nearly optimal solutions in just a few minutes for large virtual networks with tens of nodes. This is the first work that can be implemented in practice for building optimal virtual networks across multiple domains.
- Open Access
- 11 September 2006
- Published by Association for Computing Machinery (ACM)
- p. 77-82
Policy-based BGP control architecture for autonomous routing management
Unexpected temporal and spatial changes of inter-AS routing behavior often lead to the necessity of on-demand inter-domain routingadjustment. For resolving this problem, we apply the AISLE framework, which is a multi-agent-based model, to a policy-based routingadjustment system for transit ISPs and their customer ASs. This paper describes the BGP-control architecture called VR (Virtual Router) that can dynamically change forwarding paths considering alternative paths, which are inferred from historical data and confirmed when they are actually applied. VR can control conventional multiple border routers in an AS without any protocol extensions. The policy description, which is interpreted by an agent, enables network operators to define autonomous actions for analyzing network status and adjusting inter-AS routing based on these observed results by issuing requests to VR. Some evaluation results indicate that VR can effectively change routing over BGP data on the actual Internet and some control scenarios based on policy descriptions demonstrate the validity of our basic design framework.
- 11 September 2006
- Published by Association for Computing Machinery (ACM)
- p. 77-82
Open AccessPolicy-based BGP control architecture for autonomous routing management
Unexpected temporal and spatial changes of inter-AS routing behavior often lead to the necessity of on-demand inter-domain routingadjustment. For resolving this problem, we apply the AISLE framework, which is a multi-agent-based model, to a policy-based routingadjustment system for transit ISPs and their customer ASs. This paper describes the BGP-control architecture called VR (Virtual Router) that can dynamically change forwarding paths considering alternative paths, which are inferred from historical data and confirmed when they are actually applied. VR can control conventional multiple border routers in an AS without any protocol extensions. The policy description, which is interpreted by an agent, enables network operators to define autonomous actions for analyzing network status and adjusting inter-AS routing based on these observed results by issuing requests to VR. Some evaluation results indicate that VR can effectively change routing over BGP data on the actual Internet and some control scenarios based on policy descriptions demonstrate the validity of our basic design framework.
- 22 June 2004
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 2401, 385-394
Secure and manageable virtual private networks for end-users
- 22 June 2004
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 2401, 385-394
Secure and manageable virtual private networks for end-users