A Rough Set based PCM for authorizing grid resources
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...
Gespeichert in:
| Hauptverfasser: | , , , |
|---|---|
| Format: | Tagungsbericht |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 396 |
|---|---|
| container_issue | |
| container_start_page | 391 |
| container_title | |
| container_volume | |
| creator | Kaiiali, M Wankar, R Rao, C R Agarwal, A |
| description | 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. |
| doi_str_mv | 10.1109/ISDA.2010.5687232 |
| format | Conference Proceeding |
| fullrecord | <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_5687232</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>5687232</ieee_id><sourcerecordid>5687232</sourcerecordid><originalsourceid>FETCH-LOGICAL-i90t-193db456f37df277055dcfabd32ea76618913ead2395022de567cc08e0be7a103</originalsourceid><addsrcrecordid>eNpFj8tKAzEYRuMNrLUPIG7yAlPz557lMFYtVBTbfclM_plG1JFkZqFPb8Giq4_DgQMfIVfA5gDM3SzXt-Wcsz0qbQ0X_IhcgORSWhDaHpMJBy0LAwpO_oWE0z8hxTmZ5fzK2D5inHVmQmRJX_qx29E1DrT2GQN9rh5p2yfqx2HXp_gdPzrapRhowtyPqcF8Sc5a_5Zxdtgp2dwtNtVDsXq6X1blqoiODQU4EWqpdCtMaLkxTKnQtL4OgqM3WoN1INAHLpxinAdU2jQNs8hqNB6YmJLr32xExO1niu8-fW0P58UPJXxHyw</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>A Rough Set based PCM for authorizing grid resources</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Kaiiali, M ; Wankar, R ; Rao, C R ; Agarwal, A</creator><creatorcontrib>Kaiiali, M ; Wankar, R ; Rao, C R ; Agarwal, A</creatorcontrib><description>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.</description><identifier>ISSN: 2164-7143</identifier><identifier>ISBN: 1424481341</identifier><identifier>ISBN: 9781424481347</identifier><identifier>EISSN: 2164-7151</identifier><identifier>EISBN: 1424481368</identifier><identifier>EISBN: 142448135X</identifier><identifier>EISBN: 9781424481361</identifier><identifier>EISBN: 9781424481354</identifier><identifier>DOI: 10.1109/ISDA.2010.5687232</identifier><language>eng</language><publisher>IEEE</publisher><subject>Access Control ; Authorization ; Clustering algorithms ; Decision trees ; Force ; Grid Authorization ; HCM ; Hierarchical Clustering Mechanism ; PCM ; Phase change materials ; Primitive Clustering Mechanism ; Redundancy ; Rough Set</subject><ispartof>2010 10th International Conference on Intelligent Systems Design and Applications, 2010, p.391-396</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/5687232$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,780,784,789,790,2058,27925,54920</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/5687232$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Kaiiali, M</creatorcontrib><creatorcontrib>Wankar, R</creatorcontrib><creatorcontrib>Rao, C R</creatorcontrib><creatorcontrib>Agarwal, A</creatorcontrib><title>A Rough Set based PCM for authorizing grid resources</title><title>2010 10th International Conference on Intelligent Systems Design and Applications</title><addtitle>ISDA</addtitle><description>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.</description><subject>Access Control</subject><subject>Authorization</subject><subject>Clustering algorithms</subject><subject>Decision trees</subject><subject>Force</subject><subject>Grid Authorization</subject><subject>HCM</subject><subject>Hierarchical Clustering Mechanism</subject><subject>PCM</subject><subject>Phase change materials</subject><subject>Primitive Clustering Mechanism</subject><subject>Redundancy</subject><subject>Rough Set</subject><issn>2164-7143</issn><issn>2164-7151</issn><isbn>1424481341</isbn><isbn>9781424481347</isbn><isbn>1424481368</isbn><isbn>142448135X</isbn><isbn>9781424481361</isbn><isbn>9781424481354</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2010</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNpFj8tKAzEYRuMNrLUPIG7yAlPz557lMFYtVBTbfclM_plG1JFkZqFPb8Giq4_DgQMfIVfA5gDM3SzXt-Wcsz0qbQ0X_IhcgORSWhDaHpMJBy0LAwpO_oWE0z8hxTmZ5fzK2D5inHVmQmRJX_qx29E1DrT2GQN9rh5p2yfqx2HXp_gdPzrapRhowtyPqcF8Sc5a_5Zxdtgp2dwtNtVDsXq6X1blqoiODQU4EWqpdCtMaLkxTKnQtL4OgqM3WoN1INAHLpxinAdU2jQNs8hqNB6YmJLr32xExO1niu8-fW0P58UPJXxHyw</recordid><startdate>201011</startdate><enddate>201011</enddate><creator>Kaiiali, M</creator><creator>Wankar, R</creator><creator>Rao, C R</creator><creator>Agarwal, A</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>201011</creationdate><title>A Rough Set based PCM for authorizing grid resources</title><author>Kaiiali, M ; Wankar, R ; Rao, C R ; Agarwal, A</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i90t-193db456f37df277055dcfabd32ea76618913ead2395022de567cc08e0be7a103</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2010</creationdate><topic>Access Control</topic><topic>Authorization</topic><topic>Clustering algorithms</topic><topic>Decision trees</topic><topic>Force</topic><topic>Grid Authorization</topic><topic>HCM</topic><topic>Hierarchical Clustering Mechanism</topic><topic>PCM</topic><topic>Phase change materials</topic><topic>Primitive Clustering Mechanism</topic><topic>Redundancy</topic><topic>Rough Set</topic><toplevel>online_resources</toplevel><creatorcontrib>Kaiiali, M</creatorcontrib><creatorcontrib>Wankar, R</creatorcontrib><creatorcontrib>Rao, C R</creatorcontrib><creatorcontrib>Agarwal, A</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Electronic Library (IEL)</collection><collection>IEEE Proceedings Order Plans (POP All) 1998-Present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Kaiiali, M</au><au>Wankar, R</au><au>Rao, C R</au><au>Agarwal, A</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>A Rough Set based PCM for authorizing grid resources</atitle><btitle>2010 10th International Conference on Intelligent Systems Design and Applications</btitle><stitle>ISDA</stitle><date>2010-11</date><risdate>2010</risdate><spage>391</spage><epage>396</epage><pages>391-396</pages><issn>2164-7143</issn><eissn>2164-7151</eissn><isbn>1424481341</isbn><isbn>9781424481347</isbn><eisbn>1424481368</eisbn><eisbn>142448135X</eisbn><eisbn>9781424481361</eisbn><eisbn>9781424481354</eisbn><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.</abstract><pub>IEEE</pub><doi>10.1109/ISDA.2010.5687232</doi><tpages>6</tpages></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 2164-7143 |
| ispartof | 2010 10th International Conference on Intelligent Systems Design and Applications, 2010, p.391-396 |
| issn | 2164-7143 2164-7151 |
| language | eng |
| recordid | cdi_ieee_primary_5687232 |
| source | IEEE Electronic Library (IEL) Conference Proceedings |
| subjects | Access Control Authorization Clustering algorithms Decision trees Force Grid Authorization HCM Hierarchical Clustering Mechanism PCM Phase change materials Primitive Clustering Mechanism Redundancy Rough Set |
| title | A Rough Set based PCM for authorizing grid resources |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-02T17%3A10%3A08IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=A%20Rough%20Set%20based%20PCM%20for%20authorizing%20grid%20resources&rft.btitle=2010%2010th%20International%20Conference%20on%20Intelligent%20Systems%20Design%20and%20Applications&rft.au=Kaiiali,%20M&rft.date=2010-11&rft.spage=391&rft.epage=396&rft.pages=391-396&rft.issn=2164-7143&rft.eissn=2164-7151&rft.isbn=1424481341&rft.isbn_list=9781424481347&rft_id=info:doi/10.1109/ISDA.2010.5687232&rft_dat=%3Cieee_6IE%3E5687232%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&rft.eisbn=1424481368&rft.eisbn_list=142448135X&rft.eisbn_list=9781424481361&rft.eisbn_list=9781424481354&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=5687232&rfr_iscdi=true |