A rough set based PCM for authorizing grid resources

dc.contributor.author Kaiiali, Mustafa
dc.contributor.author Wankar, Rajeev
dc.contributor.author Rao, C. R.
dc.contributor.author Agarwal, Arun
dc.date.accessioned 2022-03-27T06:00:00Z
dc.date.available 2022-03-27T06:00:00Z
dc.date.issued 2010-12-01
dc.description.abstract 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 handle these repetitions is the Hierarchical Clustering Mechanism (HCM) [1]. HCM reduces the redundancy in checking security rules compared to the Brute Force Approach as well as the Primitive Clustering Mechanism (PCM). Further enhancement of HCM is done to make it suitable for dynamic environments [2]. However, HCM is not totally free from repetitions. Moreover, HCM is an expensive process in terms of decision tree size and memory consuming. In this paper, a new Rough Set based PCM is proposed which increases the efficiency of the authorization process and further reduces the redundancy. © 2010 IEEE.
dc.identifier.citation Proceedings of the 2010 10th International Conference on Intelligent Systems Design and Applications, ISDA'10
dc.identifier.uri 10.1109/ISDA.2010.5687232
dc.identifier.uri http://ieeexplore.ieee.org/document/5687232/
dc.identifier.uri https://dspace.uohyd.ac.in/handle/1/9060
dc.subject Access control
dc.subject Grid authorization
dc.subject HCM
dc.subject Hierarchical Clustering Mechanism
dc.subject PCM
dc.subject Primitive Clustering Mechanism
dc.subject Rough set
dc.title A rough set based PCM for authorizing grid resources
dc.type Conference Proceeding. Conference Paper
dspace.entity.type
Files
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.71 KB
Format:
Plain Text
Description: