Easily repairable networks

Easily repairable networks

We introduce a simple class of distribution networks which withstand damage by being repairable instead of redundant. We prove a lower bound for the expected cost of repair, and show that for networks on the square and triangular lattice, this bound is achievable and results in a network with exactl...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:arXiv.org 2014-05
Hauptverfasser: Farr, Robert S, Harer, John L, Fink, Thomas M A
Format: Artikel
Sprache:eng
Schlagworte:
Cybersecurity
Distribution management
Lower bounds
Maintenance
Networks
Repair
Structural hierarchy
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue
container_start_page
container_title arXiv.org
container_volume
creator Farr, Robert S
Harer, John L
Fink, Thomas M A
description We introduce a simple class of distribution networks which withstand damage by being repairable instead of redundant. We prove a lower bound for the expected cost of repair, and show that for networks on the square and triangular lattice, this bound is achievable and results in a network with exactly three levels of structural hierarchy. We extend our results to networks subject to repeated attacks, in which the repairs themselves must be repairable. We find that, in exchange for a modest increase in repair cost, such networks are able to withstand any number of attacks.
format Article
fullrecord <record><control><sourceid>proquest</sourceid><recordid>TN_cdi_proquest_journals_2084175120</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2084175120</sourcerecordid><originalsourceid>FETCH-proquest_journals_20841751203</originalsourceid><addsrcrecordid>eNpjYuA0MjY21LUwMTLiYOAtLs4yMDAwMjM3MjU15mSQck0szsypVChKLUjMLEpMyklVyEstKc8vyi7mYWBNS8wpTuWF0twMym6uIc4eugVF-YWlqcUl8Vn5pUV5QKl4IwMLE0NzU0MjA2PiVAEA4skrFg</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2084175120</pqid></control><display><type>article</type><title>Easily repairable networks</title><source>Free E- Journals</source><creator>Farr, Robert S ; Harer, John L ; Fink, Thomas M A</creator><creatorcontrib>Farr, Robert S ; Harer, John L ; Fink, Thomas M A</creatorcontrib><description>We introduce a simple class of distribution networks which withstand damage by being repairable instead of redundant. We prove a lower bound for the expected cost of repair, and show that for networks on the square and triangular lattice, this bound is achievable and results in a network with exactly three levels of structural hierarchy. We extend our results to networks subject to repeated attacks, in which the repairs themselves must be repairable. We find that, in exchange for a modest increase in repair cost, such networks are able to withstand any number of attacks.</description><identifier>EISSN: 2331-8422</identifier><language>eng</language><publisher>Ithaca: Cornell University Library, arXiv.org</publisher><subject>Cybersecurity ; Distribution management ; Lower bounds ; Maintenance ; Networks ; Repair ; Structural hierarchy</subject><ispartof>arXiv.org, 2014-05</ispartof><rights>2014. This work is published under http://arxiv.org/licenses/nonexclusive-distrib/1.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>780,784</link.rule.ids></links><search><creatorcontrib>Farr, Robert S</creatorcontrib><creatorcontrib>Harer, John L</creatorcontrib><creatorcontrib>Fink, Thomas M A</creatorcontrib><title>Easily repairable networks</title><title>arXiv.org</title><description>We introduce a simple class of distribution networks which withstand damage by being repairable instead of redundant. We prove a lower bound for the expected cost of repair, and show that for networks on the square and triangular lattice, this bound is achievable and results in a network with exactly three levels of structural hierarchy. We extend our results to networks subject to repeated attacks, in which the repairs themselves must be repairable. We find that, in exchange for a modest increase in repair cost, such networks are able to withstand any number of attacks.</description><subject>Cybersecurity</subject><subject>Distribution management</subject><subject>Lower bounds</subject><subject>Maintenance</subject><subject>Networks</subject><subject>Repair</subject><subject>Structural hierarchy</subject><issn>2331-8422</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2014</creationdate><recordtype>article</recordtype><sourceid>ABUWG</sourceid><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><recordid>eNpjYuA0MjY21LUwMTLiYOAtLs4yMDAwMjM3MjU15mSQck0szsypVChKLUjMLEpMyklVyEstKc8vyi7mYWBNS8wpTuWF0twMym6uIc4eugVF-YWlqcUl8Vn5pUV5QKl4IwMLE0NzU0MjA2PiVAEA4skrFg</recordid><startdate>20140509</startdate><enddate>20140509</enddate><creator>Farr, Robert S</creator><creator>Harer, John L</creator><creator>Fink, Thomas M A</creator><general>Cornell University Library, arXiv.org</general><scope>8FE</scope><scope>8FG</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>HCIFZ</scope><scope>L6V</scope><scope>M7S</scope><scope>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PTHSS</scope></search><sort><creationdate>20140509</creationdate><title>Easily repairable networks</title><author>Farr, Robert S ; Harer, John L ; Fink, Thomas M A</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-proquest_journals_20841751203</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2014</creationdate><topic>Cybersecurity</topic><topic>Distribution management</topic><topic>Lower bounds</topic><topic>Maintenance</topic><topic>Networks</topic><topic>Repair</topic><topic>Structural hierarchy</topic><toplevel>online_resources</toplevel><creatorcontrib>Farr, Robert S</creatorcontrib><creatorcontrib>Harer, John L</creatorcontrib><creatorcontrib>Fink, Thomas M A</creatorcontrib><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Materials Science &amp; Engineering Collection</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</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>SciTech Premium Collection</collection><collection>ProQuest Engineering Collection</collection><collection>Engineering Database</collection><collection>Publicly Available Content Database</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>Engineering Collection</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Farr, Robert S</au><au>Harer, John L</au><au>Fink, Thomas M A</au><format>book</format><genre>document</genre><ristype>GEN</ristype><atitle>Easily repairable networks</atitle><jtitle>arXiv.org</jtitle><date>2014-05-09</date><risdate>2014</risdate><eissn>2331-8422</eissn><abstract>We introduce a simple class of distribution networks which withstand damage by being repairable instead of redundant. We prove a lower bound for the expected cost of repair, and show that for networks on the square and triangular lattice, this bound is achievable and results in a network with exactly three levels of structural hierarchy. We extend our results to networks subject to repeated attacks, in which the repairs themselves must be repairable. We find that, in exchange for a modest increase in repair cost, such networks are able to withstand any number of attacks.</abstract><cop>Ithaca</cop><pub>Cornell University Library, arXiv.org</pub><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier EISSN: 2331-8422
ispartof arXiv.org, 2014-05
issn 2331-8422
language eng
recordid cdi_proquest_journals_2084175120
source Free E- Journals
subjects Cybersecurity
Distribution management
Lower bounds
Maintenance
Networks
Repair
Structural hierarchy
title Easily repairable networks
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-19T13%3A43%3A29IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=document&rft.atitle=Easily%20repairable%20networks&rft.jtitle=arXiv.org&rft.au=Farr,%20Robert%20S&rft.date=2014-05-09&rft.eissn=2331-8422&rft_id=info:doi/&rft_dat=%3Cproquest%3E2084175120%3C/proquest%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2084175120&rft_id=info:pmid/&rfr_iscdi=true