Probe generation for active probing
Summary Active probing is a widely adopted approach for developing effective solutions for network monitoring and diagnosing. However, the use of probing techniques incurs costs in terms of additional network traffic. Furthermore, probing stations are required to be configured and maintained in the...
Gespeichert in:
Veröffentlicht in: | International journal of network management 2018-07, Vol.28 (4), p.n/a |
---|---|
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 | n/a |
---|---|
container_issue | 4 |
container_start_page | |
container_title | International journal of network management |
container_volume | 28 |
creator | Dusia, A. Sethi, A. S. |
description | Summary
Active probing is a widely adopted approach for developing effective solutions for network monitoring and diagnosing. However, the use of probing techniques incurs costs in terms of additional network traffic. Furthermore, probing stations are required to be configured and maintained in the network for sending out probes. The set of probes used for fault detection and/or diagnosis (called the target probe set) is selected by a probe selection algorithm from a larger set called the candidate probe set. Most of the existing techniques for selecting the target probe set assume that the candidate probe set will preexist and the set is determined by the configured routing model in the network. In this paper, we address the problem of generating an expanded candidate probe set, which results in the selection of a more efficient target probe set. We propose the use of heuristics and network partitioning strategies for generating the candidate probe set. For evaluating our approach, we perform experiments to generate candidate probe sets for the networks of several types and sizes. The candidate probe sets are used by the existing probe selection algorithms for selecting target probe sets for fault detection and localization. Our results demonstrate that the target probe set selected from the candidate probe set generated using our approach has a reduced cost of monitoring the network.
Active probing is a widely adopted approach for developing effective solutions for network monitoring and diagnosing. The set of probes used for fault detection and/or diagnosis (called the target probe set) is selected by a probe selection algorithm from a larger set called the candidate probe set. In this paper, we address the problem of generating an expanded candidate probe set, which results in the selection of a more efficient target probe set. We propose the use of heuristics and network partitioning strategies for computing the candidate probe set. Our simulation results illustrate a reduction in the cost of monitoring the networks with the use of our proposed techniques. |
doi_str_mv | 10.1002/nem.2021 |
format | Article |
fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_2068379294</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2068379294</sourcerecordid><originalsourceid>FETCH-LOGICAL-c2931-bf955def69055052618abfa8fbc8b347a2a0df6d1febeba685fd17bb2b8088f73</originalsourceid><addsrcrecordid>eNp10E1LAzEQBuAgCtYq-BMWevGSOpPdbJKjlPoB9eOg55DsJmVLu1uTrdJ_b9b16mkG5mFeeAm5RpgjALtt3W7OgOEJmSAoRREVnA4751RgIc_JRYwbSBSVmJDZW-isy9audcH0TddmvguZqfrmy2X7dGva9SU582Yb3dXfnJKP--X74pGuXh-eFncrWjGVI7VecV47X6qUBZyVKI31RnpbSZsXwjADtS9r9M46a0rJfY3CWmYlSOlFPiWz8W_K_Ty42OtNdwhtitQMSpkLxVSR1M2oqtDFGJzX-9DsTDhqBD1UoFMFeqggUTrS72brjv86_bJ8_vU_Ws5bsg</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2068379294</pqid></control><display><type>article</type><title>Probe generation for active probing</title><source>Wiley Online Library - AutoHoldings Journals</source><creator>Dusia, A. ; Sethi, A. S.</creator><creatorcontrib>Dusia, A. ; Sethi, A. S.</creatorcontrib><description>Summary
Active probing is a widely adopted approach for developing effective solutions for network monitoring and diagnosing. However, the use of probing techniques incurs costs in terms of additional network traffic. Furthermore, probing stations are required to be configured and maintained in the network for sending out probes. The set of probes used for fault detection and/or diagnosis (called the target probe set) is selected by a probe selection algorithm from a larger set called the candidate probe set. Most of the existing techniques for selecting the target probe set assume that the candidate probe set will preexist and the set is determined by the configured routing model in the network. In this paper, we address the problem of generating an expanded candidate probe set, which results in the selection of a more efficient target probe set. We propose the use of heuristics and network partitioning strategies for generating the candidate probe set. For evaluating our approach, we perform experiments to generate candidate probe sets for the networks of several types and sizes. The candidate probe sets are used by the existing probe selection algorithms for selecting target probe sets for fault detection and localization. Our results demonstrate that the target probe set selected from the candidate probe set generated using our approach has a reduced cost of monitoring the network.
Active probing is a widely adopted approach for developing effective solutions for network monitoring and diagnosing. The set of probes used for fault detection and/or diagnosis (called the target probe set) is selected by a probe selection algorithm from a larger set called the candidate probe set. In this paper, we address the problem of generating an expanded candidate probe set, which results in the selection of a more efficient target probe set. We propose the use of heuristics and network partitioning strategies for computing the candidate probe set. Our simulation results illustrate a reduction in the cost of monitoring the networks with the use of our proposed techniques.</description><identifier>ISSN: 1055-7148</identifier><identifier>EISSN: 1099-1190</identifier><identifier>DOI: 10.1002/nem.2021</identifier><language>eng</language><publisher>Chichester: Wiley Subscription Services, Inc</publisher><subject>Algorithms ; Communications traffic ; Fault detection ; Monitoring</subject><ispartof>International journal of network management, 2018-07, Vol.28 (4), p.n/a</ispartof><rights>Copyright © 2018 John Wiley & Sons, Ltd.</rights><rights>2018 John Wiley & Sons, Ltd.</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c2931-bf955def69055052618abfa8fbc8b347a2a0df6d1febeba685fd17bb2b8088f73</citedby><cites>FETCH-LOGICAL-c2931-bf955def69055052618abfa8fbc8b347a2a0df6d1febeba685fd17bb2b8088f73</cites><orcidid>0000-0003-1310-8523</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://onlinelibrary.wiley.com/doi/pdf/10.1002%2Fnem.2021$$EPDF$$P50$$Gwiley$$H</linktopdf><linktohtml>$$Uhttps://onlinelibrary.wiley.com/doi/full/10.1002%2Fnem.2021$$EHTML$$P50$$Gwiley$$H</linktohtml><link.rule.ids>314,776,780,1411,27901,27902,45550,45551</link.rule.ids></links><search><creatorcontrib>Dusia, A.</creatorcontrib><creatorcontrib>Sethi, A. S.</creatorcontrib><title>Probe generation for active probing</title><title>International journal of network management</title><description>Summary
Active probing is a widely adopted approach for developing effective solutions for network monitoring and diagnosing. However, the use of probing techniques incurs costs in terms of additional network traffic. Furthermore, probing stations are required to be configured and maintained in the network for sending out probes. The set of probes used for fault detection and/or diagnosis (called the target probe set) is selected by a probe selection algorithm from a larger set called the candidate probe set. Most of the existing techniques for selecting the target probe set assume that the candidate probe set will preexist and the set is determined by the configured routing model in the network. In this paper, we address the problem of generating an expanded candidate probe set, which results in the selection of a more efficient target probe set. We propose the use of heuristics and network partitioning strategies for generating the candidate probe set. For evaluating our approach, we perform experiments to generate candidate probe sets for the networks of several types and sizes. The candidate probe sets are used by the existing probe selection algorithms for selecting target probe sets for fault detection and localization. Our results demonstrate that the target probe set selected from the candidate probe set generated using our approach has a reduced cost of monitoring the network.
Active probing is a widely adopted approach for developing effective solutions for network monitoring and diagnosing. The set of probes used for fault detection and/or diagnosis (called the target probe set) is selected by a probe selection algorithm from a larger set called the candidate probe set. In this paper, we address the problem of generating an expanded candidate probe set, which results in the selection of a more efficient target probe set. We propose the use of heuristics and network partitioning strategies for computing the candidate probe set. Our simulation results illustrate a reduction in the cost of monitoring the networks with the use of our proposed techniques.</description><subject>Algorithms</subject><subject>Communications traffic</subject><subject>Fault detection</subject><subject>Monitoring</subject><issn>1055-7148</issn><issn>1099-1190</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2018</creationdate><recordtype>article</recordtype><recordid>eNp10E1LAzEQBuAgCtYq-BMWevGSOpPdbJKjlPoB9eOg55DsJmVLu1uTrdJ_b9b16mkG5mFeeAm5RpgjALtt3W7OgOEJmSAoRREVnA4751RgIc_JRYwbSBSVmJDZW-isy9audcH0TddmvguZqfrmy2X7dGva9SU582Yb3dXfnJKP--X74pGuXh-eFncrWjGVI7VecV47X6qUBZyVKI31RnpbSZsXwjADtS9r9M46a0rJfY3CWmYlSOlFPiWz8W_K_Ty42OtNdwhtitQMSpkLxVSR1M2oqtDFGJzX-9DsTDhqBD1UoFMFeqggUTrS72brjv86_bJ8_vU_Ws5bsg</recordid><startdate>201807</startdate><enddate>201807</enddate><creator>Dusia, A.</creator><creator>Sethi, A. S.</creator><general>Wiley Subscription Services, Inc</general><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7SP</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><orcidid>https://orcid.org/0000-0003-1310-8523</orcidid></search><sort><creationdate>201807</creationdate><title>Probe generation for active probing</title><author>Dusia, A. ; Sethi, A. S.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c2931-bf955def69055052618abfa8fbc8b347a2a0df6d1febeba685fd17bb2b8088f73</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2018</creationdate><topic>Algorithms</topic><topic>Communications traffic</topic><topic>Fault detection</topic><topic>Monitoring</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Dusia, A.</creatorcontrib><creatorcontrib>Sethi, A. S.</creatorcontrib><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Electronics & Communications Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>International journal of network management</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Dusia, A.</au><au>Sethi, A. S.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Probe generation for active probing</atitle><jtitle>International journal of network management</jtitle><date>2018-07</date><risdate>2018</risdate><volume>28</volume><issue>4</issue><epage>n/a</epage><issn>1055-7148</issn><eissn>1099-1190</eissn><abstract>Summary
Active probing is a widely adopted approach for developing effective solutions for network monitoring and diagnosing. However, the use of probing techniques incurs costs in terms of additional network traffic. Furthermore, probing stations are required to be configured and maintained in the network for sending out probes. The set of probes used for fault detection and/or diagnosis (called the target probe set) is selected by a probe selection algorithm from a larger set called the candidate probe set. Most of the existing techniques for selecting the target probe set assume that the candidate probe set will preexist and the set is determined by the configured routing model in the network. In this paper, we address the problem of generating an expanded candidate probe set, which results in the selection of a more efficient target probe set. We propose the use of heuristics and network partitioning strategies for generating the candidate probe set. For evaluating our approach, we perform experiments to generate candidate probe sets for the networks of several types and sizes. The candidate probe sets are used by the existing probe selection algorithms for selecting target probe sets for fault detection and localization. Our results demonstrate that the target probe set selected from the candidate probe set generated using our approach has a reduced cost of monitoring the network.
Active probing is a widely adopted approach for developing effective solutions for network monitoring and diagnosing. The set of probes used for fault detection and/or diagnosis (called the target probe set) is selected by a probe selection algorithm from a larger set called the candidate probe set. In this paper, we address the problem of generating an expanded candidate probe set, which results in the selection of a more efficient target probe set. We propose the use of heuristics and network partitioning strategies for computing the candidate probe set. Our simulation results illustrate a reduction in the cost of monitoring the networks with the use of our proposed techniques.</abstract><cop>Chichester</cop><pub>Wiley Subscription Services, Inc</pub><doi>10.1002/nem.2021</doi><tpages>20</tpages><orcidid>https://orcid.org/0000-0003-1310-8523</orcidid></addata></record> |
fulltext | fulltext |
identifier | ISSN: 1055-7148 |
ispartof | International journal of network management, 2018-07, Vol.28 (4), p.n/a |
issn | 1055-7148 1099-1190 |
language | eng |
recordid | cdi_proquest_journals_2068379294 |
source | Wiley Online Library - AutoHoldings Journals |
subjects | Algorithms Communications traffic Fault detection Monitoring |
title | Probe generation for active probing |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-29T07%3A36%3A16IST&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=Probe%20generation%20for%20active%20probing&rft.jtitle=International%20journal%20of%20network%20management&rft.au=Dusia,%20A.&rft.date=2018-07&rft.volume=28&rft.issue=4&rft.epage=n/a&rft.issn=1055-7148&rft.eissn=1099-1190&rft_id=info:doi/10.1002/nem.2021&rft_dat=%3Cproquest_cross%3E2068379294%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=2068379294&rft_id=info:pmid/&rfr_iscdi=true |