Security of grid structures under disguised traffic attacks
Models of rectangular grid structures were constructed in the form of a colored Petri net. The basic model consists of a matrix of switching nodes that deliver packets to computing nodes which are attached to the matrix borders and produce and consume packets. Since grid structures are often employe...
Gespeichert in:
| Veröffentlicht in: | Cluster computing 2016-09, Vol.19 (3), p.1183-1200 |
|---|---|
| Hauptverfasser: | , , , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 1200 |
|---|---|
| container_issue | 3 |
| container_start_page | 1183 |
| container_title | Cluster computing |
| container_volume | 19 |
| creator | Zaitsev, D. A. Shmeleva, T. R. Retschitzegger, W. Pröll, B. |
| description | Models of rectangular grid structures were constructed in the form of a colored Petri net. The basic model consists of a matrix of switching nodes that deliver packets to computing nodes which are attached to the matrix borders and produce and consume packets. Since grid structures are often employed to solve boundary value problems, square and torus surfaces were studied and generalized to hypercube and hypertorus in multidimensional space using a grid node that aggregates switching and computing nodes. Traffic guns were added to the models to represent traffic attacks. Simulation in CPN Tools revealed simple and dangerous traffic gun configurations, such as a traffic duel, focus, crossfire, and side shot, which bring the grid to complete deadlock at less than 5 % of the grid peak load. Comparably low gun intensity targeted to induce deadlock areas within a grid (network) is a key characteristic of disguised traffic attacks. The aim of future work will be to develop counter-measures for these attacks. |
| doi_str_mv | 10.1007/s10586-016-0582-9 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_2918207187</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2918207187</sourcerecordid><originalsourceid>FETCH-LOGICAL-c316t-529a2a5068a4a76b583046637f4c8e2f615f9b210ec16d18639f123956e7cad43</originalsourceid><addsrcrecordid>eNp1kEtLAzEQx4MoWKsfwFvA82om2bzwJMUXFDyo55Bmk2Wr7tY8Dv32pqzgycMwA_N_wA-hSyDXQIi8SUC4Eg2BOlzRRh-hBXDJGslbdlxvVr9ScXmKzlLaEkK0pHqBbl-9K3HIezwF3MehwynH4nKJPuEydj7ibkh9GZLvcI42hMFhm7N1H-kcnQT7mfzF716i94f7t9VTs355fF7drRvHQOSGU22p5UQo21opNlwx0grBZGid8jQI4EFvKBDvQHSgBNMBKNNceOls17Iluppzd3H6Lj5ls51KHGuloRoUJRKUrCqYVS5OKUUfzC4OXzbuDRBzYGRmRqYyMgdGRlcPnT2pasfex7_k_00_QM5oSw</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2918207187</pqid></control><display><type>article</type><title>Security of grid structures under disguised traffic attacks</title><source>Springer Nature - Complete Springer Journals</source><source>ProQuest Central</source><creator>Zaitsev, D. A. ; Shmeleva, T. R. ; Retschitzegger, W. ; Pröll, B.</creator><creatorcontrib>Zaitsev, D. A. ; Shmeleva, T. R. ; Retschitzegger, W. ; Pröll, B.</creatorcontrib><description>Models of rectangular grid structures were constructed in the form of a colored Petri net. The basic model consists of a matrix of switching nodes that deliver packets to computing nodes which are attached to the matrix borders and produce and consume packets. Since grid structures are often employed to solve boundary value problems, square and torus surfaces were studied and generalized to hypercube and hypertorus in multidimensional space using a grid node that aggregates switching and computing nodes. Traffic guns were added to the models to represent traffic attacks. Simulation in CPN Tools revealed simple and dangerous traffic gun configurations, such as a traffic duel, focus, crossfire, and side shot, which bring the grid to complete deadlock at less than 5 % of the grid peak load. Comparably low gun intensity targeted to induce deadlock areas within a grid (network) is a key characteristic of disguised traffic attacks. The aim of future work will be to develop counter-measures for these attacks.</description><identifier>ISSN: 1386-7857</identifier><identifier>EISSN: 1573-7543</identifier><identifier>DOI: 10.1007/s10586-016-0582-9</identifier><language>eng</language><publisher>New York: Springer US</publisher><subject>Boundary value problems ; Cloud computing ; Computation ; Computer Communication Networks ; Computer Science ; Hypercubes ; Nodes ; Operating Systems ; Packet switching ; Peak load ; Petri nets ; Processor Architectures ; Programming languages ; Simulation ; Software ; Supercomputers ; Toruses ; Traffic models ; Workloads</subject><ispartof>Cluster computing, 2016-09, Vol.19 (3), p.1183-1200</ispartof><rights>Springer Science+Business Media New York 2016</rights><rights>Springer Science+Business Media New York 2016.</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c316t-529a2a5068a4a76b583046637f4c8e2f615f9b210ec16d18639f123956e7cad43</citedby><cites>FETCH-LOGICAL-c316t-529a2a5068a4a76b583046637f4c8e2f615f9b210ec16d18639f123956e7cad43</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/s10586-016-0582-9$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://www.proquest.com/docview/2918207187?pq-origsite=primo$$EHTML$$P50$$Gproquest$$H</linktohtml><link.rule.ids>314,776,780,21367,27901,27902,33721,41464,42533,43781,51294</link.rule.ids></links><search><creatorcontrib>Zaitsev, D. A.</creatorcontrib><creatorcontrib>Shmeleva, T. R.</creatorcontrib><creatorcontrib>Retschitzegger, W.</creatorcontrib><creatorcontrib>Pröll, B.</creatorcontrib><title>Security of grid structures under disguised traffic attacks</title><title>Cluster computing</title><addtitle>Cluster Comput</addtitle><description>Models of rectangular grid structures were constructed in the form of a colored Petri net. The basic model consists of a matrix of switching nodes that deliver packets to computing nodes which are attached to the matrix borders and produce and consume packets. Since grid structures are often employed to solve boundary value problems, square and torus surfaces were studied and generalized to hypercube and hypertorus in multidimensional space using a grid node that aggregates switching and computing nodes. Traffic guns were added to the models to represent traffic attacks. Simulation in CPN Tools revealed simple and dangerous traffic gun configurations, such as a traffic duel, focus, crossfire, and side shot, which bring the grid to complete deadlock at less than 5 % of the grid peak load. Comparably low gun intensity targeted to induce deadlock areas within a grid (network) is a key characteristic of disguised traffic attacks. The aim of future work will be to develop counter-measures for these attacks.</description><subject>Boundary value problems</subject><subject>Cloud computing</subject><subject>Computation</subject><subject>Computer Communication Networks</subject><subject>Computer Science</subject><subject>Hypercubes</subject><subject>Nodes</subject><subject>Operating Systems</subject><subject>Packet switching</subject><subject>Peak load</subject><subject>Petri nets</subject><subject>Processor Architectures</subject><subject>Programming languages</subject><subject>Simulation</subject><subject>Software</subject><subject>Supercomputers</subject><subject>Toruses</subject><subject>Traffic models</subject><subject>Workloads</subject><issn>1386-7857</issn><issn>1573-7543</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2016</creationdate><recordtype>article</recordtype><sourceid>BENPR</sourceid><recordid>eNp1kEtLAzEQx4MoWKsfwFvA82om2bzwJMUXFDyo55Bmk2Wr7tY8Dv32pqzgycMwA_N_wA-hSyDXQIi8SUC4Eg2BOlzRRh-hBXDJGslbdlxvVr9ScXmKzlLaEkK0pHqBbl-9K3HIezwF3MehwynH4nKJPuEydj7ibkh9GZLvcI42hMFhm7N1H-kcnQT7mfzF716i94f7t9VTs355fF7drRvHQOSGU22p5UQo21opNlwx0grBZGid8jQI4EFvKBDvQHSgBNMBKNNceOls17Iluppzd3H6Lj5ls51KHGuloRoUJRKUrCqYVS5OKUUfzC4OXzbuDRBzYGRmRqYyMgdGRlcPnT2pasfex7_k_00_QM5oSw</recordid><startdate>20160901</startdate><enddate>20160901</enddate><creator>Zaitsev, D. A.</creator><creator>Shmeleva, T. R.</creator><creator>Retschitzegger, W.</creator><creator>Pröll, B.</creator><general>Springer US</general><general>Springer Nature B.V</general><scope>AAYXX</scope><scope>CITATION</scope><scope>8FE</scope><scope>8FG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>GNUQQ</scope><scope>HCIFZ</scope><scope>JQ2</scope><scope>K7-</scope><scope>P5Z</scope><scope>P62</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope></search><sort><creationdate>20160901</creationdate><title>Security of grid structures under disguised traffic attacks</title><author>Zaitsev, D. A. ; Shmeleva, T. R. ; Retschitzegger, W. ; Pröll, B.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c316t-529a2a5068a4a76b583046637f4c8e2f615f9b210ec16d18639f123956e7cad43</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2016</creationdate><topic>Boundary value problems</topic><topic>Cloud computing</topic><topic>Computation</topic><topic>Computer Communication Networks</topic><topic>Computer Science</topic><topic>Hypercubes</topic><topic>Nodes</topic><topic>Operating Systems</topic><topic>Packet switching</topic><topic>Peak load</topic><topic>Petri nets</topic><topic>Processor Architectures</topic><topic>Programming languages</topic><topic>Simulation</topic><topic>Software</topic><topic>Supercomputers</topic><topic>Toruses</topic><topic>Traffic models</topic><topic>Workloads</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Zaitsev, D. A.</creatorcontrib><creatorcontrib>Shmeleva, T. R.</creatorcontrib><creatorcontrib>Retschitzegger, W.</creatorcontrib><creatorcontrib>Pröll, B.</creatorcontrib><collection>CrossRef</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Central UK/Ireland</collection><collection>Advanced Technologies & Aerospace Collection</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>ProQuest Central Student</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Computer Science Collection</collection><collection>Computer Science Database</collection><collection>Advanced Technologies & Aerospace Database</collection><collection>ProQuest Advanced Technologies & Aerospace Collection</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><jtitle>Cluster computing</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Zaitsev, D. A.</au><au>Shmeleva, T. R.</au><au>Retschitzegger, W.</au><au>Pröll, B.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Security of grid structures under disguised traffic attacks</atitle><jtitle>Cluster computing</jtitle><stitle>Cluster Comput</stitle><date>2016-09-01</date><risdate>2016</risdate><volume>19</volume><issue>3</issue><spage>1183</spage><epage>1200</epage><pages>1183-1200</pages><issn>1386-7857</issn><eissn>1573-7543</eissn><abstract>Models of rectangular grid structures were constructed in the form of a colored Petri net. The basic model consists of a matrix of switching nodes that deliver packets to computing nodes which are attached to the matrix borders and produce and consume packets. Since grid structures are often employed to solve boundary value problems, square and torus surfaces were studied and generalized to hypercube and hypertorus in multidimensional space using a grid node that aggregates switching and computing nodes. Traffic guns were added to the models to represent traffic attacks. Simulation in CPN Tools revealed simple and dangerous traffic gun configurations, such as a traffic duel, focus, crossfire, and side shot, which bring the grid to complete deadlock at less than 5 % of the grid peak load. Comparably low gun intensity targeted to induce deadlock areas within a grid (network) is a key characteristic of disguised traffic attacks. The aim of future work will be to develop counter-measures for these attacks.</abstract><cop>New York</cop><pub>Springer US</pub><doi>10.1007/s10586-016-0582-9</doi><tpages>18</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 1386-7857 |
| ispartof | Cluster computing, 2016-09, Vol.19 (3), p.1183-1200 |
| issn | 1386-7857 1573-7543 |
| language | eng |
| recordid | cdi_proquest_journals_2918207187 |
| source | Springer Nature - Complete Springer Journals; ProQuest Central |
| subjects | Boundary value problems Cloud computing Computation Computer Communication Networks Computer Science Hypercubes Nodes Operating Systems Packet switching Peak load Petri nets Processor Architectures Programming languages Simulation Software Supercomputers Toruses Traffic models Workloads |
| title | Security of grid structures under disguised traffic attacks |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-30T14%3A00%3A28IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Security%20of%20grid%20structures%20under%20disguised%20traffic%20attacks&rft.jtitle=Cluster%20computing&rft.au=Zaitsev,%20D.%20A.&rft.date=2016-09-01&rft.volume=19&rft.issue=3&rft.spage=1183&rft.epage=1200&rft.pages=1183-1200&rft.issn=1386-7857&rft.eissn=1573-7543&rft_id=info:doi/10.1007/s10586-016-0582-9&rft_dat=%3Cproquest_cross%3E2918207187%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2918207187&rft_id=info:pmid/&rfr_iscdi=true |