期刊文献+

基于最小干扰的服务组合和恢复

Service Composition and Recovery Based on Minimum Interference
下载PDF
导出
摘要 服务组合正在成为一种对商业过程、Web服务、多媒体应用等提供按需服务的关键技术.在服务组合中强调两个重要的因素:组合服务路径的质量和服务中断的恢复.用一种新的方法研究服务组合问题,提出了一个优化的服务干扰理论模型,给出最小干扰服务组合和恢复的启发式算法(MISCR).仿真结果表明,在发现服务路径时,MISCR算法优于传统的算法,提高了组合服务的健壮性和稳定性. Service composition is becoming a crucial technology to enable on demand business process provision,web services, multimedia applications, etc. There are two important issues to address in service composition: the quality of the composed service path and the failure recovery in service disruptions. In this paper give a new way to study QoS-based service composition. First, an interference model is proposed to quantitatively characterize and measure the interferenee. Then,based the model, we present a minimum interference service composition and recovery algorithms (MISCR) by exploiting the local path recovery and reliable service paths. The experimental results show that our model and algorithms can achieve much better performanee than the traditional methods in finding service paths, with respect to decreasing the interferenee to end users.
出处 《小型微型计算机系统》 CSCD 北大核心 2008年第9期1616-1621,共6页 Journal of Chinese Computer Systems
基金 国家自然科学基金项目(60073059和60273078)资助 东北大学“985工程”基金项目(985-2-DC-C09)资助
关键词 QOS 最小干扰 服务组合 服务恢复 minimum interference service composition service recovery
  • 相关文献

参考文献11

  • 1Stoica l,Morris R,Liben-Nowell D, et al. Chord: a scalable peer-to-peer lookup protocol for internet applications [J]. IEEE/ ACM Transactions on Networking, 2003,11 () : 17-32.
  • 2Xu D, Nahrstedt K, Wichadakul D. QoS-aware discovery of widearea distributed services[C]. In Proceedings of IEEE/ACM International.
  • 3Gu X, Nahrstedt K. A scalable QoS-aware service aggregation model for peer-to-peer computing grids[C]. In Proceedings of IEEE International Symposium on High Performance Distributed Computing, 2002.
  • 4Xu D, Nahrstedt K. Finding service paths in a media service proxy network[C]. In Proceedings of SPIE/ACM Multimedia Computing and Networking Conference,2002.
  • 5Jin J, Nahrstedt K. On exploring performance optimizations in web service composition[C]. In Proceedings of IEEE International Symposium on High Performance Distributed Computing, 2004.
  • 6Choi S Y, Turner J, Wolf T. Configuring sessions in programmable networks[C]. In Proceedings of IEEE INFOCOM, 2001.
  • 7Chandrasekaran S,Madden S, Ionescu M. Ninja paths : an architecture for composing services over wide area networks. CS262 Class Project Writeup[EB/OL]. http://ninja.cs. berkeley.edu/ pubs/pubs. html, 2002.
  • 8Wang Hui, Zhao Yi-hui,Yang De-guo. et al. LQSON :large-scala QoS-aware service overlay networks based on SCTP[J]. Computer Science,2006,33(10A) :275-277.
  • 9Yu T,Lin K J. Adaptive algorithms for finding replacement services in autonomic distributed business processes[C]. In Procedings of the 7th International Symposium on Autonomous Decentralized Systems (ISADS2005), Chengdu, China, April 2005,427-433.
  • 10Zegura E,Calvert K,Bhattacharjee S. How to model an internetwork[C]. In Proc. of IEEE INCOFOM, Apr 1996.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部