· Services Transactions on Services Computing (STSC) (Print) ISSN 2330-4464 (Online) ISSN 2330-4472, New York, USA
 

Services Transactions on Services Computing (STSC)

Journal Contents


=== 2018===
Volume 6, No 1 (January - March, 2018)

=== 2017===
Volume 5, No 4 (October - December, 2017)
Volume 5, No 3 (July - September, 2017)
Volume 5, No 2 (April - June, 2017)
Volume 5, No 1 (January - March, 2017)


=== 2016===
Volume 4, No 4 (October-December, 2016)
Volume 4, No 3 (July-September, 2016)
Volume 4, No 2 (April - June, 2016)
Volume 4, No 1 (January - March, 2016)


=== 2015===
Volume 3, No 4 (October-December, 2015)
Volume 3, No 3 (July-September, 2015)
Volume 3, No 2 (April - June, 2015)
Volume 3, No 1 (January - March, 2015)


=== 2014 ===
Volume 2,No 4 (October-December 2014)
Volume 2,No 3 (July-September,2014)
Volume 2, No 2 (April - June, 2014)
Volume 2, No 1 (January - March, 2014)

=== 2013 ===
Volume 1, No 1 (October - December, 2013)

== 2017 ===

    Volume 5, No 1.(January - March, 2017): [ Full Issue PDF]

  • A PRIORI PREDICTION OF PHISHING VICTIMIZATION BASED ON STRUCTURAL CONTENT FACTORS

  • Should be cited as: [ paper pdf download]

    Matthew L. Hale, Charles Walter, Jessica Lin, and Rose F. Gamble "A PRIORI PREDICTION OF PHISHING VICTIMIZATION BASED ON STRUCTURAL CONTENT FACTORS", International Journal of Services Computing (IJSC), 5(1), 2017, pp. 1-13. DOI: 10.29268/stsc.2017.5.1.1

    Abstract:

    Sending malicious content to users for obtaining personnel, financial, or intellectual property has become a multi-billion dollar criminal enterprise. Malicious content comes in multiple forms including emails, social media posts, and phishing websites. User training initiatives seek to minimize the impact of malicious content through improved vigilance. Training works best when tailored to specific user deficiencies. However, tailoring training requires understanding how malicious content victimizes users. This paper creates a predictive method that analyzes structural content design factors on malicious phishing content to derive a metric that can predict the likelihood of users being victimized, i.e. getting phished. The design factors examined are developed from an analysis of over 300 pieces of content from email, social media and websites. In addition to predicting how likely a user is to be phished, our method pinpoints specific deficiencies to enable targeted user training. To evaluate the efficacy of our method, its predictive power, and its usefulness for identifying deficiencies, we conducted two experiments involving a combined 80 subjects and over 5000 individual trust decisions in a game-based simulation platform. The results from these experiments, their analysis, and the implications of the findings are presented as part of the evaluation.

