Pub Date : 2011-07-04DOI: 10.1109/SERVICES.2011.61
T. Aihkisalo, Tuomas Paaso
The performance of web services depends to a great extent on the efficiency of data transfer and on a number of factors related to it. Such factors are the network's possible latency, the efficiency of the used data marshalling and unmarshalling scheme, and the resulting length of the chosen message wire format. Several object marshalling and unmarshalling schemes aimed for data transfer in the web service domain were tested. The chosen schemes relied on XML, JSON and other binary alternatives. The practical marshalling and unmarshalling performance was measured and calculated. The results were analysed as regards pure effective marshalling and unmarshalling throughput and also concerning the resulting overhead affecting the efficiency of network transmission. The results show not only the implications on the performance of the chosen marshalling scheme but also the effect of serialization method and format. It was also clearly demonstrated that JSON is not always the best choice over the traditional XML when aiming at a high performance web services.
{"title":"A Performance Comparison of Web Service Object Marshalling and Unmarshalling Solutions","authors":"T. Aihkisalo, Tuomas Paaso","doi":"10.1109/SERVICES.2011.61","DOIUrl":"https://doi.org/10.1109/SERVICES.2011.61","url":null,"abstract":"The performance of web services depends to a great extent on the efficiency of data transfer and on a number of factors related to it. Such factors are the network's possible latency, the efficiency of the used data marshalling and unmarshalling scheme, and the resulting length of the chosen message wire format. Several object marshalling and unmarshalling schemes aimed for data transfer in the web service domain were tested. The chosen schemes relied on XML, JSON and other binary alternatives. The practical marshalling and unmarshalling performance was measured and calculated. The results were analysed as regards pure effective marshalling and unmarshalling throughput and also concerning the resulting overhead affecting the efficiency of network transmission. The results show not only the implications on the performance of the chosen marshalling scheme but also the effect of serialization method and format. It was also clearly demonstrated that JSON is not always the best choice over the traditional XML when aiming at a high performance web services.","PeriodicalId":429726,"journal":{"name":"2011 IEEE World Congress on Services","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129055059","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2011-07-04DOI: 10.1109/SERVICES.2011.32
T. Critchlow, George Chin
Over the past decade, workflows have been successfully applied to a number of scientific domains with great success. Workflow engines are now commonly used across scientific disciplines to automate mundane tasks, collect provenance, and orchestrate complex processes. However, workflows have not yet made significant strides managing fine-grain, concurrent tasks directly on supercomputing platforms. As scientific computing becomes an increasingly important discovery method and high performance computing environments become more complex, addressing this gap becomes critical. Using a simple use case as motivation, this paper describes the current barriers to using workflow engines in a supercomputing environment and outlines the new capabilities that must be provided if workflows are to be successfully applied in this context.
{"title":"Supercomputing and Scientific Workflows Gaps and Requirements","authors":"T. Critchlow, George Chin","doi":"10.1109/SERVICES.2011.32","DOIUrl":"https://doi.org/10.1109/SERVICES.2011.32","url":null,"abstract":"Over the past decade, workflows have been successfully applied to a number of scientific domains with great success. Workflow engines are now commonly used across scientific disciplines to automate mundane tasks, collect provenance, and orchestrate complex processes. However, workflows have not yet made significant strides managing fine-grain, concurrent tasks directly on supercomputing platforms. As scientific computing becomes an increasingly important discovery method and high performance computing environments become more complex, addressing this gap becomes critical. Using a simple use case as motivation, this paper describes the current barriers to using workflow engines in a supercomputing environment and outlines the new capabilities that must be provided if workflows are to be successfully applied in this context.","PeriodicalId":429726,"journal":{"name":"2011 IEEE World Congress on Services","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127613295","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2011-07-04DOI: 10.1109/SERVICES.2011.48
Nabil El Ioini, A. Sillitti
The advance in web services (WS) and service oriented architecture (SOA) applications has led to the development of new types of systems in which different heterogeneous components and platforms can connect and collaborate to solve a business problem. This advancement adds a new level of abstraction to the existing stack of technologies and development methodologies, but it adds also new challenges. One such a big challenge is testing. From the client prospective, a Web Service is a black box that needs to be tested before being used, mainly to confirm the claims of services' providers about the quality of their services. By calling a WS, we delegate part of our business logic to an external provider to do it for us. Thus, we have no control of what could happen during the execution of that part of the business logic. To this end, many testing approaches and techniques have been proposed in the literature to address various aspects related to WS testing. In our effort to improve WS testing infrastructures, we propose a framework for service integrators to collaborate during Web Services testing by making test suites open to the public and share testing results.
{"title":"Open Web Services Testing","authors":"Nabil El Ioini, A. Sillitti","doi":"10.1109/SERVICES.2011.48","DOIUrl":"https://doi.org/10.1109/SERVICES.2011.48","url":null,"abstract":"The advance in web services (WS) and service oriented architecture (SOA) applications has led to the development of new types of systems in which different heterogeneous components and platforms can connect and collaborate to solve a business problem. This advancement adds a new level of abstraction to the existing stack of technologies and development methodologies, but it adds also new challenges. One such a big challenge is testing. From the client prospective, a Web Service is a black box that needs to be tested before being used, mainly to confirm the claims of services' providers about the quality of their services. By calling a WS, we delegate part of our business logic to an external provider to do it for us. Thus, we have no control of what could happen during the execution of that part of the business logic. To this end, many testing approaches and techniques have been proposed in the literature to address various aspects related to WS testing. In our effort to improve WS testing infrastructures, we propose a framework for service integrators to collaborate during Web Services testing by making test suites open to the public and share testing results.","PeriodicalId":429726,"journal":{"name":"2011 IEEE World Congress on Services","volume":"1715 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127452979","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2011-07-04DOI: 10.1109/SERVICES.2011.97
V. Krithika, Arshinder Kaur, K. Sekaran, C. Rajendran
The World Wide Web environment has made all kind of services available online be it a simple movie ticket booking or the most complex processes such as outsourcing and banking. The services that are offered offline and semi-online (in which case part of the service transactions are online and part of it offline) are the result of the collaboration of static entities resulting in static service supply chains. The advent of enablers like Service Oriented Architecture and development of web service applications has enabled online / dynamic service supply chain networks (SSCNs) formed by dynamic collaboration of many serving entities. The entities in web SSCNs are interdependent and the performance of one entity impacts the performance of other entities as well as overall performance of service network. It is important to study the relationship and dependency between each entity of web SSCNs. Once the relationship is identified, it will help in devising some composite performance indicator for the entire service supply chain considering the interests of service providers and clients. The globalization era demands all services to be online and useable everywhere while delivering best possible quality. The dynamic service supply chains are mostly pure online services. We take a scenario based illustration of two such online service supply chains to show the feasibility of the concept.
{"title":"Developing a Conceptual Relationship between Web Service Supply Chain Entities","authors":"V. Krithika, Arshinder Kaur, K. Sekaran, C. Rajendran","doi":"10.1109/SERVICES.2011.97","DOIUrl":"https://doi.org/10.1109/SERVICES.2011.97","url":null,"abstract":"The World Wide Web environment has made all kind of services available online be it a simple movie ticket booking or the most complex processes such as outsourcing and banking. The services that are offered offline and semi-online (in which case part of the service transactions are online and part of it offline) are the result of the collaboration of static entities resulting in static service supply chains. The advent of enablers like Service Oriented Architecture and development of web service applications has enabled online / dynamic service supply chain networks (SSCNs) formed by dynamic collaboration of many serving entities. The entities in web SSCNs are interdependent and the performance of one entity impacts the performance of other entities as well as overall performance of service network. It is important to study the relationship and dependency between each entity of web SSCNs. Once the relationship is identified, it will help in devising some composite performance indicator for the entire service supply chain considering the interests of service providers and clients. The globalization era demands all services to be online and useable everywhere while delivering best possible quality. The dynamic service supply chains are mostly pure online services. We take a scenario based illustration of two such online service supply chains to show the feasibility of the concept.","PeriodicalId":429726,"journal":{"name":"2011 IEEE World Congress on Services","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127478436","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2011-07-04DOI: 10.1109/SERVICES.2011.107
D. Phatak, A. Sherman, J. Pinkston
Maintaining the confidentiality of data sent toclouds is a vital issue that must be satisfactorily resolvedas a pre-condition in order for the cloud computingparadigm to survive and thrive. In this paper we explorea completely new paradigm to approximately achievethe functionality implied by "Oblivious Data Processing(ODP)". Our strategy is to partition the data as wellas the underlying Residue Number System (RNS) in theResidue Domain(RD) and then distribute and processthe partitions independently.
{"title":"A New Paradigm to Approximate Oblivious Data Processing (ODP) for Data Confidentiality in Cloud Computing","authors":"D. Phatak, A. Sherman, J. Pinkston","doi":"10.1109/SERVICES.2011.107","DOIUrl":"https://doi.org/10.1109/SERVICES.2011.107","url":null,"abstract":"Maintaining the confidentiality of data sent toclouds is a vital issue that must be satisfactorily resolvedas a pre-condition in order for the cloud computingparadigm to survive and thrive. In this paper we explorea completely new paradigm to approximately achievethe functionality implied by \"Oblivious Data Processing(ODP)\". Our strategy is to partition the data as wellas the underlying Residue Number System (RNS) in theResidue Domain(RD) and then distribute and processthe partitions independently.","PeriodicalId":429726,"journal":{"name":"2011 IEEE World Congress on Services","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132800199","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2011-07-04DOI: 10.1109/SERVICES.2011.42
Honghao Gao, Huai-kou Miao, Shengbo Chen, Jia Mei
As Web services are becoming more and more complex, there is an increasing concern about how to guarantee the correctness and safety of Web services composition. This has driven many researchers to study the performance analysis of dynamic atomic service selection, as well as functional verifications. In this paper, we focus on not only modeling the behaviors of atomic service, but also verifying the properties in a quantitative way. First, we apply probabilistic timed model checking to model and verify the behaviors of atomic service by extending interface automata, and propose a technique to formally estimate software performance which exhibits stochastic behaviors with time constrains. Second, the probabilistic-tic timed computation tree logic (PTCTL) formulae are used to express the reliability properties. Third, a failure may occur stochastically when an invocation is triggered through interface operation. We present an internal interaction model, based on which we can dynamically pick out a highest reliable execution sequence for Web services composition. Finally, a case study is demonstrated and experimental results are discussed. In conclusion, our approach provides with an underlying guideline for Web services composition.
{"title":"Probabilistic Timed Model Checking for Atomic Web Service","authors":"Honghao Gao, Huai-kou Miao, Shengbo Chen, Jia Mei","doi":"10.1109/SERVICES.2011.42","DOIUrl":"https://doi.org/10.1109/SERVICES.2011.42","url":null,"abstract":"As Web services are becoming more and more complex, there is an increasing concern about how to guarantee the correctness and safety of Web services composition. This has driven many researchers to study the performance analysis of dynamic atomic service selection, as well as functional verifications. In this paper, we focus on not only modeling the behaviors of atomic service, but also verifying the properties in a quantitative way. First, we apply probabilistic timed model checking to model and verify the behaviors of atomic service by extending interface automata, and propose a technique to formally estimate software performance which exhibits stochastic behaviors with time constrains. Second, the probabilistic-tic timed computation tree logic (PTCTL) formulae are used to express the reliability properties. Third, a failure may occur stochastically when an invocation is triggered through interface operation. We present an internal interaction model, based on which we can dynamically pick out a highest reliable execution sequence for Web services composition. Finally, a case study is demonstrated and experimental results are discussed. In conclusion, our approach provides with an underlying guideline for Web services composition.","PeriodicalId":429726,"journal":{"name":"2011 IEEE World Congress on Services","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130417494","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2011-07-04DOI: 10.1109/SERVICES.2011.13
D. Tamburri, P. Lago
Cloud computing is an emerging paradigm able of flexibly offering IT resources and services over the Internet. Cloud computing's high flexibility needs novel software engineering approaches, and technologies to deliver agile, flexible, scalable yet secure software solutions with full technical (e.g. QoS, service continuity etc.) and business gain (e.g. profit, corporate value, utility etc.). Agile Service Networks are themselves an emerging paradigm envisioning collaborative and dynamic service interactions (network edges) among global service-oriented applications (network nodes). We argue that Agile Service Networks can be used as a paradigm for software engineering in the cloud, since they are indeed able to deliver solutions which are both compliant to the cloud's needs and able to harness it, bringing about its full potential. In this paper we identify requirements for the cloud, and show how these can be satisfied using Agile Service Networks.
{"title":"Satisfying Cloud Computing Requirements with Agile Service Networks","authors":"D. Tamburri, P. Lago","doi":"10.1109/SERVICES.2011.13","DOIUrl":"https://doi.org/10.1109/SERVICES.2011.13","url":null,"abstract":"Cloud computing is an emerging paradigm able of flexibly offering IT resources and services over the Internet. Cloud computing's high flexibility needs novel software engineering approaches, and technologies to deliver agile, flexible, scalable yet secure software solutions with full technical (e.g. QoS, service continuity etc.) and business gain (e.g. profit, corporate value, utility etc.). Agile Service Networks are themselves an emerging paradigm envisioning collaborative and dynamic service interactions (network edges) among global service-oriented applications (network nodes). We argue that Agile Service Networks can be used as a paradigm for software engineering in the cloud, since they are indeed able to deliver solutions which are both compliant to the cloud's needs and able to harness it, bringing about its full potential. In this paper we identify requirements for the cloud, and show how these can be satisfied using Agile Service Networks.","PeriodicalId":429726,"journal":{"name":"2011 IEEE World Congress on Services","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133334155","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2011-07-04DOI: 10.1109/SERVICES.2011.92
A. Celesti, F. Tusa, M. Villari, A. Puliafito
Nowadays, the cloud computing ecosystem is more and more distributed and heterogeneous. Cloud service providers begin to build their services using cloud-based services offered by other service providers. This raises several issues due to integration between services and provider themselves. In this paper, we propose a practice addressing such a concern in a "Vertical Supply Chain" scenario of distributed clouds.
{"title":"An Approach to Enable Cloud Service Providers to Arrange IaaS, PaaS, and Saas Using External Virtualization Infrastructures","authors":"A. Celesti, F. Tusa, M. Villari, A. Puliafito","doi":"10.1109/SERVICES.2011.92","DOIUrl":"https://doi.org/10.1109/SERVICES.2011.92","url":null,"abstract":"Nowadays, the cloud computing ecosystem is more and more distributed and heterogeneous. Cloud service providers begin to build their services using cloud-based services offered by other service providers. This raises several issues due to integration between services and provider themselves. In this paper, we propose a practice addressing such a concern in a \"Vertical Supply Chain\" scenario of distributed clouds.","PeriodicalId":429726,"journal":{"name":"2011 IEEE World Congress on Services","volume":"90 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132115680","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2011-07-04DOI: 10.1109/SERVICES.2011.45
M. Abbasy, Bharanidharan Shanmugam
The main target of this paper is to propose an algorithm to implement data hiding in DNA sequences to increase the confidentiality and complexity by using software point of view in cloud computing environments. By utilizing some interesting features of DNA sequences, the implementation of a data hiding is applied in cloud. The algorithm which has been proposed here is based on binary coding and complementary pair rules. Therefore, DNA reference sequence is chosen and a secret data M is hidden into it as well. As result of applying some steps, M´´´ is come out to upload to cloud environments. The process of identifying and extracting the original data M, hidden in DNA reference sequence begins once clients decide to use data. Furthermore, security issues are demonstrated to inspect the complexity of the algorithm.
{"title":"Enabling Data Hiding for Resource Sharing in Cloud Computing Environments Based on DNA Sequences","authors":"M. Abbasy, Bharanidharan Shanmugam","doi":"10.1109/SERVICES.2011.45","DOIUrl":"https://doi.org/10.1109/SERVICES.2011.45","url":null,"abstract":"The main target of this paper is to propose an algorithm to implement data hiding in DNA sequences to increase the confidentiality and complexity by using software point of view in cloud computing environments. By utilizing some interesting features of DNA sequences, the implementation of a data hiding is applied in cloud. The algorithm which has been proposed here is based on binary coding and complementary pair rules. Therefore, DNA reference sequence is chosen and a secret data M is hidden into it as well. As result of applying some steps, M´´´ is come out to upload to cloud environments. The process of identifying and extracting the original data M, hidden in DNA reference sequence begins once clients decide to use data. Furthermore, security issues are demonstrated to inspect the complexity of the algorithm.","PeriodicalId":429726,"journal":{"name":"2011 IEEE World Congress on Services","volume":"88 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132191915","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2011-07-04DOI: 10.1109/SERVICES.2011.77
Soumia Kessal, N. Simoni
The deployment of services requires a significant investment from service providers, in order to maximize their Return On Investment. To create and launch new services offerings rapidly and successfully, they must deploy their services in the adequate hosting environment. We propose in this paper "a Deployment of Service Elements based on QoS" to meet the Service Level Agreement (SLA) from he deployment phase. To do this, a QoS and service models are necessary to automate the mapping between the design and operation. A "Usage Profile" is defined for this deployment.
{"title":"A Deployment of Service Elements Based on QoS","authors":"Soumia Kessal, N. Simoni","doi":"10.1109/SERVICES.2011.77","DOIUrl":"https://doi.org/10.1109/SERVICES.2011.77","url":null,"abstract":"The deployment of services requires a significant investment from service providers, in order to maximize their Return On Investment. To create and launch new services offerings rapidly and successfully, they must deploy their services in the adequate hosting environment. We propose in this paper \"a Deployment of Service Elements based on QoS\" to meet the Service Level Agreement (SLA) from he deployment phase. To do this, a QoS and service models are necessary to automate the mapping between the design and operation. A \"Usage Profile\" is defined for this deployment.","PeriodicalId":429726,"journal":{"name":"2011 IEEE World Congress on Services","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134176101","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：