语义社区中服务注册中心部署策略研究
|
摘要
服务注册中心是面向服务架构的重要组成部分之一。随着互联网范围内面向服务计算模式的普及和网络规模日趋复杂,海量服务注册信息的合理组织和管理对面向服务计算的性能显得至关重要,因此,服务注册中心的合理部署是实现上述目标的基础。目前,复杂网络环境下服务注册中心部署存在的主要问题包括缺乏理论支撑,不能适应网络动态演变,缺乏语义信息处理能力,不能理解服务注册信息和自动演算推理。与此同时,在复杂网络的研究中发现万维网等都具有非常有价值的统计特性,诸如网络呈现的社区结构特性,它为服务注册中心的研究提供了有力理论依据。《中国至2050年信息科技发展线路图》已将网络科学列为发展新信息科学和前沿交叉科学的重要分支,因此,在对等网络中利用语义和社区结构特性来搜寻和发现语义社区(根据节点兴趣偏好的语义信息划分的内部联系紧密而外部联系稀疏的逻辑结构),然后在其中设置服务注册中心的研究具有重要的实际应用价值,也对复杂网络的理论研究起到了积极的作用,在语义社区中进行服务注册中心部署策略研究具有理论价值。
基于上述背景,论文通过结合对等网的可扩展性、语义网络的智能性和复杂网络的社区结构特性,开展了语义社区中服务注册中心部署策略研究,提出了一个解决服务注册中心部署问题的模型,并针对模型中所涉及的节点选择、网络演化和语义社区划分等具体问题展开了研究。因此,论文的主要内容包括系统模型设计、超级节点选择、网络拓扑演化、语义信息传播和语义社区划分五个方面。论文研究取得的主要成果体现在以下几个方面:
(1)提出了以语义特征为基础的具有超级节点的语义路由服务注册中心(Super Peer and Semantic Routing UDDI, SPSR-UDDI)模型。模型以语义信息为基础,将节点兴趣偏好语义信息以“谣言”形式传播,节点通过语义信息获取到与其具有相同兴趣偏好的其它节点信息,把网络中的节点按照兴趣偏好划分语义社区,在社区中选择综合性能相对较好的节点作为超级节点承担服务注册中心的任务,社区间通过语义信息互联,对于给定的查询主要集中在对应的主题域,查询处理范围小,查询处理效率高。
(2)提出了基于集对的超级节点选择算法。算法在超级节点选择时引入资源消耗因子和负载能力,量化了负载能力性能指标,增加了算法的普适性和灵活性;采用集对方法选择超级节点,较好地量化节点各种参数,实现了模糊综合评价,该方法还可以通过权重的方式体现用户的对特定参数的重视程度,是一种有效的评估方法;根据节点排队长度涨落的均方根函数,在节点即将出现拥塞之前启动超级节点选举算法,提高了系统整体服务的响应时间。
(3)提出了基于节点点强度的网络演化方法。方法采用在密集区投放服务点的思想,通过节点边权优先连接原则让部分节点动态调整连接策略,实现了网络自组织演化过程,并使最终的网络具备小世界特性,获得较好的服务响应时间。
(4)提出了采用谣言兴趣衰减机制的语义信息传播模型。模型采用谣言兴趣衰减机制,以较小的消息量在网络中实现节点兴趣偏好信息的有效传播;每个节点仅依据网络中的兴趣偏好信息进行决策,并根据兴趣偏好的语义匹配相似程度改变节点之间的连接度,减少了对全局性知识的依赖。
(5)提出了基于社区语义熵的语义社区划分算法。算法通过节点间的语义信息,利用社区语义熵实现了将兴趣偏好相似的节点聚集在同一主题领域的语义社区划分;社区划分后,由超级节点管理每个语义社区,承担服务注册中心任务,节点根据语义信息自主地建立并维护与其它节点的拓扑连接,完成网络自组织过程,达到节点资源的有序组织,为语义社区结构中的服务注册中心部署提供的新途径。
论文的研究工作为挖掘网络语义社区结构和部署服务注册中心提供了理论和方法,在复杂网络特性应用研究方面进行了有意义的探索,对网络科学的发展起到了积极的作用。
Service registry is an important component in service-oriented architecture, called SOA. With the arising of service-oriented computing mode in Internet and the growing complexity of network, it becomes very important to the efficiency and performance of service-oriented computing that huge volume of service registering information are reasonably organized, managed and fast indexed in complex network, so the appropriated deployment of service registries is the essential to gain this goal. The current service registries in complex network can not adapt the dynamic evolution of network because of the lack of appropriate theory support in organizing, managing and deploying. Due to the lack of ability of semantic processing, service registration information can not be efficiently understood, automatically calculus reasoned and appropriately organized. Meanwhile, in the study of complex network, many valuable statistical properties results are found in the World Wide Web etc., such as the network that presents a community structural characteristics which can provide a strong theoretical basis to study on service registry. The report "The Road Map of China Information Technology Development Until 2050 " has listed the development of new information science and cutting-edge interdisciplinary. Therefore, the study of searching and discovering semantic communities (A logic structure which is constructed through semantic information according to the preference of each node) through the semantic and structural characteristics in peer-to-peer network can be used to direct the setting of service registries. These studies do not only have important application value in organizing service-oriented network, but also theoretical value which promotes the application of complex network theory.
The strategy of service registry deployment in semantic community is studied in this dissertation combining the extensibility of P2P network, intelligence of semantic network and characteristic of community structure in complex network. A model is proposed to help the deployment of service registry. A few key issues involved in this model including node selection, network evolution and semantic community construction are studied. So five main topics are discussed in this thesis, including the design of system model, selection of super node, evolution of network topology, propagation of semantic information and the division of semantic community. Some innovative research results are gained as the following:
(1) A Super Peer and Semantic Routing Model is proposed, which is based on the semantic characteristics of information, the preferences of each node in the semantic information is propagated in gossiping mode. Each node can get the information of other nodes which have the same preference through the semantic gossip, so the nodes in the network can be divided into different semantic community based on their preferences. The node with the best overall performance is selected as the super node, which is in charge of registry. Different communities can be interconnected through semantic information. Given request of querying, the processing is limited in appropriate domain, so the processing range is decreased, and more efficiency of processing gained.
(2) The set-pair based super node selecting algorithm is proposed. The factor of resource consumption and load capability are introduced in super node selecting. The load capacity is qualified, the universal and flexibility of super node selection can be increased. Selecting super node using the method of set pair can qualify different parameters on each node, so the fuzzy evaluation of each node can be achieved. This method can also reflect the user customized emphasis on specific parameter through weight, which is an efficient evaluation method. The root mean square function is used to measure the dynamic changing of node queuing, the election algorithm could be trigger before the congestion of processing, so the whole service response time could be improved.
(3) A node intensity based network evolving method is proposed, which uses the idea deploying more service points in dense zone. The connection strategy is adjusted dynamically through the edge-weight priority rule, so the process of network self evolution could be achieved. The final network has the characteristics of small world and a better global response time is gained.
(4) A model of semantic information propagation using gossip mechanism is proposed. Gossip decay mechanism is used to achieve the efficient propagating of node preference with lower cost. Each node makes decision based on preferred information. The connection degree between nodes could be changed according to the semantic similarity of preference between nodes through semantic matching. The dependence on global knowledge is magnificently decreased.
(5) A semantic community division algorithm based on the entropy of community semantic is proposed. In this algorithm, using the concept of semantic entropy, nodes with similar preference are gathered into a domain of semantic community division based on the semantic information between nodes. After the division of community, each semantic community is managed by a super node, which is responsible for registry. Each node sets up and maintains the topology of connection with other nodes independently according to the semantic information, process the self organization of network to achieve the orderly organizing of resource on each node. This provides a new way to the deployment of service registries in semantic community.
This research provides the theory and method for mining semantic community structure in the complex network and deployment of service registry, meaningfully explores in applied research of characteristics in complex network, and plays a positive role for the development of network science.
基于上述背景,论文通过结合对等网的可扩展性、语义网络的智能性和复杂网络的社区结构特性,开展了语义社区中服务注册中心部署策略研究,提出了一个解决服务注册中心部署问题的模型,并针对模型中所涉及的节点选择、网络演化和语义社区划分等具体问题展开了研究。因此,论文的主要内容包括系统模型设计、超级节点选择、网络拓扑演化、语义信息传播和语义社区划分五个方面。论文研究取得的主要成果体现在以下几个方面:
(1)提出了以语义特征为基础的具有超级节点的语义路由服务注册中心(Super Peer and Semantic Routing UDDI, SPSR-UDDI)模型。模型以语义信息为基础,将节点兴趣偏好语义信息以“谣言”形式传播,节点通过语义信息获取到与其具有相同兴趣偏好的其它节点信息,把网络中的节点按照兴趣偏好划分语义社区,在社区中选择综合性能相对较好的节点作为超级节点承担服务注册中心的任务,社区间通过语义信息互联,对于给定的查询主要集中在对应的主题域,查询处理范围小,查询处理效率高。
(2)提出了基于集对的超级节点选择算法。算法在超级节点选择时引入资源消耗因子和负载能力,量化了负载能力性能指标,增加了算法的普适性和灵活性;采用集对方法选择超级节点,较好地量化节点各种参数,实现了模糊综合评价,该方法还可以通过权重的方式体现用户的对特定参数的重视程度,是一种有效的评估方法;根据节点排队长度涨落的均方根函数,在节点即将出现拥塞之前启动超级节点选举算法,提高了系统整体服务的响应时间。
(3)提出了基于节点点强度的网络演化方法。方法采用在密集区投放服务点的思想,通过节点边权优先连接原则让部分节点动态调整连接策略,实现了网络自组织演化过程,并使最终的网络具备小世界特性,获得较好的服务响应时间。
(4)提出了采用谣言兴趣衰减机制的语义信息传播模型。模型采用谣言兴趣衰减机制,以较小的消息量在网络中实现节点兴趣偏好信息的有效传播;每个节点仅依据网络中的兴趣偏好信息进行决策,并根据兴趣偏好的语义匹配相似程度改变节点之间的连接度,减少了对全局性知识的依赖。
(5)提出了基于社区语义熵的语义社区划分算法。算法通过节点间的语义信息,利用社区语义熵实现了将兴趣偏好相似的节点聚集在同一主题领域的语义社区划分;社区划分后,由超级节点管理每个语义社区,承担服务注册中心任务,节点根据语义信息自主地建立并维护与其它节点的拓扑连接,完成网络自组织过程,达到节点资源的有序组织,为语义社区结构中的服务注册中心部署提供的新途径。
论文的研究工作为挖掘网络语义社区结构和部署服务注册中心提供了理论和方法,在复杂网络特性应用研究方面进行了有意义的探索,对网络科学的发展起到了积极的作用。
Service registry is an important component in service-oriented architecture, called SOA. With the arising of service-oriented computing mode in Internet and the growing complexity of network, it becomes very important to the efficiency and performance of service-oriented computing that huge volume of service registering information are reasonably organized, managed and fast indexed in complex network, so the appropriated deployment of service registries is the essential to gain this goal. The current service registries in complex network can not adapt the dynamic evolution of network because of the lack of appropriate theory support in organizing, managing and deploying. Due to the lack of ability of semantic processing, service registration information can not be efficiently understood, automatically calculus reasoned and appropriately organized. Meanwhile, in the study of complex network, many valuable statistical properties results are found in the World Wide Web etc., such as the network that presents a community structural characteristics which can provide a strong theoretical basis to study on service registry. The report "The Road Map of China Information Technology Development Until 2050 " has listed the development of new information science and cutting-edge interdisciplinary. Therefore, the study of searching and discovering semantic communities (A logic structure which is constructed through semantic information according to the preference of each node) through the semantic and structural characteristics in peer-to-peer network can be used to direct the setting of service registries. These studies do not only have important application value in organizing service-oriented network, but also theoretical value which promotes the application of complex network theory.
The strategy of service registry deployment in semantic community is studied in this dissertation combining the extensibility of P2P network, intelligence of semantic network and characteristic of community structure in complex network. A model is proposed to help the deployment of service registry. A few key issues involved in this model including node selection, network evolution and semantic community construction are studied. So five main topics are discussed in this thesis, including the design of system model, selection of super node, evolution of network topology, propagation of semantic information and the division of semantic community. Some innovative research results are gained as the following:
(1) A Super Peer and Semantic Routing Model is proposed, which is based on the semantic characteristics of information, the preferences of each node in the semantic information is propagated in gossiping mode. Each node can get the information of other nodes which have the same preference through the semantic gossip, so the nodes in the network can be divided into different semantic community based on their preferences. The node with the best overall performance is selected as the super node, which is in charge of registry. Different communities can be interconnected through semantic information. Given request of querying, the processing is limited in appropriate domain, so the processing range is decreased, and more efficiency of processing gained.
(2) The set-pair based super node selecting algorithm is proposed. The factor of resource consumption and load capability are introduced in super node selecting. The load capacity is qualified, the universal and flexibility of super node selection can be increased. Selecting super node using the method of set pair can qualify different parameters on each node, so the fuzzy evaluation of each node can be achieved. This method can also reflect the user customized emphasis on specific parameter through weight, which is an efficient evaluation method. The root mean square function is used to measure the dynamic changing of node queuing, the election algorithm could be trigger before the congestion of processing, so the whole service response time could be improved.
(3) A node intensity based network evolving method is proposed, which uses the idea deploying more service points in dense zone. The connection strategy is adjusted dynamically through the edge-weight priority rule, so the process of network self evolution could be achieved. The final network has the characteristics of small world and a better global response time is gained.
(4) A model of semantic information propagation using gossip mechanism is proposed. Gossip decay mechanism is used to achieve the efficient propagating of node preference with lower cost. Each node makes decision based on preferred information. The connection degree between nodes could be changed according to the semantic similarity of preference between nodes through semantic matching. The dependence on global knowledge is magnificently decreased.
(5) A semantic community division algorithm based on the entropy of community semantic is proposed. In this algorithm, using the concept of semantic entropy, nodes with similar preference are gathered into a domain of semantic community division based on the semantic information between nodes. After the division of community, each semantic community is managed by a super node, which is responsible for registry. Each node sets up and maintains the topology of connection with other nodes independently according to the semantic information, process the self organization of network to achieve the orderly organizing of resource on each node. This provides a new way to the deployment of service registries in semantic community.
This research provides the theory and method for mining semantic community structure in the complex network and deployment of service registry, meaningfully explores in applied research of characteristics in complex network, and plays a positive role for the development of network science.
引文
[1]方锦清.一门崭新的交叉科学:网络科学(上)[J].物理学进展, 2007, 27(3).
[2]方锦清.一门崭新的交叉科学:网络科学(下)[J].物理学进展, 2007, 27(4).
[3] Sen, Subhabrata,Jia Wang. Analyzing peer-to-peer traffic across large networks[J]. IEEE/ACM Transactions on Networking, 2004, 12(2): 219-232.
[4] Saroiu, S, KP Gummadi, RJ Dunn, SD Gribble,HM Levy. An analysis of internet content delivery systems[J]. ACM SIGOPS Operating Systems Review, 2002, 36(si): 315.
[5] Ripeanu, Matei, Adriana Iamnitchi,Ian Foster. Mapping the Gnutella network[J]. IEEE Internet Computing, 2002, 6(1): 50-57.
[6] Foster, I,A Iamnitchi. On death, taxes, and the convergence of peer-to-peer and grid computing[J]. Lecture Notes in Computer Science, 2003: 118-128.
[7] Endrei M, Ang J, Arsanjani A,Chua S,Comte P,Krogdahl P,Luo M,Newling T. Patterns: Service_Oriented architecture and Web services[EB/OL]. http://www.redbooks.ibm.com/ redbooks/pdfs/sg246303.pdf. 2004, [cited 2008 12.3].
[8] Tsai, W. T., Xinyu Zhou, Yinong Chen, Bingnan Xiao, Raymond A. Paul,William Chu. Roadmap to a full service broker in service-oriented architecture[C]. SOSE 2007, October 24, 2007. Hong Kong, China: Inst. of Elec. and Elec. Eng. Computer Society.
[9] Dow, Matthew, Pascal Ravesteijn,Johan Versendaal. Assessing the quality of Enterprise Services - A model for supporting Service Oriented Architecture design[C]. in ICEIS 2008 - 10th International Conference on Enterprise Information Systems, June 12, 2008. Barcelona, Spain: Inst. for Syst. and Technol. of Inf. Control and Commun.
[10] Jrstad, Ivar, Schahram Dustdar,Do Van Thanh. A service oriented architecture framework for collaborative services[C]. in 14th IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprises, WET ICE 2005, June 13, 2005. Linkoeping, Sweden: Inst. of Elec. and Elec. Eng. Computer Society.
[11] Takase, Toshiro. Workshop on Service Oriented Architecture[C]. in 14th Asia Pacific Software Engineering Conference, ASPCE 2007, December 4, 2007. Nagoya, Japan: IEEE Computer Society.
[12] Abramowitz, W.,T. Eymann. Service oriented architecture and web services[J]. Wirtschaft - sinformatik, 2008, 50(1): 1-3.
[13] Christensen E, Curbera F, Meredith G,Weerawarana S. Web services description language (WSDL) 1.1[EB/OL]. http://www.w3.org/TR/wsdl. 2001, [cited 2007 10.9].
[14] Clement L, Hately A, Riegen CV, Rogers T. Universal description discovery & integration (UDDI) 3.0.2[EB/OL]. http://uddi.org/pubs/uddi_v3.htm. 2004, [cited 2009 1.3].
[15] Bellwood, T. Universal description, discovery and integration specification (UDDI) 3.0 [EB/OL]. Online: http://uddi. org/pubs/uddi-v3. 00-published-20020719. htm.
[16] Cai, Min,Martin Frank. RDFPeers: A scalable distributed RDF repository based on a structured peer-to-peer network[C]. in Thirteenth International World Wide Web Conference Proceedings, WWW2004, May 17, 2004. New York, NY, United states: Association for Computing Machinery.
[17] Hong, Wontaek, Minyeol Lim, Ennsung Kim, Jongsuk Lee,Hyoungwoo Park. GAIS: Grid advanced information service based on P2P mechanism[C]. in Proceedings - 13th IEEE International Symposium on High Performance Distributed Computing, June 4, 2004. Honolulu, HI, United states: Institute of Electrical and Electronics Engineers Inc.
[18] Li, Xiao, Zhang Xiaodong,Xu Zhichen. On reliable and scalable peer-to-peer Web document sharing[J]. Proceedings 16th International Parallel and Distributed Processing Symposium, 2002: 224-31.
[19] Nagy W, Curbera F, Weerawaranna S. The advertisement and discovery of services (ADS) protocol for Web servicesads.html? dwzone=ws [EB/OL]. http://www-28.ibm.com/ developerworks/library/ws. 2000, [cited 2007 10.3].
[20] ShaikhAli, A, OF Rana, R Al-Ali,DW Walker. Uddie: An extended registry for web services[C]. 2003.
[21] Verma K, Sivashanmugam K, Sheth A,Patil A,Oundhakar S,Miller J. METEOR-S WSDI: A scalable P2P infrastructure of registries for semantic publication and discovery of Web services[J]. Journal of Information Technology and Management, 2005, 6(1): 17-39.
[22] Oundhakar S, Verma K, Sivashanmugam K,Sheth A,Miller J. Discovery of Web services in a multi-ontology and federated registry environment[J]. Journal of Web Services Research, 2005, 2(3): 1-32.
[23] Papazoglou MP, Kramer BJ, Yang J. Leveraging Web-services and peer-to-peer networks[R]. Proc. of the Advanced Information Systems Engineering,15th Int’l Conf. (CAiSE 2003). Klagenfurt: : Springer-Verlag, 2003: 485-501.
[24]杜宗霞,怀进鹏.主动分布式Web服务注册机制研究与实现[J].软件学报, 2006(03).
[25] Guo, De-Ke, Hong-Hui Chen, Xue-Shan Luo,Wei-Ming Zhang. Enhance UDDI and design peer-to-peer network for UDDI to realize decentralized web service discovery[C]. in 2005 International Symposium on Web Services and Applications, ISWS'05, June 27, 2005. Las Vegas, NV, United states: CSREA Press.
[26] Tran Da, Hua Ka, Do T T. A peer-to-peer architecture for media streaming[J]. IEEE Journal on Selected Areas in Communications, 2004, 22(1): 1-44.
[27] Rong L, Burnett I. Dynamic resource adaptation in a heterogeneous peer-to-peer environment[R]. IEEE Consumer Communications and Networking Conference. USA, LasVegas, 2005: 416-420.
[28] ECSP, LI J. an Efficient Clustered Super-Peer Architecture for P2P Networks[D]. Canada: the University of British Columbia, 2003.
[29] Tsoumakos, Dimitrios,Nick Roussopoulos. Analysis and comparison of P2P search methods[C]. in 1st International Conference on Scalable Information Systems, InfoScale '06, May 30, 2006. Hong Kong, China: Association for Computing Machinery.
[30] Min, Suhong,Dongsub Cho. Super-peer selection based framework using dynamic capacity and similarity[C]. in ISCIS 2006: 21th International Symposium on Computer and Information Sciences, November 1, 2006. Istanbul, Turkey: Springer Verlag.
[31] Min, Su-Hong, Joanne Holliday,Dong-Sub Cho. Optimal super-peer selection for large-scale P2P system[C]. in 2006 International Conference on Hybrid Information Technology, ICHIT 2006, November 9, 2006. Cheju Island, Korea, Republic of: Inst. of Elec. and Elec. Eng. Computer Society.
[32] Wiesner, Christian, Alfons Kemper,Stefan Brandl. Dynamic extensible query processing in super-peer based P2P systems[C]. in Proceedings - 20th International Conference on Data Engineering - ICDE 2004, March 30, 2004. Boston, MA., United states: Institute of Electrical and Electronics Engineers Computer Society.
[33] Cherkasova, Ludmila,Peter Phaal. Session-based admission control: A mechanism for peak load management of commercial web sites[J]. IEEE Transactions on Computers, 2002, 51(6): 669-685.
[34]赵生慧,钱宁,吴国新,陈桂林. Ssabc:一种基于能力的超级节点选择算法(英文)[J]. Journal of Southeast University(English Edition), 2008(04).
[35]杨寿保,许通,胡云.用户需求适应的P2P超级节点选取机制[J].电子科技大学学报, 2009(03).
[36]牛尔力,单明辉,陈君,王劲林. P2P网络中的社区结构发现方法[J].计算机工程, 2008, 34(024): 7-9.
[37]王淑玲,杨寿保,申凯,郭良敏.一种基于层次分析法的超级节点选取机制[J].东南大学学报(自然科学版), 2008(S1).
[38]徐小龙,王汝传.一种基于全局复合评价算法的Super Peer选择机制[J].东南大学学报(自然科学版), 2009(01).
[39] Condie T, Kamvar S, Garcia-Molina H. Adaptive peer-to-peer topologies[R]. Proc. of the 4th Int’l Conf. on Peer-to-Peer Computing. New York: IEEE Press, 2004: 53-62.
[40] BF, Cooper. An optimal overlay topology for routing peer-to-peer searches[R]. Proc. of the 6th Int’l Middleware Conf.,Middleware 2005. Berlin,Heidelberg: Springer-Verlag, 2005: 82-101.
[41] Rajkumar, R, C Lee, JP Lehoczky,DP Siewiorek. A QoS-based resource allocation model[C]. 1997.
[42]刘玉枚,杨寿保,陈万明,郭磊涛,韦冬. P2P系统中基于信誉感知的超级节点选择算法研究[J].中国科学院研究生院学报, 2008(02).
[43]许通,杨寿保,胡云.基于wmn物理特性的P2P超级节点选取机制[J].计算机工程, 2009(01).
[44] Hassan, O. A. H.,L. Ramaswamy. Message replication in unstructured peer-to-peer network[C]. in Collaborative Computing: Networking, Applications and Worksharing, 2007.
[45] Lv, Q, P Cao, E Cohen, K Li,S Shenker. Search and replication in unstructured peer-to-peer networks[C]. 2002: ACM New York, NY, USA.
[46]汤大权.基于幂律分布和小世界特性的无结构P2P网络中搜索方法研究[J].计算机研究与发展, 2007, 44(9).
[47] Inc, N. The napster homepage[EB/OL]. Online: http://www. napster. com, [cited 2007].
[48] Stoica, Ion, Robert Morris, David Karger, M. Frans Kaashoek,Hari Balakrishnan. Chord: A scalable peer-to-peer lookup service for internet applications[C]. in ACM SIGCOMM 2001- Applications, Technologies, Architectures, and Protocols for Computers Communications-, August 27, 2001. San Diego, CA, United states: Association for Computing Machinery.
[49] Gnutella. Gnutella Home Page[EB/OL]. http://gnutella.wego.com, [cited 2006].
[50] Liang, J, R Kumar,KW Ross. Understanding kazaa[J]. Manuscript, Polytechnic Univ, 2004.
[51]窦文.信任敏感的P2P拓扑构造及其相关技术研究[D]. 2003.
[52] Bawa, Mayank, Brian F. Cooper, Arturo Crespo, Neil Daswani, Prasanna Ganesan, Hector Garcia-Molina, Sepandar Kamvar, Sergio Marti, Mario Schlosser, Qi Sun, Patrick Vinograd,Beverly Yang. Peer-to-peer research at Stanford[J]. SIGMOD Record, 2003, 32(3): 23-28.
[53] Tran, Duc A., Kien A. Hua,Tai T. Do. A peer-to-peer architecture for media streaming[J]. IEEE Journal on Selected Areas in Communications, 2004, 22(1): 121-133.
[54] Rong, Letian,Ian Burnett. Dynamic resource adaptation in a heterogeneous Peer-to-Peer environment[C]. in 2005 2nd IEEE Consumer Communications and Networking Conference, CCNC2005, January 3, 2005. Las Vegas, NV, United states: Institute of Electrical andElectronics Engineers Computer Society.
[55] Chawathe Y, Ratnasamy S, Breslau L,Shenker S. Making Gnutella-like P2P systems scalable[R]. Proc. of the Conf. on Applications, Technologies, Architectures,and Protocols for Computer Communications. New York: ACM Press, 2003: 407-418. .
[56] Bernardo EA, Huberman A. Free riding on Gnutella[J]. Techniqal Report, 2000, SSL-00-63(Palo Alto: Xerox PARC).
[57]张伟哲.基于网络性能的计算网格主机聚类[J].计算机研究与发展, 2004, 41(12).
[58] Asvanund A, Krishnan R. Content-Based community formation in hybrid peer-to-peer networks[R]. Proc. of the SIGIR Workshop on Peer-to-Peer Information Retrieval,the 27th Annual Int’l ACM SIGIR Conf. New York: ACM Press, 2004: 24-34.
[59] Loser A, Naumann F, Siberski W,Nejdl W,Thaden U. Semantic overlay clusters within super-peer networks[R]. Proc. of the Int’l Workshop on Databases,Information Systems and Peer-to-Peer Computing. Berlin: Springer-Verlag, 2003: 33-47.
[60] Wang Y,Vassileva J. Bayesian network trust model in peer-to-peer networks[R]. Proc. of the 2nd Int’l Workshop on Agents and Peer-to-Peer Computing. Berlin: Springer-Verlag, 2004: 23-34.
[61] Condie, T., S. D. Kamvar,H. Garcia-Molina. Adaptive peer-to-peer topologies[J]. Fourth International Conference on Peer-to-Peer Computing, Proceedings, 2004: 53-62.
[62] Zhang Q, Zhang X, Liu JR Wen XZ,Shan T. Construction of peer-to-peer multiple-grain trust model[J]. Journal of Software, 2006, 17(1): 11.
[63] Crespo A,Garcia-Molina H. Semantic overlay networks for P2P systems[R]. Proc. of the 3rd Int’l Workshop on Agents and Peer-to-Peer Computing. Berlin: Springer-Verlag, 2004: 1-13.
[64]宋建涛.语义对等网构造及搜索机制研究[J].计算机研究与发展, 2004, 41(4).
[65] Klampanos, Iraklis A.,Joemon M. Jose. An architecture for information retrieval over semi-collaborating peer-to-peer networks[C]. in Applied Computing 2004 - Proceedings of the 2004 ACM Symposium on Applied Computing, March 14, 2004. Nicosia, Cyprus: Association for Computing Machinery.
[66] Cooper, B. F. An optimal overlay topology for routing peer-to-peer searches[J]. Middleware 2005, Proceedings, 2005, 3790: 82-101.
[67]郭良敏,杨寿保,郭磊涛,韦冬. P2P网络中基于区域划分的超级节点选取机制[J].小型微型计算机系统, 2008(02).
[68]谭义红,罗立,林亚平,欧阳竟成.超级节点网络的构建与搜索机制研究[J].小型微型计算机系统, 2008(11).
[69] Kleinberg, J. The small-world phenomenon: an algorithmic perspective[J]. Proceedings ofthe Thirty Second Annual ACM Symposium on Theory of Computing|Proceedings of the Thirty Second Annual ACM Symposium on Theory of Computing, 2000: 163-70.
[70] Manku, G. S., M. Bawa,P. Raghavan. Symphony: Distributed hashing in a small world[J]. Usenix Association Proceedings of the 4th Usenix Symposium on Internet Technologies and Systems (Usits'03), 2003: 127-140.
[71] Manku, GS. Routing networks for distributed hash tables[C]. 2003: ACM New York, NY, USA.
[72]邹福泰.基于分布式哈希表的对等系统关键技术研究[D], 2004,博士.
[73] Zhuang, Z, Y Liu, L Xiao,LM Ni. Hybrid periodical flooding in unstructured peer-to-peer networks[C]. 2003.
[74]窦文.模拟谣言传播机制的无结构P2P网络中广播机制的研究[J].计算机研究与发展, 2004, 41(9).
[75] Yang, B,H Garcia-Molina. Efficient search in peer-to-peer networks[C]. 2002.
[76] Liu, Yunhao, Li Xiao, Xiaomei Liu, Lionel M. Ni,Xiaodong Zhang. Location awareness in unstructured peer-to-peer systems[J]. IEEE Transactions on Parallel and Distributed Systems, 2005, 16(2): 163-174.
[77]诸葛海.语义网格的基础理论、模型与方法研究进展[J].中国基础科学, 2007, 9(6).
[78] Watts, DJ,SH Strogatz. Small world[J]. Nature, 1998, 393: 440¨C442.
[79] Barabasi, A. L.,R. Albert. Emergence of scaling in random networks[J]. Science, 1999, 286(5439): 509-512.
[80] Milgram, S. The small world problem[J]. Psychology today, 1967, 2(1): 60-67.
[81] Watts, D. J., P. S. Dodds,M. E. J. Newman. Identity and search in social networks[J]. Science, 2002, 296(5571): 1302-1305.
[82]解.复杂网络中的社团结构分析算法研究综述[J].复杂系统与复杂性科学, 2005, 2(3).
[83] Kernighan, BW,S Lin. An efficient heuristic procedure for partitioning graphs[J]. Bell System Technical Journal, 1970, 49(2): 291-307.
[84] Fiedler, M. Algebraic connectivity of graphs[J]. Czechoslovak Mathematical Journal, 1973, 23(2): 298-305.
[85] Pothen, A, HD Simon,KP Liou. Partitioning sparse matrices with eigenvectors of graphs[J]. SIAM Journal on Matrix Analysis and Applications, 1990, 11: 430.
[86] Scott, J. Social network analysis[J]. Sociology, 1988, 22(1): 109.
[87] Lakshmish, Ramaswamy, B. Gedik,L. Liu. A distributed approach to node clustering in decentralized peer-to-peer networks[J]. Parallel and Distributed Systems, IEEE Transactionson, 2005, 16(9): 814-829.
[88] Clauset, Aaron, M. E. J. Newman,Cristopher Moore. Finding community structure in very large networks[J]. Physical Review E, 2004, 70(Copyright (C) 2009 The American Physical Society): 066111.
[89] Wang Y,Vassileva J. Trust-Based community formation in peer-to-peer file sharing networks[R]. Proc. of the IEEE/ WIC/ACM Int'l Conf. on Web Intelligence (WI 2004). New York: IEEE Press, 2004: 341-348
[90] Networks, Utah Street. Find your community on tribe[EB/OL]. http://www.tribe.net. 2009.
[91] Google. orkut[EB/OL]. http://www.orkut.com. 2009, [cited 2009 3.15].
[92]陈汉华. SemreX:一种基于语义相似度的P2P覆盖网络[J].软件学报, 2006, 17(5).
[93]于婧,张建辉,顾小卓,汪斌强.基于主题和物理位置相近原则的层次化对等语义覆盖网络结构[J].电子与信息学报, 2008(08).
[94]汤大权,唐九阳,刘健,肖卫东.主题覆盖P2P网络自组织构造方法[J].计算机工程与科学, 2009(01).
[95] Sakaryan G,Unger H. Influence of the decentralized algorithms on topology evolution in P2P distributed networks[R]. Proc. of the Design,Analysis,and Simulation of Distributed Systems (DASD 2003). San Diego: SCS Press, 2003: 12-18.
[96] Sakaryan G,Unger H. Topology evolution in P2P distributed networks[R]. Proc. of the IASTED: Applied Informatics (AI 2003). Calgary: ACTA Press, 2003: 791-796.
[97] Sun, Qixiang,Hector Garcia-Molina. SLIC: A selfish link-based incentive mechanism for unstructured peer-to-peer networks[C]. in Proceedings - 24th International Conference on Distributed Computing Systems, March 24, 2004. Hachioji, Tokyo, Japan: Institute of Electrical and Electronics Engineers Inc.
[98]胡健,董跃华,杨炳儒.大型复杂网络中的社区结构发现算法[J].计算机工程, 2008(19).
[99]才华,周春光,卢廷玉,王喆.重叠社区结构的挖掘算法[J].吉林大学学报(工学版), 2009(04).
[100]戴飞飞,唐普英.基于dna遗传算法的复杂网络社区结构发现[J].计算机工程与应用, 2008(03).
[101]岳训,迟忠先,莫宏伟,郝艳友.基于网络社区模块结构的特征选择性能评价[J].计算机工程, 2007(12).
[102]杜海峰,李树茁, W. Feldman Marcus,悦中山,杨绪松.基于先验知识与模块性的网络社区结构探测算法[J].西安交通大学学报, 2007(06).
[103]王慧芳,黄林鹏,俞晟.一种增量式的社区发现算法研究[J].计算机仿真, 2008(01).
[104] Tang, Y, Z Zhang, S Chen,G Fan. A distributed hybrid scheme for unstructured peer-to-peernetworks[C]. 2006.
[105]李江峰,张晨曦,周兴铭. SCP2P:基于节点属性特征的自适应P2P模型[J].计算机应用, 2008, 28(010): 2580-2583.
[106] Maamar, Z, H Yahyaoui, QH Mahmoud, SK Mostefaoui,W Mansoor. Messengers for the dynamic management of distributed UDDI registries[C]. 2004.
[107] Booth, D, H Haas, F McCabe, E Newcomer, M Champion, C Ferris,D Orchard. Web services architecture[J]. W3C Working Group Note, 2004, 11: 2005-1.
[108] Semantic Web Services[EB/OL]. http://www.cnblogs.com/ykt/articles/610880.html. 2010, [cited 2010 3.16].
[109] UDDI OASIS Standard[EB/OL]. http://www.oasis-open.org/specs/index.php#uddiv3.0.2. 2002, [cited 2009 8.20].
[110] Kucikova. UDDI V3: The Registry Standard for SOA[EB/OL]. http://www.oasis- open.org/presentations/uddi_v3_webcast_20050222.pdf. 2005, [cited 2009 9.10].
[111] Kim, Su Myeon,Marcel-Catalin Rosu. A survey of public Web Services[C]. in Thirteenth International World Wide Web Conference Proceedings, WWW2004, May 17, 2004 - May 22, 2004. 2004. New York, NY, United states: Association for Computing Machinery.
[112] Kim SM. Population of public Web services[EB/OL]. http://nclab.kaist.ac.kr/~smkim /ws_survey/index.html. 2005.
[113]营造播存网格[EB/OL]. http://www.226e.net/article/17/article9412_1.htm. 2005, [cited 2010 03.18].
[114]杜海峰.小世界网络与无标度网络的社区结构研究[J].物理学报, 2007, 56(12).
[115]杨波.基于个体选择的小世界网络结构演化[J].系统工程, 2004, 22(12).
[116] Flake, Gary William, Steve Lawrence, C. Lee Giles,Frans M. Coetzee. Self-organization and identification of web communities[J]. Computer, 2002, 35(3): 66-71.
[117] Gibson, David, Jon Kleinberg,Prabhakar Raghavan. Inferring Web communities from link topology[C]. in Proceedings of the 1998 9th ACM Conference on Hypertext and Hypermedia, June 20, 1998. Pittsburgh, PA, USA: ACM.
[118] Adamic, L. A.,E. Adar. Friends and neighbors on the Web[J]. Social Networks, 2003, 25(3): 211-230.
[119] Holme, P., M. Huss,H. W. Jeong. Subnetwork hierarchies of biochemical pathways[J]. Bioinformatics, 2003, 19(4): 532-538.
[120] Milo, R., S. Shen-Orr, S. Itzkovitz, N. Kashtan, D. Chklovskii,U. Alon. Network motifs: Simple building blocks of complex networks[J]. Science, 2002, 298(5594): 824-827.
[121] Shen-Orr, S. S., R. Milo, S. Mangan,U. Alon. Network motifs in the transcriptionalregulation network of Escherichia coli[J]. Nature Genetics, 2002, 31(1): 64-68.
[122] Zhang, P, M Li, J Wu, Z Di,Y Fan. The analysis and dissimilarity comparison of community structure[J]. Physica A: Statistical Mechanics and its Applications, 2006, 367: 577-585.
[123] M¨1hl, G. Large-scale content-based publish/subscribe systems[J]. Unpublished doctoral dissertation, Darmstadt University of Technology, Germany, 2002.
[124]陈明.基于语义相似度的P2P平衡路由网络[J].微电子学与计算机, 2007, 24(10).
[125]马丽丽,黄宏斌,邓苏.基于朋友聚类的语义覆盖网构建方法研究[J].微电子学与计算机, 2008(09).
[126]于婧. TSS-SON:一种基于结构化P2P网络路由的两级语义覆盖网络结构[J].高技术通讯, 2007, 17(7).
[127]朱晓姝.语义对等网覆盖路由模型的研究[J].计算机工程, 2008(13).
[128]杜宗霞.主动分布式Web服务注册机制研究与实现[J].软件学报, 2006, 17(3).
[129] Yang, Beverly,Hector Garcia-Molina. Designing a super-peer network[C]. in Nineteenth International Conference on Data Ingineering, March 5, 2003. Bangalore, India: Institute of Electrical and Electronics Engineers Computer Society.
[130]黄道颖.利用Gnutella网络的拓扑特性改进其可扩展性[J].计算机工程与应用, 2003, 39(26).
[131]乐光学.基于Region多层结构P2P计算网络模型[J].软件学报, 2005, 16(6).
[132]郭方方.超级节点对等网动态负载分配问题的研究[J].哈尔滨工程大学学报, 2007, 28(4).
[133]吴乃星.基于软交换的异构集群媒体服务器中一种LRV负载均衡算法[J].电子学报, 2005, 33(10).
[134]蒋江.基于多种资源的负载平衡算法的研究[J].电子学报, 2002, 30(8).
[135] Bin, Zeng, Zhang Dafang, Li Wenwei, Zhang Mei,Hong Qiao. An adaptive sampling methodology for Internet traffic data measurement[J]. 2009 International Conference on Communication Software and Networks (ICCSN 2009), 2009: 215-18|xxi+848.
[136] Zhenqi, Wang,Liu Jin. Traffic measurement mechanisms for high precision internet applications[J]. 2007 8th ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing, 2007: 66-9.
[137]张鹏.新集对论[J].哈尔滨建筑大学学报, 2000, 33(3).
[138] Yun-Liang, Jiang, Xu Cong-Fu, Yao Yuan,Zhao Ke-Qin. Systems information in set pair analysis and its applications[J]. Proceedings of 2004 International Conference on Machine Learning and Cybernetics (IEEE Cat. No.04EX826), 2004: 1717-22 vol.3|7 vol. (vii+4384).
[139] Tretyakov, A. Y., H. Takayasu,M. Takayasu. Phase transition in a computer network model[J].Physica A, 1998, 253(1-4): 315-322.
[140] Takayasu, H.,M. Takayasu. Critical fluctuations of demand and supply[J]. Physica A, 1999, 269(1): 24-29.
[141] Gabor, S.,I. Csabai. The analogies of highway and computer network traffic[J]. Physica a-Statistical Mechanics and Its Applications, 2002, 307(3-4): 516-526.
[142]王磊.虚拟网络行为对互联网整体特性的影响[J].物理学报, 2007, 56(1).
[143] Mandelbrot, BB. The fractal geometry of nature[M]. Wh Freeman, 1982.
[144]刘锋.计算机网络的长程相关特性[J].物理学报, 2004, 53(2).
[145]张金春.自组织理论在军事系统中的应用[J].系统工程与电子技术, 2002, 24(5).
[146]董攀.一种网络自组织演化的数学模型[J].软件学报, 2007, 18(12).
[147]冯国富.无结构P2P覆盖网络的拓扑优化[J].软件学报, 2007, 18(11).
[148] Chen, Qinghua,Dinghua Shi. The modeling of scale-free networks[J]. Physica A: Statistical Mechanics and its Applications, 2004, 335(1-2): 240-248.
[149]方锦清.复杂动态网络的一种和谐统一的混合择优模型及其普适特性[J].中国科学G辑, 2007, 37(2).
[150]袁平鹏.一种基于Cache的网格任务反馈调度方法[J].软件学报, 2006, 17(11).
[151] Pan, Zaofeng, Xiang Li,Xiaofang Wang. Generalized local-world models for weighted networks[J]. Physical Review E - Statistical, Nonlinear, and Soft Matter Physics, 2006, 73(5).
[152] Zhou, Mingqiang, Qingsheng Zhu,Shuangqing Li. Research on forecast and estimate of super-node service capacity[J]. Journal of Information and Computational Science, 2009, 6(2): 941-950.
[153] Kalogeraki, Vana, Dimitrios Gunopulos,D. Zeinalipour-Yazti. A local search mechanism for peer-to-peer networks[C]. in Proceedings of the Eleventh International Conference on Information and Knowledge Management (CIKM 2002), November 4, 2002. McLean, VA, United states: Association for Computing Machinery.
[154] Lv, Qin, Pei Cao, Edith Cohen, Kai Li,Scott Shenker. Search and replication in unstructured peer-to-peer networks[C]. in ACM SIGMETRICS 2002 International Conference on Measurement and Modeling of Computer Systems, June 15, 2002. Marina Del Rey, CA, United states: Association for Computing Machinery.
[155]潘灶烽.可变聚类系数无标度网络上的谣言传播仿真研究[J].系统仿真学报, 2006, 18(8).
[156] Bookstein, Abraham. Explanation and generalization of vector models in information retrieval[C]. in Research and Development in Information Retrieval, Proceedings. 1983.Berlin, West Ger: Springer-Verlag.
[157] Calistri-Yeh, Randall J. U. S.,David L. U. S. Snyder. Management and analysis of document information text[R]. US, 2000.
[158] Gonzalo, Julio, Felisa Verdejo,Irina Chugur. Using EuroWordNet in a concept-based approach to cross-language text retrieval[J]. Applied Artificial Intelligence, 1999, 13(7): 647-678.
[159] Keller, Uwe. Inferencing support for semantic Web services: Tools for semantic support[J]. SDK WSMO Working Group, Working draft: D5.2v0.1, 2004.
[160]陈德伟.服务部署与发布绑定的基于P2P网络的Web服务发现机制[J].计算机学报, 2005, 28(4).
[161]白东伟.一种增强语义精确度的Web服务匹配方法[J].北京邮电大学学报, 2006, 29(5).
[162]赵海,袁韶谦,张昕,李超.一种局部集聚的网络演化模型[J].东北大学学报:自然科学版, 2007, 28(011): 1548-1551.
[163] Gokcay, E.,J. C. Principe. Information theoretic clustering[J]. Pattern Analysis and Machine Intelligence, IEEE Transactions on, 2002, 24(2): 158-171.
[2]方锦清.一门崭新的交叉科学:网络科学(下)[J].物理学进展, 2007, 27(4).
[3] Sen, Subhabrata,Jia Wang. Analyzing peer-to-peer traffic across large networks[J]. IEEE/ACM Transactions on Networking, 2004, 12(2): 219-232.
[4] Saroiu, S, KP Gummadi, RJ Dunn, SD Gribble,HM Levy. An analysis of internet content delivery systems[J]. ACM SIGOPS Operating Systems Review, 2002, 36(si): 315.
[5] Ripeanu, Matei, Adriana Iamnitchi,Ian Foster. Mapping the Gnutella network[J]. IEEE Internet Computing, 2002, 6(1): 50-57.
[6] Foster, I,A Iamnitchi. On death, taxes, and the convergence of peer-to-peer and grid computing[J]. Lecture Notes in Computer Science, 2003: 118-128.
[7] Endrei M, Ang J, Arsanjani A,Chua S,Comte P,Krogdahl P,Luo M,Newling T. Patterns: Service_Oriented architecture and Web services[EB/OL]. http://www.redbooks.ibm.com/ redbooks/pdfs/sg246303.pdf. 2004, [cited 2008 12.3].
[8] Tsai, W. T., Xinyu Zhou, Yinong Chen, Bingnan Xiao, Raymond A. Paul,William Chu. Roadmap to a full service broker in service-oriented architecture[C]. SOSE 2007, October 24, 2007. Hong Kong, China: Inst. of Elec. and Elec. Eng. Computer Society.
[9] Dow, Matthew, Pascal Ravesteijn,Johan Versendaal. Assessing the quality of Enterprise Services - A model for supporting Service Oriented Architecture design[C]. in ICEIS 2008 - 10th International Conference on Enterprise Information Systems, June 12, 2008. Barcelona, Spain: Inst. for Syst. and Technol. of Inf. Control and Commun.
[10] Jrstad, Ivar, Schahram Dustdar,Do Van Thanh. A service oriented architecture framework for collaborative services[C]. in 14th IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprises, WET ICE 2005, June 13, 2005. Linkoeping, Sweden: Inst. of Elec. and Elec. Eng. Computer Society.
[11] Takase, Toshiro. Workshop on Service Oriented Architecture[C]. in 14th Asia Pacific Software Engineering Conference, ASPCE 2007, December 4, 2007. Nagoya, Japan: IEEE Computer Society.
[12] Abramowitz, W.,T. Eymann. Service oriented architecture and web services[J]. Wirtschaft - sinformatik, 2008, 50(1): 1-3.
[13] Christensen E, Curbera F, Meredith G,Weerawarana S. Web services description language (WSDL) 1.1[EB/OL]. http://www.w3.org/TR/wsdl. 2001, [cited 2007 10.9].
[14] Clement L, Hately A, Riegen CV, Rogers T. Universal description discovery & integration (UDDI) 3.0.2[EB/OL]. http://uddi.org/pubs/uddi_v3.htm. 2004, [cited 2009 1.3].
[15] Bellwood, T. Universal description, discovery and integration specification (UDDI) 3.0 [EB/OL]. Online: http://uddi. org/pubs/uddi-v3. 00-published-20020719. htm.
[16] Cai, Min,Martin Frank. RDFPeers: A scalable distributed RDF repository based on a structured peer-to-peer network[C]. in Thirteenth International World Wide Web Conference Proceedings, WWW2004, May 17, 2004. New York, NY, United states: Association for Computing Machinery.
[17] Hong, Wontaek, Minyeol Lim, Ennsung Kim, Jongsuk Lee,Hyoungwoo Park. GAIS: Grid advanced information service based on P2P mechanism[C]. in Proceedings - 13th IEEE International Symposium on High Performance Distributed Computing, June 4, 2004. Honolulu, HI, United states: Institute of Electrical and Electronics Engineers Inc.
[18] Li, Xiao, Zhang Xiaodong,Xu Zhichen. On reliable and scalable peer-to-peer Web document sharing[J]. Proceedings 16th International Parallel and Distributed Processing Symposium, 2002: 224-31.
[19] Nagy W, Curbera F, Weerawaranna S. The advertisement and discovery of services (ADS) protocol for Web servicesads.html? dwzone=ws [EB/OL]. http://www-28.ibm.com/ developerworks/library/ws. 2000, [cited 2007 10.3].
[20] ShaikhAli, A, OF Rana, R Al-Ali,DW Walker. Uddie: An extended registry for web services[C]. 2003.
[21] Verma K, Sivashanmugam K, Sheth A,Patil A,Oundhakar S,Miller J. METEOR-S WSDI: A scalable P2P infrastructure of registries for semantic publication and discovery of Web services[J]. Journal of Information Technology and Management, 2005, 6(1): 17-39.
[22] Oundhakar S, Verma K, Sivashanmugam K,Sheth A,Miller J. Discovery of Web services in a multi-ontology and federated registry environment[J]. Journal of Web Services Research, 2005, 2(3): 1-32.
[23] Papazoglou MP, Kramer BJ, Yang J. Leveraging Web-services and peer-to-peer networks[R]. Proc. of the Advanced Information Systems Engineering,15th Int’l Conf. (CAiSE 2003). Klagenfurt: : Springer-Verlag, 2003: 485-501.
[24]杜宗霞,怀进鹏.主动分布式Web服务注册机制研究与实现[J].软件学报, 2006(03).
[25] Guo, De-Ke, Hong-Hui Chen, Xue-Shan Luo,Wei-Ming Zhang. Enhance UDDI and design peer-to-peer network for UDDI to realize decentralized web service discovery[C]. in 2005 International Symposium on Web Services and Applications, ISWS'05, June 27, 2005. Las Vegas, NV, United states: CSREA Press.
[26] Tran Da, Hua Ka, Do T T. A peer-to-peer architecture for media streaming[J]. IEEE Journal on Selected Areas in Communications, 2004, 22(1): 1-44.
[27] Rong L, Burnett I. Dynamic resource adaptation in a heterogeneous peer-to-peer environment[R]. IEEE Consumer Communications and Networking Conference. USA, LasVegas, 2005: 416-420.
[28] ECSP, LI J. an Efficient Clustered Super-Peer Architecture for P2P Networks[D]. Canada: the University of British Columbia, 2003.
[29] Tsoumakos, Dimitrios,Nick Roussopoulos. Analysis and comparison of P2P search methods[C]. in 1st International Conference on Scalable Information Systems, InfoScale '06, May 30, 2006. Hong Kong, China: Association for Computing Machinery.
[30] Min, Suhong,Dongsub Cho. Super-peer selection based framework using dynamic capacity and similarity[C]. in ISCIS 2006: 21th International Symposium on Computer and Information Sciences, November 1, 2006. Istanbul, Turkey: Springer Verlag.
[31] Min, Su-Hong, Joanne Holliday,Dong-Sub Cho. Optimal super-peer selection for large-scale P2P system[C]. in 2006 International Conference on Hybrid Information Technology, ICHIT 2006, November 9, 2006. Cheju Island, Korea, Republic of: Inst. of Elec. and Elec. Eng. Computer Society.
[32] Wiesner, Christian, Alfons Kemper,Stefan Brandl. Dynamic extensible query processing in super-peer based P2P systems[C]. in Proceedings - 20th International Conference on Data Engineering - ICDE 2004, March 30, 2004. Boston, MA., United states: Institute of Electrical and Electronics Engineers Computer Society.
[33] Cherkasova, Ludmila,Peter Phaal. Session-based admission control: A mechanism for peak load management of commercial web sites[J]. IEEE Transactions on Computers, 2002, 51(6): 669-685.
[34]赵生慧,钱宁,吴国新,陈桂林. Ssabc:一种基于能力的超级节点选择算法(英文)[J]. Journal of Southeast University(English Edition), 2008(04).
[35]杨寿保,许通,胡云.用户需求适应的P2P超级节点选取机制[J].电子科技大学学报, 2009(03).
[36]牛尔力,单明辉,陈君,王劲林. P2P网络中的社区结构发现方法[J].计算机工程, 2008, 34(024): 7-9.
[37]王淑玲,杨寿保,申凯,郭良敏.一种基于层次分析法的超级节点选取机制[J].东南大学学报(自然科学版), 2008(S1).
[38]徐小龙,王汝传.一种基于全局复合评价算法的Super Peer选择机制[J].东南大学学报(自然科学版), 2009(01).
[39] Condie T, Kamvar S, Garcia-Molina H. Adaptive peer-to-peer topologies[R]. Proc. of the 4th Int’l Conf. on Peer-to-Peer Computing. New York: IEEE Press, 2004: 53-62.
[40] BF, Cooper. An optimal overlay topology for routing peer-to-peer searches[R]. Proc. of the 6th Int’l Middleware Conf.,Middleware 2005. Berlin,Heidelberg: Springer-Verlag, 2005: 82-101.
[41] Rajkumar, R, C Lee, JP Lehoczky,DP Siewiorek. A QoS-based resource allocation model[C]. 1997.
[42]刘玉枚,杨寿保,陈万明,郭磊涛,韦冬. P2P系统中基于信誉感知的超级节点选择算法研究[J].中国科学院研究生院学报, 2008(02).
[43]许通,杨寿保,胡云.基于wmn物理特性的P2P超级节点选取机制[J].计算机工程, 2009(01).
[44] Hassan, O. A. H.,L. Ramaswamy. Message replication in unstructured peer-to-peer network[C]. in Collaborative Computing: Networking, Applications and Worksharing, 2007.
[45] Lv, Q, P Cao, E Cohen, K Li,S Shenker. Search and replication in unstructured peer-to-peer networks[C]. 2002: ACM New York, NY, USA.
[46]汤大权.基于幂律分布和小世界特性的无结构P2P网络中搜索方法研究[J].计算机研究与发展, 2007, 44(9).
[47] Inc, N. The napster homepage[EB/OL]. Online: http://www. napster. com, [cited 2007].
[48] Stoica, Ion, Robert Morris, David Karger, M. Frans Kaashoek,Hari Balakrishnan. Chord: A scalable peer-to-peer lookup service for internet applications[C]. in ACM SIGCOMM 2001- Applications, Technologies, Architectures, and Protocols for Computers Communications-, August 27, 2001. San Diego, CA, United states: Association for Computing Machinery.
[49] Gnutella. Gnutella Home Page[EB/OL]. http://gnutella.wego.com, [cited 2006].
[50] Liang, J, R Kumar,KW Ross. Understanding kazaa[J]. Manuscript, Polytechnic Univ, 2004.
[51]窦文.信任敏感的P2P拓扑构造及其相关技术研究[D]. 2003.
[52] Bawa, Mayank, Brian F. Cooper, Arturo Crespo, Neil Daswani, Prasanna Ganesan, Hector Garcia-Molina, Sepandar Kamvar, Sergio Marti, Mario Schlosser, Qi Sun, Patrick Vinograd,Beverly Yang. Peer-to-peer research at Stanford[J]. SIGMOD Record, 2003, 32(3): 23-28.
[53] Tran, Duc A., Kien A. Hua,Tai T. Do. A peer-to-peer architecture for media streaming[J]. IEEE Journal on Selected Areas in Communications, 2004, 22(1): 121-133.
[54] Rong, Letian,Ian Burnett. Dynamic resource adaptation in a heterogeneous Peer-to-Peer environment[C]. in 2005 2nd IEEE Consumer Communications and Networking Conference, CCNC2005, January 3, 2005. Las Vegas, NV, United states: Institute of Electrical andElectronics Engineers Computer Society.
[55] Chawathe Y, Ratnasamy S, Breslau L,Shenker S. Making Gnutella-like P2P systems scalable[R]. Proc. of the Conf. on Applications, Technologies, Architectures,and Protocols for Computer Communications. New York: ACM Press, 2003: 407-418. .
[56] Bernardo EA, Huberman A. Free riding on Gnutella[J]. Techniqal Report, 2000, SSL-00-63(Palo Alto: Xerox PARC).
[57]张伟哲.基于网络性能的计算网格主机聚类[J].计算机研究与发展, 2004, 41(12).
[58] Asvanund A, Krishnan R. Content-Based community formation in hybrid peer-to-peer networks[R]. Proc. of the SIGIR Workshop on Peer-to-Peer Information Retrieval,the 27th Annual Int’l ACM SIGIR Conf. New York: ACM Press, 2004: 24-34.
[59] Loser A, Naumann F, Siberski W,Nejdl W,Thaden U. Semantic overlay clusters within super-peer networks[R]. Proc. of the Int’l Workshop on Databases,Information Systems and Peer-to-Peer Computing. Berlin: Springer-Verlag, 2003: 33-47.
[60] Wang Y,Vassileva J. Bayesian network trust model in peer-to-peer networks[R]. Proc. of the 2nd Int’l Workshop on Agents and Peer-to-Peer Computing. Berlin: Springer-Verlag, 2004: 23-34.
[61] Condie, T., S. D. Kamvar,H. Garcia-Molina. Adaptive peer-to-peer topologies[J]. Fourth International Conference on Peer-to-Peer Computing, Proceedings, 2004: 53-62.
[62] Zhang Q, Zhang X, Liu JR Wen XZ,Shan T. Construction of peer-to-peer multiple-grain trust model[J]. Journal of Software, 2006, 17(1): 11.
[63] Crespo A,Garcia-Molina H. Semantic overlay networks for P2P systems[R]. Proc. of the 3rd Int’l Workshop on Agents and Peer-to-Peer Computing. Berlin: Springer-Verlag, 2004: 1-13.
[64]宋建涛.语义对等网构造及搜索机制研究[J].计算机研究与发展, 2004, 41(4).
[65] Klampanos, Iraklis A.,Joemon M. Jose. An architecture for information retrieval over semi-collaborating peer-to-peer networks[C]. in Applied Computing 2004 - Proceedings of the 2004 ACM Symposium on Applied Computing, March 14, 2004. Nicosia, Cyprus: Association for Computing Machinery.
[66] Cooper, B. F. An optimal overlay topology for routing peer-to-peer searches[J]. Middleware 2005, Proceedings, 2005, 3790: 82-101.
[67]郭良敏,杨寿保,郭磊涛,韦冬. P2P网络中基于区域划分的超级节点选取机制[J].小型微型计算机系统, 2008(02).
[68]谭义红,罗立,林亚平,欧阳竟成.超级节点网络的构建与搜索机制研究[J].小型微型计算机系统, 2008(11).
[69] Kleinberg, J. The small-world phenomenon: an algorithmic perspective[J]. Proceedings ofthe Thirty Second Annual ACM Symposium on Theory of Computing|Proceedings of the Thirty Second Annual ACM Symposium on Theory of Computing, 2000: 163-70.
[70] Manku, G. S., M. Bawa,P. Raghavan. Symphony: Distributed hashing in a small world[J]. Usenix Association Proceedings of the 4th Usenix Symposium on Internet Technologies and Systems (Usits'03), 2003: 127-140.
[71] Manku, GS. Routing networks for distributed hash tables[C]. 2003: ACM New York, NY, USA.
[72]邹福泰.基于分布式哈希表的对等系统关键技术研究[D], 2004,博士.
[73] Zhuang, Z, Y Liu, L Xiao,LM Ni. Hybrid periodical flooding in unstructured peer-to-peer networks[C]. 2003.
[74]窦文.模拟谣言传播机制的无结构P2P网络中广播机制的研究[J].计算机研究与发展, 2004, 41(9).
[75] Yang, B,H Garcia-Molina. Efficient search in peer-to-peer networks[C]. 2002.
[76] Liu, Yunhao, Li Xiao, Xiaomei Liu, Lionel M. Ni,Xiaodong Zhang. Location awareness in unstructured peer-to-peer systems[J]. IEEE Transactions on Parallel and Distributed Systems, 2005, 16(2): 163-174.
[77]诸葛海.语义网格的基础理论、模型与方法研究进展[J].中国基础科学, 2007, 9(6).
[78] Watts, DJ,SH Strogatz. Small world[J]. Nature, 1998, 393: 440¨C442.
[79] Barabasi, A. L.,R. Albert. Emergence of scaling in random networks[J]. Science, 1999, 286(5439): 509-512.
[80] Milgram, S. The small world problem[J]. Psychology today, 1967, 2(1): 60-67.
[81] Watts, D. J., P. S. Dodds,M. E. J. Newman. Identity and search in social networks[J]. Science, 2002, 296(5571): 1302-1305.
[82]解.复杂网络中的社团结构分析算法研究综述[J].复杂系统与复杂性科学, 2005, 2(3).
[83] Kernighan, BW,S Lin. An efficient heuristic procedure for partitioning graphs[J]. Bell System Technical Journal, 1970, 49(2): 291-307.
[84] Fiedler, M. Algebraic connectivity of graphs[J]. Czechoslovak Mathematical Journal, 1973, 23(2): 298-305.
[85] Pothen, A, HD Simon,KP Liou. Partitioning sparse matrices with eigenvectors of graphs[J]. SIAM Journal on Matrix Analysis and Applications, 1990, 11: 430.
[86] Scott, J. Social network analysis[J]. Sociology, 1988, 22(1): 109.
[87] Lakshmish, Ramaswamy, B. Gedik,L. Liu. A distributed approach to node clustering in decentralized peer-to-peer networks[J]. Parallel and Distributed Systems, IEEE Transactionson, 2005, 16(9): 814-829.
[88] Clauset, Aaron, M. E. J. Newman,Cristopher Moore. Finding community structure in very large networks[J]. Physical Review E, 2004, 70(Copyright (C) 2009 The American Physical Society): 066111.
[89] Wang Y,Vassileva J. Trust-Based community formation in peer-to-peer file sharing networks[R]. Proc. of the IEEE/ WIC/ACM Int'l Conf. on Web Intelligence (WI 2004). New York: IEEE Press, 2004: 341-348
[90] Networks, Utah Street. Find your community on tribe[EB/OL]. http://www.tribe.net. 2009.
[91] Google. orkut[EB/OL]. http://www.orkut.com. 2009, [cited 2009 3.15].
[92]陈汉华. SemreX:一种基于语义相似度的P2P覆盖网络[J].软件学报, 2006, 17(5).
[93]于婧,张建辉,顾小卓,汪斌强.基于主题和物理位置相近原则的层次化对等语义覆盖网络结构[J].电子与信息学报, 2008(08).
[94]汤大权,唐九阳,刘健,肖卫东.主题覆盖P2P网络自组织构造方法[J].计算机工程与科学, 2009(01).
[95] Sakaryan G,Unger H. Influence of the decentralized algorithms on topology evolution in P2P distributed networks[R]. Proc. of the Design,Analysis,and Simulation of Distributed Systems (DASD 2003). San Diego: SCS Press, 2003: 12-18.
[96] Sakaryan G,Unger H. Topology evolution in P2P distributed networks[R]. Proc. of the IASTED: Applied Informatics (AI 2003). Calgary: ACTA Press, 2003: 791-796.
[97] Sun, Qixiang,Hector Garcia-Molina. SLIC: A selfish link-based incentive mechanism for unstructured peer-to-peer networks[C]. in Proceedings - 24th International Conference on Distributed Computing Systems, March 24, 2004. Hachioji, Tokyo, Japan: Institute of Electrical and Electronics Engineers Inc.
[98]胡健,董跃华,杨炳儒.大型复杂网络中的社区结构发现算法[J].计算机工程, 2008(19).
[99]才华,周春光,卢廷玉,王喆.重叠社区结构的挖掘算法[J].吉林大学学报(工学版), 2009(04).
[100]戴飞飞,唐普英.基于dna遗传算法的复杂网络社区结构发现[J].计算机工程与应用, 2008(03).
[101]岳训,迟忠先,莫宏伟,郝艳友.基于网络社区模块结构的特征选择性能评价[J].计算机工程, 2007(12).
[102]杜海峰,李树茁, W. Feldman Marcus,悦中山,杨绪松.基于先验知识与模块性的网络社区结构探测算法[J].西安交通大学学报, 2007(06).
[103]王慧芳,黄林鹏,俞晟.一种增量式的社区发现算法研究[J].计算机仿真, 2008(01).
[104] Tang, Y, Z Zhang, S Chen,G Fan. A distributed hybrid scheme for unstructured peer-to-peernetworks[C]. 2006.
[105]李江峰,张晨曦,周兴铭. SCP2P:基于节点属性特征的自适应P2P模型[J].计算机应用, 2008, 28(010): 2580-2583.
[106] Maamar, Z, H Yahyaoui, QH Mahmoud, SK Mostefaoui,W Mansoor. Messengers for the dynamic management of distributed UDDI registries[C]. 2004.
[107] Booth, D, H Haas, F McCabe, E Newcomer, M Champion, C Ferris,D Orchard. Web services architecture[J]. W3C Working Group Note, 2004, 11: 2005-1.
[108] Semantic Web Services[EB/OL]. http://www.cnblogs.com/ykt/articles/610880.html. 2010, [cited 2010 3.16].
[109] UDDI OASIS Standard[EB/OL]. http://www.oasis-open.org/specs/index.php#uddiv3.0.2. 2002, [cited 2009 8.20].
[110] Kucikova. UDDI V3: The Registry Standard for SOA[EB/OL]. http://www.oasis- open.org/presentations/uddi_v3_webcast_20050222.pdf. 2005, [cited 2009 9.10].
[111] Kim, Su Myeon,Marcel-Catalin Rosu. A survey of public Web Services[C]. in Thirteenth International World Wide Web Conference Proceedings, WWW2004, May 17, 2004 - May 22, 2004. 2004. New York, NY, United states: Association for Computing Machinery.
[112] Kim SM. Population of public Web services[EB/OL]. http://nclab.kaist.ac.kr/~smkim /ws_survey/index.html. 2005.
[113]营造播存网格[EB/OL]. http://www.226e.net/article/17/article9412_1.htm. 2005, [cited 2010 03.18].
[114]杜海峰.小世界网络与无标度网络的社区结构研究[J].物理学报, 2007, 56(12).
[115]杨波.基于个体选择的小世界网络结构演化[J].系统工程, 2004, 22(12).
[116] Flake, Gary William, Steve Lawrence, C. Lee Giles,Frans M. Coetzee. Self-organization and identification of web communities[J]. Computer, 2002, 35(3): 66-71.
[117] Gibson, David, Jon Kleinberg,Prabhakar Raghavan. Inferring Web communities from link topology[C]. in Proceedings of the 1998 9th ACM Conference on Hypertext and Hypermedia, June 20, 1998. Pittsburgh, PA, USA: ACM.
[118] Adamic, L. A.,E. Adar. Friends and neighbors on the Web[J]. Social Networks, 2003, 25(3): 211-230.
[119] Holme, P., M. Huss,H. W. Jeong. Subnetwork hierarchies of biochemical pathways[J]. Bioinformatics, 2003, 19(4): 532-538.
[120] Milo, R., S. Shen-Orr, S. Itzkovitz, N. Kashtan, D. Chklovskii,U. Alon. Network motifs: Simple building blocks of complex networks[J]. Science, 2002, 298(5594): 824-827.
[121] Shen-Orr, S. S., R. Milo, S. Mangan,U. Alon. Network motifs in the transcriptionalregulation network of Escherichia coli[J]. Nature Genetics, 2002, 31(1): 64-68.
[122] Zhang, P, M Li, J Wu, Z Di,Y Fan. The analysis and dissimilarity comparison of community structure[J]. Physica A: Statistical Mechanics and its Applications, 2006, 367: 577-585.
[123] M¨1hl, G. Large-scale content-based publish/subscribe systems[J]. Unpublished doctoral dissertation, Darmstadt University of Technology, Germany, 2002.
[124]陈明.基于语义相似度的P2P平衡路由网络[J].微电子学与计算机, 2007, 24(10).
[125]马丽丽,黄宏斌,邓苏.基于朋友聚类的语义覆盖网构建方法研究[J].微电子学与计算机, 2008(09).
[126]于婧. TSS-SON:一种基于结构化P2P网络路由的两级语义覆盖网络结构[J].高技术通讯, 2007, 17(7).
[127]朱晓姝.语义对等网覆盖路由模型的研究[J].计算机工程, 2008(13).
[128]杜宗霞.主动分布式Web服务注册机制研究与实现[J].软件学报, 2006, 17(3).
[129] Yang, Beverly,Hector Garcia-Molina. Designing a super-peer network[C]. in Nineteenth International Conference on Data Ingineering, March 5, 2003. Bangalore, India: Institute of Electrical and Electronics Engineers Computer Society.
[130]黄道颖.利用Gnutella网络的拓扑特性改进其可扩展性[J].计算机工程与应用, 2003, 39(26).
[131]乐光学.基于Region多层结构P2P计算网络模型[J].软件学报, 2005, 16(6).
[132]郭方方.超级节点对等网动态负载分配问题的研究[J].哈尔滨工程大学学报, 2007, 28(4).
[133]吴乃星.基于软交换的异构集群媒体服务器中一种LRV负载均衡算法[J].电子学报, 2005, 33(10).
[134]蒋江.基于多种资源的负载平衡算法的研究[J].电子学报, 2002, 30(8).
[135] Bin, Zeng, Zhang Dafang, Li Wenwei, Zhang Mei,Hong Qiao. An adaptive sampling methodology for Internet traffic data measurement[J]. 2009 International Conference on Communication Software and Networks (ICCSN 2009), 2009: 215-18|xxi+848.
[136] Zhenqi, Wang,Liu Jin. Traffic measurement mechanisms for high precision internet applications[J]. 2007 8th ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing, 2007: 66-9.
[137]张鹏.新集对论[J].哈尔滨建筑大学学报, 2000, 33(3).
[138] Yun-Liang, Jiang, Xu Cong-Fu, Yao Yuan,Zhao Ke-Qin. Systems information in set pair analysis and its applications[J]. Proceedings of 2004 International Conference on Machine Learning and Cybernetics (IEEE Cat. No.04EX826), 2004: 1717-22 vol.3|7 vol. (vii+4384).
[139] Tretyakov, A. Y., H. Takayasu,M. Takayasu. Phase transition in a computer network model[J].Physica A, 1998, 253(1-4): 315-322.
[140] Takayasu, H.,M. Takayasu. Critical fluctuations of demand and supply[J]. Physica A, 1999, 269(1): 24-29.
[141] Gabor, S.,I. Csabai. The analogies of highway and computer network traffic[J]. Physica a-Statistical Mechanics and Its Applications, 2002, 307(3-4): 516-526.
[142]王磊.虚拟网络行为对互联网整体特性的影响[J].物理学报, 2007, 56(1).
[143] Mandelbrot, BB. The fractal geometry of nature[M]. Wh Freeman, 1982.
[144]刘锋.计算机网络的长程相关特性[J].物理学报, 2004, 53(2).
[145]张金春.自组织理论在军事系统中的应用[J].系统工程与电子技术, 2002, 24(5).
[146]董攀.一种网络自组织演化的数学模型[J].软件学报, 2007, 18(12).
[147]冯国富.无结构P2P覆盖网络的拓扑优化[J].软件学报, 2007, 18(11).
[148] Chen, Qinghua,Dinghua Shi. The modeling of scale-free networks[J]. Physica A: Statistical Mechanics and its Applications, 2004, 335(1-2): 240-248.
[149]方锦清.复杂动态网络的一种和谐统一的混合择优模型及其普适特性[J].中国科学G辑, 2007, 37(2).
[150]袁平鹏.一种基于Cache的网格任务反馈调度方法[J].软件学报, 2006, 17(11).
[151] Pan, Zaofeng, Xiang Li,Xiaofang Wang. Generalized local-world models for weighted networks[J]. Physical Review E - Statistical, Nonlinear, and Soft Matter Physics, 2006, 73(5).
[152] Zhou, Mingqiang, Qingsheng Zhu,Shuangqing Li. Research on forecast and estimate of super-node service capacity[J]. Journal of Information and Computational Science, 2009, 6(2): 941-950.
[153] Kalogeraki, Vana, Dimitrios Gunopulos,D. Zeinalipour-Yazti. A local search mechanism for peer-to-peer networks[C]. in Proceedings of the Eleventh International Conference on Information and Knowledge Management (CIKM 2002), November 4, 2002. McLean, VA, United states: Association for Computing Machinery.
[154] Lv, Qin, Pei Cao, Edith Cohen, Kai Li,Scott Shenker. Search and replication in unstructured peer-to-peer networks[C]. in ACM SIGMETRICS 2002 International Conference on Measurement and Modeling of Computer Systems, June 15, 2002. Marina Del Rey, CA, United states: Association for Computing Machinery.
[155]潘灶烽.可变聚类系数无标度网络上的谣言传播仿真研究[J].系统仿真学报, 2006, 18(8).
[156] Bookstein, Abraham. Explanation and generalization of vector models in information retrieval[C]. in Research and Development in Information Retrieval, Proceedings. 1983.Berlin, West Ger: Springer-Verlag.
[157] Calistri-Yeh, Randall J. U. S.,David L. U. S. Snyder. Management and analysis of document information text[R]. US, 2000.
[158] Gonzalo, Julio, Felisa Verdejo,Irina Chugur. Using EuroWordNet in a concept-based approach to cross-language text retrieval[J]. Applied Artificial Intelligence, 1999, 13(7): 647-678.
[159] Keller, Uwe. Inferencing support for semantic Web services: Tools for semantic support[J]. SDK WSMO Working Group, Working draft: D5.2v0.1, 2004.
[160]陈德伟.服务部署与发布绑定的基于P2P网络的Web服务发现机制[J].计算机学报, 2005, 28(4).
[161]白东伟.一种增强语义精确度的Web服务匹配方法[J].北京邮电大学学报, 2006, 29(5).
[162]赵海,袁韶谦,张昕,李超.一种局部集聚的网络演化模型[J].东北大学学报:自然科学版, 2007, 28(011): 1548-1551.
[163] Gokcay, E.,J. C. Principe. Information theoretic clustering[J]. Pattern Analysis and Machine Intelligence, IEEE Transactions on, 2002, 24(2): 158-171.