The search functionality is under construction.

Author Search Result

[Author] Biao WU(2hit)

1-2hit
  • Research on the Switch Migration Strategy Based on Global Optimization Open Access

    Xiao’an BAO  Shifan ZHOU  Biao WU  Xiaomei TU  Yuting JIN  Qingqi ZHANG  Na ZHANG  

     
    PAPER-Information Network

      Pubricized:
    2024/03/25
      Vol:
    E107-D No:7
      Page(s):
    825-834

    With the popularization of software defined networks, switch migration as an important network management strategy has attracted increasing attention. Most existing switch migration strategies only consider local conditions and simple load thresholds, without fully considering the overall optimization and dynamics of the network. Therefore, this article proposes a switch migration algorithm based on global optimization. This algorithm adds a load prediction module to the migration model, determines the migration controller, and uses an improved whale optimization algorithm to determine the target controller and its surrounding controller set. Based on the load status of the controller and the traffic priority of the switch to be migrated, the optimal migration switch set is determined. The experimental results show that compared to existing schemes, the algorithm proposed in this paper improves the average flow processing efficiency by 15% to 40%, reduces switch migration times, and enhances the security of the controller.

  • Subnets Generation of Program Nets and Its Application to Software Testing

    Biao WU  Xiaoan BAO  Na ZHANG  Hiromu MORITA  Mitsuru NAKATA  Qi-Wei GE  

     
    PAPER-Mathematical Systems Science

      Vol:
    E102-A No:9
      Page(s):
    1303-1311

    Software testing is an important problem to design a large software system and it is difficult to be solved due to its computational complexity. We try to use program nets to approach this problem. As the first step towards solving software testing problem, this paper provides a technique to generate subnets of a program net and applies this technique to software testing. Firstly, definitions and properties of program nets are introduced based on our previous works, and the explanation of software testing problem is given. Secondly, polynomial algorithms are proposed to generate subnets that can cover all the given program net. Finally, a case study is presented to show how to find subnets covering a given program net by using the proposed algorithms, as well as to show the input test data of the program net for software testing.