Comparison of Failures and Attacks on Random and Scale-Free Networks
It appeared recently that some statistical properties of complex networks like the Internet, the World Wide Web or Peer-to-Peer systems have an important influence on their resilience to failures and attacks. In particular, scale-free networks (i.e. networks with power-law degree distribution) seem...
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Tagungsbericht |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 196 |
|---|---|
| container_issue | |
| container_start_page | 186 |
| container_title | |
| container_volume | |
| creator | Guillaume, Jean-Loup Latapy, Matthieu Magnien, Clémence |
| description | It appeared recently that some statistical properties of complex networks like the Internet, the World Wide Web or Peer-to-Peer systems have an important influence on their resilience to failures and attacks. In particular, scale-free networks (i.e. networks with power-law degree distribution) seem much more robust than random networks in case of failures, while they are more sensitive to attacks.
In this paper we deepen the study of the differences in the behavior of these two kinds of networks when facing failures or attacks. We moderate the general affirmation that scale-free networks are much more sensitive than random networks to attacks by showing that the number of links to remove in both cases is similar, and by showing that a slightly modified scenario for failures gives results similar to the ones for attacks. We also propose and analyze an efficient attack strategy against links. |
| doi_str_mv | 10.1007/11516798_14 |
| format | Conference Proceeding |
| fullrecord | <record><control><sourceid>hal_pasca</sourceid><recordid>TN_cdi_pascalfrancis_primary_17182938</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>oai_HAL_hal_00016863v1</sourcerecordid><originalsourceid>FETCH-LOGICAL-c332t-4eea8dcb589c03e1dc7695a13294a3517d860499339d5ec0675187911e9d0bd73</originalsourceid><addsrcrecordid>eNpNkMtOwzAQRc1LopSu-IFsWLAIeDJ-LquWUqQKJB5ry3VcCE3jyg4g_p6UosJqNPfcuZoZQs6AXgKl8gqAg5BaGWB7ZKClQs4oAlcM9kkPBECOyPTBjhUSC0YPSY8iLXItGR6Tk5TeKO2QLnpkPAqrtY1VCk0WFtnEVvV79CmzTZkN29a6Zco69ND1YfWjPjpb-3wSvc_ufPsZ4jKdkqOFrZMf_NY-eZ5cP42m-ez-5nY0nOUOsWhz5r1VpZtzpR1FD6WTQnMLWGhmkYMslaBMa0Rdcu-okByU1ABel3ReSuyTi23uq63NOlYrG79MsJWZDmdmo3VngVACP6Dznm-9a5u6jRfRNq5KuymQoAqN6i8zdah58dHMQ1gmA9RsXm7-vRy_AavCasc</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Comparison of Failures and Attacks on Random and Scale-Free Networks</title><source>Springer Books</source><creator>Guillaume, Jean-Loup ; Latapy, Matthieu ; Magnien, Clémence</creator><contributor>Higashino, Teruo</contributor><creatorcontrib>Guillaume, Jean-Loup ; Latapy, Matthieu ; Magnien, Clémence ; Higashino, Teruo</creatorcontrib><description>It appeared recently that some statistical properties of complex networks like the Internet, the World Wide Web or Peer-to-Peer systems have an important influence on their resilience to failures and attacks. In particular, scale-free networks (i.e. networks with power-law degree distribution) seem much more robust than random networks in case of failures, while they are more sensitive to attacks.
In this paper we deepen the study of the differences in the behavior of these two kinds of networks when facing failures or attacks. We moderate the general affirmation that scale-free networks are much more sensitive than random networks to attacks by showing that the number of links to remove in both cases is similar, and by showing that a slightly modified scenario for failures gives results similar to the ones for attacks. We also propose and analyze an efficient attack strategy against links.</description><identifier>ISSN: 0302-9743</identifier><identifier>ISBN: 9783540273240</identifier><identifier>ISBN: 3540273247</identifier><identifier>EISSN: 1611-3349</identifier><identifier>EISBN: 9783540315841</identifier><identifier>EISBN: 3540315845</identifier><identifier>DOI: 10.1007/11516798_14</identifier><language>eng</language><publisher>Berlin, Heidelberg: Springer Berlin Heidelberg</publisher><subject>Applied sciences ; Complex Networks ; Computer Science ; Computer science; control theory; systems ; Computer systems and distributed systems. User interface ; Exact sciences and technology ; Fault tolerence ; Internet ; Network Topology ; Networking and Internet Architecture ; Random Graphs ; Reliability ; Resilience ; Scale-Free Graphs ; Software</subject><ispartof>Lecture notes in computer science, 2005, p.186-196</ispartof><rights>Springer-Verlag Berlin Heidelberg 2005</rights><rights>2005 INIST-CNRS</rights><rights>Distributed under a Creative Commons Attribution 4.0 International License</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c332t-4eea8dcb589c03e1dc7695a13294a3517d860499339d5ec0675187911e9d0bd73</citedby><orcidid>0000-0002-0975-6109 ; 0000-0002-4615-1563</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/11516798_14$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/11516798_14$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>230,309,310,775,776,780,785,786,789,881,27902,38232,41418,42487</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=17182938$$DView record in Pascal Francis$$Hfree_for_read</backlink><backlink>$$Uhttps://hal.science/hal-00016863$$DView record in HAL$$Hfree_for_read</backlink></links><search><contributor>Higashino, Teruo</contributor><creatorcontrib>Guillaume, Jean-Loup</creatorcontrib><creatorcontrib>Latapy, Matthieu</creatorcontrib><creatorcontrib>Magnien, Clémence</creatorcontrib><title>Comparison of Failures and Attacks on Random and Scale-Free Networks</title><title>Lecture notes in computer science</title><description>It appeared recently that some statistical properties of complex networks like the Internet, the World Wide Web or Peer-to-Peer systems have an important influence on their resilience to failures and attacks. In particular, scale-free networks (i.e. networks with power-law degree distribution) seem much more robust than random networks in case of failures, while they are more sensitive to attacks.
In this paper we deepen the study of the differences in the behavior of these two kinds of networks when facing failures or attacks. We moderate the general affirmation that scale-free networks are much more sensitive than random networks to attacks by showing that the number of links to remove in both cases is similar, and by showing that a slightly modified scenario for failures gives results similar to the ones for attacks. We also propose and analyze an efficient attack strategy against links.</description><subject>Applied sciences</subject><subject>Complex Networks</subject><subject>Computer Science</subject><subject>Computer science; control theory; systems</subject><subject>Computer systems and distributed systems. User interface</subject><subject>Exact sciences and technology</subject><subject>Fault tolerence</subject><subject>Internet</subject><subject>Network Topology</subject><subject>Networking and Internet Architecture</subject><subject>Random Graphs</subject><subject>Reliability</subject><subject>Resilience</subject><subject>Scale-Free Graphs</subject><subject>Software</subject><issn>0302-9743</issn><issn>1611-3349</issn><isbn>9783540273240</isbn><isbn>3540273247</isbn><isbn>9783540315841</isbn><isbn>3540315845</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2005</creationdate><recordtype>conference_proceeding</recordtype><recordid>eNpNkMtOwzAQRc1LopSu-IFsWLAIeDJ-LquWUqQKJB5ry3VcCE3jyg4g_p6UosJqNPfcuZoZQs6AXgKl8gqAg5BaGWB7ZKClQs4oAlcM9kkPBECOyPTBjhUSC0YPSY8iLXItGR6Tk5TeKO2QLnpkPAqrtY1VCk0WFtnEVvV79CmzTZkN29a6Zco69ND1YfWjPjpb-3wSvc_ufPsZ4jKdkqOFrZMf_NY-eZ5cP42m-ez-5nY0nOUOsWhz5r1VpZtzpR1FD6WTQnMLWGhmkYMslaBMa0Rdcu-okByU1ABel3ReSuyTi23uq63NOlYrG79MsJWZDmdmo3VngVACP6Dznm-9a5u6jRfRNq5KuymQoAqN6i8zdah58dHMQ1gmA9RsXm7-vRy_AavCasc</recordid><startdate>20050101</startdate><enddate>20050101</enddate><creator>Guillaume, Jean-Loup</creator><creator>Latapy, Matthieu</creator><creator>Magnien, Clémence</creator><general>Springer Berlin Heidelberg</general><general>Springer</general><general>Springer-Verlag GmbH</general><scope>IQODW</scope><scope>1XC</scope><scope>VOOES</scope><orcidid>https://orcid.org/0000-0002-0975-6109</orcidid><orcidid>https://orcid.org/0000-0002-4615-1563</orcidid></search><sort><creationdate>20050101</creationdate><title>Comparison of Failures and Attacks on Random and Scale-Free Networks</title><author>Guillaume, Jean-Loup ; Latapy, Matthieu ; Magnien, Clémence</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c332t-4eea8dcb589c03e1dc7695a13294a3517d860499339d5ec0675187911e9d0bd73</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2005</creationdate><topic>Applied sciences</topic><topic>Complex Networks</topic><topic>Computer Science</topic><topic>Computer science; control theory; systems</topic><topic>Computer systems and distributed systems. User interface</topic><topic>Exact sciences and technology</topic><topic>Fault tolerence</topic><topic>Internet</topic><topic>Network Topology</topic><topic>Networking and Internet Architecture</topic><topic>Random Graphs</topic><topic>Reliability</topic><topic>Resilience</topic><topic>Scale-Free Graphs</topic><topic>Software</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Guillaume, Jean-Loup</creatorcontrib><creatorcontrib>Latapy, Matthieu</creatorcontrib><creatorcontrib>Magnien, Clémence</creatorcontrib><collection>Pascal-Francis</collection><collection>Hyper Article en Ligne (HAL)</collection><collection>Hyper Article en Ligne (HAL) (Open Access)</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Guillaume, Jean-Loup</au><au>Latapy, Matthieu</au><au>Magnien, Clémence</au><au>Higashino, Teruo</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Comparison of Failures and Attacks on Random and Scale-Free Networks</atitle><btitle>Lecture notes in computer science</btitle><date>2005-01-01</date><risdate>2005</risdate><spage>186</spage><epage>196</epage><pages>186-196</pages><issn>0302-9743</issn><eissn>1611-3349</eissn><isbn>9783540273240</isbn><isbn>3540273247</isbn><eisbn>9783540315841</eisbn><eisbn>3540315845</eisbn><abstract>It appeared recently that some statistical properties of complex networks like the Internet, the World Wide Web or Peer-to-Peer systems have an important influence on their resilience to failures and attacks. In particular, scale-free networks (i.e. networks with power-law degree distribution) seem much more robust than random networks in case of failures, while they are more sensitive to attacks.
In this paper we deepen the study of the differences in the behavior of these two kinds of networks when facing failures or attacks. We moderate the general affirmation that scale-free networks are much more sensitive than random networks to attacks by showing that the number of links to remove in both cases is similar, and by showing that a slightly modified scenario for failures gives results similar to the ones for attacks. We also propose and analyze an efficient attack strategy against links.</abstract><cop>Berlin, Heidelberg</cop><pub>Springer Berlin Heidelberg</pub><doi>10.1007/11516798_14</doi><tpages>11</tpages><orcidid>https://orcid.org/0000-0002-0975-6109</orcidid><orcidid>https://orcid.org/0000-0002-4615-1563</orcidid><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0302-9743 |
| ispartof | Lecture notes in computer science, 2005, p.186-196 |
| issn | 0302-9743 1611-3349 |
| language | eng |
| recordid | cdi_pascalfrancis_primary_17182938 |
| source | Springer Books |
| subjects | Applied sciences Complex Networks Computer Science Computer science control theory systems Computer systems and distributed systems. User interface Exact sciences and technology Fault tolerence Internet Network Topology Networking and Internet Architecture Random Graphs Reliability Resilience Scale-Free Graphs Software |
| title | Comparison of Failures and Attacks on Random and Scale-Free Networks |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-15T20%3A43%3A52IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-hal_pasca&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Comparison%20of%20Failures%20and%20Attacks%20on%20Random%20and%20Scale-Free%20Networks&rft.btitle=Lecture%20notes%20in%20computer%20science&rft.au=Guillaume,%20Jean-Loup&rft.date=2005-01-01&rft.spage=186&rft.epage=196&rft.pages=186-196&rft.issn=0302-9743&rft.eissn=1611-3349&rft.isbn=9783540273240&rft.isbn_list=3540273247&rft_id=info:doi/10.1007/11516798_14&rft_dat=%3Chal_pasca%3Eoai_HAL_hal_00016863v1%3C/hal_pasca%3E%3Curl%3E%3C/url%3E&rft.eisbn=9783540315841&rft.eisbn_list=3540315845&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |