2013 IEEE International Conference on Services Computing最新文献_第8页

Web Services QoS Measure Based on Subjective and Objective Weight 基于主客观权重的Web服务QoS度量

2013 IEEE International Conference on Services Computing Pub Date : 2013-06-28 DOI: 10.1109/SCC.2013.10

You Ma, Shangguang Wang, Qibo Sun, Hua Zou, Fangchun Yang

引用次数: 6

Integrating RESTful Service into BPEL Business Process on Service Generation System 在服务生成系统上将RESTful服务集成到BPEL业务流程中

2013 IEEE International Conference on Services Computing Pub Date : 2013-06-28 DOI: 10.1109/SCC.2013.70

Budan Wu, Rongheng Lin, Junliang Chen

引用次数: 7

Sharing with a Difference: Realizing Service-Based SaaS Applications with Runtime Sharing and Variation in Dynamic Software Product Lines 差异共享:在动态软件产品线中实现基于服务的SaaS应用程序的运行时共享和变化

2013 IEEE International Conference on Services Computing Pub Date : 2013-06-28 DOI: 10.1109/SCC.2013.30

I. Kumara, Jun Han, A. Colman, Tuan-Anh Nguyen, Malinda Kapuruge

{"title":"Sharing with a Difference: Realizing Service-Based SaaS Applications with Runtime Sharing and Variation in Dynamic Software Product Lines","authors":"I. Kumara, Jun Han, A. Colman, Tuan-Anh Nguyen, Malinda Kapuruge","doi":"10.1109/SCC.2013.30","DOIUrl":"https://doi.org/10.1109/SCC.2013.30","url":null,"abstract":"A single-instance multi-tenant (SIMT) SaaS application enables a SaaS provider to achieve economies of scale through runtime sharing. However, runtime sharing can make tenant-specific variations difficult to achieve in such an application. In this paper, we propose an approach to realizing SIMT SaaS applications, which is based on Dynamic Software Product Lines (DSPL) and supports runtime sharing and variation. With the collaboration among a subset of services as the unit of composition, the commonality among the tenants' requirements is realized in the DSPL architecture by sharing collaboration units, and their variability is realized by composing different collaboration units, all at runtime. In addition, we adopt a feature-based high-level representation of the commonality and variability between the tenants' requirements to facilitate the runtime creation and reconfiguration of their application variants. We compare our approach with two alternative approaches in terms of development effort and degree of sharing. We further quantify the runtime overhead incurred by our multi-tenancy support.","PeriodicalId":370898,"journal":{"name":"2013 IEEE International Conference on Services Computing","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125645012","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 29

Crowd-Enabled Technical Writing Services 大众技术写作服务

2013 IEEE International Conference on Services Computing Pub Date : 2013-06-28 DOI: 10.1109/SCC.2013.84

M. Vukovic, V. Salapura, Sriram Rajagopal

{"title":"Crowd-Enabled Technical Writing Services","authors":"M. Vukovic, V. Salapura, Sriram Rajagopal","doi":"10.1109/SCC.2013.84","DOIUrl":"https://doi.org/10.1109/SCC.2013.84","url":null,"abstract":"Availability of high quality technical documentation is a critical enabler for users to fully take advantage of service capabilities, such as Cloud-based offerings where clients interact with the service via a portal and have no direct access to a service support. Technical writers are relying on the input from subject matter experts (SMEs) to create usable portal content. This disrupts service operation and reduces the productivity of the entire service offering team. While technical documentation may include contributions from a large distributed team, it often results in disconnected content with different writing styles. In this paper, we describe Scribe Crowd, a service for managing the process of composition of technical documents. Based on the principles of crowdsourcing, where a task may be outsources to many qualified agents, Scribe Crowd manages the distributed process of documentation and assigns incomplete pieces of write-up to appropriate experts. We present how Scribe Crowd has been used to engage over 120 business consultants to efficiently create content for 450 documents as part of an enterprise learning portal that serves information about banking, insurance and financial markets.","PeriodicalId":370898,"journal":{"name":"2013 IEEE International Conference on Services Computing","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134442164","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 7

An Efficient Algorithm for Strategy-Proof Service Composition 一种有效的抗策略服务组合算法

2013 IEEE International Conference on Services Computing Pub Date : 2013-06-28 DOI: 10.1109/SCC.2013.100

Masahiro Tanaka, Yohei Murakami

{"title":"An Efficient Algorithm for Strategy-Proof Service Composition","authors":"Masahiro Tanaka, Yohei Murakami","doi":"10.1109/SCC.2013.100","DOIUrl":"https://doi.org/10.1109/SCC.2013.100","url":null,"abstract":"One of the most typical models of service market is a reverse auction, where service providers offer their services at a certain price and a user selects a combination of the services. In the first price auction, however, a service which is cheaper and has better quality is not necessarily selected. This causes unstable outcomes which are undesirable both for a user and service providers. A possible solution to this is the VCG (Vickrey-Clarke-Groves) mechanism, where the dominant strategy for a service provider is to report true cost of his service. In spite of this desirable property, implementing the VCG mechanism for service composition suffers from its computational cost. Calculation of payments to service providers based on the VCG mechanism requires iterative service selection, although each service selection can be NP- hard. Approximation algorithms cannot be applied because approximate solutions do not assure the desirable property of the VCG mechanism. Thus, we propose a dynamic programming (DP) based algorithm for service selection and VCG payment calculation. The proposed algorithm solves service selection in quasi-polynomial time and gives an exact solution. Moreover, we extend the algorithm to reuse matrix which is built during DP. This largely improves the performance of VCG payment calculation. Our experiment shows that the proposed algorithm can solve practical scale service composition.","PeriodicalId":370898,"journal":{"name":"2013 IEEE International Conference on Services Computing","volume":"285 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132367110","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 4

Robust Client/Server Shared State Interactions of Collaborative Process with System Crash and Network Failures 具有系统崩溃和网络故障的协作过程的健壮客户机/服务器共享状态交互

2013 IEEE International Conference on Services Computing Pub Date : 2013-06-28 DOI: 10.1109/SCC.2013.39

Lei Wang, A. Wombacher, L. F. Pires, M. V. Sinderen, Chihung Chi

引用次数: 10

SOA Design Patterns -- Can They Improve the Process of Model Driven Development? SOA设计模式——它们能改进模型驱动开发的过程吗?

2013 IEEE International Conference on Services Computing Pub Date : 2013-06-28 DOI: 10.1109/SCC.2013.117

Roman Selmeci, Viera Rozinajová

引用次数: 0

Spectral Graph Approach for Process Model Matchmaking 过程模型匹配的谱图方法

2013 IEEE International Conference on Services Computing Pub Date : 2013-06-28 DOI: 10.1109/SCC.2013.27

Y. Belhoul, Mohammed Haddad, A. Gater, Daniela Grigori, H. Kheddouci, M. Bouzeghoub

引用次数: 5

Toward a Flexible Bidding Strategy with Preference Analysis 基于偏好分析的柔性竞价策略研究

2013 IEEE International Conference on Services Computing Pub Date : 2013-06-28 DOI: 10.1109/SCC.2013.20

N. Zhou, Wesley M. Gifford, K. Ratakonda

{"title":"Toward a Flexible Bidding Strategy with Preference Analysis","authors":"N. Zhou, Wesley M. Gifford, K. Ratakonda","doi":"10.1109/SCC.2013.20","DOIUrl":"https://doi.org/10.1109/SCC.2013.20","url":null,"abstract":"Today, the majority of solution development is completed under a fixed-price contract. Due to the inherent uncertainty of executing a project with many unpredictable factors, the solution developer bears significant risk in terms of cost, delivery time and quality. Compared to a variable-price (time-and-materials) contract, a fixed-price contract shifts most of the development risk from clients to developers. Therefore, it is important for developers to understand the level of risk inherent in a project and take the proper steps to mitigate risks. From the analysis of custom application development projects using service-oriented architecture methods, we observe that extension of the project duration utilizing a smaller development team can help to reduce the project effort (working hours) and therefore reduce the development cost. We characterize the relationship between deterioration in team performance and the increase in project team size through multivariate regression. We also provide a method to adjust the results of standard project estimation methods to take into account client-side risks. We then propose simple client and developer utility functions to quantify these trade-offs. This serves as an initial framework to identify choices that can be made during the bidding process to reduce development risks.","PeriodicalId":370898,"journal":{"name":"2013 IEEE International Conference on Services Computing","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131191774","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 1

Data Decomposition Based Partial Replication Model for Software Services 基于数据分解的软件服务部分复制模型

2013 IEEE International Conference on Services Computing Pub Date : 2013-06-28 DOI: 10.1109/SCC.2013.83

Shuo Chen, Chi-Hung Chi, Chen Ding, R. Wong

{"title":"Data Decomposition Based Partial Replication Model for Software Services","authors":"Shuo Chen, Chi-Hung Chi, Chen Ding, R. Wong","doi":"10.1109/SCC.2013.83","DOIUrl":"https://doi.org/10.1109/SCC.2013.83","url":null,"abstract":"Nowadays many software services are hosted in the Cloud. When there are more requests on these services, there are also more queries sent to the underlying database. In order to keep up with the increasing workload, it is necessary to have multiple servers hosting the data. Some cloud providers offer the full data replication solution. However, this solution only works when the load mainly consists of the read requests, and when the number of write requests increases, it does not scale well. Although data decomposition has been widely used in data-intensive web sites, not much study has been done on how to decompose the underlying data of software services for the purpose of data replication. In this paper, we propose a data-decomposition-based partial replication model for software services. We devise an automatic algorithm for data decomposition under the constraint of the capacity limit of the host machines. We evaluate our approach from two aspects: scalability and performance, using two benchmarks: RUBiS and TPC-W. In the experiment, we test the algorithm using different workload inputs, and also compare our approach with the full data replication approach.","PeriodicalId":370898,"journal":{"name":"2013 IEEE International Conference on Services Computing","volume":"2016 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128036132","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 1