Takehiro Sato
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
Takehiro Sato has a total of 86 co-authors. Here are the top co-authors by number of shared publications:
- Eiji Oki
Kyoto University
22 shared publications - Ryoichi Shinkuma
Shibaura Institute of Technology, Tokyo, Japan
9 shared publications Eiji Oki
8 shared publications- Fujun He
Graduate School of Informatics, Kyoto University, Kyoto, Japan
7 shared publications - Bijoy Chand Chatterjee
South Asian University
2 shared publications - Chenlu Zhang
Graduate School of Informatics, Kyoto University, Kyoto, Japan
2 shared publications
Latest Publications
- Open Access
- 10 September 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Open Journal of the Communications Society
- Vol. 6, 7333-7348
Service Function Chain Update and Buffer Scheduling Model With State Consistency
A service function chain (SFC) is a set of virtualized network functions (VNFs) concatenated in a virtualized network. Paths of SFCs need to be updated to achieve load balancing and security. When updating SFCs, states of VNF instances need to be migrated to new VNF instances; otherwise, the processing accuracy of packets degrades. While the state migration is performed, packets need to be buffered to guarantee state consistency. In existing models, if the state migration to a VNF instance is not completed, packets are buffered at that VNF instance. When these models are adopted to the update of multiple SFCs, the buffered packets can be concentrated at certain VNF instances and packet loss can occur. This paper proposes an SFC update and buffer scheduling model with the state consistency. In the proposed model, packets can be buffered at destination VNF instances for an arbitrary time. The proposed model is formulated as a mixed integer linear programming (MILP) problem, whose objective is to minimize the maximum amount of buffered packets among VNF instances. The decision problem of the proposed model is proved to be NP-complete. Two algorithms are introduced for the case where the MILP problem is not tractable. Numerical results show that the proposed model can suppress the maximum amount of buffered packets compared to the benchmark model by more than 40% in several scenarios.
- 10 September 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Open Journal of the Communications Society
- Vol. 6, 7333-7348
Open AccessService Function Chain Update and Buffer Scheduling Model With State Consistency
A service function chain (SFC) is a set of virtualized network functions (VNFs) concatenated in a virtualized network. Paths of SFCs need to be updated to achieve load balancing and security. When updating SFCs, states of VNF instances need to be migrated to new VNF instances; otherwise, the processing accuracy of packets degrades. While the state migration is performed, packets need to be buffered to guarantee state consistency. In existing models, if the state migration to a VNF instance is not completed, packets are buffered at that VNF instance. When these models are adopted to the update of multiple SFCs, the buffered packets can be concentrated at certain VNF instances and packet loss can occur. This paper proposes an SFC update and buffer scheduling model with the state consistency. In the proposed model, packets can be buffered at destination VNF instances for an arbitrary time. The proposed model is formulated as a mixed integer linear programming (MILP) problem, whose objective is to minimize the maximum amount of buffered packets among VNF instances. The decision problem of the proposed model is proved to be NP-complete. Two algorithms are introduced for the case where the MILP problem is not tractable. Numerical results show that the proposed model can suppress the maximum amount of buffered packets compared to the benchmark model by more than 40% in several scenarios.
- 11 December 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network and Service Management
- Vol. 22 (2) , 2156-2180
Robust Deployment Model for Parallelized Service Function Chains Against Uncertain Traffic Arrival Rates
In network function virtualization, a network service is provided by a service function chain (SFC), which consists of a chain of virtual network functions (VNFs) within a specific order. SFC parallelism allows parallel processing among VNFs to reduce the end-to-end service delay. Existing works handle the service delay without considering traffic uncertainty, which leads to degraded performance on parallel structure balancing and deployment cost saving in the parallelized SFC deployment problem. This paper proposes a robust deployment model for parallelized SFCs against traffic uncertainty that satisfies the requirement of balanced parallel structures and minimizes the deployment cost. We define a traffic uncertainty set that handles both the variation of service traffic arrival rates and the fluctuation of parallel structures. We apply VNF sharing to improve the efficiency of resource allocation. We formulate the proposed model as a mixed integer second-order cone programming (MISOCP) problem. We introduce a heuristic algorithm to handle larger-size problems, where the MISOCP approach is intractable to obtain a solution in a practical time. Numerical results show the advantages of the proposed model in terms of deployment cost over the baseline models.
- 11 December 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network and Service Management
- Vol. 22 (2) , 2156-2180
Robust Deployment Model for Parallelized Service Function Chains Against Uncertain Traffic Arrival Rates
In network function virtualization, a network service is provided by a service function chain (SFC), which consists of a chain of virtual network functions (VNFs) within a specific order. SFC parallelism allows parallel processing among VNFs to reduce the end-to-end service delay. Existing works handle the service delay without considering traffic uncertainty, which leads to degraded performance on parallel structure balancing and deployment cost saving in the parallelized SFC deployment problem. This paper proposes a robust deployment model for parallelized SFCs against traffic uncertainty that satisfies the requirement of balanced parallel structures and minimizes the deployment cost. We define a traffic uncertainty set that handles both the variation of service traffic arrival rates and the fluctuation of parallel structures. We apply VNF sharing to improve the efficiency of resource allocation. We formulate the proposed model as a mixed integer second-order cone programming (MISOCP) problem. We introduce a heuristic algorithm to handle larger-size problems, where the MISOCP approach is intractable to obtain a solution in a practical time. Numerical results show the advantages of the proposed model in terms of deployment cost over the baseline models.
- 24 October 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network and Service Management
- Vol. 22 (1) , 744-759
Flow Update Model Based on Probability Distribution of Migration Time in Software-Defined Networks
In a software-defined network (SDN), routes of packet flows need to be updated in situations such as maintenance and router replacement. Each flow is migrated from its old path to new path. The SDN update has an asynchronous nature; the time when the switches process commands by the controller varies depending on flows. Therefore, it is difficult to control an order of flow migrations, and packets can be lost by congestion. Existing models divide the time axis into rounds and assign migrations to these rounds. However, congestion caused by multiple migrations in the same round is uncontrollable. Based on the probability distribution of time required for each migration, congestion can occur. This paper proposes a flow update model which minimizes the expected amount of excessive traffic by shifting the probability distributions. The time axis is divided into time slots which are fine-grained than rounds, so that each probability distribution is shifted. The proposed model assigns the time when the controller injects a command of flow migration to time slots. The proposed model is formulated as an optimization problem to determine the command times to minimize the expected amount. This paper introduces two methods to compute the expected amount. This paper also introduces a two-stage scheduling scheme (2SS) that divides the optimization problem into two stages. 2SS suppresses the computation time from O(|T||F|-1) to O(|T||F|-1/2) at the cost of including at most 0.12% error. 2SS suppresses the amount of excessive traffic than an existing model by at most 71.2%.
- 24 October 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network and Service Management
- Vol. 22 (1) , 744-759
Flow Update Model Based on Probability Distribution of Migration Time in Software-Defined Networks
In a software-defined network (SDN), routes of packet flows need to be updated in situations such as maintenance and router replacement. Each flow is migrated from its old path to new path. The SDN update has an asynchronous nature; the time when the switches process commands by the controller varies depending on flows. Therefore, it is difficult to control an order of flow migrations, and packets can be lost by congestion. Existing models divide the time axis into rounds and assign migrations to these rounds. However, congestion caused by multiple migrations in the same round is uncontrollable. Based on the probability distribution of time required for each migration, congestion can occur. This paper proposes a flow update model which minimizes the expected amount of excessive traffic by shifting the probability distributions. The time axis is divided into time slots which are fine-grained than rounds, so that each probability distribution is shifted. The proposed model assigns the time when the controller injects a command of flow migration to time slots. The proposed model is formulated as an optimization problem to determine the command times to minimize the expected amount. This paper introduces two methods to compute the expected amount. This paper also introduces a two-stage scheduling scheme (2SS) that divides the optimization problem into two stages. 2SS suppresses the computation time from O(|T||F|-1) to O(|T||F|-1/2) at the cost of including at most 0.12% error. 2SS suppresses the amount of excessive traffic than an existing model by at most 71.2%.
- 7 May 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network and Service Management
- Vol. 21 (4) , 4563-4582
Probabilistic Protection for Both Computing and Transmission Capacities of Virtual Networks Under Multiple Facility Node Failures
This paper proposes a backup computing and transmission capacity allocation model for virtual networks that minimizes the required backup computing capacity under multiple facility node failures. The proposed model adopts the probabilistic protection, where the probability that the protection fails due to insufficient capacity is restricted not to be greater than a given survivability parameter, by using robust optimization. The conventional model allocates the backup computing capacity by considering the probabilistic protection but allocates the transmission capacity for all backup paths dedicatedly. The proposed model allocates the backup transmission capacity only for the failure patterns that are considered under the probabilistic protection guarantee; the probabilistic protection is considered for both computing and transmission capacity allocation. Reducing the required backup transmission capacity can also reduce the required backup computing capacity, since more feasible solutions for backup computing capacity allocation can exist. We introduce a heuristic algorithm to solve the backup computing and transmission capacity allocation problem. Numerical results show that the proposed model reduces the required backup transmission capacity and enhances the feasibility of allocating virtual networks compared with the conventional model. We also observe that reducing the required backup transmission capacity can lead to reducing the required backup computing capacity.
- 7 May 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network and Service Management
- Vol. 21 (4) , 4563-4582
Probabilistic Protection for Both Computing and Transmission Capacities of Virtual Networks Under Multiple Facility Node Failures
This paper proposes a backup computing and transmission capacity allocation model for virtual networks that minimizes the required backup computing capacity under multiple facility node failures. The proposed model adopts the probabilistic protection, where the probability that the protection fails due to insufficient capacity is restricted not to be greater than a given survivability parameter, by using robust optimization. The conventional model allocates the backup computing capacity by considering the probabilistic protection but allocates the transmission capacity for all backup paths dedicatedly. The proposed model allocates the backup transmission capacity only for the failure patterns that are considered under the probabilistic protection guarantee; the probabilistic protection is considered for both computing and transmission capacity allocation. Reducing the required backup transmission capacity can also reduce the required backup computing capacity, since more feasible solutions for backup computing capacity allocation can exist. We introduce a heuristic algorithm to solve the backup computing and transmission capacity allocation problem. Numerical results show that the proposed model reduces the required backup transmission capacity and enhances the feasibility of allocating virtual networks compared with the conventional model. We also observe that reducing the required backup transmission capacity can lead to reducing the required backup computing capacity.
- 22 January 2024
- Published by Elsevier in Computer Networks
- Vol. 241
Multi-source multicast service chaining model guaranteeing reliability of network services
- 22 January 2024
- Published by Elsevier in Computer Networks
- Vol. 241
Multi-source multicast service chaining model guaranteeing reliability of network services
- 1 January 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEICE Transactions on Communications
- Vol. E107.B (1) , 173-184
Resource Allocation for Mobile Edge Computing System Considering User Mobility with Deep Reinforcement Learning
Mobile edge computing (MEC) is a key technology for providing services that require low latency by migrating cloud functions to the network edge. The potential low quality of the wireless channel should be noted when mobile users with limited computing resources offload tasks to an MEC server. To improve the transmission reliability, it is necessary to perform resource allocation in an MEC server, taking into account the current channel quality and the resource contention. There are several works that take a deep reinforcement learning (DRL) approach to address such resource allocation. However, these approaches consider a fixed number of users offloading their tasks, and do not assume a situation where the number of users varies due to user mobility. This paper proposes Deep reinforcement learning model for MEC Resource Allocation with Dummy (DMRA-D), an online learning model that addresses the resource allocation in an MEC server under the situation where the number of users varies. By adopting dummy state/action, DMRA-D keeps the state/action representation. Therefore, DMRA-D can continue to learn one model regardless of variation in the number of users during the operation. Numerical results show that DMRA-D improves the success rate of task submission while continuing learning under the situation where the number of users varies.
- 1 January 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEICE Transactions on Communications
- Vol. E107.B (1) , 173-184
Resource Allocation for Mobile Edge Computing System Considering User Mobility with Deep Reinforcement Learning
Mobile edge computing (MEC) is a key technology for providing services that require low latency by migrating cloud functions to the network edge. The potential low quality of the wireless channel should be noted when mobile users with limited computing resources offload tasks to an MEC server. To improve the transmission reliability, it is necessary to perform resource allocation in an MEC server, taking into account the current channel quality and the resource contention. There are several works that take a deep reinforcement learning (DRL) approach to address such resource allocation. However, these approaches consider a fixed number of users offloading their tasks, and do not assume a situation where the number of users varies due to user mobility. This paper proposes Deep reinforcement learning model for MEC Resource Allocation with Dummy (DMRA-D), an online learning model that addresses the resource allocation in an MEC server under the situation where the number of users varies. By adopting dummy state/action, DMRA-D keeps the state/action representation. Therefore, DMRA-D can continue to learn one model regardless of variation in the number of users during the operation. Numerical results show that DMRA-D improves the success rate of task submission while continuing learning under the situation where the number of users varies.
- 8 December 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network and Service Management
- Vol. 21 (2) , 2266-2286
Service Deployment for Parallelized Function Chains Considering Traffic-Dependent Delay
In network function virtualization, virtual network functions (VNFs) are usually chained in specific orders to generate service function chains (SFCs). Recently, SFC parallelism has been presented to enable VNFs to run in parallel to reduce the end-to-end service delay. Existing works handle the issue of unbalanced parallel branches by assuming predefined linear delay models, which have limitations in efficient resource allocation and deployment cost savings. This paper proposes a deployment model for parallelized SFC that handles the imbalance issue with considering that the delay of each VNF depends on both arriving traffic and allocated computing resources, to improve the flexibility of computing resource allocation. We consider a nonlinear relationship between delay, allocated computing resources, and arriving traffic. We apply VNF sharing to improve the efficiency of resource allocation. We formulate the proposed model as a mixed integer second-order cone programming problem (MISOCP) to minimize the total deployment cost, with satisfying the end-to-end delay requirement. We also introduce a heuristic algorithm to solve the original problem, because the MISOCP approach is intractable to handle larger-size problems in practical time. Numerical results show that the proposed model achieves lower deployment cost than the baseline models.
- 8 December 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network and Service Management
- Vol. 21 (2) , 2266-2286
Service Deployment for Parallelized Function Chains Considering Traffic-Dependent Delay
In network function virtualization, virtual network functions (VNFs) are usually chained in specific orders to generate service function chains (SFCs). Recently, SFC parallelism has been presented to enable VNFs to run in parallel to reduce the end-to-end service delay. Existing works handle the issue of unbalanced parallel branches by assuming predefined linear delay models, which have limitations in efficient resource allocation and deployment cost savings. This paper proposes a deployment model for parallelized SFC that handles the imbalance issue with considering that the delay of each VNF depends on both arriving traffic and allocated computing resources, to improve the flexibility of computing resource allocation. We consider a nonlinear relationship between delay, allocated computing resources, and arriving traffic. We apply VNF sharing to improve the efficiency of resource allocation. We formulate the proposed model as a mixed integer second-order cone programming problem (MISOCP) to minimize the total deployment cost, with satisfying the end-to-end delay requirement. We also introduce a heuristic algorithm to solve the original problem, because the MISOCP approach is intractable to handle larger-size problems in practical time. Numerical results show that the proposed model achieves lower deployment cost than the baseline models.
- 10 November 2023
- Published by Elsevier in Computer Networks
- Vol. 237
Lightpath provisioning model considering crosstalk-derived fragmentation in spectrally-spatially elastic optical networks
- 10 November 2023
- Published by Elsevier in Computer Networks
- Vol. 237
Lightpath provisioning model considering crosstalk-derived fragmentation in spectrally-spatially elastic optical networks
- 12 June 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network and Service Management
- Vol. 20 (4) , 4887-4908
Fault-Tolerant Controller Placement Model Considering Load-Dependent Sojourn Time in Software-Defined Network
This paper proposes a controller placement model that takes into account the load-dependent sojourn time at each controller while considering controller failures in a software-defined network. The sojourn time is expressed by the queuing theory. The sojourn time varies depending on the amount of load arriving at each controller in the proposed model. The proposed model is formulated as a mixed integer second-order cone programming (MISOCP) problem. The controller placement problem studied in this paper is proven to be NP-hard. We develop a heuristic algorithm for the case where the solution to an optimization problem of the proposed model cannot be obtained in practical time. The proposed model is compared with two baseline models presented in the previous research. In the baseline models, the sojourn time does not depend on the amount of load arriving at each controller. Numerical results show that the number of placed controllers becomes smaller in the proposed model than in the baseline models. We also compare results obtained by solving the MISOCP problem to those of the heuristic algorithm. Numerical results show that the heuristic algorithm reduces the computation time required to determine the controller placement, whereas the difference between the number of controllers determined by the heuristic algorithm and the optimal value is at most 4.84%. The number of controllers placed by the heuristic algorithm tends to decrease by considering network centrality.
- 12 June 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network and Service Management
- Vol. 20 (4) , 4887-4908
Fault-Tolerant Controller Placement Model Considering Load-Dependent Sojourn Time in Software-Defined Network
This paper proposes a controller placement model that takes into account the load-dependent sojourn time at each controller while considering controller failures in a software-defined network. The sojourn time is expressed by the queuing theory. The sojourn time varies depending on the amount of load arriving at each controller in the proposed model. The proposed model is formulated as a mixed integer second-order cone programming (MISOCP) problem. The controller placement problem studied in this paper is proven to be NP-hard. We develop a heuristic algorithm for the case where the solution to an optimization problem of the proposed model cannot be obtained in practical time. The proposed model is compared with two baseline models presented in the previous research. In the baseline models, the sojourn time does not depend on the amount of load arriving at each controller. Numerical results show that the number of placed controllers becomes smaller in the proposed model than in the baseline models. We also compare results obtained by solving the MISOCP problem to those of the heuristic algorithm. Numerical results show that the heuristic algorithm reduces the computation time required to determine the controller placement, whereas the difference between the number of controllers determined by the heuristic algorithm and the optimal value is at most 4.84%. The number of controllers placed by the heuristic algorithm tends to decrease by considering network centrality.
- 25 April 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network and Service Management
- Vol. 20 (4) , 4779-4802
Service Chain Provisioning Model Considering Traffic Changes Due to Virtualized Network Functions
Service chaining provides network services by flexibly configuring service chains that connect virtualized network functions (VNFs) in the appropriate order so as to satisfy users’ needs. Existing models can be inefficient in terms of consuming network and computation resources since the models do not consider the traffic changes due to VNFs or the models restrict routing and VNF placement. This paper proposes a service chain provisioning model that handles the traffic changes created by VNFs while determining the VNF visit order of each request, request routes, and VNF placement. The service chain provisioning problem is formulated as an integer linear programming (ILP) problem. Three methods for limiting the number of VNF visit order patterns considered in the ILP problem are introduced to shorten the computation time. In order to handle a problem that is intractable with the ILP model, we introduce a greedy algorithm and an algorithm that divides the problem into the VNF placement part and the routing part. Numerical results show that considering the traffic changes due to VNFs yields more efficient consumption of network and computation resources than the alternative of assuming that the traffic amount of each request is constant between the endpoints. The results also show that the computation time can be shortened in our examined scenarios while we obtain the objective value larger by at most 0.4% than the optimal value by limiting the number of visit order patterns considered.
- 25 April 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network and Service Management
- Vol. 20 (4) , 4779-4802
Service Chain Provisioning Model Considering Traffic Changes Due to Virtualized Network Functions
Service chaining provides network services by flexibly configuring service chains that connect virtualized network functions (VNFs) in the appropriate order so as to satisfy users’ needs. Existing models can be inefficient in terms of consuming network and computation resources since the models do not consider the traffic changes due to VNFs or the models restrict routing and VNF placement. This paper proposes a service chain provisioning model that handles the traffic changes created by VNFs while determining the VNF visit order of each request, request routes, and VNF placement. The service chain provisioning problem is formulated as an integer linear programming (ILP) problem. Three methods for limiting the number of VNF visit order patterns considered in the ILP problem are introduced to shorten the computation time. In order to handle a problem that is intractable with the ILP model, we introduce a greedy algorithm and an algorithm that divides the problem into the VNF placement part and the routing part. Numerical results show that considering the traffic changes due to VNFs yields more efficient consumption of network and computation resources than the alternative of assuming that the traffic amount of each request is constant between the endpoints. The results also show that the computation time can be shortened in our examined scenarios while we obtain the objective value larger by at most 0.4% than the optimal value by limiting the number of visit order patterns considered.