== 2016 ===

    Volume 4, No 4.(October-December, 2016): [ Full Issue PDF]

  • PREDICTING SERVICE PRICE FOR GAME-THEORETIC QOS-AWARE SERVICE SELECTION

  • Should be cited as: [ paper pdf download]

    Puwei Wang, Anup K. Kalia, Munindar P. Singh "PREDICTING SERVICE PRICE FOR GAME-THEORETIC QOS-AWARE SERVICE SELECTION", International Journal of Services Computing (IJSC), 4(3), 2016, pp. 1-17. DOI: 10.29268/stsc.2016.4.4.1

    Abstract:

    In QoS-aware service selection, a service requester seeks to maximize his utility by selecting service providers that charges the lowest service prices while meeting the requester's global QoS requirements. In existing selection approaches, a service requester focuses on finding providers based on their QoS and thereby ignores their service prices that could change with their QoS. High QoS may provide more benefits, but may require a high service price. As a result, the highest QoS may not produce the maximum utility. A service requester and service providers have a conflicting interest over service prices. We model the process of QoS-aware service selection as a price competition game. In the case where the providers' minimum prices are public knowledge, we propose an approach to compute a ε-Nash equilibrium that maximizes the service requester's utility. However, in general, a service provider would not reveal its minimum acceptable price. Thus, it is important for a service requester to predict the minimum price for a service that meets its QoS requirements. We propose a collaborative approach to predicting a provider's minimum price for a desired QoS based on prior usage experiences. Based on the prediction results of the service providers' minimum prices, we propose a multi-round mechanism where the service requester chooses a service for each task by using a Vickrey auction with reserve price. The experimental results show our approach can find the optimal service providers efficiently and effectively.

  • SUPPORT SYSTEMS FOR HEALTH MONITORING USING INTERNET-OF-THINGS DRIVEN DATA ACQUISITION

  • Should be cited as: [ paper pdf download]

    Alex Page, Shurouq Hijazi, Dogan Askan, Burak Kantarci, Tolga Soyata "SUPPORT SYSTEMS FOR HEALTH MONITORING USING INTERNET-OF-THINGS DRIVEN DATA ACQUISITION ", International Journal of Services Computing (IJSC), 4(4), 2016, pp. 18-34. DOI: 10.29268/stsc.2016.4.4.2

    Abstract:

    The Digital Health (D-Health) era is expected to be the “next big thing” since the invention of the internet, characterized by inexpensive and widespread medical data acquisition devices, widespread availability of identity-removed health data, and analytics algorithms that provide remote health monitoring feedback to doctors in realtime. Recent years have brought incremental developments in three key technological areas towards the realization of the D-Health era: data acquisition, secure data transmission/storage, and data analytics. i) For data acquisition, the emerging Internet-of-Things (IoT) devices are becoming a viable technology to enable the acquisition of remote health monitoring data. ii) For data storage, emerging system-level and cryptographic mechanisms provide secure and privacy-preserving transmission, storage, and sharing of the acquired data. iii) For data analytics, emerging decision support algorithms provide a mechanism for healthcare professionals to base their clinical diagnoses partially on machine-suggested statistical inferences that rely on a wide corpus of accumulated data. The D-Health era will create new business opportunities in all of these areas. In this paper, we propose a generalized structure for a D-Health system that is capable of remote health monitoring and decision support. We formulate our proposed structure around potential business opportunities and conduct technical feasibility studies.

  • COST MANAGEMENT OF SERVICE COMPOSITIONS

  • Should be cited as: [ paper pdf download]

    Robson W. A. de Medeiros, Nelson S. Rosa, Luís Ferreira Pires "COST MANAGEMENT OF SERVICE COMPOSITIONS", International Journal of Services Computing (IJSC), 4(4), 2016, pp. 35-50. DOI: 10.29268/stsc.2016.4.4.3

    Abstract:

    Nowadays, several organisations provide services on the Internet with similar functionality but different price and pricing schemes. Since these services are used in service compositions, the providers of composed services have to face the challenge of managing the services they use, in order to decrease the cost of the service compositions without compromising their quality. Several techniques to compute the cost of service compositions are currently available, but none of them take into account all classes of cost behaviour. This paper proposes an approach to service composition that consists of algorithms and an architecture to support the cost management of service compositions by considering several classes of cost behaviour. We developed a prototype in order to evaluate our approach with experiments that show that it properly supports cost management of service compositions throughout the service composition life-cycle. Our approach is quite promising as it is expected to dramatically improve the cost management of service compositions.

  • MODELING AND MEASURING SERVICES TO SUPPORT BUSINESS PROCESS EXECUTION: FROM SOAML AND QOS MODELS TO WEB SERVICES

  • Should be cited as: [ paper pdf download]

    Andrea Delgado "MODELING AND MEASURING SERVICES TO SUPPORT BUSINESS PROCESS EXECUTION: FROM SOAML AND QOS MODELS TO WEB SERVICES", International Journal of Services Computing (IJSC), 4(4), 2016, pp. 51-65. DOI: 10.29268/stsc.2016.4.4.4

    Abstract:

    When Service Oriented applications and services are modeled, the term Quality of Service (QoS) is used to refer to the collection of constraints and quality requirements for a service. It is important that QoS attributes are specified in early stages of the development process, and modeled in a way that can be recognized and understood by all stakeholders. Regarding Service Oriented Architecture (SOA) modeling, QoS usually includes security, performance and availability. There are many options to realize business processes with services, such as collaborations with partners, internal services, third parties services (SaaS) among others. In previous works we have proposed the automatic generation of services specified in the Service Architecture Modeling Language (SoaML) from business processes, and the associated code. As SoaML allows to model functional requirements only, we have extended our proposal to also take into account QoS modeling and generation from SoaML service models, enriching the specification of services with quality characteristics. We have also added a log facility to the generated WS client to register times regarding services execution, in order to evaluate the defined QoS.

    Volume 4, No 3.July-September, 2016): [ Full Issue PDF]

  • INTELLIGENT SOFTWARE-DEFINED STORAGE WITH DEEP TRAFFIC MODELING FOR CLOUD STORAGE SERVICE

  • Should be cited as: [ paper pdf download]

    Ming-Jen Huang, Chun-Fang Huang, Wen-Shyen Eric Chen "INTELLIGENT SOFTWARE-DEFINED STORAGE WITH DEEP TRAFFIC MODELING FOR CLOUD STORAGE SERVICE", International Journal of Services Computing (IJSC), 4(3), 2016, pp. 1-14. DOI: 10.29268/stsc.2016.4.3.1

    Abstract:

    The advent of cloud computing, big data, and mobile computing has created a fast-growing demand for storage. Cloud service providers are looking for cost-effective storage solutions as an alternative to traditional, high-cost, embedded-systems-based storage to meet the needs of newly emerging applications, such as messaging, video streaming, data analytics, etc. In particular, they are facing the challenge of lowering costs while still accommodating multi-workloads on a single instance of storage without compromising workload performance requirements. Software-defined storage (SDS) is a new generation of storage system. Unlike traditional embedded-systems-based storage, the SDS uses a software-stack above commodity hardware to provide more valuable and cost-effective features. To meet the challenges cloud service providers are facing, this paper introduces the architecture of a new SDS platform called Federator. It also argues that the architecture of an SDS platform should have three main characteristics: 1. separation of the control and data pathways, 2. self-configuration of storage resources, and 3. RESTful APIs for new business extension. This paper specifically introduces the storage I/O traffic modeling supported by Federator. With this capability, storage performance metrics are generated by using Long-Short Term Memory (LSTM). This prediction capability is important to a self-configurable SDS to meet performance requirements.

  • AN EFFICIENT SIMILARITY-BASED MODEL FOR WEB SERVICE RECOMMENDATION

  • Should be cited as: [ paper pdf download]

    Abdullah Abdullah, Xining Li "AN EFFICIENT SIMILARITY-BASED MODEL FOR WEB SERVICE RECOMMENDATION", International Journal of Services Computing (IJSC), 4(3), 2016, pp. 15-28. DOI: 10.29268/stsc.2016.4.3.2

    Abstract:

    With the emergence of Cloud and Mobile Computing paradigms which adopt web services (WS) as a means of management, companies worldwide are actively deploying web services within their business environments. Consequently, designing effective Web service recommendation mechanisms is receiving more research attention. Traditional Neighborhood-based Collaborative Filtering (CF) models fail to capture the actual relationships between users and services due to data sparsity. In contrast, Random Walk (RW) algorithm, which is categorized as a sparsity-tolerant recommendation approach, suffers from poor recommendation accuracy. In this paper, we first propose an Integrated-Model QoS-based Graph (IMQG), in which users and services represent nodes while weighted Quality of Service (QoS) magnitudes and User/Service similarity measurements serve as edges. Variants of Jaccard coefficient are used to separately compute these similarities. Then, Top-k Random Walk algorithm is applied to generate a final recommendation list. Further, we reduce the model by selecting only a subset of users to better guide RW algorithm. Comprehensive experiments are conducted on a real-world dataset where analysis of results shows high improvement in recommendation accuracy with more tolerance to data sparsity. Utilizing the improved model, a considerable reduction in computation time is achieved while maintaining the recommendation accuracy.

  • CORRECTNESS CONTROL OF PRIVACY-PRESERVING DECENTRALIZED CONSTRAINED WEB SERVICE COMPOSITIONS THROUGH AUDITING

  • Should be cited as: [ paper pdf download]

    Leila Bahri, Barbara Carminati, Elena Ferrari, Ngoc Hong Tran "CORRECTNESS CONTROL OF PRIVACY-PRESERVING DECENTRALIZED CONSTRAINED WEB SERVICE COMPOSITIONS THROUGH AUDITING ", International Journal of Services Computing (IJSC), 4(3), 2016, pp. 29-44. DOI: 10.29268/stsc.2016.4.3.3

    Abstract:

    Deploying web service (WS) compositions following a choreography has been attracting considerable interest as it brings the advantages of decentralization in terms of performance and privacy preservation. However, in the absence of a central entity, the choreography model suffers from lack of control regarding the selection of appropriate WSes. This is further aggravated in the case of constrained compositions, where service selection is bounded by a set of requirements imposed either by the user requesting the composite service or by the WSes involved in the composition. In this scenario, it is essential to provide assurance that all selected services satisfied the posed constraints. This requirement might constitute a serious limitation to the acceptance of the choreography model, compared to the central orchestration driven one, as entities might collude to select each other even if they are not enough qualified for the task. To save the benefits of the choreography model all while ensuring control against collusion, we suggest an audit-based correctness control combined with a reputation system. Our approach detects anomalous behaviors, it deters entities from collusion with a punish-based reputation system, and it ensures the audit in a privacy preserving manner without subverting the performance of the choreography approach.

  • HANDLING UNCERTAINTY DURING SERVICES RANKING

  • Should be cited as: [ paper pdf download]

    George Kakarontzas,Vassilis C. Gerogiannis "HANDLING UNCERTAINTY DURING SERVICES RANKING ", International Journal of Services Computing (IJSC), 4(3), 2016, pp. 45-57. DOI: 10.29268/stsc.2016.4.3.4

    Abstract:

    Many researchers have suggested fuzzy-based methods to derive rankings of services based on the fuzzy degree that each service satisfies a set of weighted quality attributes. Most of these methods assume a closed set of candidate services completely assessed. However, the candidate service set may include services which have not been fully assessed yet with respect to all quality attributes. Unassessed candidates introduce hesitation regarding the ranking of already evaluated services. In addition, even after services have been completely assessed, users may challenge the alleged assessments by disagreeing with them. Furthermore, users may suggest their preferences for quality attributes of services without providing numbers or ranges of numbers, but rather by providing characterizations of the relative importance of each attribute for their specific purposes. This paper suggests Intuitionistic Fuzzy Sets (IFSs) to handle these sources of uncertainty during services’ ranking based on their Quality of Service (QoS) attributes. IFS score functions are used to rank services with regard to each quality attribute. The final ranking can be derived by applying an objective method based on entropy weights for the quality attributes. In addition, users’ subjective selection of services based on preferences for the relative importance of quality properties is also discussed.

    Volume 4, No 2.(April - June, 2016): [ Full Issue PDF]

  • MUTI-OBJECTIVE SERVICE COMPOSITION IN UBQUTIOUS ENVIRONMENTS WITH SERVICE DEPENDENCIES

  • Should be cited as: [ paper pdf download]

    Nebil Ben Mabrouk, Nikolaos Georgantas,Valérie Issarny " MUTI-OBJECTIVE SERVICE COMPOSITION IN UBQUTIOUS ENVIRONMENTS WITH SERVICE DEPENDENCIES", International Journal of Services Computing (IJSC), 4(2), 2016, pp. 1-15. DOI: 10.29268/stsc.2016.4.2.1

    Abstract:

    Service composition is a widely used method in ubiquitous computing that enables accomplishing complex tasks required by users based on elementary (hardware and software) services available in ubiquitous environments. To ensure that users experience the best Quality of Service (QoS) with respect to their quality needs, service composition has to be QoS-aware. Establishing QoS-aware service compositions entails efficient service selection taking into account the QoS requirements of users. A challenging issue towards this purpose is to consider service selection under global QoS requirements (i.e., requirements imposed by the user on the whole task), which is of high computational cost. This challenge is even more relevant when we consider the dynamics, limited computational resources and timeliness constraints of ubiquitous environments. To cope with the above challenge, we present QASSA, an efficient service selection algorithm that provides the appropriate ground for QoS-aware service composition in ubiquitous environments. QASSA formulates service selection under global QoS requirements as a set-based optimisation problem, and solves this problem by combining local and global selection techniques. In particular, it introduces a novel way of using clustering techniques to enable fine-grained management of trade-offs between QoS objectives. QASSA further considers: (i) dependencies between services, (ii) adaptation at run-time, and (iii) both centralised and distributed design fashions. Results of experimental studies performed using real QoS data are presented to illustrate the timeliness and optimality of QASSA.

  • PERFORMANCE EVALUATION OF SERVICE-ORIENTED APPLICATIONS USING NHPP MODEL AND PETRI NETS

  • Should be cited as: [ paper pdf download]

    Jiajun Xu, Shuzhen Yao "PERFORMANCE EVALUATION OF SERVICE-ORIENTED APPLICATIONS USING NHPP MODEL AND PETRI NETS", International Journal of Services Computing (IJSC), 4(2), 2016, pp. 16-31. DOI: 10.29268/stsc.2016.4.2.2

    Abstract:

    Performance evaluation of a service-oriented application is a critical problem. Markov chain becomes a popular model for performance evaluation. Unfortunately, Markov chains suffer from state-space explosion. Stochastic Petri Nets superior to conventional Markov chain have recently emerged as a promising approach. Methods based on Stochastic Petri Nets currently available face the problem of estimating the unknown failure rate and normally assume that the failure times follow exponential distribution, which could not simulate the cases of other distributions. Therefore, the technique of estimating the failure data and the other probability distribution functions should be considered. This paper applies Non-Homogeneous Poisson Process (NHPP) model to estimate the failure data; a Non-Markovian Stochastic Time Petri Net (NMSTPN) is defined and an algorithm of constructing the reachability tree is presented. Then, a procedure of computing the probabilities of the sequences of failures in which the firing rates are non-Markovian with (but not limited to) exponential is presented. The whole approach is validated through an example. As an extension of the conventional methods, the resulting framework can act as a useful systematic approach in performance evaluation of complex applications. This approach is helpful to managers in analyzing the overall quality of the service-oriented application.

  • COMPOSING CONTEXT-AWARE DISTRIBUTED SYSTEMS USING QOS AND TRUST PRINCIPLES

  • Should be cited as: [ paper pdf download]

    Dimuthu U. Gamage, Lahiru S. Gallage, Rajeev R. Raje "COMPOSING CONTEXT-AWARE DISTRIBUTED SYSTEMS USING QOS AND TRUST PRINCIPLES ", International Journal of Services Computing (IJSC), 4(2), 2016, pp. 32-48. DOI: 10.29268/stsc.2016.4.2.3

    Abstract:

    The emergence of ubiquitous computing and the wide adoption of smart phones over the past few years require many Web Services to function in a context-aware manner. In such services, not only the functional attributes, but also the QoS attributes (e.g., response time) and the trust (i.e., the degree of compliance of a service to its specification) depend on the context of the services. Hence, when designing systems composed out of such services, it is important to consider the entire system execution context in addition to its functional and non-functional requirements. Achieving this goal requires the consideration of the context to trust-QoS dependencies, and interaction patterns between individual services. In this work, we tackle this challenge by first proposing a model that uses the context-QoS dependency information of individual services and inter-service interaction patterns to make predictions about the QoS and trust of compositions at the design phase. Then we apply the prediction model to select the optimum set of service to create the composed system. Our approach allows for better design and implementation decisions about composed systems in the early phases of the software lifecycle thereby reducing cost, time, and effort. The preliminary results show that the proposed model provides more accurate predictions and results in optimum composed systems than the prevalent approaches.

  • THERE CAN BE COMPOSITE SERVICES WHEN YOU BELIEVE

  • Should be cited as: [ paper pdf download]

    Yu Lei "THERE CAN BE COMPOSITE SERVICES WHEN YOU BELIEVE", International Journal of Services Computing (IJSC), 4(2), 2016, pp. 49-58. DOI: 10.29268/stsc.2016.4.2.4

    Abstract:

    Web services on the internet are distributed, heterogeneous, autonomous and dynamic, which leads to uncertainty of web services. These uncertain factors affect success rate of service composition. The web service composition problem should be considered as an uncertain planning problem. Therefore, we use an uncertainty planning method to deal with the uncertain planning problem for service composition. Without knowing complete information, our method uses an estimated value function to obtain a composite service. We give details and examples that how to compose services by our method. In addition, we shows relations among user requirements, service invocations and Quality of services. The experiments verify the validity of the algorithm.

    Volume 4, No 1.(January - March, 2016): [ Full Issue PDF]

  • A DISTRIBUTED SENSOR DATA SEARCH PLATFORM FOR INTERNET OF THINGS ENVIRONMENTS

  • Should be cited as: [ paper pdf download]

    Luiz H. Nunes, Júlio C. Estrella, Luis H. V. Nakamura, Rafael M. de O. Libardi1, Carlos H. G. Ferreira1, Liuri L. R. Jorge1, Charith Perera, Stephan Reiff-Marganiec "A DISTRIBUTED SENSOR DATA SEARCH PLATFORM FOR INTERNET OF THINGS ENVIRONMENTS", International Journal of Services Computing (IJSC), 4(1), 2016, pp. 1-12. DOI: 10.29268/stsc.2016.4.1.1

    Abstract:

    Recently, the number of devices has grown increasingly and it is hoped that, between 2015 and 2016, 20 billion devices will be connected to the Internet and this market will move around 91.5 billion dollars. The Internet of Things (IoT) is composed of small sensors and actuators embedded in objects with Internet access and will play a key role in solving many challenges faced in today's society. However, the real capacity of IoT concepts is constrained as the current sensor networks usually do not exchange information with other sources. In this paper, we propose the Visual Search for Internet of Things (ViSIoT) platform to help technical and non-technical users to discover and use sensors as a service for different application purposes. As a proof of concept, a real case study is used to generate weather condition reports to support rheumatism patients. This case study was executed in a working prototype and a performance evaluation is presented.

  • PERSONALIZED QOS PREDICTION USING TIME SERIES FORECASTING AND COLLABORATIVE FILTERING

  • Should be cited as: [ paper pdf download]

    Yan Hu, Qimin Peng, Xiaohui Hu, Rong Yang "PERSONALIZED QOS PREDICTION USING TIME SERIES FORECASTING AND COLLABORATIVE FILTERING", International Journal of Services Computing (IJSC), 4(1), 2016, pp. 13-26. DOI: 10.29268/stsc.2016.4.1.2

    Abstract:

    Quality of Service (QoS) has been widely used for web service recommendation and selection. Since QoS information usually cannot be predetermined, how to make personalized QoS prediction precisely becomes a big challenge. Time series forecasting and Collaborative Filtering (CF) are two mainstream technologies for QoS prediction. However, existing time series forecasting approaches based on AutoRegressive Integrated Moving Average (ARIMA) models do not take new observations as a feedback to revise QoS forecasts. Moreover, they only focus on forecasting QoS values for each individual web service. Service users’ personalized factors are not considered. CF facilitates personalized QoS evaluation, but rarely models the temporal dynamics of QoS values. To address the limitations of existing approaches, this paper proposes a novel personalized QoS prediction approach considering both the temporal dynamics of QoS attributes and the personalized factors of service users. Our approach seamlessly combines CF with an improved time series forecasting method, which uses Kalman filtering to compensate for defects of ARIMA models. Additionally, we design a prototype system for QoS dissemination over the Internet, thus providing a necessary infrastructure for the implementation of personalized QoS prediction. Finally, we conduct experiments to study the effectiveness of our approach. Experimental results show our approach can improve QoS prediction accuracy significantly.

  • WEB SERVICES OPTIMAL COMPOSITION BASED ON IMPROVED ARTIFICIAL BEE COLONY ALGORITHM WITH THE KNOWLEDGE OF SERVICE DOMAIN FEATURES

  • Should be cited as: [ paper pdf download]

    ZhiZhong LIU, HaiFang WANG, XiaoFei XU, ZhongJie WANG "WEB SERVICES OPTIMAL COMPOSITION BASED ON IMPROVED ARTIFICIAL BEE COLONY ALGORITHM WITH THE KNOWLEDGE OF SERVICE DOMAIN FEATURES", International Journal of Services Computing (IJSC), 4(1), 2016, pp. 27-38. DOI: 10.29268/stsc.2016.4.1.3

    Abstract:

    Web service composition is a key technology for creating value-added services by integrating available services. With the rapid development of Service Computing, Cloud Computing, Big Data and Internet of Things, a fast increasing number of services with similar functionalities but different Quality of Service (QoS) are available on the Internet, and make Web service optimal composition a NP-hard problem. Meanwhile, over the last decade’s development and evolution of the service industries, service domain features (such as priori and similarity of services) are gradually formed. These features have valuable domain knowledge for improving Web service optimal composition. However, existing research works on Web service composition don’t make full use of the service domain features, and leading to unfavorable results. Therefore, how to improve the efficiency and effectiveness of Web service optimal composition with the knowledge of service domain features becomes a significant challenge. To attack this issue, this paper firstly analyzes the influences of service domain features on Web service optimal composition; then, improves key optimization strategies of ABC with the knowledge of service domain features; finally, proposes the Web service optimal composition method based on improved artificial bee colony algorithm (S-ABCSC). The performance of S-ABCSC is verified through simulation experiment; Moreover, the underlying dependencies between service domain features and S-ABCSC’s optimality are analyzed and S-ABCSC’s parameter settings are determined through several experiments with different service usage data sets.

  • A DESIGN PATTERN FOR RECOVERING FROM TCP CONNECTION CRASHES IN HTTP APPLICATIONS

  • Should be cited as: [ paper pdf download]

    Naghmeh Ivaki, Nuno Laranjeiro, Filipe Araujo "A DESIGN PATTERN FOR RECOVERING FROM TCP CONNECTION CRASHES IN HTTP APPLICATIONS", International Journal of Services Computing (IJSC), 4(1), 2016, pp. 39-54. DOI: 10.29268/stsc.2016.4.1.4

    Abstract:

    HTTP is currently being used as the communication protocol for many distributed applications, supporting business and safety-critical services at a world-wide scale. Despite of their increasing importance, HTTP-based applications are still quite exposed to TCP connection crashes, which can result in huge losses for services users and providers, including financial and reputation losses. Typical techniques for achieving reliable HTTP communication rely on buffering and retransmission of complete HTTP messages, and are quite un-adapted to large messages. Stream-based approaches are more efficient as, after a crash, data transmission can be resumed from where it stopped. However, it is very difficult to know how much data is lost after a crash, as TCP provides insufficient support to obtain this information and none to recover from connection crashes. This makes the design of any stream-based reliability mechanism a significant challenge. In this paper we propose a stream-based solution for reliable HTTP communication that is retro-compatible with existing software. The mechanism is presented as a design solution and relieves developers from explicitly designing recovery code for handling connection crashes, providing a standardized way for building reliable applications. Our experimental evaluation shows that the solution is functional and results in acceptable coding and runtime costs.

  • WEB SERVICE DISCOVERY FOR LARGE SCALE IOT DEPLOYMENTS

  • Should be cited as: [ paper pdf download]

    Yehia Elshater, Khalid Elgazzar, Patrick Martin "WEB SERVICE DISCOVERY FOR LARGE SCALE IOT DEPLOYMENTS", International Journal of Services Computing (IJSC), 4(1), 2016, pp. 55-68. DOI: 10.29268/stsc.2016.4.1.5

    Abstract:

    IoT scenarios cannot tolerate long latency in finding relevant Web services to consume on the fly or dynamically integrate in IoT applications providing real time services. In this paper, we present a comprehensive Web service discovery approach for large scale IoT deployments. We leverage the information available in the Web service description document to cluster large service repositories into functionally similar groups to reduce the discovery latency and improve precision. Then, we use statistical indexing techniques to generate data structures for each cluster for fast and efficient matching. In this research, we propose and study the performance of four matching algorithms: semantic keyword matching using Normalized Google Distance (NGD), brute force search over Term Frequency-Inverse Document Frequency (TF-IDF) matrix, K-Dimensional (K-D) tree, and Locality Sensitive Hashing (LSH). Our thesis is that indexing-based discovery algorithms (i.e., K-D tree and LSH) provide a much faster response with comparable precision, while NGD and brute force search provide a slightly better accuracy, but at the cost of high latency. Our experimental results show that we can reduce the query latency by up to 5x fold, while achieving comparable precision with the state-of-the-art service discovery mechanisms

