International Journal of Web and Grid Services (10 papers in press)

Regular Issues

• A Service Composition Approach Based on Overall QoS and Modified Graphplan  
  by Ming Zhu, Guodong Fan, Jing Li, Fengying Wang 
  Abstract: Increasing emphasis on users preferences and the growth of services on the web make service composition a time consuming and complicated work. In this paper, an approach for web service composition that combines Overall QoS and modified Graphplan is proposed. Fuzzy logic is applied to handle uncertainty and support decision making. Specifically, values of Overall QoS of services are generated by using fuzzy analytical hierarchy process, entropy and users preferences. The Graphplan is modified by pruning services according to the values of Overall QoS of services in forward and backward expansions, while producing solutions of compositions. Furthermore, case studies and experiments are performed and show that our approach has better solutions compared with original Graphplan and some other approaches.
  Keywords: web service composition; QoS; fuzzy analytical hierarchy process; entropy.
  
  
• Natural Parallelization Paradigm on Accelerator Physics Example  
  by Nataliia Kulabukhova 
  Abstract: In this paper the problems of using the existing methods and algorithms for applied science with the help of high performance techniques is described. The idea is to provide the scientists with an easy to use tools for constructing the implementation of their research working on heterogeneous systems. Without a doubt the problem-solving environment for these purposes must give the exact solution in a reasonable time. The concept which is described in the article was devised specifically for such kind of tasks. The application of it in terms of high energy physics is given. To illustrate the work of the concept the analysis of the distribution of the particles in the beam under the influence of the space charge is done.
  Keywords: Hybrid Systems; General Purpose computations on GPU; Parallelization; Problem-Solving Environment.
  
  
• WMN-PSOSA: An Intelligent Hybrid Simulation System for WMNs and Its Performance Evaluations  
  by Shinji Sakamoto, Leonard Barolli, Shusuke Okamoto 
  Abstract: Networks of today are going through a rapid evolution. Recently, many new networks, especially wireless networks, are appearing. The Wireless Mesh Networks (WMNs) are wireless networks having mesh topology. They have many advantages, such as high robustness and easiness for maintenance. However, WMNs have some problems that need to be solved. One important problem for WMNs is the node placement problem, which is an NP-hard problem. In this work, we propose and implement an intelligent hybrid simulation system based on Particle Swarm Optimization (PSO) and Simulated Annealing (SA) for node placement problem in WMNs, called WMN-PSOSA. We evaluate the performance of WMN-PSOSA system considering different distributions of mesh clients such as Weibull, Chi-square, and Uniform distributions. The simulation results show that the WMN-PSOSA performs better for Weibull distribution compared with the case of Chi-square and Uniform distributions.
  Keywords: Wireless Mesh Networks; Node Placement Problem; Particle Swarm Optimization; Simulated Annealing; Intelligent Hybrid System; Weibull Distribution; Chi-square Distribution; Uniform Distribution.
  
  
• A Dependability and Cost Optimization Method for Private Cloud Infrastructures  
  by Danilo Oliveira, Jamilson Dantas, Rubens Matos, Nelson Rosa, Paulo Maciel, André Brinkmann 
  Abstract: Creating a cost-effective and highly available private cloud infrastructure from scratch is challenging. In order to improve availability, system administrators commonly employ redundant hardware, what incurs increased acquisition cost. One question that arises is: among all possible ways to arrange the servers, and considering a set of requirements (e.g., the minimum number of available workers, minimum availability), which configurations are able to sustain a minimal availability level (steady state and capacity oriented)? In this work, we propose an optimization model for private clouds planning supported by analytical modeling for computing the cost of solutions. By combining the optimization model with the bisection method, we can minimize the acquisition cost while maintaining the high availability of the cloud. The proposed method can also be applied to other parallel/distributed systems with the same properties as the private clouds used in our study.
  Keywords: Cloud computing; steady-state availability; capacity-oriented availability; combinatorial optimization.
  
  
• A fault-tolerant tree-based fog computing model  
  by Ryuji Oma, Shigenari Nakamura, Dilawaer Duolikun, Tomoya Enokido, Makoto Takizawa 
  Abstract: In the fog computing model of the IoT, subprocesses of an application process to handle sensor data are performed on fog nodes. Since the IoT is scalable, we have to reduce the electric energy consumption. In the tree-based fog computing (TBFC) model, fog nodes are hierarchically structured. In this paper, we propose a fault-tolerant TBFC (FTBFC) model. In addition, we newly propose a pair of fault-tolerant strategies. In one data transmission strategy, data processed by disconnected fog nodes is sent to a new parent fog node. Here, we propose a minimum energy (ME) algorithm to select a new parent fog node whose energy consumption is minimum. In another subprocess transmission strategy, the subprocess of the faulty fog node is sent to another fog node. In the evaluation, the energy consumption and execution time of a new parent fog node can be reduced by the ME algorithm.
  Keywords: energy-efficient fog computing; internet of things; IoT; energy-efficient IoT; tree-based fog computing model; fault-tolerant tree-based fog computing model.
  DOI: 10.1504/IJWGS.2019.10022420
   
  
