高级检索
    唐 磊, 淮晓永, 李明树. 一种基于上下文协商的动态服务组合方法[J]. 计算机研究与发展, 2008, 45(11): 1902-1910.
    引用本文: 唐 磊, 淮晓永, 李明树. 一种基于上下文协商的动态服务组合方法[J]. 计算机研究与发展, 2008, 45(11): 1902-1910.
    Tang Lei, Huai Xiaoyong, Li Mingshu. An Approach to Dynamic Service Composition Based on Context Negotiation[J]. Journal of Computer Research and Development, 2008, 45(11): 1902-1910.
    Citation: Tang Lei, Huai Xiaoyong, Li Mingshu. An Approach to Dynamic Service Composition Based on Context Negotiation[J]. Journal of Computer Research and Development, 2008, 45(11): 1902-1910.

    一种基于上下文协商的动态服务组合方法

    An Approach to Dynamic Service Composition Based on Context Negotiation

    • 摘要: 普适计算的计算环境和交互信息动态变化,为了提供适时适地的服务,服务组合除了满足用户的需求之外,还要适应环境的变化.以面向普适计算的分布式文档管理系统为例,提出一种基于上下文协商的动态服务组合方法,适应普适计算环境下资源动态变化的特点,同时满足用户对服务的需求.首先定义上下文和带有上下文信息的服务模型;然后给出服务和设备以及服务和用户之间的上下文协商约束条件,根据约束条件提出基本算法实现服务动态组合,并对基本算法进行优化;最后通过原型系统和实验验证算法的性能和有效性,并通过实验数据分析上下文对于服务组合的影响.实验数据说明:提出的方法能够应用在普适计算环境中上下文敏感的服务组合问题上,提高服务组合的动态适应性和网络资源利用率.

       

      Abstract: Composition of Web services has received more and more interest to support businesstobusiness or enterprise application integration. In this paper, an approach to service composition based on context negotiation is presented and applied to distributed document management system for pervasive computing. It can not only adapt to the dynamic environment for pervasive computing, but also satisfy the users preferences. First, the definitions of the context and context aware service are given. Based on the definitions, the constraint conditions of context negotiation are given. According to the constraint conditions, the service composition algorithm is presented. Furthermore, the algorithm is optimized to improve the resource utilization. Finally, the prototype of service composition is realized based on context negotiation is presented and applied to distributed document management system for pervasive computing. Some experiments are given to validate the algorithm performance and validity, i.e., the time cost when increasing the number of candidate services and context, the conflicts of candidate services selection when increasing the number of context, etc. The prototype and experiment data prove that the approach presented can be applied to context sensitive service composition in pervasive computing.

       

    /

    返回文章
    返回