Pub Date : 2018-03-01DOI: 10.6138/JIT.2018.19.5.20160309
Meijuan Yin, Xiaonan Liu, Junyong Luo, Yan Liu, Tang Ziqi
To improve the accuracy and stability of existing methods to measure social relations in the Web, a novel model of relation measuring methods based on both a search engine and text analysis is proposed. The model measures the strength of social relations according to both the co-occurrence of two persons’ names in web pages obtained by a web search engine and the cooccurrence of two person names in sentences of the text of web pages as found by text analysis. The formalized description of the model is then presented. To evaluate the effectiveness of the proposed model, the specific implementation of the model is presented in detail. Experimental results show that compared with existing methods only based on a search engine or text analysis, the relation weights obtained by the specific methods based on the proposed model are more accurate and stable.
{"title":"Measuring Social Relations in the Web based on Search Engine and Text Analysis: a Model and Implementation","authors":"Meijuan Yin, Xiaonan Liu, Junyong Luo, Yan Liu, Tang Ziqi","doi":"10.6138/JIT.2018.19.5.20160309","DOIUrl":"https://doi.org/10.6138/JIT.2018.19.5.20160309","url":null,"abstract":"To improve the accuracy and stability of existing methods to measure social relations in the Web, a novel model of relation measuring methods based on both a search engine and text analysis is proposed. The model measures the strength of social relations according to both the co-occurrence of two persons’ names in web pages obtained by a web search engine and the cooccurrence of two person names in sentences of the text of web pages as found by text analysis. The formalized description of the model is then presented. To evaluate the effectiveness of the proposed model, the specific implementation of the model is presented in detail. Experimental results show that compared with existing methods only based on a search engine or text analysis, the relation weights obtained by the specific methods based on the proposed model are more accurate and stable.","PeriodicalId":50172,"journal":{"name":"Journal of Internet Technology","volume":"19 1","pages":"459-470"},"PeriodicalIF":1.6,"publicationDate":"2018-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"41874792","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 : 2018-03-01DOI: 10.6138/JIT.2018.19.5.20160714
Min Lei, Xiaoming Liu, Mian Wang, Yu Yang, Zhiguo Qu
The main drawback of the traditional quantization index modulation (QIM) watermarking is its extreme sensitivity to scaling attack. Due to scaling have a little effect on Discrete Cosine Transform (DCT) coefficients, this paper proposed a novel robust image watermarking algorithm based on QIM in the DCT domain. In the presented scheme, the medium and low frequency DCT coefficients of host signal are divided into two parts, then the watermark bits are embedded by quantizing ratio of l p -norm of the two parts. Experimental results confirm the superiority of the proposed algorithm against common types attacks in comparison with the recently proposed scheme.
{"title":"Robust Image Watermarking Based On Quantization Index Modulation in the DCT Domain","authors":"Min Lei, Xiaoming Liu, Mian Wang, Yu Yang, Zhiguo Qu","doi":"10.6138/JIT.2018.19.5.20160714","DOIUrl":"https://doi.org/10.6138/JIT.2018.19.5.20160714","url":null,"abstract":"The main drawback of the traditional quantization index modulation (QIM) watermarking is its extreme sensitivity to scaling attack. Due to scaling have a little effect on Discrete Cosine Transform (DCT) coefficients, this paper proposed a novel robust image watermarking algorithm based on QIM in the DCT domain. In the presented scheme, the medium and low frequency DCT coefficients of host signal are divided into two parts, then the watermark bits are embedded by quantizing ratio of l p -norm of the two parts. Experimental results confirm the superiority of the proposed algorithm against common types attacks in comparison with the recently proposed scheme.","PeriodicalId":50172,"journal":{"name":"Journal of Internet Technology","volume":"19 1","pages":"507-514"},"PeriodicalIF":1.6,"publicationDate":"2018-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49515385","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}
Bluetooth low energy technology has gradually penetrated into people’s daily life. Nowadays, a number of wearable devices which are embedded with tiny sensors and Bluetooth radio can create a Bluetooth body area networks (BANs). Because of human mobility, the signal strength of Bluetooth links might be decreased with the link distance, increasing the transmission delay and hence dropping the network throughputs. Considering the mobility issue, this paper presents a mobility-aware topology restructuring scheme, called MATR, for Bluetooth body area networks. The proposed MATR mechanism changes the piconet topology for redirecting the traffic flow to the links with better quality. In addition, the proposed mechanism is also extended to restructure the topology of a scatternet, further reducing the transmission delay of link connecting different Piconets. Performance study reveals that the proposed MATR approaches further reduce the transmission delay and the energy consumption for Bluetooth BANs, decrease the network overheads raised by packet retransmissions, and improve the network throughput of Bluetooth radio area networks.
{"title":"MATR: A Mobility-Aware Topology Restructuring Scheme for Bluetooth Body Area Networks","authors":"Qiaoyun Zhang, Guilin Chen, Chih-Yung Chang, Cheng-Chang Chen","doi":"10.6138/JIT.2018.19.4.20160515","DOIUrl":"https://doi.org/10.6138/JIT.2018.19.4.20160515","url":null,"abstract":"Bluetooth low energy technology has gradually penetrated into people’s daily life. Nowadays, a number of wearable devices which are embedded with tiny sensors and Bluetooth radio can create a Bluetooth body area networks (BANs). Because of human mobility, the signal strength of Bluetooth links might be decreased with the link distance, increasing the transmission delay and hence dropping the network throughputs. Considering the mobility issue, this paper presents a mobility-aware topology restructuring scheme, called MATR, for Bluetooth body area networks. The proposed MATR mechanism changes the piconet topology for redirecting the traffic flow to the links with better quality. In addition, the proposed mechanism is also extended to restructure the topology of a scatternet, further reducing the transmission delay of link connecting different Piconets. Performance study reveals that the proposed MATR approaches further reduce the transmission delay and the energy consumption for Bluetooth BANs, decrease the network overheads raised by packet retransmissions, and improve the network throughput of Bluetooth radio area networks.","PeriodicalId":50172,"journal":{"name":"Journal of Internet Technology","volume":"19 1","pages":"391-402"},"PeriodicalIF":1.6,"publicationDate":"2018-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48284900","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 : 2018-03-01DOI: 10.3966/160792642018031902005
Meng-Shu Chiang, Chung-Ming Huang
The fast handover scheme provides a handover preparation mechanism, which retrieves a new care-ofaddress (CoA) in advance and forwards packets to MN’s new visiting access router, to improve the handover performance over wireless network. However, if the handover preparation cannot be finished before the current link becoming unavailable, the handover latency will be increased. In this paper, we propose a backward fast handover control scheme for mobile Internet (BFHMIPv6) to resolve the aforementioned problems. In the proposed BFH-MIPv6 scheme, a new CoA is formed by the new access router (NAR) and a tunnel is established in advance when MN moves into the domain of NAR. As a result, MN can move smoothly to the new network domain to shorten the handover latency.
{"title":"A Backward Fast Handover Control Scheme for Mobile Internet (BFH-MIPv6)","authors":"Meng-Shu Chiang, Chung-Ming Huang","doi":"10.3966/160792642018031902005","DOIUrl":"https://doi.org/10.3966/160792642018031902005","url":null,"abstract":"The fast handover scheme provides a handover preparation mechanism, which retrieves a new care-ofaddress (CoA) in advance and forwards packets to MN’s new visiting access router, to improve the handover performance over wireless network. However, if the handover preparation cannot be finished before the current link becoming unavailable, the handover latency will be increased. In this paper, we propose a backward fast handover control scheme for mobile Internet (BFHMIPv6) to resolve the aforementioned problems. In the proposed BFH-MIPv6 scheme, a new CoA is formed by the new access router (NAR) and a tunnel is established in advance when MN moves into the domain of NAR. As a result, MN can move smoothly to the new network domain to shorten the handover latency.","PeriodicalId":50172,"journal":{"name":"Journal of Internet Technology","volume":"19 1","pages":"359-367"},"PeriodicalIF":1.6,"publicationDate":"2018-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47621340","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 : 2018-01-01DOI: 10.3966/160792642018011901022
Hosung Baek, Haneul Ko, Gwangwoo Park, Sangheon Pack, Jiyoung Kwak
Service function chaining (SFC) enables specific network flows to be processed through an ordered set of service functions. In this paper, we propose a two-stage failover mechanism to provide high availability (HA) in SFC. In the proposed mechanism, a secondary service function path (SFP) is pre-computed, which is maximally disjointed with the primary SFP, and a backup service function instance (SFI) is prepared for each service function. For a failure event, the first local repair stage is examined by means of the preconfigured backup SFI. If the backup SFI is not available and/or any link is failed, the second end-to-end repair stage is triggered by replacing the primary SFP with the secondary SFP. Simulation results demonstrate that the proposed failover mechanism can reduce the recovery time by 50%-75% compared to the conventional approach.
SFC (Service function chains)是指将特定的网络流通过一组有序的业务功能进行处理。为了在SFC中提供高可用性，我们提出了一种两阶段的故障转移机制，在该机制中，预先计算出与主SFP最大程度分离的辅助业务功能路径(secondary service function path, SFP)，并为每个业务功能准备一个备份业务功能实例(backup service function instance, SFI)。对于故障事件，通过预先配置的备份SFI检查第一个本地修复阶段。如果备份SFI不可用和/或任何链路失败，则通过用辅助SFP替换主SFP来触发第二个端到端修复阶段。仿真结果表明，所提出的故障转移机制比传统的故障转移机制可减少50% ~ 75%的恢复时间。
{"title":"A Two-Stage Failover Mechanism for High Availability in Service Function Chaining","authors":"Hosung Baek, Haneul Ko, Gwangwoo Park, Sangheon Pack, Jiyoung Kwak","doi":"10.3966/160792642018011901022","DOIUrl":"https://doi.org/10.3966/160792642018011901022","url":null,"abstract":"Service function chaining (SFC) enables specific network flows to be processed through an ordered set of service functions. In this paper, we propose a two-stage failover mechanism to provide high availability (HA) in SFC. In the proposed mechanism, a secondary service function path (SFP) is pre-computed, which is maximally disjointed with the primary SFP, and a backup service function instance (SFI) is prepared for each service function. For a failure event, the first local repair stage is examined by means of the preconfigured backup SFI. If the backup SFI is not available and/or any link is failed, the second end-to-end repair stage is triggered by replacing the primary SFP with the secondary SFP. Simulation results demonstrate that the proposed failover mechanism can reduce the recovery time by 50%-75% compared to the conventional approach.","PeriodicalId":50172,"journal":{"name":"Journal of Internet Technology","volume":"19 1","pages":"229-236"},"PeriodicalIF":1.6,"publicationDate":"2018-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"70039640","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 : 2018-01-01DOI: 10.6138/JIT.2018.19.3.20151209
Yu Yu, Anping Zhao
To facilitate reasoning and predicting service evolution relationships with incomplete, partial or uncertain knowledge for supporting an intelligent service application and to preserve the relationship consistency in the whole service networks during Web service evolution processes over time. An approach was presented for event-based relationships evolution detection and reasoning among web services by combining first-order logic and probabilistic graphical models in a single representation. The Web service relationship evolution model was constructed by using available probability information and knowledge based on the related event and their inherent service relationship dependencies. And S-MLN was taken as a logical framework for Web service relationships evolution reasoning with uncertainty to discover and predict evolutionary service relationship classification. The events and evolutionary measures of the research were found to be helpful for evaluating Web service evolution relationships. And it is effective to evaluate the quality of service set classification by SMLN based evolution relationships prediction. The study identifies the theoretical foundations of web service evolution discovery in the context of SLN. This study, based on an established theoretical foundation, will help the research community to gain a deeper understanding of the dynamic relationship in the semantic context of the web services network.
{"title":"Logic and Event Based Semantic Relationship Evolution in Service Semantic Link Network","authors":"Yu Yu, Anping Zhao","doi":"10.6138/JIT.2018.19.3.20151209","DOIUrl":"https://doi.org/10.6138/JIT.2018.19.3.20151209","url":null,"abstract":"To facilitate reasoning and predicting service evolution relationships with incomplete, partial or uncertain knowledge for supporting an intelligent service application and to preserve the relationship consistency in the whole service networks during Web service evolution processes over time. An approach was presented for event-based relationships evolution detection and reasoning among web services by combining first-order logic and probabilistic graphical models in a single representation. The Web service relationship evolution model was constructed by using available probability information and knowledge based on the related event and their inherent service relationship dependencies. And S-MLN was taken as a logical framework for Web service relationships evolution reasoning with uncertainty to discover and predict evolutionary service relationship classification. The events and evolutionary measures of the research were found to be helpful for evaluating Web service evolution relationships. And it is effective to evaluate the quality of service set classification by SMLN based evolution relationships prediction. The study identifies the theoretical foundations of web service evolution discovery in the context of SLN. This study, based on an established theoretical foundation, will help the research community to gain a deeper understanding of the dynamic relationship in the semantic context of the web services network.","PeriodicalId":50172,"journal":{"name":"Journal of Internet Technology","volume":"109 1","pages":"207-218"},"PeriodicalIF":1.6,"publicationDate":"2018-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"71315111","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 : 2018-01-01DOI: 10.3966/160792642018011901018
Chien-Te Lu, C. Yeh, Yung-Chung Wang, Chu-Sing Yang
The user requests of Web systems are often mutually independent, thus can be processed by processors at separate servers/sites. Irregular and/or burst workloads may occur sometimes. Hybrid Clouds could well be suitable for these kinds of Web systems. This research studies the usability and performance of hybrid Clouds for Web systems. Performance metrics measured are response time (RT), throughput and CPU utilization. Analytical results verify that hybrid Clouds can reach the performance level of private Clouds. They also indicate that both the inverse of RT reduction rate and throughput gain are smaller than the corresponding vCPU gain. The network latency of hybrid Clouds obviously affects CPU utilization and performance in some cases. Public Cloud providers offer various deployment models with different price policies. The performancecost relation of hybrid Clouds is derived from experimental data. It offers a guideline for selecting suitable deployment model for performance requirements under a cost constraint. For an arbitrary upper bound of cost, the system using the model of less computing capacities performs better than the one using the model of more computing capacities. This paper presents a novel method to adopt Cloud technology to achieve the balance of security, performance, server sprawl, and CPU utilization.
{"title":"Hybrid clouds for web systems: Usability and performance","authors":"Chien-Te Lu, C. Yeh, Yung-Chung Wang, Chu-Sing Yang","doi":"10.3966/160792642018011901018","DOIUrl":"https://doi.org/10.3966/160792642018011901018","url":null,"abstract":"The user requests of Web systems are often mutually independent, thus can be processed by processors at separate servers/sites. Irregular and/or burst workloads may occur sometimes. Hybrid Clouds could well be suitable for these kinds of Web systems. This research studies the usability and performance of hybrid Clouds for Web systems. Performance metrics measured are response time (RT), throughput and CPU utilization. Analytical results verify that hybrid Clouds can reach the performance level of private Clouds. They also indicate that both the inverse of RT reduction rate and throughput gain are smaller than the corresponding vCPU gain. The network latency of hybrid Clouds obviously affects CPU utilization and performance in some cases. Public Cloud providers offer various deployment models with different price policies. The performancecost relation of hybrid Clouds is derived from experimental data. It offers a guideline for selecting suitable deployment model for performance requirements under a cost constraint. For an arbitrary upper bound of cost, the system using the model of less computing capacities performs better than the one using the model of more computing capacities. This paper presents a novel method to adopt Cloud technology to achieve the balance of security, performance, server sprawl, and CPU utilization.","PeriodicalId":50172,"journal":{"name":"Journal of Internet Technology","volume":"19 1","pages":"187-195"},"PeriodicalIF":1.6,"publicationDate":"2018-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"70039574","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 : 2018-01-01DOI: 10.6138/JIT.2018.19.3.20151118
Cheng-Jen Tang, Miau-Ru Dai
The queueing analysis of the call center staff planning is a common process for efficient resource allocation. In many ways, although at different time scales, this process is analogous to the provisioning of the nodes in a web hosting server cluster. Based on the well proven strategies learned from the call centers, this paper proposes an energy management method that (1) models a server cluster as an M/M/m queueing system, (2) periodically switches the ACPI (Advanced Configuration and Power Interface) global states of a server node, and (3) obtains an adequate number of active nodes constrained by a desired response time. The proposed process is simulated with a real world trace log. The simulation result shows that a significant energy saving can be achieved while maintaining a desirable response time.
{"title":"A Queueing Model Based Periodical ACPI Global State Control for Web Server Cluster Energy Management","authors":"Cheng-Jen Tang, Miau-Ru Dai","doi":"10.6138/JIT.2018.19.3.20151118","DOIUrl":"https://doi.org/10.6138/JIT.2018.19.3.20151118","url":null,"abstract":"The queueing analysis of the call center staff planning is a common process for efficient resource allocation. In many ways, although at different time scales, this process is analogous to the provisioning of the nodes in a web hosting server cluster. Based on the well proven strategies learned from the call centers, this paper proposes an energy management method that (1) models a server cluster as an M/M/m queueing system, (2) periodically switches the ACPI (Advanced Configuration and Power Interface) global states of a server node, and (3) obtains an adequate number of active nodes constrained by a desired response time. The proposed process is simulated with a real world trace log. The simulation result shows that a significant energy saving can be achieved while maintaining a desirable response time.","PeriodicalId":50172,"journal":{"name":"Journal of Internet Technology","volume":"19 1","pages":"177-185"},"PeriodicalIF":1.6,"publicationDate":"2018-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"71315103","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 : 2018-01-01DOI: 10.6138/JIT.2018.19.1.20151228
Bailing Liu, Chao Lei, Yanhui Li, Liting Liang
Automated trust negotiation (ATN) is a successful approach to establishing mutual trust between strangers wishing to share resources or conduct business by gradually requesting and disclosing digitally signed credentials. An ATN strategy need to be adopted to determine a successful negotiation sequence based on the access control policies. Traditional ATN strategies provide the maximum degree of protection to the involved resources. However, there can be cases where efficiency is the most crucial need especially in light of widespread use of mobile device. It is preferable to adopt highly efficient ATN strategies, even if they do not maximize the protection of involved resources. Thus in this paper, we propose an approach to improve efficiency of traditional negotiation strategies by integrating sequence prediction, making a trade-off between negotiation efficiency and sensitive information protection. We validate the effectiveness of our approach by performing experiments on a mobile platform, taking the representative traditional negotiation strategy PRUENS as an example. Our experimental results show that our approach dramatically enhances efficiency of PRUNES.
{"title":"An Approach to Improve Efficiency of Traditional Automated Trust Negotiation Strategies","authors":"Bailing Liu, Chao Lei, Yanhui Li, Liting Liang","doi":"10.6138/JIT.2018.19.1.20151228","DOIUrl":"https://doi.org/10.6138/JIT.2018.19.1.20151228","url":null,"abstract":"Automated trust negotiation (ATN) is a successful approach to establishing mutual trust between strangers wishing to share resources or conduct business by gradually requesting and disclosing digitally signed credentials. An ATN strategy need to be adopted to determine a successful negotiation sequence based on the access control policies. Traditional ATN strategies provide the maximum degree of protection to the involved resources. However, there can be cases where efficiency is the most crucial need especially in light of widespread use of mobile device. It is preferable to adopt highly efficient ATN strategies, even if they do not maximize the protection of involved resources. Thus in this paper, we propose an approach to improve efficiency of traditional negotiation strategies by integrating sequence prediction, making a trade-off between negotiation efficiency and sensitive information protection. We validate the effectiveness of our approach by performing experiments on a mobile platform, taking the representative traditional negotiation strategy PRUENS as an example. Our experimental results show that our approach dramatically enhances efficiency of PRUNES.","PeriodicalId":50172,"journal":{"name":"Journal of Internet Technology","volume":"19 1","pages":"035-043"},"PeriodicalIF":1.6,"publicationDate":"2018-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"71315060","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 : 2018-01-01DOI: 10.6138/JIT.2018.19.1.20150930
Jianxiao Liu, Xiaoxia Li, Z. Xia
How to realize Web service organization and management quickly and accurately, and build an effective service selection mechanism to choose services with correlations to meet users' functional and non-functional requests, and thus to meet the individual and dynamic changing requirements is a key problem in the Service-Oriented Software Engineering (SOSE). The Web service and ontology information are stored into RDB (relational database) in our method, it realizes Web service aggregation and selection in term of service interface (Input and Output) and execution capability (Precondition and Effect). Firstly, the Web service clustering method based on self-join operation in RDB is proposed to cluster services efficiency. Then it uses the abstract service extraction method to get abstract services, and uses Web service aggregation approach based on join operation to organize the clustered services. Finally, the Web service selection method is proposed to select the atomic service and a set of services with correlations to meet users' functional and QoS (quality of service) requirements. In addition, the case study and experiments are used to explain and verify the effectiveness of the proposed methods.
{"title":"Web Service Aggregation and Selection Based on Join Operation in RDB","authors":"Jianxiao Liu, Xiaoxia Li, Z. Xia","doi":"10.6138/JIT.2018.19.1.20150930","DOIUrl":"https://doi.org/10.6138/JIT.2018.19.1.20150930","url":null,"abstract":"How to realize Web service organization and management quickly and accurately, and build an effective service selection mechanism to choose services with correlations to meet users' functional and non-functional requests, and thus to meet the individual and dynamic changing requirements is a key problem in the Service-Oriented Software Engineering (SOSE). The Web service and ontology information are stored into RDB (relational database) in our method, it realizes Web service aggregation and selection in term of service interface (Input and Output) and execution capability (Precondition and Effect). Firstly, the Web service clustering method based on self-join operation in RDB is proposed to cluster services efficiency. Then it uses the abstract service extraction method to get abstract services, and uses Web service aggregation approach based on join operation to organize the clustered services. Finally, the Web service selection method is proposed to select the atomic service and a set of services with correlations to meet users' functional and QoS (quality of service) requirements. In addition, the case study and experiments are used to explain and verify the effectiveness of the proposed methods.","PeriodicalId":50172,"journal":{"name":"Journal of Internet Technology","volume":"99 1","pages":"1-17"},"PeriodicalIF":1.6,"publicationDate":"2018-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"71315047","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
扫码关注我们
求助内容：
应助结果提醒方式：