• Lane detection algorithm based on Hough transform for high-speed self driving vehicles  
  by Hyunhee Park 
  Abstract: This study proposes a lane detection method based on expressway driving videos through a computer vision-based image processing system without using sensors. Both straight and curved sections can occur on a road, and thus, lanes must be detected by quickly determining such sections. The proposed method detects straight and curved sections that are estimated to be lanes using the Hough transform. When lanes are detected from actual images, the scope of left and right lanes is limited to reduce computational load. In this paper, we propose a lane-detection algorithm using the colour space and a stepwise algorithm for accurate lane detection. To verify the proposed algorithms, we developed a small self-driving vehicle model using a TX-2 board. The experiment results when applying the proposed Hough transform algorithm and lane-detection algorithm using the colour space show that the lane detection rate of vehicles driving on curves at high speed is approximately 96%. Through the extensive simulation results, the proposed algorithm to vehicle black boxes or autonomous driving will help prevent lane departure and reduce accident rates.
  Keywords: lane detection; Hough transform; self-driving vehicle; OpenCV; TensorFlow.
  DOI: 10.1504/IJWGS.2019.10022421
   
  
• Migrating two legacy systems to SOA: a new approach for service selection based on data flow diagram  
  by Basel Bani-Ismail, Youcef Baghdadi 
  Abstract: There are many service identification methods (SIMs) to simplify service identification in SOA lifecycle. These SIMs vary in terms of their features (e.g., input artefact, technique). Due to this diversity, few evaluation frameworks have been proposed to guide organisations in selecting a suitable SIM based on their available input artefacts (e.g., source code, business process). This research concerns with SIMs that consider data flow diagram (DFD) as an input artefact, in order to migrate two legacy systems, modelled with DFD, to SOA. Only two SIMs are found in the literature to identify services based on DFD. However, these SIMs do not provide a way to select among the services identified to be implemented as web services. Therefore, this paper aims to bridge this gap by proposing a new approach for service selection based on DFD to assist organisations in speeding up the process of migrating their legacy systems to SOA.
  Keywords: service-oriented architecture; SOA; service identification; service identification method; SIM; service selection; service quality; evaluation framework; data flow diagram; DFD.
  DOI: 10.1504/IJWGS.2019.10022422
   
  
• An improved public auditing protocol for cloud storage integrity checking  
  by Jindan Zhang, Baocang Wang 
  Abstract: Nowadays, cloud storage is a popular service for many data owners, they prefer to outsource their datum to the cloud servers. However the cloud servers maybe sometimes loss datum due to accidents. Thus, the integrity of the outsourced datum need to be ensured by the data owners or even any other third parties publicly. Recently in the mobile cloud computing setting, Chen et al. proposed a public auditing protocol for data integrity based on adjacency-hash-table. However we find the data blocks' tags can be easily forged in their proposal, and thus the cloud servers can loss datum but still has the ability to give correct proof for data position, which breaks the security of their proposal. We show two concrete attacks to their proposal and give an improved public auditing protocol for cloud storage integrity checking and roughly analysis its security.
  Keywords: cloud storage; public auditing; outsource; attack; tag.
  DOI: 10.1504/IJWGS.2019.10022424
   
  
• Toward an aspect-oriented cache autoloading framework with annotation  
  by Kun Ma, Xuewei Niu, Ziqiang Yu, Ke Ji 
  Abstract: In recent years, researches focus on addressing the query bottleneck issue using data cache in the internet-of-things. However, the challenges of this method are how to implement autonomous management of data cache. In this paper, we propose an aspect-oriented cache autoloading framework with annotation (ACALFA). The architecture, annotation, expression are introduced to address cache autoloading. There are some features for improving performance, such as avoiding cache breakdown and cache penetration using load waiting and autoloading, loose coupling of business and cache logic using AOP, and batch delete of cache. The result of experiments indicated that our method is nearly 25% faster than other cache frameworks in case of high concurrency.
  Keywords: big data; data cache; aspect-oriented programming; AOP; annotation; pointcut; grid services.
  DOI: 10.1504/IJWGS.2019.10022425
   
  

Special Issue on: Security for Cloud Computing

• Searchable Symmetric Encryption Based on the Inner Product for Cloud Storage
  by Jun Yang, Shujuan Li, Xiaodan Yan, Baihui Zhang, Baojiang Cui 
  Abstract: Searchable encryption enables the data owner to store their own data after encrypting them in the cloud. Searchable encryption also allows the client to search over the data without leaking any information about it. In this paper, we rst introduce a searchable symmetric encryption scheme based on the inner product: it is more ecient to compute the inner product of two vectors. In our construction, the parties can be Data Owners, Clients or the Cloud Server. The three parties communicate with each other through the inner product to achieve the goal that the client can search the data in the cloud without leaking any information on the data the owner stored in the cloud. We then perform a security analysis and performance evaluation, which show that our algorithm and construction are secure and ecient.
  Keywords: Searchable Encryption; Searchable Symmetric Encryption; Inner Product; the Cloud Server; Security.