Synthesizing Clustered, Secured, and Hierarchical Networks through Genetic Algorithms
We have formulated and combined three problems: clustering, firewall placement and network hierarchy into one optimization problem, where the objective function is to minimize the total design cost of the synthesized network, while maximizing its security and scalability. Due to the computational co...
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 | 390 |
|---|---|
| container_issue | |
| container_start_page | 385 |
| container_title | |
| container_volume | |
| creator | Al-Subaihi, S. Al-Hubail, L. Marimuthu, P.N. Habib, S.J. |
| description | We have formulated and combined three problems: clustering, firewall placement and network hierarchy into one optimization problem, where the objective function is to minimize the total design cost of the synthesized network, while maximizing its security and scalability. Due to the computational complexity of the combined three problems, we have developed a custom-made intelligent algorithm based on the genetic algorithms (GA) to search the design space for good solutions. We have conducted five experiments with different mutation rates for three different network scenarios comprising of 50, 70, and 100 clients respectively. Our results show that the custom-made GA has converged and optimized the cost of network by 60% from its initial design. |
| doi_str_mv | 10.1109/ISMS.2010.75 |
| format | Conference Proceeding |
| fullrecord | <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_5416063</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>5416063</ieee_id><sourcerecordid>5416063</sourcerecordid><originalsourceid>FETCH-LOGICAL-i175t-702db09ebbf71940a3f1511a4d1c0d6a79588efdfbed83368e40c4faf544b9923</originalsourceid><addsrcrecordid>eNo9jMtOAjEYRustEZGdOzfzAA72flkSokCCuhhZk870L1MdBtOWGHx6iRpX5zv5koPQDcFjQrC5X1RP1ZjioypxgkZGaaykEcwopk7RgBIpSywVPkNXhFPOhdGcnv8fkl6iUUpvGB8TymijB2hVHfrcQgpfod8U026fMkRwd0UFzf5n2N4V8wDRxqYNje2KZ8ifu_ieitzG3X7TFjPoIYemmHSbXQy53aZrdOFtl2D0xyFaPT68Tufl8mW2mE6WZSBK5FJh6mpsoK69IoZjyzwRhFjuSIOdtMoIrcE7X4PTjEkNHDfcWy84r42hbIhuf7sBANYfMWxtPKwFJxJLxr4B_XxVlQ</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Synthesizing Clustered, Secured, and Hierarchical Networks through Genetic Algorithms</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Al-Subaihi, S. ; Al-Hubail, L. ; Marimuthu, P.N. ; Habib, S.J.</creator><creatorcontrib>Al-Subaihi, S. ; Al-Hubail, L. ; Marimuthu, P.N. ; Habib, S.J.</creatorcontrib><description>We have formulated and combined three problems: clustering, firewall placement and network hierarchy into one optimization problem, where the objective function is to minimize the total design cost of the synthesized network, while maximizing its security and scalability. Due to the computational complexity of the combined three problems, we have developed a custom-made intelligent algorithm based on the genetic algorithms (GA) to search the design space for good solutions. We have conducted five experiments with different mutation rates for three different network scenarios comprising of 50, 70, and 100 clients respectively. Our results show that the custom-made GA has converged and optimized the cost of network by 60% from its initial design.</description><identifier>ISSN: 2166-0662</identifier><identifier>ISBN: 1424459842</identifier><identifier>ISBN: 9781424459841</identifier><identifier>EISSN: 2166-0670</identifier><identifier>EISBN: 9780769539737</identifier><identifier>EISBN: 9781424459858</identifier><identifier>EISBN: 0769539734</identifier><identifier>EISBN: 1424459850</identifier><identifier>DOI: 10.1109/ISMS.2010.75</identifier><language>eng</language><publisher>IEEE</publisher><subject>Algorithm design and analysis ; clustering ; Clustering algorithms ; Computational complexity ; Computational intelligence ; Cost function ; Design optimization ; firewall placement ; Genetic algorithms ; Genetic mutations ; hierarchy ; Network synthesis ; optimization ; Scalability</subject><ispartof>2010 International Conference on Intelligent Systems, Modelling and Simulation, 2010, p.385-390</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/5416063$$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/5416063$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Al-Subaihi, S.</creatorcontrib><creatorcontrib>Al-Hubail, L.</creatorcontrib><creatorcontrib>Marimuthu, P.N.</creatorcontrib><creatorcontrib>Habib, S.J.</creatorcontrib><title>Synthesizing Clustered, Secured, and Hierarchical Networks through Genetic Algorithms</title><title>2010 International Conference on Intelligent Systems, Modelling and Simulation</title><addtitle>ISMS</addtitle><description>We have formulated and combined three problems: clustering, firewall placement and network hierarchy into one optimization problem, where the objective function is to minimize the total design cost of the synthesized network, while maximizing its security and scalability. Due to the computational complexity of the combined three problems, we have developed a custom-made intelligent algorithm based on the genetic algorithms (GA) to search the design space for good solutions. We have conducted five experiments with different mutation rates for three different network scenarios comprising of 50, 70, and 100 clients respectively. Our results show that the custom-made GA has converged and optimized the cost of network by 60% from its initial design.</description><subject>Algorithm design and analysis</subject><subject>clustering</subject><subject>Clustering algorithms</subject><subject>Computational complexity</subject><subject>Computational intelligence</subject><subject>Cost function</subject><subject>Design optimization</subject><subject>firewall placement</subject><subject>Genetic algorithms</subject><subject>Genetic mutations</subject><subject>hierarchy</subject><subject>Network synthesis</subject><subject>optimization</subject><subject>Scalability</subject><issn>2166-0662</issn><issn>2166-0670</issn><isbn>1424459842</isbn><isbn>9781424459841</isbn><isbn>9780769539737</isbn><isbn>9781424459858</isbn><isbn>0769539734</isbn><isbn>1424459850</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2010</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNo9jMtOAjEYRustEZGdOzfzAA72flkSokCCuhhZk870L1MdBtOWGHx6iRpX5zv5koPQDcFjQrC5X1RP1ZjioypxgkZGaaykEcwopk7RgBIpSywVPkNXhFPOhdGcnv8fkl6iUUpvGB8TymijB2hVHfrcQgpfod8U026fMkRwd0UFzf5n2N4V8wDRxqYNje2KZ8ifu_ieitzG3X7TFjPoIYemmHSbXQy53aZrdOFtl2D0xyFaPT68Tufl8mW2mE6WZSBK5FJh6mpsoK69IoZjyzwRhFjuSIOdtMoIrcE7X4PTjEkNHDfcWy84r42hbIhuf7sBANYfMWxtPKwFJxJLxr4B_XxVlQ</recordid><startdate>201001</startdate><enddate>201001</enddate><creator>Al-Subaihi, S.</creator><creator>Al-Hubail, L.</creator><creator>Marimuthu, P.N.</creator><creator>Habib, S.J.</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>201001</creationdate><title>Synthesizing Clustered, Secured, and Hierarchical Networks through Genetic Algorithms</title><author>Al-Subaihi, S. ; Al-Hubail, L. ; Marimuthu, P.N. ; Habib, S.J.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i175t-702db09ebbf71940a3f1511a4d1c0d6a79588efdfbed83368e40c4faf544b9923</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2010</creationdate><topic>Algorithm design and analysis</topic><topic>clustering</topic><topic>Clustering algorithms</topic><topic>Computational complexity</topic><topic>Computational intelligence</topic><topic>Cost function</topic><topic>Design optimization</topic><topic>firewall placement</topic><topic>Genetic algorithms</topic><topic>Genetic mutations</topic><topic>hierarchy</topic><topic>Network synthesis</topic><topic>optimization</topic><topic>Scalability</topic><toplevel>online_resources</toplevel><creatorcontrib>Al-Subaihi, S.</creatorcontrib><creatorcontrib>Al-Hubail, L.</creatorcontrib><creatorcontrib>Marimuthu, P.N.</creatorcontrib><creatorcontrib>Habib, S.J.</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>Al-Subaihi, S.</au><au>Al-Hubail, L.</au><au>Marimuthu, P.N.</au><au>Habib, S.J.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Synthesizing Clustered, Secured, and Hierarchical Networks through Genetic Algorithms</atitle><btitle>2010 International Conference on Intelligent Systems, Modelling and Simulation</btitle><stitle>ISMS</stitle><date>2010-01</date><risdate>2010</risdate><spage>385</spage><epage>390</epage><pages>385-390</pages><issn>2166-0662</issn><eissn>2166-0670</eissn><isbn>1424459842</isbn><isbn>9781424459841</isbn><eisbn>9780769539737</eisbn><eisbn>9781424459858</eisbn><eisbn>0769539734</eisbn><eisbn>1424459850</eisbn><abstract>We have formulated and combined three problems: clustering, firewall placement and network hierarchy into one optimization problem, where the objective function is to minimize the total design cost of the synthesized network, while maximizing its security and scalability. Due to the computational complexity of the combined three problems, we have developed a custom-made intelligent algorithm based on the genetic algorithms (GA) to search the design space for good solutions. We have conducted five experiments with different mutation rates for three different network scenarios comprising of 50, 70, and 100 clients respectively. Our results show that the custom-made GA has converged and optimized the cost of network by 60% from its initial design.</abstract><pub>IEEE</pub><doi>10.1109/ISMS.2010.75</doi><tpages>6</tpages></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 2166-0662 |
| ispartof | 2010 International Conference on Intelligent Systems, Modelling and Simulation, 2010, p.385-390 |
| issn | 2166-0662 2166-0670 |
| language | eng |
| recordid | cdi_ieee_primary_5416063 |
| source | IEEE Electronic Library (IEL) Conference Proceedings |
| subjects | Algorithm design and analysis clustering Clustering algorithms Computational complexity Computational intelligence Cost function Design optimization firewall placement Genetic algorithms Genetic mutations hierarchy Network synthesis optimization Scalability |
| title | Synthesizing Clustered, Secured, and Hierarchical Networks through Genetic Algorithms |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-24T17%3A46%3A37IST&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=Synthesizing%20Clustered,%20Secured,%20and%20Hierarchical%20Networks%20through%20Genetic%20Algorithms&rft.btitle=2010%20International%20Conference%20on%20Intelligent%20Systems,%20Modelling%20and%20Simulation&rft.au=Al-Subaihi,%20S.&rft.date=2010-01&rft.spage=385&rft.epage=390&rft.pages=385-390&rft.issn=2166-0662&rft.eissn=2166-0670&rft.isbn=1424459842&rft.isbn_list=9781424459841&rft_id=info:doi/10.1109/ISMS.2010.75&rft_dat=%3Cieee_6IE%3E5416063%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&rft.eisbn=9780769539737&rft.eisbn_list=9781424459858&rft.eisbn_list=0769539734&rft.eisbn_list=1424459850&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=5416063&rfr_iscdi=true |