Enhancing the hierarchical clustering mechanism of storing resources’ security policies in a grid authorization system

Authors:
Mustafa Kaiiali;Rajeev Wankar;C. R. Rao;Arun Agarwal
Affiliations:
Department of Computer and Information Sciences, University of Hyderabad, Hyderabad, India;Department of Computer and Information Sciences, University of Hyderabad, Hyderabad, India;Department of Computer and Information Sciences, University of Hyderabad, Hyderabad, India;Department of Computer and Information Sciences, University of Hyderabad, Hyderabad, India
Venue:
ICDCIT'10 Proceedings of the 6th international conference on Distributed Computing and Internet Technology
Year:
2010

Citing 6
Cited 1

Authorization and Attribute Certificates for Widely Distributed Access Control

WETICE '98 Proceedings of the 7th Workshop on Enabling Technologies: Infrastructure for Collaborative Enterprises
Performance Comparison of Security Mechanisms for Grid Services

GRID '04 Proceedings of the 5th IEEE/ACM International Workshop on Grid Computing
Grid Computing Security

Grid Computing Security
Grid Computing Security: A Taxonomy

IEEE Security and Privacy
Design of a Structured Fine-Grained Access Control Mechanism for Authorizing Grid Resources

CSEWORKSHOPS '08 Proceedings of the 2008 11th IEEE International Conference on Computational Science and Engineering - Workshops
From gridmap-file to VOMS: managing authorization in a Grid environment

Future Generation Computer Systems - Special issue: High-speed networks and services for data-intensive grids: The DataTAG project

Grid Authorization Graph

Future Generation Computer Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Many existing grid authorization systems adopt an inefficient structure of storing security policies for the available resources, which reduces the scalability and leads to huge repetitions in checking security rules. One of the efficient mechanisms that handles these repetitions and increases the scalability is the Hierarchical Clustering Mechanism (HCM) [1]. HCM outperforms the Brute Force Approach as well as the Primitive Clustering Mechanism (PCM). This paper enhances HCM to accommodate the dynamism of the grid and the same is demonstrated using new algorithms.