Data intensive applications, e.g. in life sciences, pose new efficiency challenges to the service composition problem. Since today computing power is mainly increased by multiplication of CPU cores, algorithms have to be redesigned to benefit from this evolution. In this paper we present a framework for parallelizing service composition algorithms investigating how to partition the composition problem into multiple parallel threads. But in contrast to intuition, the straightforward parallelization techniques do not lead to superior performance as our baseline evaluation reveals. To harness the full power of multicore architectures, we propose two novel approaches to evenly distribute the workload in a sophisticated fashion. In fact, our extensive experiments on practical life science data resulted in an impressive speedup of over 300% using only 4 cores. Moreover, we show that our techniques can also benefit from all advanced pruning heuristics used in sequential algorithms.
{"title":"Highly Scalable Web Service Composition Using Binary Tree-Based Parallelization","authors":"Patrick Hennig, Wolf-Tilo Balke","doi":"10.1109/ICWS.2010.45","DOIUrl":"https://doi.org/10.1109/ICWS.2010.45","url":null,"abstract":"Data intensive applications, e.g. in life sciences, pose new efficiency challenges to the service composition problem. Since today computing power is mainly increased by multiplication of CPU cores, algorithms have to be redesigned to benefit from this evolution. In this paper we present a framework for parallelizing service composition algorithms investigating how to partition the composition problem into multiple parallel threads. But in contrast to intuition, the straightforward parallelization techniques do not lead to superior performance as our baseline evaluation reveals. To harness the full power of multicore architectures, we propose two novel approaches to evenly distribute the workload in a sophisticated fashion. In fact, our extensive experiments on practical life science data resulted in an impressive speedup of over 300% using only 4 cores. Moreover, we show that our techniques can also benefit from all advanced pruning heuristics used in sequential algorithms.","PeriodicalId":170573,"journal":{"name":"2010 IEEE International Conference on Web Services","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116444519","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}
This paper addresses one of the major problems of SOA software development: the lack of support for testing complex service-oriented systems. The research community has developed various means for checking individual Web services but has not come up with satisfactory solutions for testing systems that operate in service-based environments and, therefore, need realistic testbeds for evaluating their quality. We regard this as an unnecessary burden for SOA engineers. As a proposed solution for this issue, we present the Genesis2 testbed generator framework. Genesis2 supports engineers in modeling testbeds and programming their behavior. Out of these models it generates running instances of Web services, clients, registries, and other entities in order to emulate realistic SOA environments. By generating real testbeds, our approach assists engineers in performing runtime tests of their systems and particular focus has been put on the framework’s extensibility to allow the emulation of arbitrarily complex environments. Furthermore, by exploiting the advantages of the Groovy language, Genesis2 provides an intuitive yet powerful scripting interface for testbed control.
{"title":"Script-Based Generation of Dynamic Testbeds for SOA","authors":"Lukasz Juszczyk, S. Dustdar","doi":"10.1109/ICWS.2010.75","DOIUrl":"https://doi.org/10.1109/ICWS.2010.75","url":null,"abstract":"This paper addresses one of the major problems of SOA software development: the lack of support for testing complex service-oriented systems. The research community has developed various means for checking individual Web services but has not come up with satisfactory solutions for testing systems that operate in service-based environments and, therefore, need realistic testbeds for evaluating their quality. We regard this as an unnecessary burden for SOA engineers. As a proposed solution for this issue, we present the Genesis2 testbed generator framework. Genesis2 supports engineers in modeling testbeds and programming their behavior. Out of these models it generates running instances of Web services, clients, registries, and other entities in order to emulate realistic SOA environments. By generating real testbeds, our approach assists engineers in performing runtime tests of their systems and particular focus has been put on the framework’s extensibility to allow the emulation of arbitrarily complex environments. Furthermore, by exploiting the advantages of the Groovy language, Genesis2 provides an intuitive yet powerful scripting interface for testbed control.","PeriodicalId":170573,"journal":{"name":"2010 IEEE International Conference on Web Services","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124498132","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}
Web service composition, i.e., WSC, has emerged as a promising way to integrate various distributed computing resources for complex application requirements. However, much computation time is needed to determine the optimal composite solution, which embarrasses the popularity of WSC in actual real time applications. In view of this challenge, in this paper, a heuristic service composition method, named LOEM (Local Optimization and Enumeration Method, LOEM), is proposed. It aims at filtering the candidates of each task to a small number of promising ones by local selection, and then enumerates all the composite solutions to pursue a near-to-optimal one. The experiment results demonstrate the feasibility of LOEM in dealing with the WSC problems.
{"title":"Combining Local Optimization and Enumeration for QoS-aware Web Service Composition","authors":"Lianyong Qi, Ying Tang, Wanchun Dou, Jinjun Chen","doi":"10.1109/ICWS.2010.62","DOIUrl":"https://doi.org/10.1109/ICWS.2010.62","url":null,"abstract":"Web service composition, i.e., WSC, has emerged as a promising way to integrate various distributed computing resources for complex application requirements. However, much computation time is needed to determine the optimal composite solution, which embarrasses the popularity of WSC in actual real time applications. In view of this challenge, in this paper, a heuristic service composition method, named LOEM (Local Optimization and Enumeration Method, LOEM), is proposed. It aims at filtering the candidates of each task to a small number of promising ones by local selection, and then enumerates all the composite solutions to pursue a near-to-optimal one. The experiment results demonstrate the feasibility of LOEM in dealing with the WSC problems.","PeriodicalId":170573,"journal":{"name":"2010 IEEE International Conference on Web Services","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116138351","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}
Vulnerability detection tools are frequently considered the silver-bullet for detecting vulnerabilities in web services. However, research shows that the effectiveness of most of those tools is very low and that using the wrong tool may lead to the deployment of services with undetected vulnerabilities. In this paper we propose a benchmarking approach to assess and compare the effectiveness of vulnerability detection tools in web services environments. This approach was used to define a concrete benchmark for SQL Injection vulnerability detection tools. This benchmark is demonstrated by a real example of benchmarking several widely used tools, including four penetration-testers, three static code analyzers, and one anomaly detector. Results show that the benchmark accurately portrays the effectiveness of vulnerability detection tools and suggest that the proposed approach can be applied in the field.
{"title":"Benchmarking Vulnerability Detection Tools for Web Services","authors":"Nuno Antunes, M. Vieira","doi":"10.1109/ICWS.2010.76","DOIUrl":"https://doi.org/10.1109/ICWS.2010.76","url":null,"abstract":"Vulnerability detection tools are frequently considered the silver-bullet for detecting vulnerabilities in web services. However, research shows that the effectiveness of most of those tools is very low and that using the wrong tool may lead to the deployment of services with undetected vulnerabilities. In this paper we propose a benchmarking approach to assess and compare the effectiveness of vulnerability detection tools in web services environments. This approach was used to define a concrete benchmark for SQL Injection vulnerability detection tools. This benchmark is demonstrated by a real example of benchmarking several widely used tools, including four penetration-testers, three static code analyzers, and one anomaly detector. Results show that the benchmark accurately portrays the effectiveness of vulnerability detection tools and suggest that the proposed approach can be applied in the field.","PeriodicalId":170573,"journal":{"name":"2010 IEEE International Conference on Web Services","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115096417","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}
Web service composition is a topic bringing several issues to be resolved. Our work deals with the effectiveness and scalability of service composition. During composition we consider QoS and pre-/post-conditions of single services to create a composite service satisfying the user needs the best. Regarding pre-/post-conditions we propose an approach to fast determination of which services produce results expected by the user, i.e. the post-condition of which services implicates the desired condition defined in the user goal. This paper proposes also an approach to restriction on the service space which provided a dramatic improvement in terms of composition time.
{"title":"QoS Aware Semantic Web Service Composition Approach Considering Pre/Postconditions","authors":"Peter Bartalos, M. Bieliková","doi":"10.1109/ICWS.2010.90","DOIUrl":"https://doi.org/10.1109/ICWS.2010.90","url":null,"abstract":"Web service composition is a topic bringing several issues to be resolved. Our work deals with the effectiveness and scalability of service composition. During composition we consider QoS and pre-/post-conditions of single services to create a composite service satisfying the user needs the best. Regarding pre-/post-conditions we propose an approach to fast determination of which services produce results expected by the user, i.e. the post-condition of which services implicates the desired condition defined in the user goal. This paper proposes also an approach to restriction on the service space which provided a dramatic improvement in terms of composition time.","PeriodicalId":170573,"journal":{"name":"2010 IEEE International Conference on Web Services","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115030337","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}
Since Representational State Transfer (REST) architecture was proposed by Fielding in early 1990s for distributed hypermedia systems, it has become a popular architectural style of choice in various computing environments. However, REST was not originally designed to support enterprise requirements, in particular the accountability requirements that are crucial for the business services offered through the Software as a Service (SaaS) and Cloud Computing environments. In this paper, we propose an Accountable State Transfer (AST) architecture to bridge the accountability gap in REST. With AST, service participants can be held accountable for each representational state transfer during service consumption. A formal service contract model with a hybrid reasoning mechanism and a novel accountable state transfer protocol are designed as the mechanisms underpinning the AST architecture. Moreover, we implement a Credit Check service prototype based on AST, demonstrating the practicality of such architecture. Inheriting REST’s scalability, AST architecture provides the much needed accountability capabilities for the virtual service delivery environment.
自从Fielding在20世纪90年代早期为分布式超媒体系统提出具象状态传输(Representational State Transfer, REST)架构以来，它已经成为各种计算环境中流行的架构风格选择。然而，REST最初并不是为支持企业需求而设计的，特别是对通过软件即服务(SaaS)和云计算环境提供的业务服务至关重要的责任要求。在本文中，我们提出了一个可问责状态转移(AST)架构来弥补REST中的可问责性差距。使用AST，服务参与者可以对服务消费期间的每个表示状态转移负责。设计了一种具有混合推理机制的正式服务契约模型和一种新的可问责状态传输协议作为AST体系结构的支撑机制。此外，我们还实现了一个基于AST的信用检查服务原型，证明了这种架构的实用性。AST体系结构继承了REST的可伸缩性，为虚拟服务交付环境提供了急需的责任能力。
{"title":"From Representational State Transfer to Accountable State Transfer Architecture","authors":"Joe Zou, Jing Mei, Yan Wang","doi":"10.1109/ICWS.2010.56","DOIUrl":"https://doi.org/10.1109/ICWS.2010.56","url":null,"abstract":"Since Representational State Transfer (REST) architecture was proposed by Fielding in early 1990s for distributed hypermedia systems, it has become a popular architectural style of choice in various computing environments. However, REST was not originally designed to support enterprise requirements, in particular the accountability requirements that are crucial for the business services offered through the Software as a Service (SaaS) and Cloud Computing environments. In this paper, we propose an Accountable State Transfer (AST) architecture to bridge the accountability gap in REST. With AST, service participants can be held accountable for each representational state transfer during service consumption. A formal service contract model with a hybrid reasoning mechanism and a novel accountable state transfer protocol are designed as the mechanisms underpinning the AST architecture. Moreover, we implement a Credit Check service prototype based on AST, demonstrating the practicality of such architecture. Inheriting REST’s scalability, AST architecture provides the much needed accountability capabilities for the virtual service delivery environment.","PeriodicalId":170573,"journal":{"name":"2010 IEEE International Conference on Web Services","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127703276","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}
IPTV has emerged as the future standard of television and drawn enormous attention from both industry and research communities. Among different IPTV services, on-demand services are the most popular ones due to their convenience and rich content. However, supporting scalable and reliable on-demand IPTV services remains to be an important challenge. Existing IPTV architecture dedicates a centralized regional station to serve subscribers in the respective region regardless of temporal and spatial dynamics in service demand. As a result, it may cause significant imbalance of resource utilization and service provisioning delay at different stations, especially with increasing subscribers and video content. In this paper, we propose to allow IPTV stations of different regions to collaboratively serve user requests for delivering scalable and reliable IPTV services. One key challenge in achieving this station-wise collaboration is to route service requests to appropriate stations according to cost-effectiveness and load distribution in a fully distributed manner. We devise a novel request dispatching protocol which runs on each IPTV station, and yet forms a collaborative dispatching strategy that avoids hot spots and reduces service delivery cost at the same time. Our experiment results suggest that our service request dispatching algorithm significantly improves the scalability of on-demand IPTV services for the existing IPTV architecture.
{"title":"Scalable and Reliable IPTV Service Through Collaborative Request Dispatching","authors":"S. Meng, Ling Liu, Jianwei Yin","doi":"10.1109/ICWS.2010.26","DOIUrl":"https://doi.org/10.1109/ICWS.2010.26","url":null,"abstract":"IPTV has emerged as the future standard of television and drawn enormous attention from both industry and research communities. Among different IPTV services, on-demand services are the most popular ones due to their convenience and rich content. However, supporting scalable and reliable on-demand IPTV services remains to be an important challenge. Existing IPTV architecture dedicates a centralized regional station to serve subscribers in the respective region regardless of temporal and spatial dynamics in service demand. As a result, it may cause significant imbalance of resource utilization and service provisioning delay at different stations, especially with increasing subscribers and video content. In this paper, we propose to allow IPTV stations of different regions to collaboratively serve user requests for delivering scalable and reliable IPTV services. One key challenge in achieving this station-wise collaboration is to route service requests to appropriate stations according to cost-effectiveness and load distribution in a fully distributed manner. We devise a novel request dispatching protocol which runs on each IPTV station, and yet forms a collaborative dispatching strategy that avoids hot spots and reduces service delivery cost at the same time. Our experiment results suggest that our service request dispatching algorithm significantly improves the scalability of on-demand IPTV services for the existing IPTV architecture.","PeriodicalId":170573,"journal":{"name":"2010 IEEE International Conference on Web Services","volume":"PP 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126418398","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}
Service Oriented Architectures enable markets of functionally equivalent service providers delivering services at different Quality of Service (QoS) and cost levels. Under these circumstances, there is a need for mechanisms to optimally select service providers at run-time to support a business process execution so that a utility function for the business process is maximized subject to QoS and cost constraints. This is an NP-hard problem. This paper investigates this problem when the utility function is expressed in terms of multiple QoS metrics. An efficient optimal algorithm is presented, which eliminates the need to exhaustively search the state space. This algorithm can be used for small to medium size problems. A very efficient heuristic solution is also presented and scientifically evaluated against the optimal solution on a large set of randomly generated business processes.
{"title":"Utility-Based Optimal Service Selection for Business Processes in Service Oriented Architectures","authors":"V. Dubey, D. Menascé","doi":"10.1109/ICWS.2010.33","DOIUrl":"https://doi.org/10.1109/ICWS.2010.33","url":null,"abstract":"Service Oriented Architectures enable markets of functionally equivalent service providers delivering services at different Quality of Service (QoS) and cost levels. Under these circumstances, there is a need for mechanisms to optimally select service providers at run-time to support a business process execution so that a utility function for the business process is maximized subject to QoS and cost constraints. This is an NP-hard problem. This paper investigates this problem when the utility function is expressed in terms of multiple QoS metrics. An efficient optimal algorithm is presented, which eliminates the need to exhaustively search the state space. This algorithm can be used for small to medium size problems. A very efficient heuristic solution is also presented and scientifically evaluated against the optimal solution on a large set of randomly generated business processes.","PeriodicalId":170573,"journal":{"name":"2010 IEEE International Conference on Web Services","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129987372","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}
Yu Chen Zhou, X. Liu, Xi Ning Wang, Liang Xue, Chen Tian, X. Liang
With the popularity of SOA, SOA policy becomes one of the core technical enablers for SOA governance and management. Different in several aspects from traditional policy for distributed system management, policy applied in SOA solutions needs to take into account various policy types and enforcement points in different layers of SOA solution stack and different phases of SOA lifecycle. As well, it has the unique requirements on compliance to match existing SOA technologies and characteristics, as simplicity, standardization, high performance, etc. In this paper, a novel context model based SOA policy management framework by innovatively extending W3C Service Modeling Language (SML) and ISO Schematron is introduced. Firstly, a common context model distilled from SOA policy types typically including service policy, service governance policy, application policy and business policy, is presented. Then, the core components - context model based policy engine and definition tool are described. Finally, it is illustrated how the unified definition tools and policy engine are manipulated within the context model based SOA policy framework to manage and enforce policies in typical scenarios as service meta-data management, service match making and business process management. Based on the project, we participated in the works for defining W3C SML V1.1 working draft and proposed the works introduced in this paper to W3C SML Working Group. This paper demonstrates how these technologies and architectures significantly enhance the capability of SOA governance and management throughout whole SOA lifecycle and spanning the layers of SOA solution stack.
{"title":"Context Model Based SOA Policy Framework","authors":"Yu Chen Zhou, X. Liu, Xi Ning Wang, Liang Xue, Chen Tian, X. Liang","doi":"10.1109/ICWS.2010.115","DOIUrl":"https://doi.org/10.1109/ICWS.2010.115","url":null,"abstract":"With the popularity of SOA, SOA policy becomes one of the core technical enablers for SOA governance and management. Different in several aspects from traditional policy for distributed system management, policy applied in SOA solutions needs to take into account various policy types and enforcement points in different layers of SOA solution stack and different phases of SOA lifecycle. As well, it has the unique requirements on compliance to match existing SOA technologies and characteristics, as simplicity, standardization, high performance, etc. In this paper, a novel context model based SOA policy management framework by innovatively extending W3C Service Modeling Language (SML) and ISO Schematron is introduced. Firstly, a common context model distilled from SOA policy types typically including service policy, service governance policy, application policy and business policy, is presented. Then, the core components - context model based policy engine and definition tool are described. Finally, it is illustrated how the unified definition tools and policy engine are manipulated within the context model based SOA policy framework to manage and enforce policies in typical scenarios as service meta-data management, service match making and business process management. Based on the project, we participated in the works for defining W3C SML V1.1 working draft and proposed the works introduced in this paper to W3C SML Working Group. This paper demonstrates how these technologies and architectures significantly enhance the capability of SOA governance and management throughout whole SOA lifecycle and spanning the layers of SOA solution stack.","PeriodicalId":170573,"journal":{"name":"2010 IEEE International Conference on Web Services","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128986109","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}
This paper presents a middleware for building context-aware applications. One of the main components, Device Information Access (DIA), is discussed in detail. Since many kinds of devices (e.g., RFID, GPS, Bluetooth, etc.) can be used to collect the context information, the middleware defines the Device Information Access component to communicate with different devices. A set of interfaces are devised in DIA, and the common functions such as getting and setting a data element are defined in the interfaces. For each device, we shall provide an implementation of the interfaces to communicate with the corresponding servers or software agents. DIA can communicate with the software agents or servers using various protocols such as RMI, Web Services, and REST. In this way the access to the hardware are encapsulated by the middleware and virtualized to the end-point applications. The architecture of the middleware and the functions of DIA are discussed, and an empirical application is also developed to validate our design.
{"title":"A Uniform Device Information Access for Context-Aware Middleware","authors":"Weiping Li, Weijie Chu, F. Tung, Zhonghai Wu","doi":"10.1109/ICWS.2010.43","DOIUrl":"https://doi.org/10.1109/ICWS.2010.43","url":null,"abstract":"This paper presents a middleware for building context-aware applications. One of the main components, Device Information Access (DIA), is discussed in detail. Since many kinds of devices (e.g., RFID, GPS, Bluetooth, etc.) can be used to collect the context information, the middleware defines the Device Information Access component to communicate with different devices. A set of interfaces are devised in DIA, and the common functions such as getting and setting a data element are defined in the interfaces. For each device, we shall provide an implementation of the interfaces to communicate with the corresponding servers or software agents. DIA can communicate with the software agents or servers using various protocols such as RMI, Web Services, and REST. In this way the access to the hardware are encapsulated by the middleware and virtualized to the end-point applications. The architecture of the middleware and the functions of DIA are discussed, and an empirical application is also developed to validate our design.","PeriodicalId":170573,"journal":{"name":"2010 IEEE International Conference on Web Services","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126522923","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
扫码关注我们
求助内容：
应助结果提醒方式：