Flow/Path Performance Consistency
Authors: 
Mahdi Hosseini, Georgia Fragkouli, Pavlos Nikolopoulos, Katerina ArgyrakiAuthors Info & Claims
Mahdi Hosseini, Georgia Fragkouli, Pavlos Nikolopoulos, Katerina ArgyrakiAuthors Info & ClaimsPages 255 - 263
Abstract
We explore a new network-performance metric: flow/path consistency, which captures whether the end-to-end performance of the flows that traverse a network is consistent with the aggregate performance of the network's elements. We propose a formal definition; provide preliminary evidence that---by leveraging simple math---it can be estimated with configurable confidence and minimal overhead; and argue that it could simplify network debugging.
References
[1]
M. Alizadeh, A. Greenberg, D. A. Maltz, J. Padhye, P. Patel, B. Prabhakar, S. Sengupta, and M. Sridharan. Data center tcp (dctcp). In Proceedings of the ACM SIGCOMM 2010 Conference, pages 63--74, 2010.
[2]
B. Arzani, S. Ciraci, B. T. Loo, A. Schuster, and G. Outhred. Taking the blame game out of data centers operations with netpoirot. In Proceedings of the 2016 ACM SIGCOMM Conference, pages 440--453, 2016.
[3]
F. Baccelli, S. Machiraju, D. Veitch, and J. C. Bolot. The Role of PASTA in Network Measurement. In Proceedings of the 2006 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications, SIGCOMM '06, page 231--242, New York, NY, USA, 2006. Association for Computing Machinery.
[4]
CAIDA. The caida anonymized internet traces dataset (october 2010). https://www.caida.org/catalog/datasets/passive_dataset/equinix-chicago/20101029-130000.UTC/, 2022. Accessed: August 2022.
[5]
R. Castro, M. Coates, G. Liang, R. Nowak, and B. Yu. Network Tomography: Recent Developments. Statistical Science, 19(3):499 - 517, 2004.
[6]
X. Chen, S. L. Feibish, Y. Koral, J. Rexford, and O. Rottenstreich. Catching the microburst culprits with snappy. In Proceedings of the Afternoon Workshop on Self-Driving Networks, SelfDN 2018, page 22--28, New York, NY, USA, 2018. Association for Computing Machinery.
[7]
M. Coates, A. O. H. III, R. D. Nowak, and B. Yu. Internet tomography. IEEE Signal Process. Mag., 19(3):47--65, 2002.
[8]
A. Dhamdhere, R. Teixeira, C. Dovrolis, and C. Diot. Netdiagnoser: troubleshooting network unreachabilities using end-to-end probes and routing data. In J. Kurose and H. Schulzrinne, editors, Proceedings of the 2007 ACM Conference on Emerging Network Experiment and Technology, CoNEXT 2007, New York, NY, USA, December 10-13, 2007, page 18. ACM, 2007.
[9]
N. G. Duffield. Network tomography of binary network performance characteristics. IEEE Trans. Inf. Theory, 52(12):5373--5388, 2006.
[10]
S. Floyd and V. Jacobson. Random early detection gateways for congestion avoidance. IEEE/ACM Trans. Netw., 1(4):397--413, 1993.
[11]
Y. Geng, S. Liu, Z. Yin, A. Naik, B. Prabhakar, M. Rosenblum, and A. Vahdat. SIMON: A simple and scalable method for sensing, inference and measurement in data center networks. In J. R. Lorch and M. Yu, editors, 16th USENIX Symposium on Networked Systems Design and Implementation, NSDI 2019, Boston, MA, February 26-28, 2019, pages 549--564. USENIX Association, 2019.
[12]
D. Ghita, C. Karakus, K. J. Argyraki, and P. Thiran. Shifting network tomography toward a practical goal. In K. Cho and M. Crovella, editors, Proceedings of the 2011 Conference on Emerging Networking Experiments and Technologies, Co-NEXT '11, Tokyo, Japan, December 6-9, 2011, page 24. ACM, 2011.
[13]
P. W. Glynn, B. Melamed, and W. Whitt. Estimating customer and time averages. Operations Research, 41(2):400--408, 1993.
[14]
C. Guo, L. Yuan, D. Xiang, Y. Dang, R. Huang, D. Maltz, Z. Liu, V. Wang, B. Pang, H. Chen, et al. Pingmesh: A large-scale system for data center network latency measurement and analysis. In Proceedings of the 2015 ACM Conference on Special Interest Group on Data Communication, pages 139--152, 2015.
[15]
C. Hopps. Rfc2992: Analysis of an equal-cost multi-path algorithm, 2000.
[16]
Q. Huang, H. Sun, P. P. Lee, W. Bai, F. Zhu, and Y. Bao. Omnimon: Re-architecting network telemetry with resource efficiency and full accuracy. In Proceedings of the Annual conference of the ACM Special Interest Group on Data Communication on the applications, technologies, architectures, and protocols for computer communication, pages 404--421, 2020.
[17]
J. Kaldor, J. Mace, M. Bejda, E. Gao, W. Kuropatwa, J. O'Neill, K. W. Ong, B. Schaller, P. Shan, B. Viscomi, et al. Canopy: An end-to-end performance tracing and analysis system. In Proceedings of the 26th symposium on operating systems principles, pages 34--50, 2017.
[18]
M. Kheirkhah, I. Wakeman, and G. Parisis. Mmptcp: A multipath transport protocol for data centers. In IEEE INFOCOM 2016-The 35th Annual IEEE International Conference on Computer Communications, pages 1--9. IEEE, 2016.
[19]
J.-Y. Le Boudec. Performance Evaluation of Computer and Communication Systems. EPFL Press, Lausanne, Switzerland, 2010.
[20]
Z. Liu, R. Ben-Basat, G. Einziger, Y. Kassner, V. Braverman, R. Friedman, and V. Sekar. Nitrosketch: Robust and general sketch-based monitoring in software switches. In Proceedings of the ACM Special Interest Group on Data Communication, pages 334--350. 2019.
[21]
J. C. Mogul and J. Wilkes. Physical deployability matters. In Proceedings of the 22nd ACM Workshop on Hot Topics in Networks, HotNets '23, page 9--17, New York, NY, USA, 2023. Association for Computing Machinery.
[22]
H. X. Nguyen and P. Thiran. The boolean solution to the congested IP link location problem: Theory and practice. In INFOCOM 2007. 26th IEEE International Conference on Computer Communications, Joint Conference of the IEEE Computer and Communications Societies, 6-12 May 2007, Anchorage, Alaska, USA, pages 2117--2125. IEEE, 2007.
[23]
H. X. Nguyen and P. Thiran. Network loss inference with second order statistics of end-to-end flows. In C. Dovrolis and M. Roughan, editors, Proceedings of the 7th ACM SIGCOMM Internet Measurement Conference, IMC 2007, San Diego, California, USA, October 24-26, 2007, pages 227--240. ACM, 2007.
[24]
V. N. Padmanabhan, L. Qiu, and H.J. Wang. Server-based inference of internet link lossiness. In Proceedings IEEE INFOCOM 2003, The 22nd Annual Joint Conference of the IEEE Computer and Communications Societies, San Franciso, CA, USA, March 30-April 3, 2003, pages 145--155. IEEE Computer Society, 2003.
[25]
V. Paxson. End-to-End Routing Behavior in the Internet. SIGCOMM '96, page 25--38, New York, NY, USA, 1996. Association for Computing Machinery.
[26]
M. Qian, L. Cui, X. Zhang, F. P. Tso, and Y. Deng. ddrops: Detecting silent packet drops on programmable data plane. Computer Networks, 214:109171, 2022.
[27]
M. A. Qureshi, J. Yan, Y. Cheng, S. H. Yeganeh, Y. Seung, N. Cardwell, W. De Bruijn, V. Jacobson, J. Kaur, D. Wetherall, et al. Fathom: Understanding datacenter application network performance. In Proceedings of the ACM SIGCOMM 2023 Conference, pages 394--405, 2023.
[28]
K. Ramakrishnan, S. Floyd, and D. Black. Rfc3168: The addition of explicit congestion notification (ecn) to ip, 2001.
[29]
G. Ren, E. Tune, T. Moseley, Y. Shi, S. Rus, and R. Hundt. Google-wide profiling: A continuous profiling infrastructure for data centers. IEEE micro, 30(4):65--79, 2010.
[30]
H. H. Song, L. Qiu, and Y. Zhang. Netquest: a flexible framework for large-scale network measurement. In R. A. Marie, P. B. Key, and E. Smirni, editors, Proceedings of the Joint International Conference on Measurement and Modeling of Computer Systems, SIGMETRICS/Performance 2006, Saint Malo, France, June 26-30, 2006, pages 121--132. ACM, 2006.
[31]
B. P. Welford. Note on a method for calculating corrected sums of squares and products. Technometrics, 4(3):419--420, 1962.
[32]
R. W. Wolff. Poisson Arrivals See Time Averages. Oper. Res., 30(2):223--231, Apr. 1982.
[33]
Q. Zhang, V. Liu, H. Zeng, and A. Krishnamurthy. High-resolution measurement of data center microbursts. In Proceedings of the 2017 Internet Measurement Conference, pages 78--85, 2017.
[34]
Y. Zhou, C. Sun, H. H. Liu, R. Miao, S. Bai, B. Li, Z. Zheng, L. Zhu, Z. Shen, Y. Xi, P. Zhang, D. Cai, M. Zhang, and M. Xu. Flow event telemetry on programmable data plane. In Proceedings of the Annual Conference of the ACM Special Interest Group on Data Communication on the Applications, Technologies, Architectures, and Protocols for Computer Communication, SIGCOMM '20, page 76--89, New York, NY, USA, 2020. Association for Computing Machinery.
[35]
Y. Zhu, N. Kang, J. Cao, A. Greenberg, G. Lu, R. Mahajan, D. Maltz, L. Yuan, M. Zhang, B. Y. Zhao, and H. Zheng. Packet-level telemetry in large datacenter networks. SIGCOMM Comput. Commun. Rev., 45(4):479--491, aug 2015.
[36]
D. Zhuo, M. Ghobadi, R. Mahajan, K.-T. Förster, A. Krishnamurthy, and T. Anderson. Understanding and mitigating packet corruption in data center networks. In Proceedings of the Conference of the ACM Special Interest Group on Data Communication, SIGCOMM '17, page 362--375, New York, NY, USA, 2017. Association for Computing Machinery.
Index Terms
- Flow/Path Performance Consistency
Recommendations
Flow-Path: An AllPath flow-based protocol
LCN '12: Proceedings of the 2012 IEEE 37th Conference on Local Computer Networks (LCN 2012)This paper describes Flow-Path, an AllPath flow-based switching protocol that features improved load adaptive properties. Upon arrival of a new flow to the network, it explores every possible path reaching from source to destination host and selects the ...
A concurrent solution for intra-cell flow path layouts and I/O point locations of cells in a cellular manufacturing system
In this paper, we study the I/O (Input/Output) point location problem and the intra-cell flow path layout problem of cells in a cellular manufacturing system. Traditional approaches have often solved these two problems as separate problems, despite they ...
Performance of Shortest Path Algorithms in Network Flow Problems
It is known that minimum cost flow problems can be solved by successive augmentations along shortest paths. In this paper the issues of implementing shortest path algorithms in this context are examined. Of particular interest is the dynamic topology ...
Comments
Information & Contributors
Information
Published In
November 2024
394 pages
ISBN:9798400712722
DOI:10.1145/3696348
Copyright © 2024 ACM.
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 the author(s) 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: 18 November 2024
Check for updates
Author Tags
Qualifiers
- Research-article
- Research
- Refereed limited
Conference
HOTNETS '24
Sponsor:
Acceptance Rates
Overall Acceptance Rate 110 of 460 submissions, 24%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 74Total Downloads
- Downloads (Last 12 months)74
- Downloads (Last 6 weeks)22
Reflects downloads up to 05 Mar 2025
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in