以开放式网络应用服务模型为基础的Web服务资源管理研究
|
摘要
在设计之初,0SI/RM和Internet被定义为用于解决计算机系统问一致化访问的网络级互联平台。此后应用层被添加到该平台之上以提供对应用的若干通用支持,但应用系统仍被排除在OSI/RM范围之外。事实上,OSI/RM缺少开放的应用层服务及其接口的定义,这客观上使应用层与实际网络应用界限不清,不能实现网络支撑功能的有效封装及一致化交付,造成实际的网络应用与应用层往往紧紧耦合在一起,难以移植,这一情况在分布式环境下表现得尤为明显。为解决网络应用支撑平台与网络应用系统之间界线模糊的问题,本论文以OSI/RM为背景,给出了开放式网络应用服务模型(ONAS模型,Open Network Application Service Model),探讨如何通过显式定义的网络应用服务接口NASI(Network Application Service Interface)提供公用支撑功能,以简化网络应用系统的开发。论文特别选取Web服务为特例,讨论了上述设计思路。近年来,Web已经从单纯的超文本／超媒体交换工具演变为业务应用支撑平台,而Web服务技术也应运而生以适应这一演进。事实上,诸多C/S或P2P模式的应用往往采用Web服务作为其访问入口。Web服务的流行得益于其良好的封装性、松散的耦合性及高度的集成性。这些优点使得Web服务可被广泛复用,以组装的方式快速构建网络应用。尽管如此,在Web服务生命周期的各个阶段(服务建模、发布、发现、合成、执行阶段等),仍有若干亟待解决的问题妨碍了Web服务的进一步发展和更广泛的应用。本论文以ONAS模型为基础,着重探讨了Web服务资源的管理问题,为各个阶段存在的问题提供了相应的解决方案。论文在这方面的主要贡献如下：
(1)提出了Web服务的统一建模、存储和查询平台ServUnity:ServUnity构成了异构Web服务(如W3C Web Service.RESTful Service、一般的Web API等)的桥梁,实现对其一致化的管理。具体而言,ServUnity包含以下几个方面的研究工作：
·统一服务图模型USGM(Unified Service Graph Model):USGM是对不同服务语言的高层抽象,利用W3C的资源描述框架RDF(Resource Description Framework)将异构Web服务建模为RDF服务图,以此为基础实施对Web服务的统一建模、存储和查询。
·服务图转换方案和服务知识库：为基于标准的服务类型(如WSDL.Yahoo! Pipes等)提供了向服务图的自动转换算法；为非标准的服务类型(如RESTfulService)提供了半自动化协助的交互式转换方案。构建了基于服务图的服务知识库(Service Knowledge Base,SKB),以实现基于服务图的语义挖掘,为合理地选择服务提供决策支持。
●基于服务知识库的Web服务统一查询引擎：该引擎支持标准的RDF查询语言SPARQL及基于费用的服务链多路优选算法CSCO(Cost-based Service Chain Optimization)以适应不同的应用场景和用户需求。
(2)设计了基于空间填充曲线和分布式哈希表的协作式Web服务合成方案CWSC(Collaborative Web Service Composition)：CWCS将服务合成请求与分布式解集数据库进行匹配以求解感知QoS的服务合成,相对于传统的基于数学规划的解法,避免了繁重的运算;相对于集中式的基于案例推理(Case Based Reasoning, CBR)解法,提高了系统伸缩性和可靠性。
(3)针对组合Web服务的执行,设计了局部中心化的去中心式编制DOLCO(Decentralized Orchestration with Local Centralized Orchestration):通过结合传统的中心式编制CO(Centralized Orchestration)和去中心式编制DO (Decentralized Orchestration)的优点,DOLCO采用了根据关联度划分的多调用代理结构。相对于CO,DOLCO提供了更高的系统并发度和可靠性。相对于DO,在服务请求高峰期,DOLCO通过动态配置调用代理,提供了备用调用代理,可降低调用代理失效率。此外,本论文另一方面的贡献在于,在前几章研讨ONAS模型的基础上,第7章提出了用于开放式应用互联的NTSP-DAS RM(网络传输支撑平台-分布式应用系统关系模型,Network Transport Support Platform-Distributed Application Service Relation Model),探索性地从应用系统开放式互联的角度挑战了OSI/RM体系结构。通过将应用层纳入到应用系统,NTSP-DAS RM简化了网络平台和分布式应用系统的交互。分析表明NTSP-DAS RM使得网络平台和应用之间的信息、交互大为减少,并可更灵活地适配到异构网络环境,因此相对于ONAS模型更具优势。
The OSI/RM and Internet were essentially designed as a network interconnection platform addressing universal access issues among computer systems. However, application systems were out of the scope of OSI/RM, although a layer called Application had been added on top of the platform to perform common support for applications. The fact that OSI/RM lacks the open Application-Layer service and interface definitions blurs the demarcation between network applications and Application Layer, leading to a situation that support functions offered by network platforms can hardly be encapsulated and delivered to applications in a unified and effective manner. Applications are thus tightly coupled with Application Layer, resulting in poor portability, especially in a distributed environment. In this dissertation, the ONAS (Open Network Application Service) Model in the context of OSI/RM was introduced with the aim to clearly set the boundary between applications and network. It was discussed in this dissertation on how to simplify the development of network applications by offering common support functions through explicitly well-defined Network Application Service Interfaces (NASI). And Web services were deliberately chosen to investigate the above design ideas.
Over the years, the Web has evolved from a hypertext/hypermedia exchange tool to a business application support platform. Recent years have also witnessed the emergence of Web services to adapt to the evolution. In fact, Web services have become the common portals for a variety of applications not only in C/S mode but also in P2P mode. Benefited from advantages such as well encapsulation, loose coupling and high integration, Web services can be extensively reused to assemble network applications. However, there are still a few problems left unsolved in different stages (service modeling, publishing, discovery, composition, execution, etc.) spanning the Web service life cycle, which hampers the further development and wider adoption of Web services. This dissertation is devoted to solutions to a few critical Web service resource management issues in different stages from the perspective of ONAS Model. The contributions to Web service resource management include:
(1) Proposed the ServUnity platform providing a unified approach for Web service modeling, storing, and discovering to bridge the gap among diverse Web services such as W3C Web Services(i.e. WSDL), RESTful Services and general Web APIs to achieve unified management. Specifically, ServUnity is supported by the following research work:
? The Unified Service Graph Model (USGM):a high-level abstraction of different service languages, which models heterogeneous services as service graphs by means of W3C Resource Description Framework (RDF) and enables unified service modeling, publishing and discovery.
? Service graph conversion schemes and the Service Knowledge Base (SKB): automatic conversion algorithms for standard-based service types (such as WSDL, Yahoo! Pipes, etc.), interactive conversion with semi-automated assistance for non-standard-based service types (such as RESTful Service). On the basis of the generated service graphs, SKB is constructed for extensive semantics mining and sensible service selection decisions.
? A unified Web service query engine over SKB supported by the standard RDF query language SPARQL and the new Cost-based Service Chain Optimization (CSCO) algorithm to meet different requirements in different application scenarios.
(2) Proposed the Collaborative Web Service Composition (CWSC) scheme based on Space-filling Curve and Distributed Hashing Table:It solves QoS-aware service composition problem by matching new requests with distributed solution-bases to avoid intensive computation as with traditional Mathematical Programming approaches, and provide better scalability and reliability than centralized Case Based Reasoning (CBR) approaches.
(3) Proposed a new approach called DOLCO (Decentralized Orchestration with Local Centralized Orchestration) for composite Web service execution:It improves composite service execution performance with affinity-based multi-proxies by combining the advantages of traditional CO (Centralized Orchestration) and DO (Decentralized Orchestration), resulting in better system concurrency and reliability than CO and higher utility of proxies than DO at average request rate. A few backup proxies can be used to cope with peak request traffic via dynamic proxy configuration to reduce proxy failure.
The final contribution of this dissertation is, on the basis of ONAS Model, the introduction of a new open application interconnection model called NTSP-DAS/RM (Network Transport Support Platform-Distributed Application Service/Relation Model) as discussed in Chapter7, which challenges OSI/RM from the perspective of application interconnections. It simplifies the interaction between the NTSP and distributed application systems by returning the Application Layer back to application systems. Analysis has shown that NTSP-DAS RM is more superior over ONAS Model discussed in Chapter1, considering that information exchange between network platform and applications can be greatly reduced and it is also more flexible to adapt to heterogeneous networking environment.
(1)提出了Web服务的统一建模、存储和查询平台ServUnity:ServUnity构成了异构Web服务(如W3C Web Service.RESTful Service、一般的Web API等)的桥梁,实现对其一致化的管理。具体而言,ServUnity包含以下几个方面的研究工作：
·统一服务图模型USGM(Unified Service Graph Model):USGM是对不同服务语言的高层抽象,利用W3C的资源描述框架RDF(Resource Description Framework)将异构Web服务建模为RDF服务图,以此为基础实施对Web服务的统一建模、存储和查询。
·服务图转换方案和服务知识库：为基于标准的服务类型(如WSDL.Yahoo! Pipes等)提供了向服务图的自动转换算法；为非标准的服务类型(如RESTfulService)提供了半自动化协助的交互式转换方案。构建了基于服务图的服务知识库(Service Knowledge Base,SKB),以实现基于服务图的语义挖掘,为合理地选择服务提供决策支持。
●基于服务知识库的Web服务统一查询引擎：该引擎支持标准的RDF查询语言SPARQL及基于费用的服务链多路优选算法CSCO(Cost-based Service Chain Optimization)以适应不同的应用场景和用户需求。
(2)设计了基于空间填充曲线和分布式哈希表的协作式Web服务合成方案CWSC(Collaborative Web Service Composition)：CWCS将服务合成请求与分布式解集数据库进行匹配以求解感知QoS的服务合成,相对于传统的基于数学规划的解法,避免了繁重的运算;相对于集中式的基于案例推理(Case Based Reasoning, CBR)解法,提高了系统伸缩性和可靠性。
(3)针对组合Web服务的执行,设计了局部中心化的去中心式编制DOLCO(Decentralized Orchestration with Local Centralized Orchestration):通过结合传统的中心式编制CO(Centralized Orchestration)和去中心式编制DO (Decentralized Orchestration)的优点,DOLCO采用了根据关联度划分的多调用代理结构。相对于CO,DOLCO提供了更高的系统并发度和可靠性。相对于DO,在服务请求高峰期,DOLCO通过动态配置调用代理,提供了备用调用代理,可降低调用代理失效率。此外,本论文另一方面的贡献在于,在前几章研讨ONAS模型的基础上,第7章提出了用于开放式应用互联的NTSP-DAS RM(网络传输支撑平台-分布式应用系统关系模型,Network Transport Support Platform-Distributed Application Service Relation Model),探索性地从应用系统开放式互联的角度挑战了OSI/RM体系结构。通过将应用层纳入到应用系统,NTSP-DAS RM简化了网络平台和分布式应用系统的交互。分析表明NTSP-DAS RM使得网络平台和应用之间的信息、交互大为减少,并可更灵活地适配到异构网络环境,因此相对于ONAS模型更具优势。
The OSI/RM and Internet were essentially designed as a network interconnection platform addressing universal access issues among computer systems. However, application systems were out of the scope of OSI/RM, although a layer called Application had been added on top of the platform to perform common support for applications. The fact that OSI/RM lacks the open Application-Layer service and interface definitions blurs the demarcation between network applications and Application Layer, leading to a situation that support functions offered by network platforms can hardly be encapsulated and delivered to applications in a unified and effective manner. Applications are thus tightly coupled with Application Layer, resulting in poor portability, especially in a distributed environment. In this dissertation, the ONAS (Open Network Application Service) Model in the context of OSI/RM was introduced with the aim to clearly set the boundary between applications and network. It was discussed in this dissertation on how to simplify the development of network applications by offering common support functions through explicitly well-defined Network Application Service Interfaces (NASI). And Web services were deliberately chosen to investigate the above design ideas.
Over the years, the Web has evolved from a hypertext/hypermedia exchange tool to a business application support platform. Recent years have also witnessed the emergence of Web services to adapt to the evolution. In fact, Web services have become the common portals for a variety of applications not only in C/S mode but also in P2P mode. Benefited from advantages such as well encapsulation, loose coupling and high integration, Web services can be extensively reused to assemble network applications. However, there are still a few problems left unsolved in different stages (service modeling, publishing, discovery, composition, execution, etc.) spanning the Web service life cycle, which hampers the further development and wider adoption of Web services. This dissertation is devoted to solutions to a few critical Web service resource management issues in different stages from the perspective of ONAS Model. The contributions to Web service resource management include:
(1) Proposed the ServUnity platform providing a unified approach for Web service modeling, storing, and discovering to bridge the gap among diverse Web services such as W3C Web Services(i.e. WSDL), RESTful Services and general Web APIs to achieve unified management. Specifically, ServUnity is supported by the following research work:
? The Unified Service Graph Model (USGM):a high-level abstraction of different service languages, which models heterogeneous services as service graphs by means of W3C Resource Description Framework (RDF) and enables unified service modeling, publishing and discovery.
? Service graph conversion schemes and the Service Knowledge Base (SKB): automatic conversion algorithms for standard-based service types (such as WSDL, Yahoo! Pipes, etc.), interactive conversion with semi-automated assistance for non-standard-based service types (such as RESTful Service). On the basis of the generated service graphs, SKB is constructed for extensive semantics mining and sensible service selection decisions.
? A unified Web service query engine over SKB supported by the standard RDF query language SPARQL and the new Cost-based Service Chain Optimization (CSCO) algorithm to meet different requirements in different application scenarios.
(2) Proposed the Collaborative Web Service Composition (CWSC) scheme based on Space-filling Curve and Distributed Hashing Table:It solves QoS-aware service composition problem by matching new requests with distributed solution-bases to avoid intensive computation as with traditional Mathematical Programming approaches, and provide better scalability and reliability than centralized Case Based Reasoning (CBR) approaches.
(3) Proposed a new approach called DOLCO (Decentralized Orchestration with Local Centralized Orchestration) for composite Web service execution:It improves composite service execution performance with affinity-based multi-proxies by combining the advantages of traditional CO (Centralized Orchestration) and DO (Decentralized Orchestration), resulting in better system concurrency and reliability than CO and higher utility of proxies than DO at average request rate. A few backup proxies can be used to cope with peak request traffic via dynamic proxy configuration to reduce proxy failure.
The final contribution of this dissertation is, on the basis of ONAS Model, the introduction of a new open application interconnection model called NTSP-DAS/RM (Network Transport Support Platform-Distributed Application Service/Relation Model) as discussed in Chapter7, which challenges OSI/RM from the perspective of application interconnections. It simplifies the interaction between the NTSP and distributed application systems by returning the Application Layer back to application systems. Analysis has shown that NTSP-DAS RM is more superior over ONAS Model discussed in Chapter1, considering that information exchange between network platform and applications can be greatly reduced and it is also more flexible to adapt to heterogeneous networking environment.
引文
[1]ISO. ISO/IEC 7498-1:1994:Open Systems Interconnection--Basic Reference Model: The Basic Model.1994. http://www.iso.org/iso/iso_catalogue/catalogue_tc/catalogue_detail.htm?csnumber=20 269.
[2]Lua Eng Keong, J. Crowcroft, M. Pias, R. Sharma, S. Lim. A survey and comparison of peer-to-peer overlay network schemes, Communications Surveys & Tutorials, IEEE, 2005,7(2):72-93.
[3]曾华燊.论Internet与Internet of Things,计算机应用,2012,32(4)：893-899.
[4]阎宏Java与模式.北京：电子工业出版社,2002.
[5]ITU. The Internet of Things, International Telecommunication Union, Tunis2005.
[6]刘鹏.云计算.北京:电子工业出版社,2010.
[7]IETF. RFC 3031:Multiprotocol Label Switching Architecture.2001. http://www.ietf.org/rfc/rfc3031.txt.
[8]Huashen Zeng,.Jun Dou, Dengyuan Xu. Single physical layer U-plane Architecture (SUPA) for Next Generation Internet, in Comprehensive Report on VoIP and enhanced IP Communications Services,2004, pp.197-227.
[9]ITU-T Focus Group on Cloud Computing. Technical Report version 1.0, part 2: Functional Requirements and Reference Architecture, Feb 2012.
[10]Steven M. Bellovin, David D. Clark, Adrian Perrig, Dawn Song. A Clean-Slate Design for the Next-Generation Secure Internet, Global Environment for Network Innovations (GENI). Berkeley, CA2005.
[11].Jun Dou, Yu Xia, Xi Chen. Future network applications. Network Model, and development strategy, in 6th International Conference on Broadband Communications, Networks, and Systems (BROADNETS 2009), Madrid, Spain.2009, pp.1-8.
[12]曾华燊,陈曦.NGI研发策略与单层用户数据交换平台体系结构,西南交通大学学报,2011,46(06)：889-898+921.
[13]Huashen Zeng, Yu Gao, Yu Xia. On NGN architecture and evolution strategy, in 1st ITU-T Kaleidoscope Academic Conference, Innovations in NGN (K-INGN), Geneva, Switzerland,2008, pp.337-342.
[14]曾华燊,窦军,汪海鹰.论“单物理层的用户数据传输平面体系结构网络’SUPANET,计算机应用,2004,24(06)：1-5.
[15]李季,曾华燊EPFTS中基于时槽加权的公平调度算法,软件学报,2006,17(4)：822-829.
[16]P. Banerjee, R. Friedrich, C. Bash, P. Goldsack, B. A. Huberman, J. Manley, et al. Everything as a Service:Powering the New Information Economy, Computer,2011, 44(3):36-43.
[17]Inc. Amazon Web Services. Amazon Simple Storage Service (Amazon S3). http://aws.amazon.com/s3/
[18]Danah M. Boyd, Nicole B. Ellison. Social Network Sites:Definition, History, and Scholarship, Journal of Computer-Mediated Communication,2007,13(1):210-230.
[19]OASIS. Web Services Business Process Execution Language Version 2.0. http://docs.oasis-open.org/wsbpel/2.0/OS/wsbpel-v2.0-OS.html.
[20]W3C. Web Services Description Language (WSDL) Version 2.0 Part 1:Core Language. http://www.w3.org/TR/2007/REC-wsd120-20070626/.
[21]W3C. W3C Recommendation 26 November 2008:Extensible Markup Language (XML) 1.0 (Fifth Edition). http://www.w3.org/TR/xml/.
[22]W3C. W3C Recommendation 8 December 2009:Namespaces in XML 1.0 (Third Edition). http://www.w3.org/TR/2009/REC-xml-names-20091208/.
[23]W3C. XML Schema Part 0:Primer Second Edition. http://www.w3.org/TR/2004/REC-xmlschema-0-20041028/.
[24]W3C. XML Schema Part 1:Structures Second Edition. http://www.w3.org/TR/2004/REC-xmlschema-1-20041028/.
[25]W3C. W3C Recommendation 28 October 2004:XML Schema Part 2:Datatypes Second Edition. http://www.w3.org/TR/2004/REC-xmlschema-2-20041028/.
[26]Understanding Web Services XML WSDL SOAP and UDDI.
[27]W3C. Web Services Glossary. http://www.w3.org/TR/ws-gloss/.
[28]W3C. SOAP Version 1.2 Part 0:Primer (Second Edition).2007. http://www.w3.org/TR/2007/REC-soap12-part0-20070427/.
[29]W3C. Web Services Description Language (WSDL) Version 2.0 Part 0:Primer. http://www.w3.org/TR/2007/REC-wsd120-primer-20070626/.
[30]OASIS. UDDI Version 3.0.2. http://uddi.org/pubs/uddi_v3.htm.
[31]OASIS. Reference Model for Service Oriented Architecture 1.0. http://docs.oasis-open.org/soa-rm/v1.O/.
[32]Leonard Richardson, Sam Ruby. RESTful Web Services:O'Reilly Media, Inc.2007.
[33]Roy Thomas Fielding. Architectural Styles and the Design of Network-based Software Architectures, Ph.D, University of California, Irvine, Information and Computer Science,2000.
[34]IETF. RFC 2396:Uniform Resource Identifiers (URI):Generic Syntax.1998. http://www.ietf.org/rfc/rfc2396.txt.
[35]IETF. RFC 2068:Hypertext Transfer Protocol-HTTP/1.1.1997. http://www.ietf.org/rfc/rfc2068.txt.
[36]Jim Webber, Savas Parastatidis. Ian Robinson. REST in Practice:O'Reilly Media. Inc. 2010.
[37]IETF. RFC 4627:The application/json Media Type for JavaScript Object Notation (JSON).2006. http://www.ietf.org/rfc/rfc4627.txt.
[38]Marc J. Hadley. Web Application Description Language (WADL), Sun Microsystems 2006.
[39]D. Benslimane, S. Dustdar, A. Sheth. Serivices Mashups:The New Generation of Web Applications, Internet Computing, IEEE,2008,12(5):13-15.
[40]Yahoo! Inc. Yahoo! Pipes, http://pipes.yahoo.com/pipes/
[41]Yahoo! Inc. Flickr APIs, http://www.flickr.com/services/api/
[42]M. P. Papazoglou, P. Traverso, S. Dustdar, F. Leymann. Service-Oriented Computing: State of the Art and Research Challenges, Computer,2007,40(11):38-45.
[43]李磊.面向服务计算的若干关键技术研究,博士,中国科学技术大学,合肥,2008.
[44]IETF. RFC 5023:The Atom Publishing Protocol.2007. http://www.ietf.org/rfc/rfc5023.txt.
[45]Liangzhao Zeng, Boualem Benatallah, A. H. H. Ngu, Malone Dumas, J. Kalagnanam, H. Chang. QoS-aware middleware for Web services composition, IEEE Transactions on Software Engineering,2004,30(5):311-327.
[46]Liangzhao Zeng, Boualem Benatallah, Marlon Dumas, Jayant Kalagnanam, Quan Z. Sheng. Quality driven web services composition, in 12th International World Wide Web Conference (WWW), Budapest, Hungary,2003, pp.411-421.
[47]杨放春,苏森,李祯.混合QoS模型感知的语义Web服务组合策略,中国科学(E辑：信息科学),2008,10)：1697-1716.
[48]代钰,杨雷,张斌,高岩.支持组合服务选取的QoS模型及优化求解,计算机学报,2006,07)：1167-1178.
[49]叶世阳,魏峻,李磊,黄涛.支持服务关联的组合服务选择方法研究,计算机学报,2008,08)：1383-1397.
[50]Zheng Zibin, M. R. Lyu. A QoS-aware fault tolerant middleware for dependable service composition, in Dependable Systems & Networks,2009. DSN'09. IEEE/IFIP International Conference on,2009, pp.239-248.
[51]Xia Wang, Tomas Vitvar, Mick Kerrigan, loan Toma. A QoS-Aware Selection Model for Semantic Web Services. International Conference on Service-Oriented Computing (ICSOC),2006,4294:390-401.
[52]Tao Yu, Yue Zhang, Kwei-Jay Lin. Efficient algorithms for Web services selection with end-to-end QoS constraints, ACM Transactions on the Web,2007,1(1):1-26.
[53]Liu Lingxia, Wu ZhaoXue, Ma Zhiqiang, Wei Wei. A Fault-Tolerant Framework for Web Services, in Software Engineering,2009. WCSE'09. WRI World Congress on, 2009, pp.138-142.
[54]John K. Karlof. Integer Programming:Theory and Practice:CRC Press.2005.
[55]Hans Kellerer, Ulrich Pferschy, David Pisinger. Knapsack Problems. Berlin, Heidelberg, New York:Springer-Verlag,2004.
[56]Tao Yu, Kwei-Jay Lin. Service selection algorithms for Web services with end-to-end QoS constraints, Information Systems and e-Business Management,2005,3(2): 103-126.
[57]Tao Yu, Kwei-Jay Lin. Service Selection Algorithms for Composing Complex Services with Multiple QoS Constraints, in Service-Oriented Computing-ICSOC 2005. vol. 3826, B. Benatallah, F. Casati, and P. Traverso, Eds., ed:Springer Berlin Heidelberg, 2005, pp.130-143.
[58]Gerardo Canfora, Massimiliano Di Penta, Raffaele Esposito, Maria Luisa Villani. An approach for QoS-aware service composition based on genetic algorithms, presented at the Proceedings of the 2005 conference on Genetic and evolutionary computation, Washington DC, USA,2005.
[59]Ruixing Cheng, Sen Su, Fangchun Yang, Yong Li. Using Case-Based Reasoning to Support Web Service Composition, in Computational Science-ICCS 2006. vol.3994, V. Alexandrov, G. van Albada, P. Sloot, and J. Dongarra, Eds., ed:Springer Berlin/ Heidelberg,2006, pp.87-94.
[60]Xinfeng Ye, R. Mounla. A Hybrid Approach to QoS-Aware Service Composition, in 6th IEEE International Conference on Web Services (ICWS). Beijing, China,2008, pp. 62-69.
[61]Agnar Aamodt, Enric Plaza. Case-Based Reasoning:Foundational Issues, Methodological Variations, and System Approaches, AI Communications,1994,7(1): 39-59.
[62]C. Peltz. Web services orchestration and choreography. Computer,2003,36(10):46-52.
[63]Apache Software Foundation. Apache ODE. http://ode.apache.org/
[64]IBM. Business Process Execution Language for Web Services Java Run Time (BPWS4J). http://www.alphaworks.ibm.com/tech/bpws4j
[65]W. Binder, I. Constantinescu, B. Faltings. Decentralized Orchestration of CompositeWeb Services, in Web Services,2006. ICWS'06. International Conference on,2006, pp.869-876.
[66]Mangala Gowri Nanda, Satish Chandra, Vivek Sarkar, Association for Computing Machinery, A. C. M. Special Interest Group Engineering. Decentralizing execution of composite web services, in Object-oriented programming, systems, languages, and applications, Vancouver, BC, Canada,2004, pp.170-187.
[67]Girish B. Chafle, Sunil Chandra, Vijay Mann, Mangala Gowri Nanda. Decentralized orchestration of composite web services, in Alternate track papers & posters, New York, NY, USA,2004, pp.134-143.
[68]W3C. RDF Primer.2004. http://www.w3.org/TR/rdf-primer/.
[69]Sergey Brin, Lawrence Page. The anatomy of a large-scale hypertextual Web search engine, presented at the Proceedings of the seventh international conference on World Wide Web 7. Brisbane, Australia,1998.
[70]W3C. W3C Recommendation 15 January 2008:SPARQL Query Language for RDF. 2008. http://www.w3.org/TR/rdf-sparql-query/.
[71]B. McBride. Jena:a Semantic Web Toolkit, Internet Computing,2002,6(6):55-59.
[72]C. Schmidt, M. Parashar. Enabling flexible queries with guarantees in P2P systems, IEEE Internet Computing,2004,8(3):19-26.
[73]James Martin. Managing the Data-base Environment. Englewood Cliffs, New Jersey: Prentice-Hall,1983.
[74]UserLand Software. XML-RPC Specification.1999. http://xmlrpc.scripting.com/spec.html.
[75]W3C. W3C Recommendation 16 November 1999:XSL Transformations (XSLT) Version 1.0.1999. http://www.w3.org/TR/xslt.
[76]Frank E. Redmond. Dcom:Microsoft Distributed Component Object Model with Cdrom:IDG Books Worldwide, Inc.,1997.
[77]Robert Orfali, Dan Harkey. Client/server programming with Java and CORBA (2nd ed.):John Wiley\\& Sons, Inc.,1998.
[78]Duan Yucong. Value Modeling and Calculation for Everything as a Service (XaaS) Based on Reuse, in Software Engineering, Artificial Intelligence, Networking and Parallel & Distributed Computing (SNPD),2012 13th ACIS International Conference on,2012, pp.162-167.
[79]Oracal. Oracal Jersey.http://jersey.java.net/
[80]Google. Google App Engine. https://appengine.google.com/
[81]Baidu. Baidu App Engine.http://developer.baidu.com/bae/
[82]SINA Corporation. Sina App Engine. http://sae.sina.com.cn/
[83]Xi Chen, A. L. Lemos, M. C. Barukh, B. Benatallah. Service graph base:A unified graph-based platform for representing and manipulating service artifacts, in Service-Oriented Computing and Applications (SOCA),2012 5th IEEE International Conference on,2012, pp.1-8.
[84]W3C. Turtle:Terse RDF Triple Language.2013. http://www.w3.org/TR/turtle/.
[85]W3C. W3C Recommendation 10 February 2004:RDF Vocabulary Description Language 1.0:RDF Schema.2004. http://www.w3.org/TR/rdf-schema/.
[86]W3C. OWL Web Ontology Language Reference. http://www.w3.org/TR/2004/REC-owl-ref-20040210/.
[87]Seyed-Mehdi-Reza Beheshti, Boualem Benatallah, Hamid Reza Motahari-Nezhad, Sherif Sakr. A query language for analyzing business processes execution, in 9th International Conference on Business Process Management, BPM 2011, August 30, 2011-September 2,2011, Clermont-Ferrand, France,2011, pp.281-297.
[88]Faisal Alkhateeb, Jean-Francois Baget, Jerome Euzenet. Extending SPARQL with regular expression patterns (for querying RDF), Web Semantics,2009,7(2):57-73.
[89]Faisal Alkhateeb, Jean-Francois Baget, Jelrome Euzenat. Constrained regular expressions in SPARQL, in 2008 International Conference on Semantic Web and Web Services, SWWS 2008, July 14,2008-July 17,2008, Las Vegas, NV, United states, 2008, pp.91-99.
[90]Faisal Alkhateeb. Querying RDF(S) with Regular Expressions, Ph.D, Joseph Fourier University,2008.
[91]Krys J. Kochut, Maciej Janik. SPARQLeR:Extended sparql for semantic association discovery, in 4th European Semantic Web Conference, ESWC 2007, June 3,2007-June 7,2007, Innsbruck, Austria,2007, pp.145-159.
[92]Kemafor Anyanwu, Angela Maduko, Amit Sheth. SPARQ2L:Towards support for subgraph extraction queries in rdf databases, in 16th International World Wide Web Conference, WWW2007, May 8,2007-May 12,2007, Banff, AB, Canada,2007, pp. 797-806.
[93]Maciej Janik, Krys Kochut. BRAHMS:A WorkBench RDF store and high performance memory system for semantic association discovery, in 4th International Semantic Web Conference, ISWC 2005, November 6,2005-November 10,2005, Galway, Ireland,2005, pp.431-445.
[94]Boualem Benatallah, Marlon Dumas, Quan Z. Sheng. Facilitating the rapid development and scalable orchestration of composite web services, Distributed and Parallel Databases,2005,17(1):5-37.
[95]Christian Bizer, Tom Heath, Tim Berners-Lee. Linked Data-The Story So Far, ed:IGI Global,2009, pp.1-22.
[96]E. Q. V. Martins, M. M. B. Pascoal. A new implementation of Yen's ranking loopless paths algorithm,4OR,2003,1(2):121-133.
[97]柴登峰,张登荣.前N条最短路径问题的算法及应用,浙江大学学报(工学版),2002,05)：61-64.
[98]E. Q. V. Martins, J.L.E. Santos. A new shortest paths ranking algorithm, Investigacao Operacional.2000,20(1):47-62.
[99]Myrna Palmgren, Di Yuan. A Short Summary on K Shortest Path:Algorithms and Applications,1999.
[100]VictorM Jimenez. Andres Marzal. Computing the K Shortest Paths:A New Algorithm and an Experimental Comparison, in Algorithm Engineering, vol.1668, J. Vitter and C. Zaroliagis, Eds., ed:Springer Berlin Heidelberg,1999, pp.15-29.
[101]E. Q. V. Martins, M. M. B. Pascoal, J.L.E. Santos. A New Algorithm For Ranking Loopless Paths, CISUC 1997.
[102]Jose Augusto de Azevedo, Joaquim Joao E. R. Silvestre Madeira, Ernesto Q. Vieira Martins, Filipe Manuel A. Pires. A Shortest Paths Ranking Algorithm, in Models and Methods for Decision Support, Sorrento, Italy,1990, pp.1001-1011.
[103]Eugene L. Lawler. A Procedure for Computing the K Best Solutions to Discrete Optimization Problems and Its Application to the Shortest Path Problem, Management Science,1972,18(7):401-405.
[104]Jin Y Yen. Finding the k shortest loopless paths in a network, Management Science, 1971,17(11):712-716.
[105]E W Dijkstra. A Note on Two Problems in Connexion with Graphs, Numerische Mathematik,1959,1:269-271.
[106]Jin Yu, Boualem Benatallah, Fabio Casati, Florian Daniel. Understanding mashup development, IEEE Internet Computing,2008,12(5):44-52.
[107]M. Cameron Jones, Elizabeth F. Churchill. Conversations in developer communities:a preliminary analysis of the yahoo! pipes community, presented at the Proceedings of the fourth international conference on Communities and technologies, University Park, PA, USA,2009.
[108]Kathryn T. Stolee, Sebastian Elbaum. Refactoring pipe-like mashups for end-user programmers, in 33rd International Conference on Software Engineering, ICSE 2011, May 21,2011-May 28,2011, Waikiki, Honolulu, HI, United states,2011, pp.81-90.
[109]David F. Gleich, Paul G. Constantine, Abraham D. Flaxman, Asela Gunawardana. Tracking the random surfer:empirically measured teleportation parameters in PageRank, presented at the Proceedings of the 19th international conference on World wide web, Raleigh, North Carolina, USA,2010.
[110]Gianna M. Del Corso. Antonio Gulli, Francesco Romani. Fast PageRank Computation via a Sparse Linear System, Internet Mathematics,2005,2(3):251-273.
[111]Soudip Roy Chowdhury, Florian Daniel, Fabio Casati. Efficient, interactive recommendation of mashup composition knowledge, in 9th International Conference on Service-Oriented Computing, ICSOC 2011, December 5,2011-December 8,2011, Paphos, Cyprus,2011, pp.374-388.
[112]Soudip Roy Chowdhury, Carlos Rodriguez, Florian Daniel, Fabio Casati. Baya: Assisted mashup development as a service, in 21st Annual Conference on World Wide Web, WWW 12, April 16,2012-April 20,2012, Lyon, France,2012, pp.409-412.
[113]Andrew Begel, Khoo Yit Phang, Thomas Zimmermann. Codebook:Discovering and exploiting relationships in software repositories, in 32nd ACM/IEEE International Conference on Software Engineering, ICSE 2010, May 1,2010-May 8,2010, Cape Town, South africa,2010, pp.125-134.
[114]Gina Venolia. Textual Allusions to Artifacts in Software-Related Repositories, presented at the Proceedings of the 2006 international workshop on Mining software repositories, Shanghai, China,2006.
[115]Collin McMillan, Mark Grechanik, Denys Poshyvanyk, Qing Xie, Chen Fu. Portfolio: Finding relevant functions and their usage, in 33rd International Conference on Software Engineering, ICSE 2011, May 21,2011-May 28,2011, Waikiki, Honolulu, HI, United states,2011, pp.111-120.
[116]A. M. Collins, E. F. Loftus. A Spreading-activation theory of semantic processing, Psychological Review,1975,82(6):407-428.
[117]F. Crestani. Application of Spreading Activation Techniques in InformationRetrieval, Artif. Intell. Rev.,1997,11(6):453-482.
[118]Ken Thompson. Programming Techniques:Regular expression search algorithm, Commun. ACM,1968,11(6):419-422.
[119]Seymour Lipschutz, Marc Lipson. Schaum's Outline of Theory and Problems of Discrete Mathematics vol.2nd:McGraw-Hill Companies, Inc.,2002.
[120]Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein. Introduction to Algorithms vol.2nd. Cambridge, Massachusetts:The MIT Press,2002.
[121]I. Stoica, R. Morris, D. Liben-Nowell, D. R. Karger, M. F. Kaashoek, F. Dabek, et al. Chord:a scalable peer-to-peer lookup protocol for Internet applications, IEEE/ACM Transactions on Networking,2003,11(1):17-32.
[122]Petar Maymounkov, David Mazi. Kademlia:A Peer-to-Peer Information System Based on the XOR Metric, in 1st International Workshop on Peer-to-Peer Systems, Cambridge, MA,2002, pp.53-65.
[123]S. Tuecke, K. Czajkowski. Ian Foster. J. Frey. S. Graham. C. Kesselman, et al. GWD-R: Open Grid Services Infrastructure (OGSI) Version 0.2003. http://www.globus.org/toolkit/draft-ggf-ogsi-gridservice-33_2003-06-27.pdf.
[124]J. K. Lawder, P. J. H. King. Querying multi-dimensional data indexed using the Hilbert space-filling curve, SIGMOD Record (ACM Special Interest Group on Management of Data),2001,30(1):19-24.
[125]J. K. Lawder, P. J. H. King. Using State Diagrams for Hilbert Curve Mappings, International Journal of Computer Mathematics,2001,78(3):327-342.
[126]J. K. Lawder, P. J. H. King. Using space-filling curves for multi-dimensional indexing, in 17th British National Conference on Databases, UK,2000, pp.20-35.
[127]JA Orenstein. Spatial Query Processing in an Object-Oriented Database System, in ACM SIGMOD, Washington, DC,1986, pp.326-336.
[128]J. K. Lawder. The Application of Space-filling Curves to the Storage and Retrieval of Multi-dimensional Data, Ph.D, Birkbeck College, University of London, London, 2000.
[129]J. K. Lawder. Calculation of Mappings Between One and n-dimensional Values Using the Hilbert Space-filling Curve, Birkbeck College, University of London 2000.
[130]徐红波.基于空间填充曲线高维空间查询算法研究,博士,哈尔滨理工大学,哈尔滨,2010.
[131]David Karger, Eric Lehman, Tom Leighton, Matthew Levine, Daniel Lewin, Rina Panigrahy. Consistent hashing and random trees:Distributed caching protocols for relieving hot spots on the World Wide Web, in Proceedings of the 1997 29th Annual ACM Symposium on Theory of Computing, May 4,1997-May 6,1997, El Paso, TX, USA,1997, pp.654-663.
[132]A. Montresor, M. Jelasity. PeerSim: A Scalable P2P Simulator, in IEEE 9th International Conference on Peer-to-Peer Computing (P2P), Seattle, WA,2009, pp. 99-100.
[133]Li Jinyang, J. Stribling, R. Morris, M. F. Kaashoek, T. M. Gil. A performance vs. cost framework for evaluating DHT design tradeoffs under churn, in 24th Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE INFOCOM2005),Miami,FL,United states,2005,pp.225-236.
[134]邓水光,黄龙涛,尹建伟,李莹,吴健.Web服务组合技术框架及其研究进展,计算机集成制造系统,2011,17(02)：404-412.
[135]Yu Tao, Lin Kwei-Jay. A broker-based framework for QoS-aware Web service composition, in e-Technology, e-Commerce and e-Service,2005. EEE'05. Proceedings. The 2005 IEEE International Conference on,2005, pp.22-29.
[136]Yiming Zhang, Ling Liu, Dongsheng Li, Feng Liu, Xicheng Lu. DHT-Based Range Query Processing for Web Service Discovery, in 7th IEEE International Conference on Web Services (ICWS), Los Angeles, CA,2009, pp.477-484.
[137]H. Sagan. Space-Filling Curves. Heidelberg, Germany:Springer-Verlag,1994.
[138]OMG. Business Process Model And Notation (BPMN).2011. http://www.omg.org/spec/BPMN/.
[139]M. C. Jaeger, G. Rojec-Goldmann, G. Muhl. QoS aggregation for Web service composition using workflow patterns, in Enterprise Distributed Object Computing Conference,2004. EDOC 2004. Proceedings. Eighth IEEE International,2004, pp. 149-159.
[140]Xuan Tran Vuong, H. Tsuji. A Survey and Analysis on Semantics in QoS for Web Services, in Advanced Information Networking and Applications,2009. AIMA'09. International Conference on,2009, pp.379-385.
[141]Vuong Xuan Tran, Hidekazu Tsuji, Ryosuke Masuda. A new QoS ontology and its QoS-based ranking algorithm for Web services, Simulation Modelling Practice and Theory,2009,17(8):1378-1398.
[142]Shuping Ran. A model for web services discovery with QoS, SIGecom Exch.,2003, 4(1):1-10.
[143]I. Kazmi, S. F. Y. Bukhari. PeerSim:An Efficient Scalable Testbed for Heterogeneous Cluster-based P2P Network Protocols, in 13th International Conference on Computer Modelling and Simulation (UKSim), Los Alamitos, CA,2011, pp.420-425.
[144]张龙昌,邹华,杨放春.一种基于多QoS注册中心和模型异构的WEB服务选择算法,电子与信息学报,2011,33(1)：168-174.
[145]张莹,黄厚宽,杨冬,张宏科.基于Chord的带有QoS的语义Web服务发现方法研究,电子与信息学报,2009,31(3)：711-715.
[146]李祖鹏,黄建华,唐辉.基于P2P计算模式的自组织网络路由模型,软件学报,2005,05)：916-930.
[147]陈曦,曾华燊,吴涛.一种感知底层网络属性的对等式资源发现方法,四川大学 学报(工程科学版),2012,44(02)：105-111.
[148]W3C. Web Service Choreography Interface 1.0.2002. http://www.w3.org/TR/wsci/.
[149]G. Chafle, S. Chandra, V. Mann, M. G. Nanda. Orchestrating composite Web services under data flow constraints, in Web Services,2005. ICWS 2005. Proceedings.2005 IEEE International Conference on,2005, pp.211-218 vol.1.
[150]Ricardo Jimenez-Peris, Marta Patino-Martinez, Ernestina Martel-Jordan. Decentralized web service orchestration:a reflective approach, in Applied computing, Fortaleza, Ceara, Brazil,2008, pp.494-498.
[151]Alefiya Hussain, John Heidemann, Christos Papadopoulos. A framework for classifying denial of service attacks, presented at the Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications, Karlsruhe, Germany,2003.
[152]W3C. W3C Working Group Note 11 February 2004:Web Services Architecture.2004. http://www.w3.org/TR/2004/NOTE-ws-arch-20040211/.
[2]Lua Eng Keong, J. Crowcroft, M. Pias, R. Sharma, S. Lim. A survey and comparison of peer-to-peer overlay network schemes, Communications Surveys & Tutorials, IEEE, 2005,7(2):72-93.
[3]曾华燊.论Internet与Internet of Things,计算机应用,2012,32(4)：893-899.
[4]阎宏Java与模式.北京：电子工业出版社,2002.
[5]ITU. The Internet of Things, International Telecommunication Union, Tunis2005.
[6]刘鹏.云计算.北京:电子工业出版社,2010.
[7]IETF. RFC 3031:Multiprotocol Label Switching Architecture.2001. http://www.ietf.org/rfc/rfc3031.txt.
[8]Huashen Zeng,.Jun Dou, Dengyuan Xu. Single physical layer U-plane Architecture (SUPA) for Next Generation Internet, in Comprehensive Report on VoIP and enhanced IP Communications Services,2004, pp.197-227.
[9]ITU-T Focus Group on Cloud Computing. Technical Report version 1.0, part 2: Functional Requirements and Reference Architecture, Feb 2012.
[10]Steven M. Bellovin, David D. Clark, Adrian Perrig, Dawn Song. A Clean-Slate Design for the Next-Generation Secure Internet, Global Environment for Network Innovations (GENI). Berkeley, CA2005.
[11].Jun Dou, Yu Xia, Xi Chen. Future network applications. Network Model, and development strategy, in 6th International Conference on Broadband Communications, Networks, and Systems (BROADNETS 2009), Madrid, Spain.2009, pp.1-8.
[12]曾华燊,陈曦.NGI研发策略与单层用户数据交换平台体系结构,西南交通大学学报,2011,46(06)：889-898+921.
[13]Huashen Zeng, Yu Gao, Yu Xia. On NGN architecture and evolution strategy, in 1st ITU-T Kaleidoscope Academic Conference, Innovations in NGN (K-INGN), Geneva, Switzerland,2008, pp.337-342.
[14]曾华燊,窦军,汪海鹰.论“单物理层的用户数据传输平面体系结构网络’SUPANET,计算机应用,2004,24(06)：1-5.
[15]李季,曾华燊EPFTS中基于时槽加权的公平调度算法,软件学报,2006,17(4)：822-829.
[16]P. Banerjee, R. Friedrich, C. Bash, P. Goldsack, B. A. Huberman, J. Manley, et al. Everything as a Service:Powering the New Information Economy, Computer,2011, 44(3):36-43.
[17]Inc. Amazon Web Services. Amazon Simple Storage Service (Amazon S3). http://aws.amazon.com/s3/
[18]Danah M. Boyd, Nicole B. Ellison. Social Network Sites:Definition, History, and Scholarship, Journal of Computer-Mediated Communication,2007,13(1):210-230.
[19]OASIS. Web Services Business Process Execution Language Version 2.0. http://docs.oasis-open.org/wsbpel/2.0/OS/wsbpel-v2.0-OS.html.
[20]W3C. Web Services Description Language (WSDL) Version 2.0 Part 1:Core Language. http://www.w3.org/TR/2007/REC-wsd120-20070626/.
[21]W3C. W3C Recommendation 26 November 2008:Extensible Markup Language (XML) 1.0 (Fifth Edition). http://www.w3.org/TR/xml/.
[22]W3C. W3C Recommendation 8 December 2009:Namespaces in XML 1.0 (Third Edition). http://www.w3.org/TR/2009/REC-xml-names-20091208/.
[23]W3C. XML Schema Part 0:Primer Second Edition. http://www.w3.org/TR/2004/REC-xmlschema-0-20041028/.
[24]W3C. XML Schema Part 1:Structures Second Edition. http://www.w3.org/TR/2004/REC-xmlschema-1-20041028/.
[25]W3C. W3C Recommendation 28 October 2004:XML Schema Part 2:Datatypes Second Edition. http://www.w3.org/TR/2004/REC-xmlschema-2-20041028/.
[26]Understanding Web Services XML WSDL SOAP and UDDI.
[27]W3C. Web Services Glossary. http://www.w3.org/TR/ws-gloss/.
[28]W3C. SOAP Version 1.2 Part 0:Primer (Second Edition).2007. http://www.w3.org/TR/2007/REC-soap12-part0-20070427/.
[29]W3C. Web Services Description Language (WSDL) Version 2.0 Part 0:Primer. http://www.w3.org/TR/2007/REC-wsd120-primer-20070626/.
[30]OASIS. UDDI Version 3.0.2. http://uddi.org/pubs/uddi_v3.htm.
[31]OASIS. Reference Model for Service Oriented Architecture 1.0. http://docs.oasis-open.org/soa-rm/v1.O/.
[32]Leonard Richardson, Sam Ruby. RESTful Web Services:O'Reilly Media, Inc.2007.
[33]Roy Thomas Fielding. Architectural Styles and the Design of Network-based Software Architectures, Ph.D, University of California, Irvine, Information and Computer Science,2000.
[34]IETF. RFC 2396:Uniform Resource Identifiers (URI):Generic Syntax.1998. http://www.ietf.org/rfc/rfc2396.txt.
[35]IETF. RFC 2068:Hypertext Transfer Protocol-HTTP/1.1.1997. http://www.ietf.org/rfc/rfc2068.txt.
[36]Jim Webber, Savas Parastatidis. Ian Robinson. REST in Practice:O'Reilly Media. Inc. 2010.
[37]IETF. RFC 4627:The application/json Media Type for JavaScript Object Notation (JSON).2006. http://www.ietf.org/rfc/rfc4627.txt.
[38]Marc J. Hadley. Web Application Description Language (WADL), Sun Microsystems 2006.
[39]D. Benslimane, S. Dustdar, A. Sheth. Serivices Mashups:The New Generation of Web Applications, Internet Computing, IEEE,2008,12(5):13-15.
[40]Yahoo! Inc. Yahoo! Pipes, http://pipes.yahoo.com/pipes/
[41]Yahoo! Inc. Flickr APIs, http://www.flickr.com/services/api/
[42]M. P. Papazoglou, P. Traverso, S. Dustdar, F. Leymann. Service-Oriented Computing: State of the Art and Research Challenges, Computer,2007,40(11):38-45.
[43]李磊.面向服务计算的若干关键技术研究,博士,中国科学技术大学,合肥,2008.
[44]IETF. RFC 5023:The Atom Publishing Protocol.2007. http://www.ietf.org/rfc/rfc5023.txt.
[45]Liangzhao Zeng, Boualem Benatallah, A. H. H. Ngu, Malone Dumas, J. Kalagnanam, H. Chang. QoS-aware middleware for Web services composition, IEEE Transactions on Software Engineering,2004,30(5):311-327.
[46]Liangzhao Zeng, Boualem Benatallah, Marlon Dumas, Jayant Kalagnanam, Quan Z. Sheng. Quality driven web services composition, in 12th International World Wide Web Conference (WWW), Budapest, Hungary,2003, pp.411-421.
[47]杨放春,苏森,李祯.混合QoS模型感知的语义Web服务组合策略,中国科学(E辑：信息科学),2008,10)：1697-1716.
[48]代钰,杨雷,张斌,高岩.支持组合服务选取的QoS模型及优化求解,计算机学报,2006,07)：1167-1178.
[49]叶世阳,魏峻,李磊,黄涛.支持服务关联的组合服务选择方法研究,计算机学报,2008,08)：1383-1397.
[50]Zheng Zibin, M. R. Lyu. A QoS-aware fault tolerant middleware for dependable service composition, in Dependable Systems & Networks,2009. DSN'09. IEEE/IFIP International Conference on,2009, pp.239-248.
[51]Xia Wang, Tomas Vitvar, Mick Kerrigan, loan Toma. A QoS-Aware Selection Model for Semantic Web Services. International Conference on Service-Oriented Computing (ICSOC),2006,4294:390-401.
[52]Tao Yu, Yue Zhang, Kwei-Jay Lin. Efficient algorithms for Web services selection with end-to-end QoS constraints, ACM Transactions on the Web,2007,1(1):1-26.
[53]Liu Lingxia, Wu ZhaoXue, Ma Zhiqiang, Wei Wei. A Fault-Tolerant Framework for Web Services, in Software Engineering,2009. WCSE'09. WRI World Congress on, 2009, pp.138-142.
[54]John K. Karlof. Integer Programming:Theory and Practice:CRC Press.2005.
[55]Hans Kellerer, Ulrich Pferschy, David Pisinger. Knapsack Problems. Berlin, Heidelberg, New York:Springer-Verlag,2004.
[56]Tao Yu, Kwei-Jay Lin. Service selection algorithms for Web services with end-to-end QoS constraints, Information Systems and e-Business Management,2005,3(2): 103-126.
[57]Tao Yu, Kwei-Jay Lin. Service Selection Algorithms for Composing Complex Services with Multiple QoS Constraints, in Service-Oriented Computing-ICSOC 2005. vol. 3826, B. Benatallah, F. Casati, and P. Traverso, Eds., ed:Springer Berlin Heidelberg, 2005, pp.130-143.
[58]Gerardo Canfora, Massimiliano Di Penta, Raffaele Esposito, Maria Luisa Villani. An approach for QoS-aware service composition based on genetic algorithms, presented at the Proceedings of the 2005 conference on Genetic and evolutionary computation, Washington DC, USA,2005.
[59]Ruixing Cheng, Sen Su, Fangchun Yang, Yong Li. Using Case-Based Reasoning to Support Web Service Composition, in Computational Science-ICCS 2006. vol.3994, V. Alexandrov, G. van Albada, P. Sloot, and J. Dongarra, Eds., ed:Springer Berlin/ Heidelberg,2006, pp.87-94.
[60]Xinfeng Ye, R. Mounla. A Hybrid Approach to QoS-Aware Service Composition, in 6th IEEE International Conference on Web Services (ICWS). Beijing, China,2008, pp. 62-69.
[61]Agnar Aamodt, Enric Plaza. Case-Based Reasoning:Foundational Issues, Methodological Variations, and System Approaches, AI Communications,1994,7(1): 39-59.
[62]C. Peltz. Web services orchestration and choreography. Computer,2003,36(10):46-52.
[63]Apache Software Foundation. Apache ODE. http://ode.apache.org/
[64]IBM. Business Process Execution Language for Web Services Java Run Time (BPWS4J). http://www.alphaworks.ibm.com/tech/bpws4j
[65]W. Binder, I. Constantinescu, B. Faltings. Decentralized Orchestration of CompositeWeb Services, in Web Services,2006. ICWS'06. International Conference on,2006, pp.869-876.
[66]Mangala Gowri Nanda, Satish Chandra, Vivek Sarkar, Association for Computing Machinery, A. C. M. Special Interest Group Engineering. Decentralizing execution of composite web services, in Object-oriented programming, systems, languages, and applications, Vancouver, BC, Canada,2004, pp.170-187.
[67]Girish B. Chafle, Sunil Chandra, Vijay Mann, Mangala Gowri Nanda. Decentralized orchestration of composite web services, in Alternate track papers & posters, New York, NY, USA,2004, pp.134-143.
[68]W3C. RDF Primer.2004. http://www.w3.org/TR/rdf-primer/.
[69]Sergey Brin, Lawrence Page. The anatomy of a large-scale hypertextual Web search engine, presented at the Proceedings of the seventh international conference on World Wide Web 7. Brisbane, Australia,1998.
[70]W3C. W3C Recommendation 15 January 2008:SPARQL Query Language for RDF. 2008. http://www.w3.org/TR/rdf-sparql-query/.
[71]B. McBride. Jena:a Semantic Web Toolkit, Internet Computing,2002,6(6):55-59.
[72]C. Schmidt, M. Parashar. Enabling flexible queries with guarantees in P2P systems, IEEE Internet Computing,2004,8(3):19-26.
[73]James Martin. Managing the Data-base Environment. Englewood Cliffs, New Jersey: Prentice-Hall,1983.
[74]UserLand Software. XML-RPC Specification.1999. http://xmlrpc.scripting.com/spec.html.
[75]W3C. W3C Recommendation 16 November 1999:XSL Transformations (XSLT) Version 1.0.1999. http://www.w3.org/TR/xslt.
[76]Frank E. Redmond. Dcom:Microsoft Distributed Component Object Model with Cdrom:IDG Books Worldwide, Inc.,1997.
[77]Robert Orfali, Dan Harkey. Client/server programming with Java and CORBA (2nd ed.):John Wiley\\& Sons, Inc.,1998.
[78]Duan Yucong. Value Modeling and Calculation for Everything as a Service (XaaS) Based on Reuse, in Software Engineering, Artificial Intelligence, Networking and Parallel & Distributed Computing (SNPD),2012 13th ACIS International Conference on,2012, pp.162-167.
[79]Oracal. Oracal Jersey.http://jersey.java.net/
[80]Google. Google App Engine. https://appengine.google.com/
[81]Baidu. Baidu App Engine.http://developer.baidu.com/bae/
[82]SINA Corporation. Sina App Engine. http://sae.sina.com.cn/
[83]Xi Chen, A. L. Lemos, M. C. Barukh, B. Benatallah. Service graph base:A unified graph-based platform for representing and manipulating service artifacts, in Service-Oriented Computing and Applications (SOCA),2012 5th IEEE International Conference on,2012, pp.1-8.
[84]W3C. Turtle:Terse RDF Triple Language.2013. http://www.w3.org/TR/turtle/.
[85]W3C. W3C Recommendation 10 February 2004:RDF Vocabulary Description Language 1.0:RDF Schema.2004. http://www.w3.org/TR/rdf-schema/.
[86]W3C. OWL Web Ontology Language Reference. http://www.w3.org/TR/2004/REC-owl-ref-20040210/.
[87]Seyed-Mehdi-Reza Beheshti, Boualem Benatallah, Hamid Reza Motahari-Nezhad, Sherif Sakr. A query language for analyzing business processes execution, in 9th International Conference on Business Process Management, BPM 2011, August 30, 2011-September 2,2011, Clermont-Ferrand, France,2011, pp.281-297.
[88]Faisal Alkhateeb, Jean-Francois Baget, Jerome Euzenet. Extending SPARQL with regular expression patterns (for querying RDF), Web Semantics,2009,7(2):57-73.
[89]Faisal Alkhateeb, Jean-Francois Baget, Jelrome Euzenat. Constrained regular expressions in SPARQL, in 2008 International Conference on Semantic Web and Web Services, SWWS 2008, July 14,2008-July 17,2008, Las Vegas, NV, United states, 2008, pp.91-99.
[90]Faisal Alkhateeb. Querying RDF(S) with Regular Expressions, Ph.D, Joseph Fourier University,2008.
[91]Krys J. Kochut, Maciej Janik. SPARQLeR:Extended sparql for semantic association discovery, in 4th European Semantic Web Conference, ESWC 2007, June 3,2007-June 7,2007, Innsbruck, Austria,2007, pp.145-159.
[92]Kemafor Anyanwu, Angela Maduko, Amit Sheth. SPARQ2L:Towards support for subgraph extraction queries in rdf databases, in 16th International World Wide Web Conference, WWW2007, May 8,2007-May 12,2007, Banff, AB, Canada,2007, pp. 797-806.
[93]Maciej Janik, Krys Kochut. BRAHMS:A WorkBench RDF store and high performance memory system for semantic association discovery, in 4th International Semantic Web Conference, ISWC 2005, November 6,2005-November 10,2005, Galway, Ireland,2005, pp.431-445.
[94]Boualem Benatallah, Marlon Dumas, Quan Z. Sheng. Facilitating the rapid development and scalable orchestration of composite web services, Distributed and Parallel Databases,2005,17(1):5-37.
[95]Christian Bizer, Tom Heath, Tim Berners-Lee. Linked Data-The Story So Far, ed:IGI Global,2009, pp.1-22.
[96]E. Q. V. Martins, M. M. B. Pascoal. A new implementation of Yen's ranking loopless paths algorithm,4OR,2003,1(2):121-133.
[97]柴登峰,张登荣.前N条最短路径问题的算法及应用,浙江大学学报(工学版),2002,05)：61-64.
[98]E. Q. V. Martins, J.L.E. Santos. A new shortest paths ranking algorithm, Investigacao Operacional.2000,20(1):47-62.
[99]Myrna Palmgren, Di Yuan. A Short Summary on K Shortest Path:Algorithms and Applications,1999.
[100]VictorM Jimenez. Andres Marzal. Computing the K Shortest Paths:A New Algorithm and an Experimental Comparison, in Algorithm Engineering, vol.1668, J. Vitter and C. Zaroliagis, Eds., ed:Springer Berlin Heidelberg,1999, pp.15-29.
[101]E. Q. V. Martins, M. M. B. Pascoal, J.L.E. Santos. A New Algorithm For Ranking Loopless Paths, CISUC 1997.
[102]Jose Augusto de Azevedo, Joaquim Joao E. R. Silvestre Madeira, Ernesto Q. Vieira Martins, Filipe Manuel A. Pires. A Shortest Paths Ranking Algorithm, in Models and Methods for Decision Support, Sorrento, Italy,1990, pp.1001-1011.
[103]Eugene L. Lawler. A Procedure for Computing the K Best Solutions to Discrete Optimization Problems and Its Application to the Shortest Path Problem, Management Science,1972,18(7):401-405.
[104]Jin Y Yen. Finding the k shortest loopless paths in a network, Management Science, 1971,17(11):712-716.
[105]E W Dijkstra. A Note on Two Problems in Connexion with Graphs, Numerische Mathematik,1959,1:269-271.
[106]Jin Yu, Boualem Benatallah, Fabio Casati, Florian Daniel. Understanding mashup development, IEEE Internet Computing,2008,12(5):44-52.
[107]M. Cameron Jones, Elizabeth F. Churchill. Conversations in developer communities:a preliminary analysis of the yahoo! pipes community, presented at the Proceedings of the fourth international conference on Communities and technologies, University Park, PA, USA,2009.
[108]Kathryn T. Stolee, Sebastian Elbaum. Refactoring pipe-like mashups for end-user programmers, in 33rd International Conference on Software Engineering, ICSE 2011, May 21,2011-May 28,2011, Waikiki, Honolulu, HI, United states,2011, pp.81-90.
[109]David F. Gleich, Paul G. Constantine, Abraham D. Flaxman, Asela Gunawardana. Tracking the random surfer:empirically measured teleportation parameters in PageRank, presented at the Proceedings of the 19th international conference on World wide web, Raleigh, North Carolina, USA,2010.
[110]Gianna M. Del Corso. Antonio Gulli, Francesco Romani. Fast PageRank Computation via a Sparse Linear System, Internet Mathematics,2005,2(3):251-273.
[111]Soudip Roy Chowdhury, Florian Daniel, Fabio Casati. Efficient, interactive recommendation of mashup composition knowledge, in 9th International Conference on Service-Oriented Computing, ICSOC 2011, December 5,2011-December 8,2011, Paphos, Cyprus,2011, pp.374-388.
[112]Soudip Roy Chowdhury, Carlos Rodriguez, Florian Daniel, Fabio Casati. Baya: Assisted mashup development as a service, in 21st Annual Conference on World Wide Web, WWW 12, April 16,2012-April 20,2012, Lyon, France,2012, pp.409-412.
[113]Andrew Begel, Khoo Yit Phang, Thomas Zimmermann. Codebook:Discovering and exploiting relationships in software repositories, in 32nd ACM/IEEE International Conference on Software Engineering, ICSE 2010, May 1,2010-May 8,2010, Cape Town, South africa,2010, pp.125-134.
[114]Gina Venolia. Textual Allusions to Artifacts in Software-Related Repositories, presented at the Proceedings of the 2006 international workshop on Mining software repositories, Shanghai, China,2006.
[115]Collin McMillan, Mark Grechanik, Denys Poshyvanyk, Qing Xie, Chen Fu. Portfolio: Finding relevant functions and their usage, in 33rd International Conference on Software Engineering, ICSE 2011, May 21,2011-May 28,2011, Waikiki, Honolulu, HI, United states,2011, pp.111-120.
[116]A. M. Collins, E. F. Loftus. A Spreading-activation theory of semantic processing, Psychological Review,1975,82(6):407-428.
[117]F. Crestani. Application of Spreading Activation Techniques in InformationRetrieval, Artif. Intell. Rev.,1997,11(6):453-482.
[118]Ken Thompson. Programming Techniques:Regular expression search algorithm, Commun. ACM,1968,11(6):419-422.
[119]Seymour Lipschutz, Marc Lipson. Schaum's Outline of Theory and Problems of Discrete Mathematics vol.2nd:McGraw-Hill Companies, Inc.,2002.
[120]Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein. Introduction to Algorithms vol.2nd. Cambridge, Massachusetts:The MIT Press,2002.
[121]I. Stoica, R. Morris, D. Liben-Nowell, D. R. Karger, M. F. Kaashoek, F. Dabek, et al. Chord:a scalable peer-to-peer lookup protocol for Internet applications, IEEE/ACM Transactions on Networking,2003,11(1):17-32.
[122]Petar Maymounkov, David Mazi. Kademlia:A Peer-to-Peer Information System Based on the XOR Metric, in 1st International Workshop on Peer-to-Peer Systems, Cambridge, MA,2002, pp.53-65.
[123]S. Tuecke, K. Czajkowski. Ian Foster. J. Frey. S. Graham. C. Kesselman, et al. GWD-R: Open Grid Services Infrastructure (OGSI) Version 0.2003. http://www.globus.org/toolkit/draft-ggf-ogsi-gridservice-33_2003-06-27.pdf.
[124]J. K. Lawder, P. J. H. King. Querying multi-dimensional data indexed using the Hilbert space-filling curve, SIGMOD Record (ACM Special Interest Group on Management of Data),2001,30(1):19-24.
[125]J. K. Lawder, P. J. H. King. Using State Diagrams for Hilbert Curve Mappings, International Journal of Computer Mathematics,2001,78(3):327-342.
[126]J. K. Lawder, P. J. H. King. Using space-filling curves for multi-dimensional indexing, in 17th British National Conference on Databases, UK,2000, pp.20-35.
[127]JA Orenstein. Spatial Query Processing in an Object-Oriented Database System, in ACM SIGMOD, Washington, DC,1986, pp.326-336.
[128]J. K. Lawder. The Application of Space-filling Curves to the Storage and Retrieval of Multi-dimensional Data, Ph.D, Birkbeck College, University of London, London, 2000.
[129]J. K. Lawder. Calculation of Mappings Between One and n-dimensional Values Using the Hilbert Space-filling Curve, Birkbeck College, University of London 2000.
[130]徐红波.基于空间填充曲线高维空间查询算法研究,博士,哈尔滨理工大学,哈尔滨,2010.
[131]David Karger, Eric Lehman, Tom Leighton, Matthew Levine, Daniel Lewin, Rina Panigrahy. Consistent hashing and random trees:Distributed caching protocols for relieving hot spots on the World Wide Web, in Proceedings of the 1997 29th Annual ACM Symposium on Theory of Computing, May 4,1997-May 6,1997, El Paso, TX, USA,1997, pp.654-663.
[132]A. Montresor, M. Jelasity. PeerSim: A Scalable P2P Simulator, in IEEE 9th International Conference on Peer-to-Peer Computing (P2P), Seattle, WA,2009, pp. 99-100.
[133]Li Jinyang, J. Stribling, R. Morris, M. F. Kaashoek, T. M. Gil. A performance vs. cost framework for evaluating DHT design tradeoffs under churn, in 24th Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE INFOCOM2005),Miami,FL,United states,2005,pp.225-236.
[134]邓水光,黄龙涛,尹建伟,李莹,吴健.Web服务组合技术框架及其研究进展,计算机集成制造系统,2011,17(02)：404-412.
[135]Yu Tao, Lin Kwei-Jay. A broker-based framework for QoS-aware Web service composition, in e-Technology, e-Commerce and e-Service,2005. EEE'05. Proceedings. The 2005 IEEE International Conference on,2005, pp.22-29.
[136]Yiming Zhang, Ling Liu, Dongsheng Li, Feng Liu, Xicheng Lu. DHT-Based Range Query Processing for Web Service Discovery, in 7th IEEE International Conference on Web Services (ICWS), Los Angeles, CA,2009, pp.477-484.
[137]H. Sagan. Space-Filling Curves. Heidelberg, Germany:Springer-Verlag,1994.
[138]OMG. Business Process Model And Notation (BPMN).2011. http://www.omg.org/spec/BPMN/.
[139]M. C. Jaeger, G. Rojec-Goldmann, G. Muhl. QoS aggregation for Web service composition using workflow patterns, in Enterprise Distributed Object Computing Conference,2004. EDOC 2004. Proceedings. Eighth IEEE International,2004, pp. 149-159.
[140]Xuan Tran Vuong, H. Tsuji. A Survey and Analysis on Semantics in QoS for Web Services, in Advanced Information Networking and Applications,2009. AIMA'09. International Conference on,2009, pp.379-385.
[141]Vuong Xuan Tran, Hidekazu Tsuji, Ryosuke Masuda. A new QoS ontology and its QoS-based ranking algorithm for Web services, Simulation Modelling Practice and Theory,2009,17(8):1378-1398.
[142]Shuping Ran. A model for web services discovery with QoS, SIGecom Exch.,2003, 4(1):1-10.
[143]I. Kazmi, S. F. Y. Bukhari. PeerSim:An Efficient Scalable Testbed for Heterogeneous Cluster-based P2P Network Protocols, in 13th International Conference on Computer Modelling and Simulation (UKSim), Los Alamitos, CA,2011, pp.420-425.
[144]张龙昌,邹华,杨放春.一种基于多QoS注册中心和模型异构的WEB服务选择算法,电子与信息学报,2011,33(1)：168-174.
[145]张莹,黄厚宽,杨冬,张宏科.基于Chord的带有QoS的语义Web服务发现方法研究,电子与信息学报,2009,31(3)：711-715.
[146]李祖鹏,黄建华,唐辉.基于P2P计算模式的自组织网络路由模型,软件学报,2005,05)：916-930.
[147]陈曦,曾华燊,吴涛.一种感知底层网络属性的对等式资源发现方法,四川大学 学报(工程科学版),2012,44(02)：105-111.
[148]W3C. Web Service Choreography Interface 1.0.2002. http://www.w3.org/TR/wsci/.
[149]G. Chafle, S. Chandra, V. Mann, M. G. Nanda. Orchestrating composite Web services under data flow constraints, in Web Services,2005. ICWS 2005. Proceedings.2005 IEEE International Conference on,2005, pp.211-218 vol.1.
[150]Ricardo Jimenez-Peris, Marta Patino-Martinez, Ernestina Martel-Jordan. Decentralized web service orchestration:a reflective approach, in Applied computing, Fortaleza, Ceara, Brazil,2008, pp.494-498.
[151]Alefiya Hussain, John Heidemann, Christos Papadopoulos. A framework for classifying denial of service attacks, presented at the Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications, Karlsruhe, Germany,2003.
[152]W3C. W3C Working Group Note 11 February 2004:Web Services Architecture.2004. http://www.w3.org/TR/2004/NOTE-ws-arch-20040211/.