== 2015 ===

Volume 3, No 4 (October-December, 2015): [ Full Issue PDF]

  • ADAPTIVE MOBILE CLOUD WORKFLOW MANAGEMENT SYSTEM FOR SERVICE DISCOVERY IN PROXIMITY-BASED INTERNET OF THINGS

  • Should be cited as: [ paper pdf download]

    Chii Chang, Satish Narayana Srirama, Jakob Mass "ADAPTIVE MOBILE CLOUD WORKFLOW MANAGEMENT SYSTEM FOR SERVICE DISCOVERY IN PROXIMITY-BASED INTERNET OF THINGS", International Journal of Services Computing (IJSC), 3(4), 2015, pp. 1-13.

    Abstract:

    In the near future, Industrial Internet of Things can help people in realizing the smart cities and urban sensing scenarios by providing various useful spatial information. Based on real-time resource discovery and data retrieval technologies, mobile devices can continuously interact with surrounding things and provide real-time content mashup services. However, continuous resource discovery and content mashup processes can be resource intensive for mobile devices. In order to reduce the resource usage, certain tasks of the mobile application can be delegated to the utility Cloud. Nevertheless, task offloading isn't always cost-efficient and the decision to offload a process needs to be context-aware. This paper proposes a service-oriented workflow-based mobile Cloud middleware framework for balancing the task allocation between the mobile terminal and Cloud. The proposed cost-performance index scheme assists the decision-making of the workflow configuration by utilizing the fuzzy set and weight of context schemes. The evaluation consists of a data set generated by experts' preferences considering fuzzy logic and inference, on which linear regression was performed, for extracting the weights of the context. The prototype has been implemented in real devices and the evaluation has shown that the workflow system can automatically configure the task allocation based on resource availability.

  • DCA-SERVICES: A DISTRIBUTED AND COLLABORATIVE ARCHITECTURE FOR CONDUCTING EXPERIMENTS IN SERVICE ORIENTED SYSTEMS

  • Should be cited as: [ paper pdf download]

    Luiz H. Nunes, Júlio C. Estrella, Carlos H. G. Ferreira, Luis H. V. Nakamura, Rafael M. Libardi, Edvard M. de Oliveira, Bruno T. Kuehne, Paulo S. L. Souza, Regina H. C. Santana, Marcos J. Santana, Stephan Reiff-Marganiec "DCA-SERVICES: A DISTRIBUTED AND COLLABORATIVE ARCHITECTURE FOR CONDUCTING EXPERIMENTS IN SERVICE ORIENTED SYSTEMS ", International Journal of Services Computing (IJSC), 3(4), 2015, pp. 14-28. DOI: 10.29268/stsc.2015.3.4.2

    Abstract:

    Current distributed computing environments, such as Cloud Computing, Grid Computing and Internet of Things are typically complex and present dynamic scenarios, which makes the execution of experiments, tests and performance evaluations challenging. Performing large scale experiments in Service-Oriented Computing (SOC) environments can be a difficult and complex task. In this paper, we propose a Distributed and Collaborative Architecture for Conducting Experiments in Service Oriented Systems (DCA-SERVICES). DCA-SERVICES is a client-server architecture that provides a real environment to execute experiments in systems based on the SOC paradigm. Using the DCA-SERVICES and our developed tool named Planning and Execution of Experiments in Service Oriented Systems (PEESOS), we were able to execute experiments, tests, and analyze a target system environment quickly and efficiently.

  • CLASSIFICATION BASED PARAMETER ASSOCIATION FOR NON-REDUNDANT ANNOTATION

  • Should be cited as: [ paper pdf download]

    Xuehao Sun, Shizhan Chen, Zhiyong Feng, Keman Huang, Dongxiao He, Xiaocao Hu "CLASSIFICATION BASED PARAMETER ASSOCIATION FOR NON-REDUNDANT ANNOTATION ", International Journal of Services Computing (IJSC), 3(4), 2015, pp. 29-42. DOI: 10.29268/stsc.2015.3.4.3

    Abstract:

    Semantic annotation of Web Services can facilitate the automated service discovery and composition. At present, however, many solutions suffer from redundant annotations or imprecise derived annotations. To solve the problem, we need to find the parameters that have equivalent semantics in a large number of Web Services. This paper proposes a classification based parameter association, laying the foundation for non-redundant annotation and amendment. Then the paper presents the non-redundant annotation in reduced parameter space. And the annotation results are expanded to the original parameter space. Finally a prototype tool is made to show all Web Services’ information and parameter association information, by which we can manually amend the annotation results. Moreover, the amendment results will be applied to all parameters that are semantically equivalent. To evaluate the final annotation results, the paper gives a method based on service discovery. The experimental results show that the parameter association approach can accurately identify the equivalence between parameters. It also suggest that non-redundant annotation and amendment can greatly reduce the workload, and can augment the semantics of Web Services with adequate accuracy, which can achieve similar performance in service discovery as OWL-S services do.

