By Topic

New Efficient Tree-Building Algorithms for Creating HCM Decision Tree in a Grid Authorization System

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Kaiiali, M. ; Dept. of Comput. & Inf. Sci., Univ. of Hyderabad, Hyderabad, India ; Wankar, R. ; Rao, C.R. ; Agarwal, A.

Many existing grid authorization systems adopt an inefficient structure of storing security policies for the available resources. That leads to huge repetitions in checking security rules. One of the efficient mechanisms that handles these repetitions is the Hierarchical Clustering Mechanism (HCM). HCM reduces the redundancy in checking security rules compared to the Brute Force Approach as well as the Primitive Clustering Mechanism (PCM). However, HCM is not totally free from redundancy. In this paper, new HCM tree-building algorithms are proposed which further reduce the redundancy and increase the efficiency to a reasonable extent.

Published in:

Network Applications Protocols and Services (NETAPPS), 2010 Second International Conference on

Date of Conference:

22-23 Sept. 2010