Pub Date : 2019-07-04DOI: 10.1504/IJWGS.2019.10022424
Jindan Zhang, Baocang Wang
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.
{"title":"An improved public auditing protocol for cloud storage integrity checking","authors":"Jindan Zhang, Baocang Wang","doi":"10.1504/IJWGS.2019.10022424","DOIUrl":"https://doi.org/10.1504/IJWGS.2019.10022424","url":null,"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.","PeriodicalId":54935,"journal":{"name":"International Journal of Web and Grid Services","volume":"57 1","pages":"282-303"},"PeriodicalIF":1.0,"publicationDate":"2019-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80227882","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2019-07-04DOI: 10.1504/IJWGS.2019.10022425
Kun Ma, Xuewei Niu, Ziqiang Yu, Ke Ji
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.
{"title":"Toward an aspect-oriented cache autoloading framework with annotation","authors":"Kun Ma, Xuewei Niu, Ziqiang Yu, Ke Ji","doi":"10.1504/IJWGS.2019.10022425","DOIUrl":"https://doi.org/10.1504/IJWGS.2019.10022425","url":null,"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.","PeriodicalId":54935,"journal":{"name":"International Journal of Web and Grid Services","volume":"11 1","pages":"304-318"},"PeriodicalIF":1.0,"publicationDate":"2019-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89797285","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2019-07-04DOI: 10.1504/IJWGS.2019.10022420
R. Oma, Shigenari Nakamura, Dilawaer Duolikun, T. Enokido, M. Takizawa
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.
{"title":"A fault-tolerant tree-based fog computing model","authors":"R. Oma, Shigenari Nakamura, Dilawaer Duolikun, T. Enokido, M. Takizawa","doi":"10.1504/IJWGS.2019.10022420","DOIUrl":"https://doi.org/10.1504/IJWGS.2019.10022420","url":null,"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.","PeriodicalId":54935,"journal":{"name":"International Journal of Web and Grid Services","volume":"155 1","pages":"219-239"},"PeriodicalIF":1.0,"publicationDate":"2019-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74911664","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2019-07-04DOI: 10.1504/IJWGS.2019.10022421
Hyun-Hwa Park
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.
{"title":"Lane detection algorithm based on Hough transform for high-speed self driving vehicles","authors":"Hyun-Hwa Park","doi":"10.1504/IJWGS.2019.10022421","DOIUrl":"https://doi.org/10.1504/IJWGS.2019.10022421","url":null,"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.","PeriodicalId":54935,"journal":{"name":"International Journal of Web and Grid Services","volume":"103 1","pages":"240-250"},"PeriodicalIF":1.0,"publicationDate":"2019-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89755537","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2019-05-06DOI: 10.1504/IJWGS.2019.10021059
Liyang Zhang, Kohei Kaiya, Hiroyuki Suzuki, A. Koyama
In recent years, due to lifestyle-related diseases, people have paid more and more attention to the management of healthy meals. Some meal management systems are entering people's lives gradually. Existing studies have found that the proper meal habits, such as a correct meal sequence, can help prevent disease to a certain extent. In this paper, we introduce the smart tableware consisting of an acceleration sensor and a pressure sensor to obtain meal information such as meal sequence and meal content automatically. Moreover, feature extraction is performed on the meal information captured by sensors, and the machine learning algorithms are used to analyse and process the information. Finally, the meal content and meal sequence are fed back to the user to help people prevent diseases affected by lifestyle habits such as obesity and diabetes. In the experiment, we compare a variety of different machine learning algorithms and analyse the experimental results.
{"title":"A smart tableware-based meal information collection system using machine learning","authors":"Liyang Zhang, Kohei Kaiya, Hiroyuki Suzuki, A. Koyama","doi":"10.1504/IJWGS.2019.10021059","DOIUrl":"https://doi.org/10.1504/IJWGS.2019.10021059","url":null,"abstract":"In recent years, due to lifestyle-related diseases, people have paid more and more attention to the management of healthy meals. Some meal management systems are entering people's lives gradually. Existing studies have found that the proper meal habits, such as a correct meal sequence, can help prevent disease to a certain extent. In this paper, we introduce the smart tableware consisting of an acceleration sensor and a pressure sensor to obtain meal information such as meal sequence and meal content automatically. Moreover, feature extraction is performed on the meal information captured by sensors, and the machine learning algorithms are used to analyse and process the information. Finally, the meal content and meal sequence are fed back to the user to help people prevent diseases affected by lifestyle habits such as obesity and diabetes. In the experiment, we compare a variety of different machine learning algorithms and analyse the experimental results.","PeriodicalId":54935,"journal":{"name":"International Journal of Web and Grid Services","volume":"63 1594 1","pages":"206-218"},"PeriodicalIF":1.0,"publicationDate":"2019-05-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83925338","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2019-05-06DOI: 10.1504/IJWGS.2019.10021056
Syed Mahbub, E. Pardede, A. Kayes, W. Rahayu
Astroturfing is one of the most impactful threats on today's internet. It is the process of masking and portraying a doctored message to the general population in a way as though it originated from the grass-root level. The concept of astroturfing detection is started to gain popularity among researchers in social media, e-commerce and politics. With the recent growth of crowdsourcing systems, astroturfing is also creating a profound impact on people's opinions. Political blogs, news portals and review websites are being flooded with astroturfs. Some groups are using astroturfing to promote their interest and some are using it to demote the interest of competitors. Researchers have adopted many approaches to detect astroturfing on the web. These approaches include content analysis techniques, individual and group identification techniques, analysing linguistic features, authorship attribution techniques, machine learning and so on. We present a taxonomy of these approaches based on the key issues in online astroturfing detection techniques and discuss the relevant approaches in each category. The paper also summarises the discussed literature and highlights research challenges and directions for future work that have not aligned with the currently available research.
{"title":"Controlling astroturfing on the internet: a survey on detection techniques and research challenges","authors":"Syed Mahbub, E. Pardede, A. Kayes, W. Rahayu","doi":"10.1504/IJWGS.2019.10021056","DOIUrl":"https://doi.org/10.1504/IJWGS.2019.10021056","url":null,"abstract":"Astroturfing is one of the most impactful threats on today's internet. It is the process of masking and portraying a doctored message to the general population in a way as though it originated from the grass-root level. The concept of astroturfing detection is started to gain popularity among researchers in social media, e-commerce and politics. With the recent growth of crowdsourcing systems, astroturfing is also creating a profound impact on people's opinions. Political blogs, news portals and review websites are being flooded with astroturfs. Some groups are using astroturfing to promote their interest and some are using it to demote the interest of competitors. Researchers have adopted many approaches to detect astroturfing on the web. These approaches include content analysis techniques, individual and group identification techniques, analysing linguistic features, authorship attribution techniques, machine learning and so on. We present a taxonomy of these approaches based on the key issues in online astroturfing detection techniques and discuss the relevant approaches in each category. The paper also summarises the discussed literature and highlights research challenges and directions for future work that have not aligned with the currently available research.","PeriodicalId":54935,"journal":{"name":"International Journal of Web and Grid Services","volume":"3 1","pages":"139-158"},"PeriodicalIF":1.0,"publicationDate":"2019-05-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73444322","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2019-05-06DOI: 10.1504/IJWGS.2019.10021057
Rasool Bukhsh, N. Javaid, Sakeena Javaid, M. Ilahi, Itrat Fatima
The latency issue of cloud based system can degrade smart grid's real-time applications. This paper introduces a fog computing layer between the cloud and clients to provide energy management service in near real-time with optimised computing cost. In a region, in proposed system model, two clusters of residential buildings have access to two fogs for processing of their energy requests. A hybrid service broker policy and modified honey bee colony optimisation algorithm are proposed for efficient fog selection and balancing requests' load on virtual machines in the fog. The micro grids (MGs) are introduced in the system model between the fogs and the clusters for uninterrupted and cost-efficient power supply. The recurring cost of MGs and computing cost of the fogs make the system operation cost, which is payable by the consumers. The simulation validate the efficient system operation cost, processing and RT for power consumers.
{"title":"Efficient resource allocation for consumers' power requests in cloud-fog-based system","authors":"Rasool Bukhsh, N. Javaid, Sakeena Javaid, M. Ilahi, Itrat Fatima","doi":"10.1504/IJWGS.2019.10021057","DOIUrl":"https://doi.org/10.1504/IJWGS.2019.10021057","url":null,"abstract":"The latency issue of cloud based system can degrade smart grid's real-time applications. This paper introduces a fog computing layer between the cloud and clients to provide energy management service in near real-time with optimised computing cost. In a region, in proposed system model, two clusters of residential buildings have access to two fogs for processing of their energy requests. A hybrid service broker policy and modified honey bee colony optimisation algorithm are proposed for efficient fog selection and balancing requests' load on virtual machines in the fog. The micro grids (MGs) are introduced in the system model between the fogs and the clusters for uninterrupted and cost-efficient power supply. The recurring cost of MGs and computing cost of the fogs make the system operation cost, which is payable by the consumers. The simulation validate the efficient system operation cost, processing and RT for power consumers.","PeriodicalId":54935,"journal":{"name":"International Journal of Web and Grid Services","volume":"92 1","pages":"159-190"},"PeriodicalIF":1.0,"publicationDate":"2019-05-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75841048","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2019-05-06DOI: 10.1504/IJWGS.2019.10021058
Y. Shichkina, Al-Mardi Mohammed Haidar Awadh, Nikita Storublevtcev, A. Degtyarev
The article presents the results of studies on the adaptation of methods for optimising parallel algorithms by time and volume of computational resources to queries in relational databases. Research focuses on a method that allows you to improve the execution schedule of a parallel query by execution time due to the redistribution of operations between processes. It leads to a reduction in amount of messages transferred between processors, and to the time spent on transfer of data. It does not affect the amount of computational resources. The method is based on adjacency lists that correspond to the information graph of the algorithm. It can be applied in conjunction with other scheduling methods, for example, focused on computation node count optimisation, to achieve optimal result within multiple parameters.
{"title":"Application of parallel algorithm optimisation method to relational queries by reducing interprocessor data exchange time","authors":"Y. Shichkina, Al-Mardi Mohammed Haidar Awadh, Nikita Storublevtcev, A. Degtyarev","doi":"10.1504/IJWGS.2019.10021058","DOIUrl":"https://doi.org/10.1504/IJWGS.2019.10021058","url":null,"abstract":"The article presents the results of studies on the adaptation of methods for optimising parallel algorithms by time and volume of computational resources to queries in relational databases. Research focuses on a method that allows you to improve the execution schedule of a parallel query by execution time due to the redistribution of operations between processes. It leads to a reduction in amount of messages transferred between processors, and to the time spent on transfer of data. It does not affect the amount of computational resources. The method is based on adjacency lists that correspond to the information graph of the algorithm. It can be applied in conjunction with other scheduling methods, for example, focused on computation node count optimisation, to achieve optimal result within multiple parameters.","PeriodicalId":54935,"journal":{"name":"International Journal of Web and Grid Services","volume":"75 1","pages":"191-205"},"PeriodicalIF":1.0,"publicationDate":"2019-05-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77302066","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2019-01-01DOI: 10.1504/IJWGS.2019.10017534
Sen Niu, Guobing Zou, Yanglan Gan, Yang Xiang, Bofeng Zhang
Quality of service (QoS)-aware web service composition (QWSC) has recently become one of the most challenging research issues. Although much work has been investigated, they mainly focus on certain QoS of web services, while QoS with uncertainty exposes the most important characteristic in real and highly dynamic environment. In this paper, with the consideration of uncertain service QoS and user's preferences, we model the issue of uncertain QoS-aware WSC via interval number and translate it into a multi-objective optimisation problem with global QoS constraints of user's preferences. The encoded optimisation problem is solved by an non-deterministic multi-objective evolutionary algorithm, which exploits new genetic encoding schema, the strategy of crossover and uncertain interval Pareto comparison. To validate the feasibility, large-scale experiments have been conducted on simulated datasets. The results demonstrate that our proposed approach can effectively and efficiently find optimum composite service solutions set with satisfactory convergence.
{"title":"Towards the optimality of QoS-aware web service composition with uncertainty","authors":"Sen Niu, Guobing Zou, Yanglan Gan, Yang Xiang, Bofeng Zhang","doi":"10.1504/IJWGS.2019.10017534","DOIUrl":"https://doi.org/10.1504/IJWGS.2019.10017534","url":null,"abstract":"Quality of service (QoS)-aware web service composition (QWSC) has recently become one of the most challenging research issues. Although much work has been investigated, they mainly focus on certain QoS of web services, while QoS with uncertainty exposes the most important characteristic in real and highly dynamic environment. In this paper, with the consideration of uncertain service QoS and user's preferences, we model the issue of uncertain QoS-aware WSC via interval number and translate it into a multi-objective optimisation problem with global QoS constraints of user's preferences. The encoded optimisation problem is solved by an non-deterministic multi-objective evolutionary algorithm, which exploits new genetic encoding schema, the strategy of crossover and uncertain interval Pareto comparison. To validate the feasibility, large-scale experiments have been conducted on simulated datasets. The results demonstrate that our proposed approach can effectively and efficiently find optimum composite service solutions set with satisfactory convergence.","PeriodicalId":54935,"journal":{"name":"International Journal of Web and Grid Services","volume":"6 1","pages":"1-28"},"PeriodicalIF":1.0,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91267887","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2019-01-01DOI: 10.1504/IJWGS.2019.10017542
Jesus Bellido, Rosa Alarcón, C. Pautasso, Carla Vairetti
Service composition is one of the principles of service-oriented architecture; it enables reuse and allows developers to combine existing services in order to create new services that in turn can be part of another composition. Dynamic composition requires that service components are chosen from a set of services with equal or similar functionality at runtime and possibly automatically. The adoption of the REST services in the industry has led to a growing number of services of this type, many with similar functionality. The existing dynamic composition techniques are method-oriented whereas REST is resource-oriented and consider only traditional (WSDL/SOAP) services. We propose SAW-Q, an extension of simple additive weighting (SAW), as a novel dynamic composition technique that follows the principles of the REST style. Additionally, SAW-Q models quality attributes as a function of the actual service demand instead of the traditional constant values. Our model is much more accurate when compared to real implementation, positively improving the quality of dynamic service compositions.
{"title":"SAW-Q: a dynamic composition approach of REST services based on queue model","authors":"Jesus Bellido, Rosa Alarcón, C. Pautasso, Carla Vairetti","doi":"10.1504/IJWGS.2019.10017542","DOIUrl":"https://doi.org/10.1504/IJWGS.2019.10017542","url":null,"abstract":"Service composition is one of the principles of service-oriented architecture; it enables reuse and allows developers to combine existing services in order to create new services that in turn can be part of another composition. Dynamic composition requires that service components are chosen from a set of services with equal or similar functionality at runtime and possibly automatically. The adoption of the REST services in the industry has led to a growing number of services of this type, many with similar functionality. The existing dynamic composition techniques are method-oriented whereas REST is resource-oriented and consider only traditional (WSDL/SOAP) services. We propose SAW-Q, an extension of simple additive weighting (SAW), as a novel dynamic composition technique that follows the principles of the REST style. Additionally, SAW-Q models quality attributes as a function of the actual service demand instead of the traditional constant values. Our model is much more accurate when compared to real implementation, positively improving the quality of dynamic service compositions.","PeriodicalId":54935,"journal":{"name":"International Journal of Web and Grid Services","volume":"16 1","pages":"29-58"},"PeriodicalIF":1.0,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73047874","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：