skip to main content
10.1145/2465529.2465765acmconferencesArticle/Chapter ViewAbstractPublication PagesmetricsConference Proceedingsconference-collections
research-article

The design space of probing algorithms for network-performance measurement

Published: 17 June 2013 Publication History

Abstract

We present a framework for the design and analysis of probing methods to monitor network performance, an important technique for collecting measurements in tasks such as fault detection. We use this framework to study the interaction among numerous, possibly conflicting, optimization goals in the design of a probing algorithm. We present a rigorous definition of a probing-algorithm design problem that can apply broadly to network-measurement scenarios. We also present several metrics relevant to the analysis of probing algorithms, including probing frequency and network coverage, communication and computational overhead, and the amount of algorithm state required. We show inherent tradeoffs among optimization goals and give hardness results for achieving some combinations of optimization goals. We also consider the possibility of developing approximation algorithms for achieving some of the goals and describe a randomized approach as an alternative, evaluating it using our framework. Our work aids future development of low-overhead probing techniques and introduces principles from IP-based networking to theoretically grounded approaches for concurrent path-selection problems.

References

[1]
G. Agnarsson and M. M. Halldórsson. Strong colorings of hypergraphs. In Proc. Approximation and Online Algorithms (WAOA'04), pages 253--266, Bergen, Norway, Sept. 2004. Springer-Verlag LNCS 3351.
[2]
P. Barford, A. Bestavros, J. Byers, and M. Crovella. On the marginal utility of network topology measurements. In Proc. ACM IMW'01, pages 5--17, Nov. 2001.
[3]
P. Barford, N. Duffield, A. Ron, and J. Sommers. Network performance anomaly detection and localization. In Proc. IEEE INFOCOM 2009, pages 1377--1385, Apr. 2009.
[4]
V. Batagelj and U. Brandes. Efficient generation of large random networks. Phys. Rev. E, 71(3):1--5, 2005.
[5]
Y. Bejerano and R. Rastogi. Robust monitoring of link delays and faults in IP networks. IEEE/ACM Trans. Net., 15(5):1092--1103, Oct. 2006.
[6]
P. Berenbrink and T. Sauerwald. The weighted coupon collector's problem and applications. In Proc. COCOON'09, pages 449--458, July 2009.
[7]
L. Breslau, I. Diakonikolas, N. G. Duffield, Y. Gu, M. Hajiaghayi, D. S. Johnson, H. J. Karloff, M. G. C. Resende, and S. Sen. Disjoint-path facility location: Theory and practice. In Proc. SIAM ALENEX'11, pages 60--74, Jan. 2011.
[8]
M. Coates, A. Hero, R. Nowak, and B. Yu. Internet tomography. IEEE Sig. Proc. Mag., 19(3):47--65, May 2002.
[9]
A. Dhamdhere, R. Teixeira, C. Dovrolis, and C. Diot. NetDiagnoser: Troubleshooting network unreachabilities using end-to-end probes and routing data. In Proc. ACM CoNEXT'07, Dec. 2007.
[10]
N. Duffield. Network tomography of binary network performance characteristics. IEEE Trans. Inf. Theory, 52(12):5373--5388, Dec. 2006.
[11]
T. Erlebach. Approximation algorithms for edge-disjoint paths and unsplittable flow. In E. Bampis, K. Jansen, and C. Kenyon, editors, Efficient Approximation and Online Algorithms, pages 97--134. Springer-Verlag, 2006.
[12]
T. G. Griffin, F. B. Shepherd, and G. Wilfong. The stable paths problem and interdomain routing. IEEE/ACM Trans. Net., 10(2):232--243, Apr. 2002.
[13]
A. A. Hagberg, D. A. Schult, and P. J. Swart. Exploring network structure, dynamics, and function using NetworkX. In Proceedings of the 7th Python in Science Conference (SciPy2008), pages 11--15, Pasadena, CA USA, Aug. 2008.
[14]
I. Holyer. The NP-completeness of edge-coloring. SIAM J. Comput., 10(4):718--720, 1981.
[15]
S. Khot. Hardness results for approximate hypergraph coloring. In Proc. ACM STOC'02, May 2002.
[16]
S. Knight, H. X. Nguyen, N. Falkner, R. Bowden, and M. Roughan. The internet topology zoo. IEEE JSAC, 29(9):1765--1775, Oct. 2011.
[17]
R. Motwani and P. Raghavan. Randomized Algorithms, Sec. 3.6.1, pages 57--59. Cambridge Univ. Press, Aug. 1995.
[18]
H. X. Nguyen, R. Teixeira, P. Thiran, and C. Diot. Minimizing probing cost for detecting interface failures: Algorithms and scalability analysis. In Proc. IEEE INFOCOM 2009, pages 1386--1394, Apr. 2009.
[19]
O. Parekh and D. Segev. Path hitting in acyclic graphs. Algorithmica, 52(4):466--486, Dec. 2008.
[20]
P. Singh, M. Lee, S. Kumar, and R. R. Kompella. Enabling flow-level latency measurements across routers in data centers. In Proc. USENIX Hot-ICE'11, Mar. 2011.
[21]
P. Slavík. A tight analysis of the greedy algorithm for set cover. In Proc. ACM STOC'96, pages 435--441, May 1996.
[22]
J. Sommers, P. Barford, N. Duffield, and A. Ron. Multiobjective monitoring for SLA compliance. IEEE/ACM Trans. Net., 18(2):652--665, Apr. 2010.
[23]
H. H. Song, L. Qiu, and Y. Zhang. NetQuest: A flexible framework for large-scale network measurement. IEEE/ACM Trans. Net., 17(1):106--119, Feb. 2009.

Cited By

View all
  • (2021)Background of Network Behavior AnalysisNetwork Behavior Analysis10.1007/978-981-16-8325-1_2(7-19)Online publication date: 16-Dec-2021
  • (2020)Randomized Security Patrolling for Link Flooding Attack DetectionIEEE Transactions on Dependable and Secure Computing10.1109/TDSC.2019.289237017:4(795-812)Online publication date: 1-Jul-2020
  • (2020)Traffic Dynamics-Aware Probe Selection for Fault Detection in NetworksJournal of Network and Systems Management10.1007/s10922-020-09514-3Online publication date: 6-Feb-2020
  • Show More Cited By

Index Terms

  1. The design space of probing algorithms for network-performance measurement

        Recommendations

        Comments

        Information & Contributors

        Information

        Published In

        cover image ACM Conferences
        SIGMETRICS '13: Proceedings of the ACM SIGMETRICS/international conference on Measurement and modeling of computer systems
        June 2013
        406 pages
        ISBN:9781450319003
        DOI:10.1145/2465529
        • cover image ACM SIGMETRICS Performance Evaluation Review
          ACM SIGMETRICS Performance Evaluation Review  Volume 41, Issue 1
          Performance evaluation review
          June 2013
          385 pages
          ISSN:0163-5999
          DOI:10.1145/2494232
          Issue’s Table of Contents
        Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

        Sponsors

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        Published: 17 June 2013

        Permissions

        Request permissions for this article.

        Check for updates

        Author Tags

        1. coupon-collector's problem
        2. design-space tradeoffs
        3. hardness results
        4. network-performance analysis
        5. probing algorithms
        6. probing metrics and complexity measures
        7. randomized probing

        Qualifiers

        • Research-article

        Conference

        SIGMETRICS '13
        Sponsor:

        Acceptance Rates

        SIGMETRICS '13 Paper Acceptance Rate 54 of 196 submissions, 28%;
        Overall Acceptance Rate 459 of 2,691 submissions, 17%

        Contributors

        Other Metrics

        Bibliometrics & Citations

        Bibliometrics

        Article Metrics

        • Downloads (Last 12 months)7
        • Downloads (Last 6 weeks)0
        Reflects downloads up to 15 Jan 2025

        Other Metrics

        Citations

        Cited By

        View all
        • (2021)Background of Network Behavior AnalysisNetwork Behavior Analysis10.1007/978-981-16-8325-1_2(7-19)Online publication date: 16-Dec-2021
        • (2020)Randomized Security Patrolling for Link Flooding Attack DetectionIEEE Transactions on Dependable and Secure Computing10.1109/TDSC.2019.289237017:4(795-812)Online publication date: 1-Jul-2020
        • (2020)Traffic Dynamics-Aware Probe Selection for Fault Detection in NetworksJournal of Network and Systems Management10.1007/s10922-020-09514-3Online publication date: 6-Feb-2020
        • (2019)General Identifiability Condition for Network Topology Monitoring with Network TomographySensors10.3390/s1919412519:19(4125)Online publication date: 24-Sep-2019
        • (2019)Detection of Multipath Routing with Passive Delay MeasurementsIEEE INFOCOM 2019 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)10.1109/INFCOMW.2019.8845038(127-132)Online publication date: Apr-2019
        • (2019)Detection of multipath routing with passive delay measurements: Hypothesis testing approachesTransactions on Emerging Telecommunications Technologies10.1002/ett.375833:8Online publication date: 22-Oct-2019
        • (2018)LinkScope: Toward Detecting Target Link Flooding AttacksIEEE Transactions on Information Forensics and Security10.1109/TIFS.2018.281555513:10(2423-2438)Online publication date: Oct-2018
        • (2017)Balancing overhead-minimization objectives in network probing-path selection2017 IEEE Symposium on Computers and Communications (ISCC)10.1109/ISCC.2017.8024555(353-358)Online publication date: Jul-2017
        • (2016)iPathIEEE/ACM Transactions on Networking10.1109/TNET.2014.237145924:1(517-528)Online publication date: 1-Feb-2016
        • (2016)Identification of congestion links under multipath routing with end-to-end measurements2016 IEEE Symposium on Computers and Communication (ISCC)10.1109/ISCC.2016.7543810(646-650)Online publication date: Jun-2016
        • Show More Cited By

        View Options

        Login options

        View options

        PDF

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader

        Media

        Figures

        Other

        Tables

        Share

        Share

        Share this Publication link

        Share on social media