Please wait a minute...
FITEE
Front. Inform. Technol. Electron. Eng.  2010, Vol. 11 Issue (5): 328-339    DOI: 10.1631/jzus.C0910186
    
Minimal role mining method for Web service composition
Chao Huang, Jian-ling Sun*, Xin-yu Wang, Yuan-jie Si
Department of Computer Science and Technology, Zhejiang University, Hangzhou 310027, China
Minimal role mining method for Web service composition
Chao Huang, Jian-ling Sun*, Xin-yu Wang, Yuan-jie Si
Department of Computer Science and Technology, Zhejiang University, Hangzhou 310027, China
 全文: PDF(232 KB)  
摘要： Web service composition is a low cost and efficient way to leverage the existing resource and implementation. In current Web service composition implementations, the issue of how to define the role for a new composite Web service has been little addressed. Adjusting the access control policy for a new composite Web service always causes substantial administration overhead from the security administrator. Furthermore, the distributed nature of Web service based applications makes traditional role mining methods obsolete. In this paper, we analyze the minimal role mining problem for Web service composition, and prove that this problem is NP-complete. We propose a sub-optimal greedy algorithm based on the analysis of necessary role mapping for interoperation across multiple domains. Simulation shows the effectiveness of our algorithm, and compared to the existing methods, our algorithm has significant performance advantages. We also demonstrate the practical application of our method in a real agent based Web service system. The results show that our method could find the minimal role mapping efficiently.
关键词： Web service composition;  Role base access control (RBAC);  Role mining;  Access control policy;  Role mapping;  Web service security    
Abstract: Web service composition is a low cost and efficient way to leverage the existing resource and implementation. In current Web service composition implementations, the issue of how to define the role for a new composite Web service has been little addressed. Adjusting the access control policy for a new composite Web service always causes substantial administration overhead from the security administrator. Furthermore, the distributed nature of Web service based applications makes traditional role mining methods obsolete. In this paper, we analyze the minimal role mining problem for Web service composition, and prove that this problem is NP-complete. We propose a sub-optimal greedy algorithm based on the analysis of necessary role mapping for interoperation across multiple domains. Simulation shows the effectiveness of our algorithm, and compared to the existing methods, our algorithm has significant performance advantages. We also demonstrate the practical application of our method in a real agent based Web service system. The results show that our method could find the minimal role mapping efficiently.
Key words: Web service composition    Role base access control (RBAC)    Role mining    Access control policy    Role mapping    Web service security
收稿日期: 2009-04-02 出版日期: 2010-04-28
CLC:  TP309  
通讯作者: Jian-ling SUN     E-mail: sunjl@zju.edu.cn
服务　　
把本文推荐给朋友
加入引用管理器
E-mail Alert
RSS
作者相关文章　　
Chao Huang
Jian-ling Sun
Xin-yu Wang
Yuan-jie Si

引用本文:

Chao Huang, Jian-ling Sun, Xin-yu Wang, Yuan-jie Si. Minimal role mining method for Web service composition. Front. Inform. Technol. Electron. Eng., 2010, 11(5): 328-339.

链接本文:

http://www.zjujournals.com/xueshu/fitee/CN/10.1631/jzus.C0910186    或    http://www.zjujournals.com/xueshu/fitee/CN/Y2010/V11/I5/328

[1] Bahareh Zibanezhad, Kamran Zamanifar, Razieh Sadat Sadjady, Yousef Rastegari. Applying gravitational search algorithm in the QoS-based Web service selection problem[J]. Front. Inform. Technol. Electron. Eng., 2011, 12(9): 730-742.