Volume 3, No 3 (July-September, 2015): [ Full Issue PDF]

  • FORMAL-BASED FRAMEWORK FOR ANALYSIS OF LOGICAL ARCHITECTURE

  • Should be cited as: [ paper pdf download]

    Maria Spichkova, Heinrich Schmidt “FORMAL-BASED FRAMEWORK FOR ANALYSIS OF LOGICAL ARCHITECTURE”, International Journal of Services Computing (IJSC), 3(3), 2015, pp. 1-15. DOI: 10.29268/stsc.2015.3.3.1

    Abstract:

    This paper presents a formal framework for modeling and analysis of data and control flow dependencies between components or services within remotely deployed distributed systems. This work aims at elaborating for a concrete system, which parts of the system (or system model) are necessary to check a given property. The approach allows services and components decomposition oriented towards efficient checking of system properties as well as analysis of dependencies within a system: after analysis of the logical architecture of the system, an optimized architecture is developed following the specified algorithm. One of the key features of this approach is a semi-automatic support of the presented ideas on verification level.

  • A NOVEL ROUTING ALGORITHM FOR VIDEO-ON-DEMAND ON MOBILE DEVICES

  • Should be cited as: [ paper pdf download]

    Babangida Albaba. Abubakar, Prof. Miltos Petridis, Dr. Deshinder S. Gill, Saeed Malekshahi-Gheytassi “A NOVEL ROUTING ALGORITHM FOR VIDEO-ON-DEMAND ON MOBILE DEVICES”, International Journal of Services Computing (IJSC), 3(3), 2015, pp. 16-26. DOI: 10.29268/stsc.2015.3.3.2

    Abstract:

    Bandwidth is one of the characteristics that is used to measure network performance. In this paper, we present A Novel Routing Algorithm (ANORA) for Video-On-Demand on Mobile Devices that are streaming video contents from a video server. The algorithm can adapt to different number of mobile devices with different level of mobility and different location. Routing decisions are based on the availability of the packet(s) within a given geographical location. The video server identifies the availability of the packets it has earlier sent to a particular client and requests the packet(s) to be forwarded to the requesting client. Real live video programme was streamed using VLC media player and the collected packets size and packet inter-arrival times were used in all the simulations. Different simulations were conducted using OPNET Modeler. After conducting series of simulation tests, the algorithm showed low server and network load, low delay, high adaptability and robustness.

  • PERSONALIZED SERVICE RECOMMENDATION BASED ON PSEUDO RATINGS BY MERGING TIME AND TAG PREFERENCE

  • Should be cited as: [ paper pdf download]

    Xiuwei Zhang,Chong Wang,Jian Wang, Jianxiao Liu, Tian Gang,Keqing He "PERSONALIZED SERVICE RECOMMENDATION BASED ON PSEUDO RATINGS BY MERGING TIME AND TAG PREFERENCE", International Journal of Services Computing (IJSC), 3(3), 2015, pp. 17-40. DOI: 10.29268/stsc.2015.3.3.3

    Abstract:

    With the rapid development of service-oriented computing technologies, large amounts of Web services have been released on the Internet to facilitate system construction. Consequently, personalized service recommenders are emerging to handle information overload in service computing. Collaborative filtering (CF) is popular for service recommendations based on explicit ratings or Quality of Service (QoS) information provided by users. In real cases, however, it is difficult to collect explicit feedbacks since most available feedbacks are implicit. In this paper, the authors propose an implicit-to-explicit rating approach, which can leverage the implicit feedback from user’s collecting behavior to build a CF-based recommender system for Web services. Firstly, a user-service binary matrix is constructed based on the collection records in the watchlist. Secondly, the reputation rating, publishing time and tag information of services are combined into the previous binary matrix to generate a pseudo rating matrix, which can reflect users’ preference changing more precisely. Thirdly, both the traditional and enhanced user-based CF methods are used to generate a personalized service list with these pseudo ratings. Finally, a set of experiments are designed to validate the proposed service recommendation approach based on a large scale and real-world dataset from a well-known service registry center Programmableweb (PWeb). The experimental results show that our hybrid recommendation method is more efficient and accurate than the traditional log-based CF methods.

Volume 3, No 2 (April - June, 2015): [ Full Issue PDF]

  • DPOC:AN OPTIMIZATION STRATEGY OF EV EFFICIENT TRAVELLING

  • Should be cited as: [ paper pdf download]

    Lei Shi, Jiayuan Li, Zhihan Liu, Jinglin Li “DPOC:AN OPTIMIZATION STRATEGY OF EV EFFICIENT TRAVELLING”, International Journal of Services Computing (IJSC), 3(2), 2015, pp. 1-9. DOI: 10.29268/stsc.2015.3.2.1

    Abstract:

    The popularity of electric vehicles (EVs) provides great help to solve the increasingly serious energy issues and environmental problems, but it also has limitation such as short driving range and long charging time. This paper proposed an optimization strategy for EVs to travel more efficiently called dynamic planned ordered charging (DPOC for short), that is, changing route dynamically to cut down time on driving and necessary charging instead of waiting or overcharge. An energy reachable graph is built firstly to protect vehicles from breaking down in the midway. Travel time, including driving time, charging time and waiting time, is taken as the optimization goal. The modeling and solution of travel time is presented. The two most important contributions of this paper are route re-plan mechanism and the proposal of charging station load and how it can be calculated. Besides, reservation for charging is also introduced to achieve the global optimization. Then the planning of efficient travel can be converted to a general graph theory problem by putting time cost onto edge weight of the graph. According to the simulation and experiment, the strategy proposed in this paper is superior to other compared strategies in many aspects. Keywords: efficient travel strategy; charging station load; charging reservation; dynamic planned ordered charging

  • SCALABLE ALGORITHM FOR THE SERVICE SELECTION PROBLEM

  • Should be cited as: [ paper pdf download]

    Yanik Ngoko,Christophe Cérin,Alfredo Goldman "SCALABLE ALGORITHM FOR THE SERVICE SELECTION PROBLEM", International Journal of Services Computing (IJSC), 3(2), 2015, pp. 10-24. DOI: 10.29268/stsc.2015.3.2.2

    Abstract:

    In this paper, we are interested in fast algorithms for the service selection problem. Given an abstract services' composition, the objective in this problem is to choose the best services for implementing the composition such as to minimize a given penalty function. Our work contributes to both the sequential and parallel resolution of this problem. For the sequential resolution, we show how to extend a prior algorithm for QoS prediction to obtain a fast sequential resolution of the service selection problem. Our proposal innovates in the optimization techniques (variable ordering, branch and bound, etc.) used for the runtime minimization. For the parallel resolution, we discuss on two possible formulations for the parallelism: task and data parallelism. We show that on our problem, the latter formulation is adequate because it leads to a more scalable resolution. Finally, we conduct various experiments that show that super-linear speedups can be reached with our new parallel algorithm.

  • ICONCUBE:A LOCATION-BASED MOBILE CLOUD SYSTEM FOR MEETING ORGANIZEERS AND PARTICIPANTS

  • Should be cited as: [ paper pdf download]

    Guo Chi,Zeng Jieru,Liu Xuan,Cui Jingsong "ICONCUBE:A LOCATION-BASED MOBILE CLOUD SYSTEM FOR MEETING ORGANIZEERS AND PARTICIPANTS", International Journal of Services Computing (IJSC), 3(2), 2015, pp. 25-31. DOI: 10.29268/stsc.2015.3.2.3

    Abstract:

    Location-Based Services based on thematic information have become commonplace. Thematic indoor navigation services are also increasingly pervasive with the development of indoor positioning technologies. Extending these technologies, we designed and implemented iConCube, a mobile cloud computing system for meeting organizers and participants integrating Location-Based Services and indoor navigation. For meeting organizers, our system provides a templates library to efficiently customize meeting portal websites for different topics and meeting types, such as academic conference or art exhibitions. For meeting participants, the Android application in our system not only provides indoor navigation in a meeting space, but also enhances communication among participants through online-to- offline social network services. The system also extracts information from the Internet related to users ’ location and pushes it to users in sequence based on its similarity to a location’s social attributes. Our system has been used for many academic conferences such as China Satellite Navigation Conference (CSNC), demonstrating its utility.

