Malik Khalfallah, Nicolas Figay, M. Barhamgi, Catarina Ferreira Da Silva, P. Ghodous
Business process interoperability (BPI) is an important issue for distributed applications in collaborative environments. This problem is further complicated in dynamic collaborative environments where stakeholders can quit the network and be replaced by new ones. To date, existing approaches do not provide the necessary flexibility to handle the dynamic nature of the network. In this work a formal framework is developed which combines cross-organizational process specifications with mediation-based solutions to ensure BPI. The concepts defined in this framework are used to build flexible collaboration contracts that better handle the dynamicity of the network. The applicability of the framework has been illustrated through a real-life industrial use-case in the aerospace industry for collaborative aircraft design process. The proposed framework provides higher level concepts than existing process modeling languages which better captures the business intent behind the collaboration.
{"title":"Towards Combining Declarative Specification with On-the-Fly Mediation","authors":"Malik Khalfallah, Nicolas Figay, M. Barhamgi, Catarina Ferreira Da Silva, P. Ghodous","doi":"10.1109/SCC.2013.18","DOIUrl":"https://doi.org/10.1109/SCC.2013.18","url":null,"abstract":"Business process interoperability (BPI) is an important issue for distributed applications in collaborative environments. This problem is further complicated in dynamic collaborative environments where stakeholders can quit the network and be replaced by new ones. To date, existing approaches do not provide the necessary flexibility to handle the dynamic nature of the network. In this work a formal framework is developed which combines cross-organizational process specifications with mediation-based solutions to ensure BPI. The concepts defined in this framework are used to build flexible collaboration contracts that better handle the dynamicity of the network. The applicability of the framework has been illustrated through a real-life industrial use-case in the aerospace industry for collaborative aircraft design process. The proposed framework provides higher level concepts than existing process modeling languages which better captures the business intent behind the collaboration.","PeriodicalId":370898,"journal":{"name":"2013 IEEE International Conference on Services Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117097185","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}
Malik Khalfallah, Nicolas Figay, M. Barhamgi, P. Ghodous
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 and displayed through a standard-based user interface.
{"title":"Controlling the Evolution of Product-Based Collaboration Contracts","authors":"Malik Khalfallah, Nicolas Figay, M. Barhamgi, P. Ghodous","doi":"10.1109/SCC.2013.86","DOIUrl":"https://doi.org/10.1109/SCC.2013.86","url":null,"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 and displayed through a standard-based user interface.","PeriodicalId":370898,"journal":{"name":"2013 IEEE International Conference on Services Computing","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129641810","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}
R. Vaculín, R. Hull, M. Vukovic, F. Heath, Nathaniel Mills, Yutian Sun
Collaborative Decision Processes focus on long-running, multi-faceted decisions (e.g., the planning and approval process for a municipal development project) made by teams of people. Such decisions can draw on the crowd in a variety of ways, by enabling large-scale on-line brainstorming, crowd-sourced queries, and text mining to determine public sentiments and derive new insights. Such decision processes consist of a combination of structured and highly unconstrained, human-drive activities. This paper describes a framework and a prototype system for support of collaborative decision processes based on declarative, data-centric dynamic artifacts and Advanced Case Management.
{"title":"Supporting Collaborative Decision Processes","authors":"R. Vaculín, R. Hull, M. Vukovic, F. Heath, Nathaniel Mills, Yutian Sun","doi":"10.1109/SCC.2013.26","DOIUrl":"https://doi.org/10.1109/SCC.2013.26","url":null,"abstract":"Collaborative Decision Processes focus on long-running, multi-faceted decisions (e.g., the planning and approval process for a municipal development project) made by teams of people. Such decisions can draw on the crowd in a variety of ways, by enabling large-scale on-line brainstorming, crowd-sourced queries, and text mining to determine public sentiments and derive new insights. Such decision processes consist of a combination of structured and highly unconstrained, human-drive activities. This paper describes a framework and a prototype system for support of collaborative decision processes based on declarative, data-centric dynamic artifacts and Advanced Case Management.","PeriodicalId":370898,"journal":{"name":"2013 IEEE International Conference on Services Computing","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129940087","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}
Victor W. Chu, R. Wong, Wuhui Chen, Incheon Paik, Chi-Hung Chi
Web services have become a primary mechanism for consuming resources available on the Internet. As more and more services are published on the Web, automated service discovery is critical to consumers to identify relevant and reliable services efficiently. In this paper, we enhance the Web Service Crawler Engine (WSCE) framework by introducing comparison measures to allow for more accurate identification, discovery and ranking of relevant Web services. To discover services effectively, we need to be able to measure and compare the similarity among services. Most ontology-based and IR-based discovery techniques assume that service input/output are simple data types when calculating service similarity. However, real-world services published on the Web usually have complex data types input/output parameters. Furthermore, a good match of parameters does not guarantee good usability and good reliability. The relevant services must be further evaluated by users' past experiences, based on both objective and subjective measures, to make optimal solution selection possible. This paper proposes a service matchmaking algorithm that considers the complex data types of service input/output parameters, as well as experience-based objective and subjective measures for ranking. Experiments show that our approach performs better than previous works that only consider simple data types.
{"title":"Service Discovery Based on Objective and Subjective Measures","authors":"Victor W. Chu, R. Wong, Wuhui Chen, Incheon Paik, Chi-Hung Chi","doi":"10.1109/SCC.2013.33","DOIUrl":"https://doi.org/10.1109/SCC.2013.33","url":null,"abstract":"Web services have become a primary mechanism for consuming resources available on the Internet. As more and more services are published on the Web, automated service discovery is critical to consumers to identify relevant and reliable services efficiently. In this paper, we enhance the Web Service Crawler Engine (WSCE) framework by introducing comparison measures to allow for more accurate identification, discovery and ranking of relevant Web services. To discover services effectively, we need to be able to measure and compare the similarity among services. Most ontology-based and IR-based discovery techniques assume that service input/output are simple data types when calculating service similarity. However, real-world services published on the Web usually have complex data types input/output parameters. Furthermore, a good match of parameters does not guarantee good usability and good reliability. The relevant services must be further evaluated by users' past experiences, based on both objective and subjective measures, to make optimal solution selection possible. This paper proposes a service matchmaking algorithm that considers the complex data types of service input/output parameters, as well as experience-based objective and subjective measures for ranking. Experiments show that our approach performs better than previous works that only consider simple data types.","PeriodicalId":370898,"journal":{"name":"2013 IEEE International Conference on Services Computing","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125572295","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}
Mingdong Tang, Yu Xu, Jianxun Liu, Zibin Zheng, Xiaoqing Frank Liu
With the rapid growth in the number of available services, recommending suitable services to users becomes increasingly important. A number of collaborative service recommendation methods based on user experiences have been proposed for this purpose. Most of them adopt the similarity-based Collaborative Filtering (CF) technique, which tends to identify similar users for a target user and recommends to the target user the services preferred by the similar users. However, a user similar to the target user is unnecessarily trustworthy to him/her. Therefore, the results recommended by similarity-based CF are probably unreliable. Moreover, existing service recommendation methods seldom incorporate social trust relationships among service users into service recommendation. In this paper, we propose a collaborative, trust-aware service recommendation method for service-oriented environments with social networks. The method is based on an integration of the user-service relation and the user-user social relation. Experimental results demonstrate that our service recommendation method significantly outperforms conventional similarity-based recommendation and trust-based service recommendation methods.
{"title":"Trust-Aware Service Recommendation via Exploiting Social Networks","authors":"Mingdong Tang, Yu Xu, Jianxun Liu, Zibin Zheng, Xiaoqing Frank Liu","doi":"10.1109/SCC.2013.15","DOIUrl":"https://doi.org/10.1109/SCC.2013.15","url":null,"abstract":"With the rapid growth in the number of available services, recommending suitable services to users becomes increasingly important. A number of collaborative service recommendation methods based on user experiences have been proposed for this purpose. Most of them adopt the similarity-based Collaborative Filtering (CF) technique, which tends to identify similar users for a target user and recommends to the target user the services preferred by the similar users. However, a user similar to the target user is unnecessarily trustworthy to him/her. Therefore, the results recommended by similarity-based CF are probably unreliable. Moreover, existing service recommendation methods seldom incorporate social trust relationships among service users into service recommendation. In this paper, we propose a collaborative, trust-aware service recommendation method for service-oriented environments with social networks. The method is based on an integration of the user-service relation and the user-user social relation. Experimental results demonstrate that our service recommendation method significantly outperforms conventional similarity-based recommendation and trust-based service recommendation methods.","PeriodicalId":370898,"journal":{"name":"2013 IEEE International Conference on Services Computing","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126408298","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}
As the number of Web services grows and the diversity increases, it is imperative to bring semantics to Web services to provide richer descriptions. However, many solutions developed in the field of semantic annotation suffer from lack of relevant ontologies that are comprehensive enough to contain as many concepts as possible. Based on public open ontology, this paper presents an approach for augmenting semantics of Web services. For Web services in WSDL format, the semantics is enhanced by associating inputs and outputs with concepts from public open ontology. Then two methodologies based on match degree and service discovery respectively are described to evaluate the approach. With the support of OpenCyc, one experiment is carried out on OWLS-TC4 to test the effectiveness of the approach, the other experiment is conducted on 11836 WSDL files crawled from the Internet to expand the approach to a large number of Web services. The experimental results show that the approach performs well even when the number of Web services is large, moreover, it performs better when dealing with well-described Web services.
{"title":"Augmenting Semantics of Web Services Based on Public Open Ontology","authors":"Xiaocao Hu, Zhiyong Feng, Shizhan Chen","doi":"10.1109/SCC.2013.96","DOIUrl":"https://doi.org/10.1109/SCC.2013.96","url":null,"abstract":"As the number of Web services grows and the diversity increases, it is imperative to bring semantics to Web services to provide richer descriptions. However, many solutions developed in the field of semantic annotation suffer from lack of relevant ontologies that are comprehensive enough to contain as many concepts as possible. Based on public open ontology, this paper presents an approach for augmenting semantics of Web services. For Web services in WSDL format, the semantics is enhanced by associating inputs and outputs with concepts from public open ontology. Then two methodologies based on match degree and service discovery respectively are described to evaluate the approach. With the support of OpenCyc, one experiment is carried out on OWLS-TC4 to test the effectiveness of the approach, the other experiment is conducted on 11836 WSDL files crawled from the Internet to expand the approach to a large number of Web services. The experimental results show that the approach performs well even when the number of Web services is large, moreover, it performs better when dealing with well-described Web services.","PeriodicalId":370898,"journal":{"name":"2013 IEEE International Conference on Services Computing","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126586661","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}
We propose a novel market-based approach for dynamic composite service selection based on combinatorial auctions. The combinatorial auction model that we developed allows us to incorporate service providers' and requesters' preferences in the service selection process. From the providers' perspective, the combinatorial formulation allows them to express their preferences for offering combinations of services, or bundles. Moreover, the combinatorial model has the potential to lower the overall cost to the service requester as a result of providers offering discounts for service bundles. The proposed model also enables the service requester to express their preferences for the types of bundles by defining constraints over the configuration of the composite service provisioning, and data-cohesion of the bundles. We have mapped the problem to an Integer Linear Programming formulation and performed a number of experiments to evaluate the proposed model. In addition to demonstrating the relevance and applicability of combinatorial auction models for service selection, our experiments show that the cost of the composite service provisioning decreases with having more bidders in the auction, offering more crowded bundles is more profitable for service providers, and achieving high cohesion is more expensive than low cohesion for service requesters.
{"title":"A Combinatorial Auction Model for Composite Service Selection Based on Preferences and Constraints","authors":"M. Moghaddam, Joseph G. Davis, Taso Viglas","doi":"10.1109/SCC.2013.112","DOIUrl":"https://doi.org/10.1109/SCC.2013.112","url":null,"abstract":"We propose a novel market-based approach for dynamic composite service selection based on combinatorial auctions. The combinatorial auction model that we developed allows us to incorporate service providers' and requesters' preferences in the service selection process. From the providers' perspective, the combinatorial formulation allows them to express their preferences for offering combinations of services, or bundles. Moreover, the combinatorial model has the potential to lower the overall cost to the service requester as a result of providers offering discounts for service bundles. The proposed model also enables the service requester to express their preferences for the types of bundles by defining constraints over the configuration of the composite service provisioning, and data-cohesion of the bundles. We have mapped the problem to an Integer Linear Programming formulation and performed a number of experiments to evaluate the proposed model. In addition to demonstrating the relevance and applicability of combinatorial auction models for service selection, our experiments show that the cost of the composite service provisioning decreases with having more bidders in the auction, offering more crowded bundles is more profitable for service providers, and achieving high cohesion is more expensive than low cohesion for service requesters.","PeriodicalId":370898,"journal":{"name":"2013 IEEE International Conference on Services Computing","volume":"118 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122331584","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}
With the growing demand for service-oriented applications, the complexity of service change management is increasing. Existing work essentially addresses change decisions from a technical perspective (e.g. versioning, compatibility), but providers need to make decisions considering the business impact in terms of clients affected, revenues, costs and penalties. This paper suggests the use of Business Intelligence and Data Warehousing techniques to support business-oriented decisions throughout service life-cycle in a deep change context, i.e. a portfolio of services consumed in large scale by direct/indirect clients. The approach is centered on financial and usage indicators related to the service provision business, a data warehouse that provides a unified and integrated view of these indicators according to different analysis perspectives, and a data warehousing architecture that integrates heterogeneous data sources. We illustrate the impact analysis support provided by the approach through a case study inspired by a real world scenario.
{"title":"Supporting Strategic Decision Making on Service Evolution Context Using Business Intelligence","authors":"Ernando Silva, K. Becker, R. Galante","doi":"10.1109/SCC.2013.25","DOIUrl":"https://doi.org/10.1109/SCC.2013.25","url":null,"abstract":"With the growing demand for service-oriented applications, the complexity of service change management is increasing. Existing work essentially addresses change decisions from a technical perspective (e.g. versioning, compatibility), but providers need to make decisions considering the business impact in terms of clients affected, revenues, costs and penalties. This paper suggests the use of Business Intelligence and Data Warehousing techniques to support business-oriented decisions throughout service life-cycle in a deep change context, i.e. a portfolio of services consumed in large scale by direct/indirect clients. The approach is centered on financial and usage indicators related to the service provision business, a data warehouse that provides a unified and integrated view of these indicators according to different analysis perspectives, and a data warehousing architecture that integrates heterogeneous data sources. We illustrate the impact analysis support provided by the approach through a case study inspired by a real world scenario.","PeriodicalId":370898,"journal":{"name":"2013 IEEE International Conference on Services Computing","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125253802","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}
Recent years have witnessed the development of Cloud Computing. The management of images is a big problem in virtualized environment because there are quantities of Virtual Machine images being stored in a Cloud and most of them are outdated. How to detect the outdated images and patch them efficiently? In this paper, we present a prototype called OPS- Offline Patching Scheme for the Images Management in a Secure Cloud Environment. In OPS, we can detect out the outdated image quickly by a module called Collector. Then a module called Patcher will patch the outdated images. In order to patch an image efficiently, offline patching technology is considered. For the large number of images in the Cloud, parallel scheme is also used. Our experiment results show that OPS can update numerous images efficiently.
{"title":"OPS: Offline Patching Scheme for the Images Management in a Secure Cloud Environment","authors":"Kang Fan, Dehui Mao, Zhihui Lu, Jie Wu","doi":"10.1109/SCC.2013.57","DOIUrl":"https://doi.org/10.1109/SCC.2013.57","url":null,"abstract":"Recent years have witnessed the development of Cloud Computing. The management of images is a big problem in virtualized environment because there are quantities of Virtual Machine images being stored in a Cloud and most of them are outdated. How to detect the outdated images and patch them efficiently? In this paper, we present a prototype called OPS- Offline Patching Scheme for the Images Management in a Secure Cloud Environment. In OPS, we can detect out the outdated image quickly by a module called Collector. Then a module called Patcher will patch the outdated images. In order to patch an image efficiently, offline patching technology is considered. For the large number of images in the Cloud, parallel scheme is also used. Our experiment results show that OPS can update numerous images efficiently.","PeriodicalId":370898,"journal":{"name":"2013 IEEE International Conference on Services Computing","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122391082","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 Deng, S. Sarkar, H. Ramasamy, Rafah Hosn, R. Mahindru
The capability to analyze systems and applications is commonly needed in data centers to address diverse problems such as root cause analysis of performance problems and failures, investigation of security attack propagation, and problem determination for predictive maintenance. Such analysis is typically facilitated by a hodgepodge of procedural code and scripts representing heuristics to be applied, and configuration databases representing state. As entities in the data center and relationships among them change, it is a challenge to keep the analysis tools up-to-date. We describe a framework that is based primarily on the principle of interpreting declarative representations of knowledge rather than capturing such knowledge in procedural code, and a variety of techniques for facilitating the continuous update of knowledge and state. A metamodel representing data center-specific domain knowledge forms the foundation for the framework. A model of the data center topological elements is an instantiation of the metamodel. Using the framework, we present a methodology for conducting a variety of analyses as a model-driven topology subgraph traversal, governed by knowledge embedded in the corresponding metamodel nodes. We apply the methodology to perform root cause analysis of performance problems in the domains of 3-tier Web and InfoSphere Streams applications.
{"title":"An Ontology-Based Framework for Model-Driven Analysis of Situations in Data Centers","authors":"Yu Deng, S. Sarkar, H. Ramasamy, Rafah Hosn, R. Mahindru","doi":"10.1109/SCC.2013.98","DOIUrl":"https://doi.org/10.1109/SCC.2013.98","url":null,"abstract":"The capability to analyze systems and applications is commonly needed in data centers to address diverse problems such as root cause analysis of performance problems and failures, investigation of security attack propagation, and problem determination for predictive maintenance. Such analysis is typically facilitated by a hodgepodge of procedural code and scripts representing heuristics to be applied, and configuration databases representing state. As entities in the data center and relationships among them change, it is a challenge to keep the analysis tools up-to-date. We describe a framework that is based primarily on the principle of interpreting declarative representations of knowledge rather than capturing such knowledge in procedural code, and a variety of techniques for facilitating the continuous update of knowledge and state. A metamodel representing data center-specific domain knowledge forms the foundation for the framework. A model of the data center topological elements is an instantiation of the metamodel. Using the framework, we present a methodology for conducting a variety of analyses as a model-driven topology subgraph traversal, governed by knowledge embedded in the corresponding metamodel nodes. We apply the methodology to perform root cause analysis of performance problems in the domains of 3-tier Web and InfoSphere Streams applications.","PeriodicalId":370898,"journal":{"name":"2013 IEEE International Conference on Services Computing","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122398480","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
扫码关注我们
求助内容：
应助结果提醒方式：