在智能空间中感知存在模式的服务选择和组合

Jun Ma, Xianping Tao, Jian Lv
{"title":"在智能空间中感知存在模式的服务选择和组合","authors":"Jun Ma, Xianping Tao, Jian Lv","doi":"10.1145/2532443.2532452","DOIUrl":null,"url":null,"abstract":"Service composition provides supports for automatic construction of required services on the fly from component services provided by different providers. In a smart space, as new providers may come in and existing ones may leave from time to time, the collection of available component services may change dynamically, resulting in broken compositions. Automatic reselection or recomposition mechanisms can be applied to fix broken compositions. However, they may introduce extra efforts and time and there are applications requiring (composed)services to be continuously available (at least) during a period of time, otherwise the applications would break down. Both the situations affect users' experience. If we could know how long each component service would be continuously available, we could optimize the composition process by reducing the frequency of broken compositions. In this paper we propose a scheme to achieve the goal. It utilizes presence-patterns of providers to estimate how long a component service may continuously available and it always selects the most continuously available composition that matches requirements. Simulations are carried out to show how and how well the presence-patterns based scheme work.","PeriodicalId":362187,"journal":{"name":"Proceedings of the 5th Asia-Pacific Symposium on Internetware","volume":"232 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Presence-pattern aware service selection and composition in a smart space\",\"authors\":\"Jun Ma, Xianping Tao, Jian Lv\",\"doi\":\"10.1145/2532443.2532452\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Service composition provides supports for automatic construction of required services on the fly from component services provided by different providers. In a smart space, as new providers may come in and existing ones may leave from time to time, the collection of available component services may change dynamically, resulting in broken compositions. Automatic reselection or recomposition mechanisms can be applied to fix broken compositions. However, they may introduce extra efforts and time and there are applications requiring (composed)services to be continuously available (at least) during a period of time, otherwise the applications would break down. Both the situations affect users' experience. If we could know how long each component service would be continuously available, we could optimize the composition process by reducing the frequency of broken compositions. In this paper we propose a scheme to achieve the goal. It utilizes presence-patterns of providers to estimate how long a component service may continuously available and it always selects the most continuously available composition that matches requirements. Simulations are carried out to show how and how well the presence-patterns based scheme work.\",\"PeriodicalId\":362187,\"journal\":{\"name\":\"Proceedings of the 5th Asia-Pacific Symposium on Internetware\",\"volume\":\"232 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-10-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 5th Asia-Pacific Symposium on Internetware\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/2532443.2532452\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 5th Asia-Pacific Symposium on Internetware","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2532443.2532452","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

服务组合支持从不同提供者提供的组件服务动态地自动构造所需的服务。在智能空间中,随着新提供者的加入和现有提供者的离开,可用组件服务的集合可能会动态变化,从而导致组合的破坏。可以应用自动重选或重组机制来修复损坏的组合。然而,它们可能会引入额外的工作和时间,并且有些应用程序要求(组合)服务在一段时间内(至少)持续可用,否则应用程序将崩溃。这两种情况都会影响用户的体验。如果我们能够知道每个组件服务持续可用的时间,我们就可以通过减少组合中断的频率来优化组合过程。本文提出了一种实现这一目标的方案。它利用提供者的呈现模式来估计组件服务可以持续可用多长时间,并且总是选择符合需求的最持续可用的组合。仿真显示了基于呈现模式的方案的工作原理和效果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Presence-pattern aware service selection and composition in a smart space
Service composition provides supports for automatic construction of required services on the fly from component services provided by different providers. In a smart space, as new providers may come in and existing ones may leave from time to time, the collection of available component services may change dynamically, resulting in broken compositions. Automatic reselection or recomposition mechanisms can be applied to fix broken compositions. However, they may introduce extra efforts and time and there are applications requiring (composed)services to be continuously available (at least) during a period of time, otherwise the applications would break down. Both the situations affect users' experience. If we could know how long each component service would be continuously available, we could optimize the composition process by reducing the frequency of broken compositions. In this paper we propose a scheme to achieve the goal. It utilizes presence-patterns of providers to estimate how long a component service may continuously available and it always selects the most continuously available composition that matches requirements. Simulations are carried out to show how and how well the presence-patterns based scheme work.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信