Volume 3, No 1 (January - March, 2015): [ Full Issue PDF]

  • SOCIALLY ENHANCED ACCOUNT BENCHMARKING IN APPLICATION MANAGEMENT SERVICE (AMS)

  • Should be cited as: [ paper pdf download]

    Ying Li “SOCIALLY ENHANCED ACCOUNT BENCHMARKING IN APPLICATION MANAGEMENT SERVICE (AMS)”, International Journal of Services Computing (IJSC), 3(1), 2015, pp. 1-13. DOI: 10.29268/stsc.2015.3.1.1

    Abstract:

    This paper describes our recent work on designing and developing a socially enhanced benchmarking system to be applied to AMS (Application Management Service) domain. Benchmarking allows an AMS client or account to understand where it stands in relative to others in terms of its operational performance, and helps it set a realistic target to reach. We elaborate the entire system process in the paper which consists of the following seven modules: account data collection, cleansing, sampling, mapping and normalization; account social data mining; benchmarking pool formation and data range selection; KPI (key performance indicator) design for account performance measurement; KPI implementation, evaluation and visualization; benchmarking outcome visualization; and finally, post- benchmarking analysis. So far, we have applied this benchmarking tool to a dozen of real AMS accounts, and have received some initial yet encouraging feedback.

  • OPTIMIZING TEMPORAL PERFORMANCE IN DATA-CENTRIC BUSINESS PROCESSES

  • Should be cited as: [ paper pdf download]

    Yuqun Zhang, Dewayne E. Perry "OPTIMIZING TEMPORAL PERFORMANCE IN DATA-CENTRIC BUSINESS PROCESSES", International Journal of Services Computing (IJSC), 3(1), 2015, pp. 14-29. DOI: 10.29268/stsc.2015.3.1.2

    Abstract:

    Time studies have been proven useful towards understanding and improving business processes. Particularly, optimizing temporal performance for business processes can directly help reduce costs and bring profits for enterprises. In this paper, we study the properties of temporal performance and develop approaches to optimize it in workflow-based business processes. By applying our data-centric business process modeling techniques, we explore the possibility of reconstructing business process that is realized by modifying the execution order of business activities. Accordingly, we develop efficient algorithms to automatically detect these possibilities and approach optimal temporal performance for business processes. To evaluate our algorithms, a symbolic business process generator, namely G-DCBP, is introduced to stochastically generate symbolic data-centric business processes that can be used to analyze their properties and evaluate the time-optimization approaches according to end-users’ specification. The evaluation results validate the efficacy of the algorithms under different scenarios.

  • SERVICE RECOMMENDATION VIA EXPLOITING GLOBAL AND LOCAL TRUST METRICS

  • Should be cited as: [ paper pdf download]

    Tang Mingdong, Dai Xiaoling, Cao Buqing, Liu Jianxun "SERVICE RECOMMENDATION VIA EXPLOITING GLOBAL AND LOCAL TRUST METRICS", International Journal of Services Computing (IJSC), 3(1), 2015, pp. 30-43. DOI: 10.29268/stsc.2015.3.1.3

    Abstract:

    Recommending users with trustworthy services is a fundamental need in service-oriented environments. Various reputation-based methods have been proposed to address the issue of service trust evaluation. They typically yield a unique and global trust score for each service by aggregating the ratings on it awarded by the user community. However, this global trust score could be inconsistent with an individual ’s personal opinion on the service, especially when the service is highly controversial. To attack this issue, local trust metrics have been developed, aiming to measure trust on a service more personally and accurately. However, local trust metrics, which employ trust propagation in trust networks, may fail when the judging user has no trust chains to reach the target service. By exploiting both global and local trust metrics, this paper proposes a hybrid trust measure for trustworthy service recommendation. We firstly present a global trust metric and a local trust metric different from conventional ones, and then develop a reasonable strategy for combining them to predict a user’s trust on a service. Evaluations show that our proposed method significantly outperforms the other three methods in service- oriented environments with social networks.

  • ADAPTIVE MOBILE CLOUD WORKFLOW MANAGEMENT SYSTEM FOR SERVICE DISCOVERY IN PROXIMITY-BASED INTERNET OF THINGS

  • Should be cited as: [ paper pdf download]

    Chii Chang, Satish Narayana Srirama, Jakob Mass "ADAPTIVE MOBILE CLOUD WORKFLOW MANAGEMENT SYSTEM FOR SERVICE DISCOVERY IN PROXIMITY-BASED INTERNET OF THINGS ", International Journal of Services Computing (IJSC), 3(1), 2015, pp. 44-56. DOI: 10.29268/stsc.2015.3.1.4

    Abstract:

    In the near future, Industrial Internet of Things can help people in realizing the smart cities and urban sensing scenarios by providing various useful spatial information. Based on real-time resource discovery and data retrieval technologies, mobile devices can continuously interact with surrounding things and provide real-time content mashup services. However, continuous resource discovery and content mashup processes can be resource intensive for mobile devices. In order to reduce the resource usage, certain tasks of the mobile application can be delegated to the utility Cloud. Nevertheless, task offloading isn't always cost-efficient and the decision to offload a process needs to be context-aware. This paper proposes a service-oriented workflow-based mobile Cloud middleware framework for balancing the task allocation between the mobile terminal and Cloud. The proposed cost-performance index scheme assists the decision-making of the workflow configuration by utilizing the fuzzy set and weight of context schemes. The evaluation consists of a data set generated by experts' preferences considering fuzzy logic and inference, on which linear regression was performed, for extracting the weights of the context. The prototype has been implemented in real devices and the evaluation has shown that the workflow system can automatically configure the task allocation based on resource availability.

== 2014 ===

