Toward Optimal Network Fault Correction via End-to-End Inference
We consider an end-to-end approach of inferring network faults that manifest in multiple protocol layers, with an optimization goal of minimizing the expected cost of correcting all faulty nodes. Instead of first checking the most likely faulty nodes as in conventional fault localization problems, w...
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 | 1351 |
|---|---|
| container_issue | |
| container_start_page | 1343 |
| container_title | |
| container_volume | |
| creator | Lee, P.P.C. Misra, V. Rubenstein, D. |
| description | We consider an end-to-end approach of inferring network faults that manifest in multiple protocol layers, with an optimization goal of minimizing the expected cost of correcting all faulty nodes. Instead of first checking the most likely faulty nodes as in conventional fault localization problems, we prove that an optimal strategy should start with checking one of the candidate nodes, which are identified based on a potential function that we develop. We propose several efficient heuristics for inferring the best node to be checked in large-scale networks. By extensive simulation, we show that we can infer the best node in at least 95%, and that checking first the candidate nodes rather than the most likely faulty nodes can decrease the checking cost of correcting all faulty nodes by up to 25%. |
| doi_str_mv | 10.1109/INFCOM.2007.159 |
| format | Conference Proceeding |
| fullrecord | <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_4215741</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>4215741</ieee_id><sourcerecordid>4215741</sourcerecordid><originalsourceid>FETCH-LOGICAL-i175t-7fe120559c6e0f126849ffdae14e60b3b464ca18e52bf47159596832b5948f1d3</originalsourceid><addsrcrecordid>eNotj7tOwzAUQC0eEqF0ZmDxD7j4OtevDRS1EKm0S5HYKie5lgIlqZxAxd8TCaazHZ3D2C3IBYD09-VmVWxfFkpKuwDtz1imDILwzuI5uwZUiCDR-guWSYu5AGPerth8GN6llOCNc8Zn7GHXn0Jq-PY4tp_hwDc0nvr0wVfh6zDyok-J6rHtO_7dBr7sGjH2YgIvu0iJuppu2GUMh4Hm_5yx19VyVzyL9fapLB7XogWrR2EjgZJa-9qQjKCMQx9jEwiQjKzyCg3WARxpVUW005CeEnNVaY8uQpPP2N2ftyWi_TFNtelnjwq0Rch_AUq0Shg</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Toward Optimal Network Fault Correction via End-to-End Inference</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Lee, P.P.C. ; Misra, V. ; Rubenstein, D.</creator><creatorcontrib>Lee, P.P.C. ; Misra, V. ; Rubenstein, D.</creatorcontrib><description>We consider an end-to-end approach of inferring network faults that manifest in multiple protocol layers, with an optimization goal of minimizing the expected cost of correcting all faulty nodes. Instead of first checking the most likely faulty nodes as in conventional fault localization problems, we prove that an optimal strategy should start with checking one of the candidate nodes, which are identified based on a potential function that we develop. We propose several efficient heuristics for inferring the best node to be checked in large-scale networks. By extensive simulation, we show that we can infer the best node in at least 95%, and that checking first the candidate nodes rather than the most likely faulty nodes can decrease the checking cost of correcting all faulty nodes by up to 25%.</description><identifier>ISSN: 0743-166X</identifier><identifier>ISBN: 1424410479</identifier><identifier>ISBN: 9781424410477</identifier><identifier>EISSN: 2641-9874</identifier><identifier>DOI: 10.1109/INFCOM.2007.159</identifier><language>eng</language><publisher>IEEE</publisher><subject>Communications Society ; Cost function ; Fault diagnosis ; Large-scale systems ; Monitoring ; Network topology ; Peer to peer computing ; Protocols ; Routing ; Spine</subject><ispartof>IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications, 2007, p.1343-1351</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/4215741$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,776,780,785,786,2052,27902,54895</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/4215741$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Lee, P.P.C.</creatorcontrib><creatorcontrib>Misra, V.</creatorcontrib><creatorcontrib>Rubenstein, D.</creatorcontrib><title>Toward Optimal Network Fault Correction via End-to-End Inference</title><title>IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications</title><addtitle>INFCOM</addtitle><description>We consider an end-to-end approach of inferring network faults that manifest in multiple protocol layers, with an optimization goal of minimizing the expected cost of correcting all faulty nodes. Instead of first checking the most likely faulty nodes as in conventional fault localization problems, we prove that an optimal strategy should start with checking one of the candidate nodes, which are identified based on a potential function that we develop. We propose several efficient heuristics for inferring the best node to be checked in large-scale networks. By extensive simulation, we show that we can infer the best node in at least 95%, and that checking first the candidate nodes rather than the most likely faulty nodes can decrease the checking cost of correcting all faulty nodes by up to 25%.</description><subject>Communications Society</subject><subject>Cost function</subject><subject>Fault diagnosis</subject><subject>Large-scale systems</subject><subject>Monitoring</subject><subject>Network topology</subject><subject>Peer to peer computing</subject><subject>Protocols</subject><subject>Routing</subject><subject>Spine</subject><issn>0743-166X</issn><issn>2641-9874</issn><isbn>1424410479</isbn><isbn>9781424410477</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2007</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNotj7tOwzAUQC0eEqF0ZmDxD7j4OtevDRS1EKm0S5HYKie5lgIlqZxAxd8TCaazHZ3D2C3IBYD09-VmVWxfFkpKuwDtz1imDILwzuI5uwZUiCDR-guWSYu5AGPerth8GN6llOCNc8Zn7GHXn0Jq-PY4tp_hwDc0nvr0wVfh6zDyok-J6rHtO_7dBr7sGjH2YgIvu0iJuppu2GUMh4Hm_5yx19VyVzyL9fapLB7XogWrR2EjgZJa-9qQjKCMQx9jEwiQjKzyCg3WARxpVUW005CeEnNVaY8uQpPP2N2ftyWi_TFNtelnjwq0Rch_AUq0Shg</recordid><startdate>200705</startdate><enddate>200705</enddate><creator>Lee, P.P.C.</creator><creator>Misra, V.</creator><creator>Rubenstein, D.</creator><general>IEEE</general><scope>6IE</scope><scope>6IH</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIO</scope></search><sort><creationdate>200705</creationdate><title>Toward Optimal Network Fault Correction via End-to-End Inference</title><author>Lee, P.P.C. ; Misra, V. ; Rubenstein, D.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i175t-7fe120559c6e0f126849ffdae14e60b3b464ca18e52bf47159596832b5948f1d3</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2007</creationdate><topic>Communications Society</topic><topic>Cost function</topic><topic>Fault diagnosis</topic><topic>Large-scale systems</topic><topic>Monitoring</topic><topic>Network topology</topic><topic>Peer to peer computing</topic><topic>Protocols</topic><topic>Routing</topic><topic>Spine</topic><toplevel>online_resources</toplevel><creatorcontrib>Lee, P.P.C.</creatorcontrib><creatorcontrib>Misra, V.</creatorcontrib><creatorcontrib>Rubenstein, D.</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan (POP) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Electronic Library (IEL)</collection><collection>IEEE Proceedings Order Plans (POP) 1998-present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Lee, P.P.C.</au><au>Misra, V.</au><au>Rubenstein, D.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Toward Optimal Network Fault Correction via End-to-End Inference</atitle><btitle>IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications</btitle><stitle>INFCOM</stitle><date>2007-05</date><risdate>2007</risdate><spage>1343</spage><epage>1351</epage><pages>1343-1351</pages><issn>0743-166X</issn><eissn>2641-9874</eissn><isbn>1424410479</isbn><isbn>9781424410477</isbn><abstract>We consider an end-to-end approach of inferring network faults that manifest in multiple protocol layers, with an optimization goal of minimizing the expected cost of correcting all faulty nodes. Instead of first checking the most likely faulty nodes as in conventional fault localization problems, we prove that an optimal strategy should start with checking one of the candidate nodes, which are identified based on a potential function that we develop. We propose several efficient heuristics for inferring the best node to be checked in large-scale networks. By extensive simulation, we show that we can infer the best node in at least 95%, and that checking first the candidate nodes rather than the most likely faulty nodes can decrease the checking cost of correcting all faulty nodes by up to 25%.</abstract><pub>IEEE</pub><doi>10.1109/INFCOM.2007.159</doi><tpages>9</tpages></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 0743-166X |
| ispartof | IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications, 2007, p.1343-1351 |
| issn | 0743-166X 2641-9874 |
| language | eng |
| recordid | cdi_ieee_primary_4215741 |
| source | IEEE Electronic Library (IEL) Conference Proceedings |
| subjects | Communications Society Cost function Fault diagnosis Large-scale systems Monitoring Network topology Peer to peer computing Protocols Routing Spine |
| title | Toward Optimal Network Fault Correction via End-to-End Inference |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-03T13%3A25%3A20IST&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=Toward%20Optimal%20Network%20Fault%20Correction%20via%20End-to-End%20Inference&rft.btitle=IEEE%20INFOCOM%202007%20-%2026th%20IEEE%20International%20Conference%20on%20Computer%20Communications&rft.au=Lee,%20P.P.C.&rft.date=2007-05&rft.spage=1343&rft.epage=1351&rft.pages=1343-1351&rft.issn=0743-166X&rft.eissn=2641-9874&rft.isbn=1424410479&rft.isbn_list=9781424410477&rft_id=info:doi/10.1109/INFCOM.2007.159&rft_dat=%3Cieee_6IE%3E4215741%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=4215741&rfr_iscdi=true |