现有的Web服务发现方法主要是基于集中式拓扑,并且使用的服务描述仅仅是描述服务接口功能而忽略了业务流程执行相关信息,无法保证Web服务组合的相容性,也无法满足组合事务无死锁的要求。同时,这些方法都无法避免高维护代价、单点失效和...现有的Web服务发现方法主要是基于集中式拓扑,并且使用的服务描述仅仅是描述服务接口功能而忽略了业务流程执行相关信息,无法保证Web服务组合的相容性,也无法满足组合事务无死锁的要求。同时,这些方法都无法避免高维护代价、单点失效和可扩展性差等问题。本文提出一种基于结构化对等网络的Web服务发现方法,引入标识确定性有限状态机ADFSA(Annotated Deterministic Finite State Automata),将服务业务流程执行语言用于服务匹配,从而避免了潜在的Web服务组合不相容和有利于服务组合的自动化。展开更多
To improve the performance and robustness in service discovery, a self-organizing mechanism for service alliances of Service Providers (SPs) is proposed in this paper. According to the similarity of service content, a...To improve the performance and robustness in service discovery, a self-organizing mechanism for service alliances of Service Providers (SPs) is proposed in this paper. According to the similarity of service content, an SP publishes its services in a partition of SPs to construct connections between highly similar SPs. These SPs constitute a self-organized distributed environment. A self-organizing protocol is designed to ensure the correctness of the construction of the alliances. The protocol consists of four stages - initiating stage, developing stage, developed stage and degradation stage. The experimental results demonstrate that this protocol ensures the self-property. The visualization of alliance developing stages illustrates that sub-alliances are sp lit in balance and self-connected. Compared with the Random Walker algorithm, the time cost and the number of forwarded messages in alliance-based mechanism is lower in service discovery. On three typical topologies (Grid, Random-Graph, Power-Law), the success rate of service discovery is much higher, which shows that self-organized alliances are helpful to enhance the discovery performance.展开更多
基金国家自然科学基金(the National Natural Science Foundation of China under Grant No.60403027)湖北省自然科学基金(the Natural Science Foundation of Hubei Province of China under Grant No.2005ABA258)
文摘现有的Web服务发现方法主要是基于集中式拓扑,并且使用的服务描述仅仅是描述服务接口功能而忽略了业务流程执行相关信息,无法保证Web服务组合的相容性,也无法满足组合事务无死锁的要求。同时,这些方法都无法避免高维护代价、单点失效和可扩展性差等问题。本文提出一种基于结构化对等网络的Web服务发现方法,引入标识确定性有限状态机ADFSA(Annotated Deterministic Finite State Automata),将服务业务流程执行语言用于服务匹配,从而避免了潜在的Web服务组合不相容和有利于服务组合的自动化。
基金This paper was supported by the Natural Science Foundation of China under Grants No. 61170053, No. 61100205 the Nat- ural Science Foundation of Beijing under Grant No. 4112027 the Natural Science Foundation of Hebei under Grant No. F2009000929. The authors would like to thank the anony- mous reviewers for their helpful comments from which the preparation for this version of the paper has benefited.
文摘To improve the performance and robustness in service discovery, a self-organizing mechanism for service alliances of Service Providers (SPs) is proposed in this paper. According to the similarity of service content, an SP publishes its services in a partition of SPs to construct connections between highly similar SPs. These SPs constitute a self-organized distributed environment. A self-organizing protocol is designed to ensure the correctness of the construction of the alliances. The protocol consists of four stages - initiating stage, developing stage, developed stage and degradation stage. The experimental results demonstrate that this protocol ensures the self-property. The visualization of alliance developing stages illustrates that sub-alliances are sp lit in balance and self-connected. Compared with the Random Walker algorithm, the time cost and the number of forwarded messages in alliance-based mechanism is lower in service discovery. On three typical topologies (Grid, Random-Graph, Power-Law), the success rate of service discovery is much higher, which shows that self-organized alliances are helpful to enhance the discovery performance.