Volume 2, No 4 (October-December 2014): [ Full Issue PDF]

  • USING SYNTACTIC AND SEMANTIC SIMILARITY OF WEB APIS TO ESTIMATE PORTING EFFORT

  • Should be cited as: [ paper pdf download]

    Hiranya Jayathilaka, Alexander Pucher, Chandra Krintz, Rich Wolski "USING SYNTACTIC AND SEMANTIC SIMILARITY OF WEB APIS TO ESTIMATE PORTING EFFORT", International Journal of Services Computing (IJSC), 2(4), 2014, pp. 1-14. DOI: 10.29268/stsc.2014.2.4.1

    Abstract:

    Service Oriented Architecture (SOA) has altered the way programmers develop applications. Instead of using standalone libraries, programmers today often incorporate curated web services, accessed via well-defined interfaces (APIs), as modules in their applications. Web APIs, however, evolve rapidly, making it critical for developers to be able to compare APIs for similarity and estimate the workload associated with “porting” applications to use different or new APIs (or API versions). Unfortunately, today there is no simple automated mechanism for analyzing the similarity between web APIs and reasoning about the porting effort that will be necessary when the web APIs that an application uses change. To address this limitation, we describe an automated methodology for analyzing API similarity and quantifying the porting effort associated with the use of web APIs. Our approach defines a simple type system and a language with which API developers specify the syntactic and semantic features of APIs. We also define algorithms that transform the syntactic and semantic features of APIs into similarity and porting effort information. We evaluate our approach using both randomly generated and real-world APIs and show that our metric captures the relative difficulty that developers associate with porting an application from one API to another.

  • COST-EFFECTIVE SERVICE NETWORK PLANNING FOR MASS CUSTOMIZATION OF SERVICES

  • Should be cited as: [ paper pdf download]

    Zhongjie Wang, Nan Jing, Fei Xu, Xiaofei Xu "COST-EFFECTIVE SERVICE NETWORK PLANNING FOR MASS CUSTOMIZATION OF SERVICES", International Journal of Services Computing (IJSC), 2(4), 2014, pp. 15-31. DOI: 10.29268/stsc.2014.2.4.2

    Abstract:

    In real-world scenarios, massive demands might be simultaneously raised by massive customers. Mass customization (MC) of services is a cost-effective approach to deal with this scenario by offering a customizable composite service that satisfies as many personalized requirements as possible. In this paper, Service Network (SN) is employed to represent a customizable composite service, so that MC of services is transformed into a Service Network Planning (SNP) problem. A heuristic algorithm called Iterative Enhancement based Algorithm (IEA) is proposed for SNP. Massive requirements are sorted in terms of their potential benefit in the descending order, and for each requirement to be dealt with, the algorithm iteratively enhances the preceding constructed SN by the least cost instead of constructing a new one, so that the final constructed SN keeps the minimal size and complexity and reaches cost-effectiveness. For comparison, two traditional service composition based algorithms called Solution Consolidation based Algorithm (SCA) and Requirement Grouping based Algorithm (RGA) are presented. Experiments are conducted to prove the superiority of the IEA, and factors that impact the performance of IEA are exploited elaborately.

  • AN ANALYSIS AND COMPARISON OF CLOUD DATA CENTER ENERGY-EFFICIENT RESOURCE MANAGEMENT TECHNOLOGY

  • Should be cited as: [ paper pdf download]

    Zhihui Lu,Soichi Takashige,Yumiko Sugita,Tomohiro Morimura,Yutaka Kudo "AN ANALYSIS AND COMPARISON OF CLOUD DATA CENTER ENERGY-EFFICIENT RESOURCE MANAGEMENT TECHNOLOGY", International Journal of Services Computing (IJSC), 2(4), 2014, pp.32-51. DOI: 10.29268/stsc.2014.2.4.3

    Abstract:

    [Nowadays, cloud data centers began to support more and more popular online services such as web search, e-commerce, social networking, video on demand and software as a service (SaaS), so the massive scale of data centers brings the challenges of energy efficiency. Therefore, the concept of an energy-efficient Green data center has been proposed. To build an energy-efficient cloud data center, cloud data center resource dynamic provisioning and consolidation technology is involved. In this paper, we first provide a survey of current industry and academic efforts on cloud data center energy-efficient management technology, focusing on the cloud data center resource dynamic provisioning technology and resource consolidation technology. We first focus on an analysis and comparison of cloud resource predictive dynamic provisioning technology. We analyze and discuss the main resource prediction methods and models, including basic models, feedback based models and multiple time series models. We describe the relationship between these categories as well as the characteristics of the models. After that, we analyze and compare Cloud resource reactive dynamic provisioning technology. And then we analyze cloud resource consolidation technology. Furthermore, we also give a prospect on cloud resource management technology standardization trends. Lastly, we analyze the prospective research direction.]

  • MODELING AND ANALYSIS OF MOBILE PUSH NOTIFICATION SERVICES USING PETRI NETS

  • Should be cited as: [ paper pdf download]

    Junhua Ding, Wei Song,Dongmei Zhang "MODELING AND ANALYSIS OF MOBILE PUSH NOTIFICATION SERVICES USING PETRI NETS", International Journal of Services Computing (IJSC), 2(4), 2014, pp.52-64. DOI: 10.29268/stsc.2014.2.4.4

    Abstract:

    Mobile push notifications are an important feature in mobile computing services and they have been widely implemented in mobile systems. However, it also brings the vulnerability of security and reliability to the system. Formal specification and verification is an effective approach for understanding the properties of mobile push notification services and ensuring quality of the system development. Due to the dynamic interaction, security and mobility properties in mobile computing services, formally modeling and analyzing them is a grand challenge. In this paper, we proposed an approach to model mobile computing services using a high level Petri nets and analyze them through combining formal verification and testing techniques. The dynamic interaction between users and service providers is modeled with the publisher subscriber architecture. The mobility is modeled with a connector that dynamically connects a user to its service provider based on user’s runtime environment, and the security is modeled with a threat model. The effectiveness of the approach is demonstrated with a case study of modeling and analyzing a mobile searching engine that is implemented with mobile push notifications services.

  • Reference Architectures for Privacy Preservation in Cloud-based IoT Applications

  • Should be cited as: [ paper pdf download]

    Ivor D. Addo, Sheikh I. Ahamed,Stephen S. Yau, Arun Buduru "Reference Architectures for Privacy Preservation in Cloud-based IoT Applications ", International Journal of Services Computing (IJSC), 2(4), 2014, pp.65-79. DOI: 10.29268/stsc.2014.2.4.5

    Abstract:

    As the promise of the Internet of Things (IoT) materializes in our everyday lives, we are often challenged with a number of concerns regarding the efficacy of the current data privacy solutions that support the pervasive components at play in IoT. The privacy and security concerns surrounding IoT applications often manifests themselves as a threat to end-user adoption and negatively impacts trust among end-users. In this paper, we present a reference software architectures for building cloud-enabled IoT applications in support of collaborative pervasive systems aimed at achieving trustworthiness among end-users in IoT scenarios. We describe a case study that leverages this reference architecture to protect sensitive user data in IoT application implementation. We then evaluate the response data from our end-user survey. In addition we present a Secure, Private and Trustworthy protocol (named SPTP) that was prototyped for addressing critical security, privacy and trust concerns surrounding mobile, pervasive and cloud services in Collective Intelligence (CI) scenarios. We present our evaluation criteria for the proposed protocol, our results and future work.

Volume 2, No 3 (July - September, 2014): [ Full Issue PDF]
  • IMPROVING WEB SERVICE CLUSTERING THROUGH POST FILTERING TO BOOTSTRAP THE SERVICE DISCOVERY

  • Should be cited as: [ paper pdf download]

    Banage T. G. S. Kumara, Incheon Paik, Koswatte R. C. Koswatte, Wuhui Chen, "Improving Web Service Clustering Through Post Filtering To Bootstrap The Service Discovery", International Journal of Services Computing (IJSC), 2(3), 2014, pp. 1-13. DOI: 10.29268/stsc.2014.2.3.1

    Abstract:

    Web service clustering is one of a very efficient approach to discover Web services efficiently. Current approaches use similarity-distance measurement methods such as string-based, corpus-based, knowledge-based and hybrid methods. These approaches have problems that include discovering semantic characteristics, loss of semantic information, shortage of high-quality ontologies and encoding fine-grained information. Thus, the approaches couldn’t identify the correct clusters for some services and placed them in wrong clusters. As a result of this, cluster performance is reduced. This paper proposes post-filtering approach to increase the performance of clusters by rearranging services incorrectly clustered. Our approach uses context aware similarity method that learns domain context by machine learning to produce models of context for terms retrieved from the Web in the filtering process to calculate the service similarity. We applied post filtering approach to hybrid term similarity based clustering approach that we proposed in our previous work. Experimental results show that our post-filtering approach works efficiently.

  • MODEL-DRIVEN DESIGN AND VALIDATION OF SERVICE ORIENTED ARCHITECTURE BASED ON DEVS SIMULATION FRAMEWORK

  • Should be cited as: [ paper pdf download]

    Jianpeng Hu,Linpeng Huang,Renke Wu,Bei Cao,Xuling Chang, "Model-Driven Design And Validation of Service Oriented Architecture Based On Devs Simulation Framework", International Journal of Services Computing (IJSC), 2(3), 2014, pp. 14-29. DOI: 10.29268/stsc.2014.2.3.2

    Abstract:

    It is very important to validate functional requirements and evaluate non-functional requirements in earlier design phase of a Service Oriented Architecture (SOA) by executable modeling methodology. To make SOA executable, basically, most of the proposed approaches can be divided into two categories: formalism-based ones and model-driven ones, which both have the advantages and limitations. In this paper, we take advantage of both formalism-based and model-driven methodologies to specify a unified model-driven design and validation approach to SOA. This approach bridges generic service design and universal simulation paradigm with formal bases and practical implementation. To achieve this goal, we first extend the DEVS modeling language (DEVSML) to support nondeterministic state transition and enhance its capability to describe complex behavior of systems. Then we provide an automated transformation process using Extended DEVSML as a model transformation intermediary to bring together Model Driven Service Engineering (MDSE) with Service oriented architecture Modeling Language (SoaML) and Modeling & Simulation (M&S) methodology based on Discrete Event System Specification (DEVS). To demonstrate the applicability of this approach, we introduce an aircraft docking process in an airport scenario as the case study.

  • ENVIRONMENTAL SENSOR MONITORING WITH SECURE RESTFUL WEB SERVICE

  • Should be cited as: [ paper pdf download]

    Sungchul Lee, Ju-Yeon Jo,Yoohwan Kim, "Environmental Sensor Monitoring With Secure RESTful Web Service ", International Journal of Services Computing (IJSC), 2(3), 2014, pp. 30-42. DOI: 10.29268/stsc.2014.2.3.3

    Abstract:

    The Nevada Solar Energy-Water-Environment Nexus project generates a large amount of environmental monitoring data from variety of sensors. This data is valuable for all related research areas, such as soil, atmosphere, biology, and ecology. An important aspect of this project is promoting data sharing and analysis using a common platform. To support this effort, we developed a comprehensive architecture that can efficiently collect the data from various sensors, store them in a database, and offer an intuitive user interface for data retrieval. We employed Arduino-based sensors due to their flexibility and cost-effectiveness. Restful Web Service is used for communication with the Arduino-based sensors, and Google Charts service has been used for data visualization. This framework for sensor data monitoring with Web Service is expected to allow the Nevada Nexus project to seamlessly integrate all types of sensor data and to provide a common platform for researchers to easily share the data.

  • AN ACTOR-BASED APPROACH TO COORDINATING CROWD-SOURCED SERVICES

  • Should be cited as: [ paper pdf download]

    Ahmed Abdel Moamen, Nadeem Jamali, "An Actor-Based Approach To Coordinating Crowd-Sourced Services", International Journal of Services Computing (IJSC), 2(3), 2014, pp. 43-55. DOI: 10.29268/stsc.2014.2.3.4

    Abstract:

    As personal mobile devices become gain popularity, not only is it possible receive a variety of services virtually anywhere, the sensors on the same devices can also actively contribute real-time day from their contexts to be used in services. A busy professional could find a restaurant to go to for a quick lunch based on information available from smartphones of people already there having lunch, waiting to be seated, or even heading there. Also imagine a mid-21st century fine-grained democracy where citizens might authorize use of a police officer’s firearm – in real time – based on a live video feed of the scene. Although the programming required for offering a new service of this sort can be significant if done from scratch, we argue that in many cases it does not. We identify core communication mechanisms which underly many crowd-sourced services, and present preliminary design of a middleware which implements them. Service designers may launch novel services over this middleware by simply plugging in small pieces of service specific code. This paper identifies the coordination mechanisms required for these crowd-sourced services as types of multi-origin communication. We present details of how these core mechanisms can be implemented using Actors, and introduce high-level programming constructs for launching a new service. In addition, we present our design of a middleware for crowd-sourced services using multi-origin communication. Finally, we use examples to illustrate the implementation of services

  • ENRICHING HETEROGENEOUS SERVICE COMPOSITION WITH A SEMANTICALLY ENHANCED SERVICE DESCRIPTION LANGUAGE

  • Should be cited as: [ paper pdf download]

    Feifei Hang, Liping Zhao, "Enriching Heterogeneous Service Composition With A Semantically Enhanced Service Description Language", International Journal of Services Computing (IJSC), 2(3), 2014, pp. 56-68. DOI: 10.29268/stsc.2014.2.3.5

    Abstract:

    The emergence of Web 2.0 and its related technologies such as HTML5 has empowered end-users and made it possible for them to compose their own Web applications. Yet, most of the current development has mainly concentrated on the support of the composition of enterprise-oriented services and scientific workflows and little effort has been made to support the composition of end user-oriented services. In addition, the lack of machine-readable and high-level composite service description languages has prevented the end-users from sharing the service composition knowledge. To overcome these limitations, this paper introduces “HyperMash”, a service composition approach for end-users. HyperMash supports the composition of both RESTful and SOAP-based Web services, and allows both types of service to be freely combined. A description language, called “Semantic-UiSDL”, is used to automatically generate machine-readable and processable descriptions of composite services. Through this language, HyperMash can provide service recommendations to end-users as a way of sharing and reusing their service composition knowledge. This paper presents and illustrates the HyperMash approach and its major concepts and components through real-life examples and empirical study.

