The search functionality is under construction.
The search functionality is under construction.

Author Search Result

[Author] Wenhao FU(3hit)

1-3hit
  • Energy Efficient Resource Selection and Allocation Strategy for Virtual Machine Consolidation in Cloud Datacenters

    Yaohui CHANG  Chunhua GU  Fei LUO  Guisheng FAN  Wenhao FU  

     
    PAPER-Fundamentals of Information Systems

      Pubricized:
    2018/03/30
      Vol:
    E101-D No:7
      Page(s):
    1816-1827

    Virtual Machine Placement (VMP) plays an important role in ensuring efficient resource provisioning of physical machines (PMs) and energy efficiency in Infrastructure as a Service (IaaS) data centers. Efficient server consolidation assisted by virtual machine (VM) migration can promote the utilization level of the servers and switch the idle PMs to sleep mode to save energy. The trade-off between energy and performance is difficult, because consolidation may cause performance degradation, even service level agreement (SLA) violations. A novel residual available capacity (RAC) resource model is proposed to resolve the VM selection and allocation problem from the cloud service provider (CSP) perspective. Furthermore, a novel heuristic VM selection policy for server consolidation, named Minimized Square Root available Resource (MISR) is proposed. Meanwhile, an efficient VM allocation policy, named Balanced Selection (BS) based on RAC is proposed. The effectiveness validation of the BS-MISR combination is conducted on CloudSim with real workloads from the CoMon project. Evaluation results of experiments show that the proposed combinationBS-MISR can significantly reduce the energy consumption, with an average of 36.35% compared to the Local Regression and Minimum Migration Time (LR-MMT) combination policy. Moreover, the BS-MISR ensures a reasonable level of SLAs compared to the benchmarks.

  • A Reliable and Efficient Routing Protocol Based on Virtual Backbone in Vehicular Ad Hoc Networks

    Xiang JI  Huiqun YU  Guisheng FAN  Wenhao FU  

     
    PAPER-Network

      Pubricized:
    2018/08/20
      Vol:
    E102-B No:2
      Page(s):
    298-305

    Vehicular ad hoc network (VANET) is an emerging technology for the future intelligent transportation systems (ITS). How to design an efficient routing protocol for VANET is a challenging task due to the high mobility and uneven distribution of vehicles in urban areas. This paper proposes a backbone-based approach to providing the optimal inner-street relaying strategy. The virtual backbone is created distributively in each road segment based on the newly introduced stability index, which considers the link stability between vehicles and the mobility of vehicles. We also deploy the roadside unit (RSU) at intersections to determine the next path for forwarding data. The RSU gathers a global view of backbone vehicles on each road connected to the junction and analyzes the performance of the backbone as a basis of routing path selection. Simulation results show that the proposed protocol outperforms the conventional protocols in terms of packet delivery ratio and end-to-end delay.

  • Coverage-Based Clustering and Scheduling Approach for Test Case Prioritization

    Wenhao FU  Huiqun YU  Guisheng FAN  Xiang JI  

     
    PAPER-Software Engineering

      Pubricized:
    2017/03/03
      Vol:
    E100-D No:6
      Page(s):
    1218-1230

    Regression testing is essential for assuring the quality of a software product. Because rerunning all test cases in regression testing may be impractical under limited resources, test case prioritization is a feasible solution to optimize regression testing by reordering test cases for the current testing version. In this paper, we propose a novel test case prioritization approach that combines the clustering algorithm and the scheduling algorithm for improving the effectiveness of regression testing. By using the clustering algorithm, test cases with same or similar properties are merged into a cluster, and the scheduling algorithm helps allocate an execution priority for each test case by incorporating fault detection rates with the waiting time of test cases in candidate set. We have conducted several experiments on 12 C programs to validate the effectiveness of our proposed approach. Experimental results show that our approach is more effective than some well studied test case prioritization techniques in terms of average percentage of fault detected (APFD) values.