基于JXTA的Web服务可生存保障模型研究与实现
|
摘要
P2P技术和web服务技术是当前网络信息系统中广泛应用的分布式计算技术。传统的网络安全技术已经无法适应网络信息系统的新变化,针对服务可生存性的研究成为网络安全研究的新方向。本文主要针对P2P环境中的web服务的可生存性进行研究,提出了一种基于对等组的web服务可生存保障模型,并对其中的主要模块进行了设计和实现,主要工作和研究成果如下:
(1)在对可生存性理论、P2P技术和web服务技术进行深入研究的基础上,研究了可生存性相关概念并对其研究现状进行了综述,分析了P2P和web服务两种技术结合的优势以及构建P2P网络模式下的web服务可生存保障模型的可行性。
(2)设计并实现了一种基于JXTA的web服务可生存保障模型,包括通信路由机制、服务发布机制、服务发现机制、基于对等组的服务管理机制以及基于服务状态的服务代偿机制等相关机制。
(3)设计并实现了模型中的服务发布和服务发现机制,为实现基于JXTA的web服务奠定了基础。
(4)基于对等组的服务管理机制以及基于服务状态的服务代偿机制是本系统的核心技术实现机制。本文将提供相同服务的服务节点组织成服务对等组,有效解决了对等模式下的节点管理问题。同时设计了基于服务状态的服务代偿机制,并提出了服务代偿目标节点的选择算法。最后对模型的优势进行了分析,表明了系统对web服务可生存保障的效果。
本文成果可有效地增强网络信息系统的生存性。相关成果是863项目的重要组成部分,预期在加强web服务的生存和快速恢复等方面有潜在的应用前景。
The P2P technology and Web services technology are the widespread distributed computing technology in the current network information system.Traditional network security technology has been unable to adapt to the new changes of network information system. The research on service survivability has become a new direction of network security studies. This article mainly aims at the research of the survivability of the web services in peer-to-peer network. The main contribution of this thesis includes follows.
Firstly, by deeply researching survivability theory, P2P technology and web services technology, this thesis studys the related concept and the present research situation of the survivability theory, and analysis the advantages of the combination of the two technologies and the feasibility of construct web services’survivability assurance model in the peer-to-peer network.
Secondly, this thesis designed and implemented a JXTA-based web services’survivability assurance model. The model includes routing and communication module, service search module, service publish module, service management module based on the service peer-group and service compensation mechanism based on the state of service.
Thirdly, this thesis designed and implemented the service publish mechanism and the service search mechanism, which established the foundation of the implement of web services based on JXTA.
Finally, the service management module based on the service peer-group and the service compensation modules based on the state of service are the core components of the system. This thesis provides the mechanism of organizing the nodes providing same web service to peer-group, which solves the problem of node management in the peer-to-peer network. The thesis also designs a service compensation mechanism based on the state of service. A node selection scheme is designed for choosing the best destination node for the service compensation. At last, the thesis analysis the advantages of the model, and validate the effect of the model in guaranting the survivability of the web services in peer-to-peer network.
The achievement of this thesis may strengthen the network information system's survivability effectively. The research in the thesis is an important component of the 863 project, and is promising in the application of strengthening the survivability especially rapid recovery of web services.
(1)在对可生存性理论、P2P技术和web服务技术进行深入研究的基础上,研究了可生存性相关概念并对其研究现状进行了综述,分析了P2P和web服务两种技术结合的优势以及构建P2P网络模式下的web服务可生存保障模型的可行性。
(2)设计并实现了一种基于JXTA的web服务可生存保障模型,包括通信路由机制、服务发布机制、服务发现机制、基于对等组的服务管理机制以及基于服务状态的服务代偿机制等相关机制。
(3)设计并实现了模型中的服务发布和服务发现机制,为实现基于JXTA的web服务奠定了基础。
(4)基于对等组的服务管理机制以及基于服务状态的服务代偿机制是本系统的核心技术实现机制。本文将提供相同服务的服务节点组织成服务对等组,有效解决了对等模式下的节点管理问题。同时设计了基于服务状态的服务代偿机制,并提出了服务代偿目标节点的选择算法。最后对模型的优势进行了分析,表明了系统对web服务可生存保障的效果。
本文成果可有效地增强网络信息系统的生存性。相关成果是863项目的重要组成部分,预期在加强web服务的生存和快速恢复等方面有潜在的应用前景。
The P2P technology and Web services technology are the widespread distributed computing technology in the current network information system.Traditional network security technology has been unable to adapt to the new changes of network information system. The research on service survivability has become a new direction of network security studies. This article mainly aims at the research of the survivability of the web services in peer-to-peer network. The main contribution of this thesis includes follows.
Firstly, by deeply researching survivability theory, P2P technology and web services technology, this thesis studys the related concept and the present research situation of the survivability theory, and analysis the advantages of the combination of the two technologies and the feasibility of construct web services’survivability assurance model in the peer-to-peer network.
Secondly, this thesis designed and implemented a JXTA-based web services’survivability assurance model. The model includes routing and communication module, service search module, service publish module, service management module based on the service peer-group and service compensation mechanism based on the state of service.
Thirdly, this thesis designed and implemented the service publish mechanism and the service search mechanism, which established the foundation of the implement of web services based on JXTA.
Finally, the service management module based on the service peer-group and the service compensation modules based on the state of service are the core components of the system. This thesis provides the mechanism of organizing the nodes providing same web service to peer-group, which solves the problem of node management in the peer-to-peer network. The thesis also designs a service compensation mechanism based on the state of service. A node selection scheme is designed for choosing the best destination node for the service compensation. At last, the thesis analysis the advantages of the model, and validate the effect of the model in guaranting the survivability of the web services in peer-to-peer network.
The achievement of this thesis may strengthen the network information system's survivability effectively. The research in the thesis is an important component of the 863 project, and is promising in the application of strengthening the survivability especially rapid recovery of web services.
引文
[1]沈昌祥.信息安全工程导论.电子工业出版社,2003.7
[2]HoP G Neumann, A Hollway, A Banres. Survivable computer-commuincation systems: The problem and working group recommendations. US Army Research laboratory, 1993
[3]Robert J Ellison, David A Fisher, Richard C Linger et al. An Approach to Survivable Systems. NATOIST Symposium on Protecting Information System in the 21st Century, www.sei.cmu.edu/community/easel/pdfs/nato1.pdf
[4]Howard F Lipson, David A Fisher. Survivability: A New Technical and Business Perspective on Security. http://www.cert.org/archive/pdf/busperspec.pdf
[5]IEEE standard for a software quality metrics methodology, IEEE Std. 1061-1992
[6]J Ellison, B D Fisher, R Lingereta1. Survivable Network Systems-An Emerging Discipline. Technical Report CMU/SEI-97-TR-013, Software Engineering Institute, Canregie Mellon University, 1997
[7]张玉清,张鸿志.可生存性及紧急算法分析.通信学报,2005.1,26(1A):124-128
[8]http://www.cert.org/archive/pdf/02tr026.pdf
[9]张乐君,国林,王巍,杨武,杨永田.网络信息系统可生存性评估与增强技术研究概述.计算机科学,2007,34(8):30-33
[10]王树鹏,云晓春,余翔湛.系统生存性增强技术研究.哈尔滨工业大学学报,2007.3, 39(3):452-456,461
[11]刘键强,王韬,向阳霞,王昌盛.基于生存性的应对拒绝服务攻击的策略.计算机工程与设计,2004.4,25(4):593-595
[12]周俊杰,张桂戌.普适计算中网络可生存性及系统设计.计算机应用研究,2008.1,25(1):246-248
[13]许斌. JXTA——javaP2P网络编程技术.清华大学出版社,2003
[14]陈贵海,李振华.对等网络:结构、应用与设计.清华大学出版社,2007.9
[15]周文莉,吴晓非. P2P技术综述.计算机工程与设计,2006.1,27(1):76-79
[16]Ion Stoica, Robert Morris, David R. Karger, M. Frans Kaashoek, Hari Balakrishnan. Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications. In: SIGCOMM’01, 2001.8:149-160
[17]JXTA Java? Standard Edition v2.5: Programmers Guide. https://www. jxta.org/
[18]陈海涛,卢宇彤,黄遵国.一种新型多层可生存信息服务架构.计算机工程与应用,2008,44(15):15-17
[19]吴家菊,刘刚,席传裕.基于Web服务的面向服务(SOA)架构研究.现代电子技术,2005,14: 1-4,7
[20]岳昆,王晓玲,周傲英. Web服务核心支撑技术研究综述.软件学报,2004,15(3):428-442
[21]胥正川. P2P环境下的Web服务.合肥工业大学学报(自然科学版),2004.1,27(1): 71-74
[22]Boualem Benatallah, et al. The Self-Service Environment for Web Services Composition. IEEE Internet Computing, 2003, 5(3):40-48
[23]Mike P Papazoglou, et al. Leveraging Web-Services and Peer-to-Peer Networks. The 15th International Conference on Advanced Information Systems Engineering (CAISE), Klagenfurt / Velden, AustriaSpringer-Verlag, 2003:485-501.
[24]于冰,马世龙.一种基于P2P网络的语义Web服务发现机制.北京航空航天大学学报,2008.3,34(3): 315-318
[25]李政伟,牛强,闰子骥,杨文嘉.基于P2P的web服务发现机制研究.计算机工程与设计,2007.8,28(16): 3893-3895
[26]刘兴伟,崔晓红. UDDI的语义扩展及分布式实现.微电子学与计算机,2006,23(9): 179-181,184
[27]方馨馨,熊齐邦.基于P2P网络的语义Web服务发现机制.计算机工程, 2005.9,31 (17): 115-117
[28]刘振鹏,伊开,宋晓静,张思亮.基于对等体组的Web服务发现机制,微电子学与计算机,2006,23(9): 197-202
[29]许鹏波,鱼滨.基于P2P环境的语义Web服务发现模型.微电子学与计算机,2006,23 (9): 44-48
[30]刘志忠,王怀民,周斌.一种双层P2P结构的语义服务发现模型,软件学报,2007.8,18(8): 1922-1932
[31]Florian Forster, Hermann De Meer. Discovery of Web Services with a P2P Network, http://www.springerlink.com/media/64CR5AWHXM1JYN23RECN/Contributions/F/N/0/J/FN0JPDETTQB85VRJ.pdf
[32]Mike P. Papazoglou, Bernd J. Kramer, Jian Yang. Leveraging Web-Services and Peer-to-Peer Networks, http://www.springerlink.com/index/9B5BG0HC4K7GTD7F.pdf
[33]Sheng QZ, Benatallah B, Dumas M, Mak EO-Y. SELF-SERV: A platform for rapid composition of Web services in a peer-to-peer environment. Proc. of the 28th Int’l Conf. on Very Large Data Bases. 2002: 1051~1054
[34]胡建强,郭长国,王怀民,邹鹏.一种基于P2P网络的Web服务发现方法.电子学报,2005.12,33(12A): 25035-2507
[35]胡继成,孟凡荣,张玲.基于Web Service的层次化P2P小区模型的研究.计算机工程与设计,2007.5,28(10):2352-2354
[36]张智,杨俊,李瑞轩.面向Web服务的P2P模型研究,计算机应用研究,2005,9(3):63-64,80
[37]李祖鹏,黄建华,唐辉.基于P2P计算模式的自组织网络路由模型.软件学报,2005,16(5): 916-930
[38]陈高辉.基于P2P的Web服务及其在JXTA平台上的构建.硕士学位论文.上海交通大学,2005.2
[39]Karge D., Lehman E., Leighton T., Levine M., Lewin D., and Panigrahy R. Consistent hashing and random trees: Distributed caching protocols for relieving hot spots on the world wide web. In Proceedings of the 29th Annual ACM Symposium on Theory of Computing, 1997.5:654-663.
[40]F.DABEK, M.F.Kaashoek, D.Karger, R.Morris,and I.Stoica. Wide-area cooperative storage with CFS. In SOSP’01: Proceedings of the eighteenth ACM symposium on Operation systems principles, 2001:202-215
[41]B.Godfrey, K.Lakshminarayanan, S.Surana, R.Karp, and I.Stoica. Load balancing in dynamic structured P2P systems. In INFOCOM 2004: Proceedings of the 23th Annual Joint Conference of the IEEE Computer and Communications Societies, 2004.5:2254-2262
[42]I.Stoica, R.Morris, D.Karger, M,Kaashock, and H.Balakrishman. Chord:A scalable peer-to-peer lookup protocol for internet applications. IEEE/ACM Transactions on Networking, 2003,11(1):17-32
[43]D.R.Karger and M.Ruhl. Simple efficient load balancing algorithms for peer-to-peer systems. In SPAA’04:Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures, 2004:35-43
[44]A.Rao, K.Lakshminarayanan, S.Surana, R.Karp, and I.Stoica. Load balancing in structured p2p systems. In IPTPS 2003: Proceedings of the Second International Workshop Peer-to-Peer Systems. 2003.10:68-79
[45]黄遵国.面向生存能力的应急响应与事故恢复技术研究.博士学位论文.国防科技大学,2003.11
[46]刘红军.基于服务漂移的可生存性系统研究与实现.硕士学位论文.国防科技大学,2007.11
[47]黄遵国,卢锡城,王怀民.可生存技术及其实现框架研究.国防科技大学学报, 2002,24(5): 29-32
[48]黄遵国,卢锡城,胡华平.生存能力技术及其实现案例研究.通信学报,2004.7,25(7):137-145
[49]周鲁东.基于漏洞的多样化距离的测量和应用.硕士学位论文.国防科技大学,2007.11
[50]Sit E., Morris R., Security Considerations for Peer-to-Peer Distributed Hash Tables, In Proceeding of First International Workshop on Peer-to-Peer Systems, 2002:1-6
[2]HoP G Neumann, A Hollway, A Banres. Survivable computer-commuincation systems: The problem and working group recommendations. US Army Research laboratory, 1993
[3]Robert J Ellison, David A Fisher, Richard C Linger et al. An Approach to Survivable Systems. NATOIST Symposium on Protecting Information System in the 21st Century, www.sei.cmu.edu/community/easel/pdfs/nato1.pdf
[4]Howard F Lipson, David A Fisher. Survivability: A New Technical and Business Perspective on Security. http://www.cert.org/archive/pdf/busperspec.pdf
[5]IEEE standard for a software quality metrics methodology, IEEE Std. 1061-1992
[6]J Ellison, B D Fisher, R Lingereta1. Survivable Network Systems-An Emerging Discipline. Technical Report CMU/SEI-97-TR-013, Software Engineering Institute, Canregie Mellon University, 1997
[7]张玉清,张鸿志.可生存性及紧急算法分析.通信学报,2005.1,26(1A):124-128
[8]http://www.cert.org/archive/pdf/02tr026.pdf
[9]张乐君,国林,王巍,杨武,杨永田.网络信息系统可生存性评估与增强技术研究概述.计算机科学,2007,34(8):30-33
[10]王树鹏,云晓春,余翔湛.系统生存性增强技术研究.哈尔滨工业大学学报,2007.3, 39(3):452-456,461
[11]刘键强,王韬,向阳霞,王昌盛.基于生存性的应对拒绝服务攻击的策略.计算机工程与设计,2004.4,25(4):593-595
[12]周俊杰,张桂戌.普适计算中网络可生存性及系统设计.计算机应用研究,2008.1,25(1):246-248
[13]许斌. JXTA——javaP2P网络编程技术.清华大学出版社,2003
[14]陈贵海,李振华.对等网络:结构、应用与设计.清华大学出版社,2007.9
[15]周文莉,吴晓非. P2P技术综述.计算机工程与设计,2006.1,27(1):76-79
[16]Ion Stoica, Robert Morris, David R. Karger, M. Frans Kaashoek, Hari Balakrishnan. Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications. In: SIGCOMM’01, 2001.8:149-160
[17]JXTA Java? Standard Edition v2.5: Programmers Guide. https://www. jxta.org/
[18]陈海涛,卢宇彤,黄遵国.一种新型多层可生存信息服务架构.计算机工程与应用,2008,44(15):15-17
[19]吴家菊,刘刚,席传裕.基于Web服务的面向服务(SOA)架构研究.现代电子技术,2005,14: 1-4,7
[20]岳昆,王晓玲,周傲英. Web服务核心支撑技术研究综述.软件学报,2004,15(3):428-442
[21]胥正川. P2P环境下的Web服务.合肥工业大学学报(自然科学版),2004.1,27(1): 71-74
[22]Boualem Benatallah, et al. The Self-Service Environment for Web Services Composition. IEEE Internet Computing, 2003, 5(3):40-48
[23]Mike P Papazoglou, et al. Leveraging Web-Services and Peer-to-Peer Networks. The 15th International Conference on Advanced Information Systems Engineering (CAISE), Klagenfurt / Velden, AustriaSpringer-Verlag, 2003:485-501.
[24]于冰,马世龙.一种基于P2P网络的语义Web服务发现机制.北京航空航天大学学报,2008.3,34(3): 315-318
[25]李政伟,牛强,闰子骥,杨文嘉.基于P2P的web服务发现机制研究.计算机工程与设计,2007.8,28(16): 3893-3895
[26]刘兴伟,崔晓红. UDDI的语义扩展及分布式实现.微电子学与计算机,2006,23(9): 179-181,184
[27]方馨馨,熊齐邦.基于P2P网络的语义Web服务发现机制.计算机工程, 2005.9,31 (17): 115-117
[28]刘振鹏,伊开,宋晓静,张思亮.基于对等体组的Web服务发现机制,微电子学与计算机,2006,23(9): 197-202
[29]许鹏波,鱼滨.基于P2P环境的语义Web服务发现模型.微电子学与计算机,2006,23 (9): 44-48
[30]刘志忠,王怀民,周斌.一种双层P2P结构的语义服务发现模型,软件学报,2007.8,18(8): 1922-1932
[31]Florian Forster, Hermann De Meer. Discovery of Web Services with a P2P Network, http://www.springerlink.com/media/64CR5AWHXM1JYN23RECN/Contributions/F/N/0/J/FN0JPDETTQB85VRJ.pdf
[32]Mike P. Papazoglou, Bernd J. Kramer, Jian Yang. Leveraging Web-Services and Peer-to-Peer Networks, http://www.springerlink.com/index/9B5BG0HC4K7GTD7F.pdf
[33]Sheng QZ, Benatallah B, Dumas M, Mak EO-Y. SELF-SERV: A platform for rapid composition of Web services in a peer-to-peer environment. Proc. of the 28th Int’l Conf. on Very Large Data Bases. 2002: 1051~1054
[34]胡建强,郭长国,王怀民,邹鹏.一种基于P2P网络的Web服务发现方法.电子学报,2005.12,33(12A): 25035-2507
[35]胡继成,孟凡荣,张玲.基于Web Service的层次化P2P小区模型的研究.计算机工程与设计,2007.5,28(10):2352-2354
[36]张智,杨俊,李瑞轩.面向Web服务的P2P模型研究,计算机应用研究,2005,9(3):63-64,80
[37]李祖鹏,黄建华,唐辉.基于P2P计算模式的自组织网络路由模型.软件学报,2005,16(5): 916-930
[38]陈高辉.基于P2P的Web服务及其在JXTA平台上的构建.硕士学位论文.上海交通大学,2005.2
[39]Karge D., Lehman E., Leighton T., Levine M., Lewin D., and Panigrahy R. Consistent hashing and random trees: Distributed caching protocols for relieving hot spots on the world wide web. In Proceedings of the 29th Annual ACM Symposium on Theory of Computing, 1997.5:654-663.
[40]F.DABEK, M.F.Kaashoek, D.Karger, R.Morris,and I.Stoica. Wide-area cooperative storage with CFS. In SOSP’01: Proceedings of the eighteenth ACM symposium on Operation systems principles, 2001:202-215
[41]B.Godfrey, K.Lakshminarayanan, S.Surana, R.Karp, and I.Stoica. Load balancing in dynamic structured P2P systems. In INFOCOM 2004: Proceedings of the 23th Annual Joint Conference of the IEEE Computer and Communications Societies, 2004.5:2254-2262
[42]I.Stoica, R.Morris, D.Karger, M,Kaashock, and H.Balakrishman. Chord:A scalable peer-to-peer lookup protocol for internet applications. IEEE/ACM Transactions on Networking, 2003,11(1):17-32
[43]D.R.Karger and M.Ruhl. Simple efficient load balancing algorithms for peer-to-peer systems. In SPAA’04:Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures, 2004:35-43
[44]A.Rao, K.Lakshminarayanan, S.Surana, R.Karp, and I.Stoica. Load balancing in structured p2p systems. In IPTPS 2003: Proceedings of the Second International Workshop Peer-to-Peer Systems. 2003.10:68-79
[45]黄遵国.面向生存能力的应急响应与事故恢复技术研究.博士学位论文.国防科技大学,2003.11
[46]刘红军.基于服务漂移的可生存性系统研究与实现.硕士学位论文.国防科技大学,2007.11
[47]黄遵国,卢锡城,王怀民.可生存技术及其实现框架研究.国防科技大学学报, 2002,24(5): 29-32
[48]黄遵国,卢锡城,胡华平.生存能力技术及其实现案例研究.通信学报,2004.7,25(7):137-145
[49]周鲁东.基于漏洞的多样化距离的测量和应用.硕士学位论文.国防科技大学,2007.11
[50]Sit E., Morris R., Security Considerations for Peer-to-Peer Distributed Hash Tables, In Proceeding of First International Workshop on Peer-to-Peer Systems, 2002:1-6