Volume 2, No 2 (April - June, 2014): [ Full Issue PDF]

  • FACING UNCERTAINTY IN WEB SERVICE COMPOSITIONS

  • Should be cited as: [ paper pdf download]

    Germán H. Alférez, Vicente Pelechano, "Facing Uncertainty In Web Service Compusitions", International Journal of Services Computing (IJSC), 2(2), 2014, pp. 1-16. DOI: 10.29268/stsc.2014.2.2.1

    Abstract:

    Web service compositions run in complex computing infrastructures where arising events may affect the quality of the system. However, crucial Web service compositions cannot be stopped to apply changes to deal with problematic events. Therefore, the trend is moving towards context-aware Web service compositions, which use context information as a basis for autonomic changes. Under the closed-world assumption, the context and possible adaptations are fully known at design time. Nevertheless, it is difficult to foresee all the possible situations arising in uncertain contexts. In this article, we leverage models at runtime to guide the dynamic evolution of context-aware Web service compositions to deal with unexpected events in the open world. In order to manage uncertainty, a model that abstracts the Web service composition, self-evolves to preserve requirements. The evolved model guides changes in the underlying WS-BPEL composition schema. A software process model and its supporting method content are provided to guide the construction of models and other artifacts at design time. A prototype and an evaluation demonstrate the feasibility of our approach.

  • DATA MINING FROM DOCUMENT-APPEND NOSQL

  • Should be cited as: [ paper pdf download]

    Richard K. Lomotey, Ralph Deters, "Data Mining From Document-Append NoSQL", International Journal of Services Computing (IJSC), 2(2), 2014, pp. 17-29. DOI: 10.29268/stsc.2014.2.2.2

    Abstract:

    Due to the unstructured nature of modern digital data, NoSQL storages have been adopted by some enterprises as the preferred storage facility. NoSQL storages can store schema-oriented, semi-structured, schema-less data. A type of NoSQL storage is the document-append storage (e.g., CouchDB and Mongo) which has received high adoption due to its flexibility to store JSON-based data and files as attachment. However, the ability to perform data mining tasks from such storages remains a challenge and the required tools are generally lacking. Even though there is growing interest in textual data mining, there is huge gap in the engineering solutions that can be applied to document-append storage sources. In this work, we propose a data mining tool for term association detection. The flexibility of our proposed tool is the ability to perform data mining tasks from the document-source directly via HTTP without any copying or formatting of the existing JSON data. We adapt the Kalman filter algorithm to accomplish macro tasks such as topic extraction, term organization, term classification and term clustering. The work is evaluated in comparison with existing textual mining tools such as Apache Mahout and R with promissory result on term extraction accuracy.

  • EVENT-DRIVEN SOA FOR IOT SERVICES

  • Should be cited as: [ paper pdf download]

    YangZhang LiDuan Jun-liangChen , "Event-Driven Soa For Iot Services ", International Journal of Services Computing (IJSC), 2(2), 2014, pp. 30-43. DOI: 10.29268/stsc.2014.2.2.3

    Abstract:

    Although lots of IoT (Internet of Things) applications have been developed, the systematic method to construct IoT services is still obscure. In this paper, an Event-driven Service-oriented Architecture (EDSOA) for IoT services is discussed, where distributed events act as a primary mechanism for each IoT service to share independent meaningful events, to express its requirements and capabilities, and to decouple itself from other services. Such distributed events however do not provide powerful expressiveness to describe business logic in SOA because business activities are not completely independent each other. To fill the gap, we propose an information-centric session mechanism to describe service behavior working upon distributed events, called event session. Based on the event session concept, a graphical modeling method is proposed to describe IoT business processes. This paper also discusses how to build an Event-driven SOA infrastructure, where we can use resource information to create IoT services, use independent and shared events to run the IoT services, and use event session to coordinate the IoT services.Someapplications andexperiments aregiventoshowconceptproofforsuchevent-drivenSOA. Keywords:IoTServices,Service Collaboration,Process Theory,Publish/Subscribe,Event-drivenSOA

  • STANDARDS COMPLIANT PLATFORM FOR PRODUCT DESIGN IN DYNAMIC ENVIRONMENTS

  • Should be cited as: [ paper pdf download]

    Malik Khalfallah, Nicolas Figay, Mahmoud Barhamgi, Parisa Ghodous, "Standards Compliant Platform For Product Desing In Dynamic Environments", International Journal of Services Computing (IJSC), 2(2), 2014, pp. 44-57. DOI: 10.29268/stsc.2014.2.2.4

    Abstract:

    The literature on product-based workflow design considers only static collaborative environments where the product model is static and does not change. However the possible evolution of the product model and thus its impact on the collaborative environment are not considered despite the importance of this evolution for innovative product design. As a result the uncontrolled changes can easily break the cross-organizational process that links the different stakeholders in the collaborative environment. In this paper we present a framework that builds the collaboration contract from the product model and supports a controlled evolution of this contract. We leverage this framework by a set of management operations (services) that enable the contract evolution and investigate how a tailoring operation will not impact the executable cross-organizational process unless this process is maintained executable by the workflow engine. These operations are provided as services by a collaborative platform. Nevertheless, software applications that are provided through services following the Software as a service (SaaS) paradigm generally need to be compliant to some standards. In order to implement our management operations, we need to select the software application that provides the most conformant service interface to a given standard. Accordingly, we develop a formal framework that tests the compliance and reports quantitative results that help experts take the right decision. Unlike existing work that focuses on a single dimension when checking the compliance of a software application with the corresponding standard (for example the functional dimension exclusively, or the syntactic dimension exclusively), in this work we consider multiple dimensions at the same time. This provides more comprehensive results.

  • A COMPLIANCE AWARE INFRASTRUCTURE AS A SERVICE

  • Should be cited as: [ paper pdf download]

    Shakil M. Khan, Lorraine M. Herger, Mathew A. McCarthy, "A Compliance Aware Infrastructure As A Service", International Journal of Services Computing (IJSC), 2(2), 2014, pp. 58-71. DOI: 10.29268/stsc.2014.2.2.5

    Abstract:

    With cloud eclipsing the $100B mark, it is clear that the main driver is no longer strictly cost savings. The focus now is to exploit the cloud for innovation, utilizing the agility to expand resources to quickly build out new designs, products, simulations and analysis. Companies will use this agility and speed as competitive advantage. An example of the agility is the adoption by enterprises of the software-defined datacenter (SDDC) model, required to support the changing workloads and dynamic patterns of the enterprise. Often, security and compliance become an 'after thought', bolted on later when problems arise. In this paper, we will discuss our experience in developing and deploying a centralized management system for public, as well as an Openstack based cloud platform in SoftLayer, with an innovative, analytics-driven 'security compliance as a service' that constantly adjusts to varying compliance requirements based on workload, security and compliance requirements.

