Dynamic service scheduling is a challenging problem to the high-efficient implementation of service based business applications. Recent researches on dynamic service scheduling mostly focus on the service allocation, but they seldom optimize the timetable which defines the starting time of each service instance, and the existing methods proposed are time-consuming and with low calculation precision. In this paper, a novel hybrid algorithm for dynamic service scheduling is proposed. Our algorithm can improve the service allocation by the knowledge from self-learning and social learning and make the timetable more properly by reducing idle time of services. Experimental results show our algorithm can solve the dynamic service scheduling problem more precisely and with less execution time than the existing works.
{"title":"Dynamic Service Scheduling in Cloud Computing Using a Novel Hybrid Algorithm","authors":"Helan Liang, Yingwu Zhang, Yanhua Du","doi":"10.1109/ICEBE.2015.51","DOIUrl":"https://doi.org/10.1109/ICEBE.2015.51","url":null,"abstract":"Dynamic service scheduling is a challenging problem to the high-efficient implementation of service based business applications. Recent researches on dynamic service scheduling mostly focus on the service allocation, but they seldom optimize the timetable which defines the starting time of each service instance, and the existing methods proposed are time-consuming and with low calculation precision. In this paper, a novel hybrid algorithm for dynamic service scheduling is proposed. Our algorithm can improve the service allocation by the knowledge from self-learning and social learning and make the timetable more properly by reducing idle time of services. Experimental results show our algorithm can solve the dynamic service scheduling problem more precisely and with less execution time than the existing works.","PeriodicalId":153535,"journal":{"name":"2015 IEEE 12th International Conference on e-Business Engineering","volume":"32 5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128695202","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}
Internet of Things (IoT) services are becoming a popular class of services. Compared to traditional pure software-based services, IoT services are deployed on and constrained by devices in physical environments. Interruption of an IoT service may be caused by energy failure of its host device. Balancing energy consumption of all devices in outdoor settings is desirable to maximize the system lifetime. In this paper, we present an evolutionary game approach to service selection for multiple IoT applications. Different from centralized and pre-execution service selection methods, the approach avoids congregation on certain devices by using a global view of competitions and interactions for service selections in all concurrent applications. Our simulation results show that the proposed service selection approach can evenly distribute energy consumption across all IoT devices and extend the overall system lifetime.
{"title":"An Evolutionary Game Approach on IoT Service Selection for Balancing Device Energy Consumption","authors":"Jun Na, Kwei-Jay Lin, Zhenqiu Huang, S. Zhou","doi":"10.1109/ICEBE.2015.63","DOIUrl":"https://doi.org/10.1109/ICEBE.2015.63","url":null,"abstract":"Internet of Things (IoT) services are becoming a popular class of services. Compared to traditional pure software-based services, IoT services are deployed on and constrained by devices in physical environments. Interruption of an IoT service may be caused by energy failure of its host device. Balancing energy consumption of all devices in outdoor settings is desirable to maximize the system lifetime. In this paper, we present an evolutionary game approach to service selection for multiple IoT applications. Different from centralized and pre-execution service selection methods, the approach avoids congregation on certain devices by using a global view of competitions and interactions for service selections in all concurrent applications. Our simulation results show that the proposed service selection approach can evenly distribute energy consumption across all IoT devices and extend the overall system lifetime.","PeriodicalId":153535,"journal":{"name":"2015 IEEE 12th International Conference on e-Business Engineering","volume":"241 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122093591","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}
In e-marketplace, semantic document exchange is a methodology of providing exchangeable semantic documents, which ensures document writer, writer's computer, reader's computer and document reader to share a same understanding in meaning on any exchanged document, that is, a semantic document is exchangeable across any heterogeneous contexts. Existing methodologies for semantic document exchange, in general, can be categorized in three tracks such as document standardization, ontology engineering, and collaborative document engineering. This paper explores challenging trends and issues for semantic document exchange in e-business.
{"title":"Semantic Document Exchange for E-Business: Trends and Issues","authors":"Guangyi Xiao, J. Guo, Zhiguo Gong, Renfa Li","doi":"10.1109/ICEBE.2015.33","DOIUrl":"https://doi.org/10.1109/ICEBE.2015.33","url":null,"abstract":"In e-marketplace, semantic document exchange is a methodology of providing exchangeable semantic documents, which ensures document writer, writer's computer, reader's computer and document reader to share a same understanding in meaning on any exchanged document, that is, a semantic document is exchangeable across any heterogeneous contexts. Existing methodologies for semantic document exchange, in general, can be categorized in three tracks such as document standardization, ontology engineering, and collaborative document engineering. This paper explores challenging trends and issues for semantic document exchange in e-business.","PeriodicalId":153535,"journal":{"name":"2015 IEEE 12th International Conference on e-Business Engineering","volume":"84 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122183425","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}
José Losada, J. Raposo, A. Pan, Paula Montoto, M. Álvarez
Web automation applications are widely used for different purposes such as B2B integration, web mashups, automated testing of web applications, Internet metasearch or technology and business watch. One crucial part in intensive web automation applications, that require real time responses, is for them to execute the navigation sequences in the shortest possible time. The approach of building the automatic web navigation component by using the APIs of conventional browsers, followed by most of the current systems, is not appropriate in that scenario, because it presents performance problems. Other approach consist in creating custom browsers specially designed for web automation, which can develop some improvements based in the peculiarities of the web automation tasks. In this work, we present a new set of techniques and algorithms that allow the parallel evaluation of the scripting code when a custom browser loads a web page. We also outline the components that should be included in the custom browser architecture to implement these techniques. The tests executed with real web sources, to evaluate the validity of our proposal, show that a custom web browser loads the web pages faster when the scripts are executed in parallel using the designed techniques.
{"title":"Optimization Techniques to Speed Up the Page Loading in Custom Web Browsers","authors":"José Losada, J. Raposo, A. Pan, Paula Montoto, M. Álvarez","doi":"10.1109/ICEBE.2015.12","DOIUrl":"https://doi.org/10.1109/ICEBE.2015.12","url":null,"abstract":"Web automation applications are widely used for different purposes such as B2B integration, web mashups, automated testing of web applications, Internet metasearch or technology and business watch. One crucial part in intensive web automation applications, that require real time responses, is for them to execute the navigation sequences in the shortest possible time. The approach of building the automatic web navigation component by using the APIs of conventional browsers, followed by most of the current systems, is not appropriate in that scenario, because it presents performance problems. Other approach consist in creating custom browsers specially designed for web automation, which can develop some improvements based in the peculiarities of the web automation tasks. In this work, we present a new set of techniques and algorithms that allow the parallel evaluation of the scripting code when a custom browser loads a web page. We also outline the components that should be included in the custom browser architecture to implement these techniques. The tests executed with real web sources, to evaluate the validity of our proposal, show that a custom web browser loads the web pages faster when the scripts are executed in parallel using the designed techniques.","PeriodicalId":153535,"journal":{"name":"2015 IEEE 12th International Conference on e-Business Engineering","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125061304","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 growth of the number of Web services published over Internet, identifying composite services by taking into account both functional and non-functional requirements of end users has become a real challenge that needs to be addressed. This challenge is aggravated in the case of situations requiring adaptation to user context. To overcome these challenges, we propose a solution that enables a certain flexibility and adaptability without having to deal with composition from scratch at runtime. Our approach consists in generating automatically a composition schema at the abstract service level. The design-time components of our solution are OWL-S abstract services that are used within the composition process for deriving different composition possibilities and for reducing the difficulty of the tasks of discovery and selection of the actual Web services. This mechanism relies also on a specification of user requirements structured as intentions graph.
{"title":"A Semantic Driven Approach for an Automated Composition Based on Abstract Services","authors":"Emna Fki, S. Tazi, M. Jmaiel","doi":"10.1109/ICEBE.2015.32","DOIUrl":"https://doi.org/10.1109/ICEBE.2015.32","url":null,"abstract":"With the growth of the number of Web services published over Internet, identifying composite services by taking into account both functional and non-functional requirements of end users has become a real challenge that needs to be addressed. This challenge is aggravated in the case of situations requiring adaptation to user context. To overcome these challenges, we propose a solution that enables a certain flexibility and adaptability without having to deal with composition from scratch at runtime. Our approach consists in generating automatically a composition schema at the abstract service level. The design-time components of our solution are OWL-S abstract services that are used within the composition process for deriving different composition possibilities and for reducing the difficulty of the tasks of discovery and selection of the actual Web services. This mechanism relies also on a specification of user requirements structured as intentions graph.","PeriodicalId":153535,"journal":{"name":"2015 IEEE 12th International Conference on e-Business Engineering","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121025837","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 Level Agreement (SLA) in cloud service provides quality and responsibility for both Datacenter providers and customers. If a customer's required task is processed delayed then penalty of SLA violation are generated due to this shortage of resource allocation. The virtual machines (VMs) in lower utilization host or over utilization host will be migrated to the suitable hosts in an attempt to reduce delays in task processing and avoid SLA violation. Control chart is applied for monitoring the host performance form utilization perspective. We propose a mechanism to evaluate resource reallocation and identify which of these VMs can match an appropriate host based on economic of the cost and SLA violation penalty. The proposed approach is applied on a case study in which tasks are submitted sequentially by the constant schedule interval and cloud resource allocation is constantly gets evaluated.
{"title":"Resource Reallocation Based on SLA Requirement in Cloud Environment","authors":"Jen-Hsiang Chen, Chen-Fang Tsai, Shin-Li Lu, Fahmida Abedin","doi":"10.1109/ICEBE.2015.70","DOIUrl":"https://doi.org/10.1109/ICEBE.2015.70","url":null,"abstract":"Service Level Agreement (SLA) in cloud service provides quality and responsibility for both Datacenter providers and customers. If a customer's required task is processed delayed then penalty of SLA violation are generated due to this shortage of resource allocation. The virtual machines (VMs) in lower utilization host or over utilization host will be migrated to the suitable hosts in an attempt to reduce delays in task processing and avoid SLA violation. Control chart is applied for monitoring the host performance form utilization perspective. We propose a mechanism to evaluate resource reallocation and identify which of these VMs can match an appropriate host based on economic of the cost and SLA violation penalty. The proposed approach is applied on a case study in which tasks are submitted sequentially by the constant schedule interval and cloud resource allocation is constantly gets evaluated.","PeriodicalId":153535,"journal":{"name":"2015 IEEE 12th International Conference on e-Business Engineering","volume":"272 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133852277","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}
Complex product development faces huge amount of components with complex structure and dynamic changes in product lifecycle, which is a key challenge in mass customization. This paper addresses this issue by providing a product configuration solution based on bill of materials (BOM): First, conceptual objects with flexible structure and unified identifier (UID) in 2d-code form are built to represent business entities. Second, the relations among the instances of the conceptual objects are analyzed to dynamically generate BOM in different lifecycle phase, which is the product configuration view. Third, quality information monitoring and completeness check can be achieved based on BOM structure. Finally, a prototype system for aircraft manufacturing is built, which supports requirement change and quality management in the whole product lifecycle.
复杂产品开发面临着数量庞大、结构复杂的部件和产品生命周期的动态变化，这是大规模定制的关键挑战。本文通过提供基于物料清单(bill of materials, BOM)的产品配置解决方案来解决这一问题:首先，构建具有灵活结构和统一标识符(UID)的2d-code形式的概念对象来表示业务实体;其次，分析概念对象实例之间的关系，动态生成不同生命周期阶段的BOM，即产品配置视图;第三，基于BOM结构实现质量信息监控和完整性检查。最后，构建了飞机制造的原型系统，支持产品全生命周期的需求变更和质量管理。
{"title":"A Bottom-Up Approach for BOM Generation and Its Application in Mass Customization","authors":"Tian Chen, Hongming Cai, Boyi Xu, Fenglin Bu","doi":"10.1109/ICEBE.2015.65","DOIUrl":"https://doi.org/10.1109/ICEBE.2015.65","url":null,"abstract":"Complex product development faces huge amount of components with complex structure and dynamic changes in product lifecycle, which is a key challenge in mass customization. This paper addresses this issue by providing a product configuration solution based on bill of materials (BOM): First, conceptual objects with flexible structure and unified identifier (UID) in 2d-code form are built to represent business entities. Second, the relations among the instances of the conceptual objects are analyzed to dynamically generate BOM in different lifecycle phase, which is the product configuration view. Third, quality information monitoring and completeness check can be achieved based on BOM structure. Finally, a prototype system for aircraft manufacturing is built, which supports requirement change and quality management in the whole product lifecycle.","PeriodicalId":153535,"journal":{"name":"2015 IEEE 12th International Conference on e-Business Engineering","volume":"133 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123587928","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}
When a customer uses a service, he might change his initial requirement due to subjective reasons that could not be predicated by service providers. If this happened, service providers need to adjust the current service solution to adapt the new requirement with the objective of minimizing the change amplitude and cost. Placing this problem into AI-planning based service composition (PSC) scenario, we present two approaches called global re-planning algorithms (RP) and local reinforcement algorithm (LR). RP constructs a virtual requirement according to the composite service's current execution state and the changed expectation, and invokes PSC algorithm to look for a new solution. A price-rewritten mechanism is used as a heuristic during the re-planning to preferentially reuse those services existing in current solution. In terms of six basic types of requirement changes, LR attempts to make minor repairs to the current composite service to adapt to the new requirement and minimize the change amplitude of the solution. In the experiments, the efficiency, variation cost and amplitude of RP and LR are compared, and how the performance metrics are affected by other factors is preliminarily validated.
{"title":"Responding to Subjective Changes of Customer Requirements in Dynamic Service Execution Environment","authors":"Nan Jing, Zhongjie Wang, Xiaofei Xu","doi":"10.1109/ICEBE.2015.29","DOIUrl":"https://doi.org/10.1109/ICEBE.2015.29","url":null,"abstract":"When a customer uses a service, he might change his initial requirement due to subjective reasons that could not be predicated by service providers. If this happened, service providers need to adjust the current service solution to adapt the new requirement with the objective of minimizing the change amplitude and cost. Placing this problem into AI-planning based service composition (PSC) scenario, we present two approaches called global re-planning algorithms (RP) and local reinforcement algorithm (LR). RP constructs a virtual requirement according to the composite service's current execution state and the changed expectation, and invokes PSC algorithm to look for a new solution. A price-rewritten mechanism is used as a heuristic during the re-planning to preferentially reuse those services existing in current solution. In terms of six basic types of requirement changes, LR attempts to make minor repairs to the current composite service to adapt to the new requirement and minimize the change amplitude of the solution. In the experiments, the efficiency, variation cost and amplitude of RP and LR are compared, and how the performance metrics are affected by other factors is preliminarily validated.","PeriodicalId":153535,"journal":{"name":"2015 IEEE 12th International Conference on e-Business Engineering","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114588879","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}
Analyzing accountability violations and identifying the guilty party is a challenging process especially where multiple tenants are hosted by a single application instance. To handle this issue, we propose an approach for accountability violation analysis. It is based on service patterns as an abstract model to provide reusable and suitable description of the different characteristics of the analysis process, and an algorithm for pattern selection and instantiation. Furthermore, we propose a middleware layer for implementing our approach on the top of application level.
{"title":"Analyzing Multi-tenant Cloud Services' Accountability","authors":"Fatma Masmoudi, M. Sellami, M. Loulou, A. Kacem","doi":"10.1109/ICEBE.2015.48","DOIUrl":"https://doi.org/10.1109/ICEBE.2015.48","url":null,"abstract":"Analyzing accountability violations and identifying the guilty party is a challenging process especially where multiple tenants are hosted by a single application instance. To handle this issue, we propose an approach for accountability violation analysis. It is based on service patterns as an abstract model to provide reusable and suitable description of the different characteristics of the analysis process, and an algorithm for pattern selection and instantiation. Furthermore, we propose a middleware layer for implementing our approach on the top of application level.","PeriodicalId":153535,"journal":{"name":"2015 IEEE 12th International Conference on e-Business Engineering","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122872658","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}
A simple statistical approach based on exponentially weighted moving average (EWMA) charts for monitoring quality of service (QoS) violations is presented in this paper. The monitoring is performed by checking the actual services performance against the QoS stated in Service Level Agreement (SLA). Our approach monitors their QoS attributes and reveals early forecasts of violations in customers' demands. We verified the CUSUM and EWMA charts by utilizing several experiments and runtime data series from CLOUDSIM web services and validated our approach using a series of datasets from real-world web services.
{"title":"EWMA Control Charts for Statistical Detecting QoS Violations","authors":"Shin-Li Lu, Chen-Fang Tsai, Jen-Hsiang Chen","doi":"10.1109/ICEBE.2015.41","DOIUrl":"https://doi.org/10.1109/ICEBE.2015.41","url":null,"abstract":"A simple statistical approach based on exponentially weighted moving average (EWMA) charts for monitoring quality of service (QoS) violations is presented in this paper. The monitoring is performed by checking the actual services performance against the QoS stated in Service Level Agreement (SLA). Our approach monitors their QoS attributes and reveals early forecasts of violations in customers' demands. We verified the CUSUM and EWMA charts by utilizing several experiments and runtime data series from CLOUDSIM web services and validated our approach using a series of datasets from real-world web services.","PeriodicalId":153535,"journal":{"name":"2015 IEEE 12th International Conference on e-Business Engineering","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116697692","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
扫码关注我们
求助内容：
应助结果提醒方式：