Volume 2, No 1 (January - March, 2014): [ Full Issue PDF]

  • REVISITING PROACTIVE SERVICE-ORIENTED ARCHITECTURE: FROM DESIGN AND IMPLEMENTATION TO VALIDATION AND PERFORMANCE IMPROVEMENT

  • Should be cited as: [ paper pdf download]

    Pengcheng Xiong, Qingyang Wang, Liang-Jie Zhang, Calton Pu, “Revisiting Proactive Service-Oriented Architecture: from Design and Implementation to Validation and Performance Improvement”, International Journal of Services Computing (IJSC), 2(1), 2014, pp. 1-10. DOI: 10.29268/stsc.2014.2.1.1

    Abstract:

    Compared with the first version of service-oriented architecture (SOA) where clients invoke the web service by sending a request to the service provider and receiving a response when the service is done, the second version of SOA is enriched by events to possibly automate web service invocation following event patterns. In this paper, we design and implement proactive service-oriented architecture (PSOA), which monitors the happening of interested events and invokes desired web services when the events satisfy pre-defined triggering conditions according to SOA 2.0. The core system which is composed of event monitoring, triggering condition evaluation, and services invocation is implemented by an event filter manager, a triggering condition evaluator and a service invocation manager, respectively. Beyond the design and implementation, we make two main contributions with respect to the validation and performance improvement. (1) We use a formal method based on Petri nets to model and validate the correctness of the new PSOA system. (2) We evaluate the scalability of the system and propose a ``grouping'' based method to further improve the average response time as well as the throughput of the system under large-scale situation.

  • AN INTEGRATIVE APPROACH TO SUPPORT MULTI-PERSPECTIVE BUSINESS PROCESS MODELING

  • Should be cited as: [ paper pdf download]

    Keletso Letsholo, Erol-Valeriu Chioasca, Liping Zhao, "An Integrative Approach to Support Multi-Perspective Business Process Modeling", International Journal of Services Computing (IJSC), 2(1), 2014, pp. 11-24. DOI: 10.29268/stsc.2014.2.1.2

    Abstract:

    Business process modeling (BPM) has become a dominating approach for organizations to understand, plan and optimize their business processes. BPM has also become an important part in service systems development because it helps to identify service activities embedded in business processes. Several modeling languages have been developed to support BPM, including IDEF, BPMN and EPC. Yet, our research shows that these languages still lack comprehensive constructs for representing some core business concepts, such as business goals, non-functional requirements and resources. This paper has two related purposes: First, it uses the Zachman Framework to assess the modeling capabilities of some of the popular BPM languages to identify their modeling gaps. The Zachman Framework is known to be comprehensive for representing different business perspectives. Second, the paper proposes an integrative approach to support multi-perspective BPM, so as to bridge the identified modeling gaps. This approach is illustrated through an example. The proposed approach aims at supporting the creation of comprehensive models and facilitating a common understanding of business perspectives regardless of the languages that represent them. The main benefit of the proposed approach is its integration of existing modeling languages that are familiar to business analysts, rather than introducing new languages. Further it provides guidance for business analysts and helps them to select appropriate modeling languages.

  • WEB SERVICES STANDARD-BASED SYSTEM RESOURCE MANAGEMENT MIDDLEWARE MODEL, SCHEME AND TEST

  • Should be cited as: [ paper pdf download]

    Lu ZhiHui, Jie Wu, and Patrick Hung, "Web Services Standard-Based System Resource Management Middleware Model, Scheme and Test", International Journal of Services Computing (IJSC), 2(1), 2014, pp. 25-44. DOI: 10.29268/stsc.2014.2.1.3

    Abstract:

    Traditionally, system resource management software is tightly tied with managed IT resources through their specific manageability interfaces. Applying Web Services technology to the system resource management field is a reasonable way to loosen this tie. In this paper, we discuss the implementation of SOA principals to the system resource management field, and then we use WSDM standard and WS-Management standards to design and realize the resource management middleware model. We illustrate how Web Services management standards are mapped and integrated with existing management interfaces, such as JMX, WMI, and so on. As part of our experiment work, we discuss MUSE-JMX and Wiseman-WMI based system management implementation schemes, including Manager Layer, Gateway Layer, and Resource Agent Layer, and then we analyze the experiment results. Finally, from our research experiences and related surveies, we analyze the prospective research direction and challenges in this field.

  • AN EVENT-B DRIVEN APPROACH FOR ENSURING RELIABLE AND FLEXIBLE SERVICES COMPOSITION

  • Should be cited as: [ paper pdf download]

    Imed Abbassi, Mohamed Graiet, and Zied Joua, "An Event-B Driven Approach for Ensuring Reliable and Flexible Services Composition", International Journal of Services Computing (IJSC), 2(1), 2014, pp. 45-57. DOI: 10.29268/stsc.2014.2.1.4

    Abstract:

    Web Services are defined independently of any execution context. Due to their inherent autonomy and heterogeneity, it is difficult to expect the behavior of composite Services, especially in a dynamic environment. In this paper, we propose an Event-B driven approach to easily design reliable and flexible Services compositions. To do so, we introduce a new paradigm, called dynamic transactional pattern. This new paradigm is a convergence concept of dynamic workflow patterns and advanced transactional model. Indeed, it combines dynamic Control-Flow flexibility and transactional processing reliability. A composite Service is defined as a set of dynamic transactional patterns instances properly connected together. We show how the transactional behavior of a composite Service is automatically defined in an efficient way. In this work, we combine the modeling and verification activities related to formal development process supported by Event-B. The verification activity is based on theorems proving and model-checker. Afterwards, the model is validated using ProB animator in order to ensure that it behaves as expected.

  • TRANSFORMATION OF ALGEBRAIC SPECIFICATIONS INTO ONTOLOGICAL SEMANTIC DESCRIPTIONS OF WEB SERVICES

  • Should be cited as: [ paper pdf download]

    Dongmei Liu, Hong Zhu, and Ian Bayley, “Transformation of Algebraic Specifications into Ontological Semantic Descriptions of Web Services”, International Journal of Services Computing (IJSC), 2(1), 2014, pp. 58-71. DOI: 10.29268/stsc.2014.2.1.5

    Abstract:

    The accurate description of service semantics plays a crucial role in service discovery, composition and interaction. Most work in this area has been focused on ontological descriptions, which are searchable and machine-understandable. However, they do not define service functionality in a verifiable and testable manner. In contrast, formal specification techniques, having evolved over the past 30 years, can define semantics in such a manner, but they have not yet been widely applied to service computing because the specifications produced are not searchable. There is a huge gap between these two methods of semantics description. This paper bridges the gap by advancing a transformation technique. It specifies services formally in an algebraic specification language and then to extract ontological description of domain knowledge and service semantics as profiles in an ontology description language such as OWL-S; this brings the desired searchability benefits. The paper presents a prototype tool for performing this transformation and reports a case study to demonstrate the feasibility of our approach.

Volume 1, No 1 (October - December, 2013): [ Full Issue PDF]

  • USING FINITE STATE MODELS FOR QUALITY EVALUATION AT WEB SERVICE DEVELOPMENT STEPS

  • Should be cited as: [ paper pdf download]

    Olga Kondratyeva, Natalia Kushik, Ana Cavalli, Nina Yevtushenko, "Using Finite State Models for Quality Evaluation at Web Service Development Steps", International Journal of Services Computing (IJSC), 1(1), 2013, pp. 1-12. DOI: 10.29268/stsc.2013.1.1.1

    Abstract:

    Known metrics of Quality of Service (QoS) and Quality of Experience (QoE) represent objective and subjective assessments. The development of any web service involves several steps and the final values of the service QoS and QoE can be essentially improved/deteriorated based on the quality reached at each development step. In this paper, five service development steps are considered: those are requirements specification, provisioning, composition, implementation, and usage and management. At each step different finite state models for refining the service quality estimation are utilized. A running example of a vacation planner service illustrates the application of finite state models to improve the accuracy of the QoS and QoE evaluation.

  • AN EVENT‐BASED APPROACH FOR DECLARATIVE, INTEGRATED AND SELF‐HEALING WEB SERVICES COMPOSITION

  • Should be cited as: [ paper pdf download]

    Ehtesham Zahoor, Kashif Munir, Olivier Perrin and Claude Godart, "An Event-Based Approach for Declarative, Integrated and Self-Healing Web Services Composition", International Journal of Services Computing (IJSC), 1(1), 2013, pp. 13-24. DOI: 10.29268/stsc.2013.1.1.2

    Abstract:

    Web services are defined to be the software systems that provide interoperable machine‐to‐machine interaction over a network. Individual services may need to be composed and the composition process design, verification and monitoring are thus active and widely studied research directions. However, the traditional approaches are both procedural (and rigid) and do not address the need of integrating these related dimensions using a unified formalism. In this paper, we propose an event‐oriented framework called DISC that is both declarative and serves as a unified framework to bridge the gap between the process design, verification and monitoring. It provides a flexible and highly expressive composition design that can accommodate various aspects such as data relationships and constraints, Web services dynamic binding, compliance regulations, security or temporal requirements etc. Furthermore, the DISC framework allows for instantiating and verifying the composition design and for monitoring the process while in execution

  • A DIGITAL SECURITY CERTIFICATE FRAMEWORK FOR SERVICES

  • Should be cited as: [ paper pdf download]

    Samuel Paul Kaluvuri, Hristo Koshutanski, Francesco Di Cerbo, Renato Menicocci, Antonio Maña, "A Digital Security Certificate Framework for Services“, International Journal of Services Computing (IJSC), 1(1), 2013, pp. 25-38. DOI: 10.29268/stsc.2013.1.1.3

    Abstract:

    Service Oriented Architectures have facilitated a paradigm shift in software provisioning models: software gets consumed as a service; providing enormous benefits to both service providers and consumers. However, a major barrier for a wider adoption of the new service provisioning model in business and security-critical domains is the lack of security assurance of a service. Although current security certification schemes typically provide the required assurance, applying them to service environments is practically infeasible, a major reason being the natural language representation of the security certificates which becomes a major obstacle for adoption in typical service environment scenarios such as service discovery and service composition. To overcome the limitations of existing security certificates, we present a full-fledged framework for the realization of the concept of digital security certificates for services. The framework comprises a language for machine processable digital security certificates (DSC), and the concept of a security profile that allows the generation of uniform DSCs and a tool that aids in the generation of the DSCs.

  • FORMAL METHODS FOR THE SPECIFICATION AND TESTING OF DATA‐CENTRIC WEB SERVICES: A CASE STUDY

  • Should be cited as: [ paper pdf download]

    Iman Saleh, Gregory KulczyckiŢ, M. Brian Blake, Yi Wei, "Formal Methods for The Specification and Testing Of Data-Centric Web Services: A Case Study", International Journal of Services Computing (IJSC), 1(1), 2013, pp. 39-51. DOI: 10.29268/stsc.2013.1.1.4

    Abstract:

    Web services allow organizations to capture their human and software‐based capabilities as modular software components that are called remotely over a network. In such service-oriented settings, it is important to establish an agreement that sets the obligations of the service provider and the expectations of the service consumer. Since traditional approaches such as Service Level Agreements (SLAs) are loosely defined with respect to data integrity aspects, in previous work, we proposed a formal model for specifying data‐centric Web services. The goal is to formally and unambiguously specify the service behavior in terms of its underlying data model and data interactions. In this paper, we present a case study where we use our model to specify and verify data-centric Web services. We demonstrate our proposed methodology using three state-of-the-art specification languages: JML, Dafny and RESOLVE. We also explore the use of our specification to automatically generate test cases for data‐centric services. Our goal is to study the feasibility of our proposed model and also to pinpoint the challenges and limitations of current specification and verification tools.

  • A LOCATION‐AWARE SERVICE SELECTION MODEL

  • Should be cited as: [ paper pdf download]

    Ying Li, Zhiling Luo, Jianwei Yin, "A Location-Aware Service Selection Model", International Journal of Services Computing (IJSC), 1(1), 2013, pp. 52-63. DOI: 10.29268/stsc.2013.1.1.5

    Abstract:

    This paper introduces a service selection model with the service location considered. The location of a service represents its position in the network, which determines the transmission cost of calling this service in the composite service. The more concentrated the invoking services are, the less transmission time the composite service costs. On the other hand, the more and more popular big data processing services, which need to transfer mass data as input, make the effect much more obvious than ever before. Therefore, it is necessary to introduce service location as a basic feature in service selection. The definition and membership functions of service location are presented in this paper. After that, the optimal service selection problem is represented as an optimization problem under some reasonable assumptions. A shortest‐path based algorithm is proposed to solve this optimization problem. At last, the case of railway detection is studied for better understanding of our model.

Contact Information

If you have any questions or queries on the Services Transactions on Services Computing, please send email to ijsc DOT HiPore AT gmail.com.