skip to main content
10.1145/3472456.3472465acmotherconferencesArticle/Chapter ViewAbstractPublication PagesicppConference Proceedingsconference-collections
research-article

sRouting: Towards a Better Flow Size Estimation Performance through Routing and Sketch Configuration

Published: 05 October 2021 Publication History

Abstract

Flow size estimation is highly important and beneficial to various applications, including traffic engineering and anomaly detection. Considering the resource constraints and performance requirements in place, sketches are widely used to accomplish this task. However, when sketches are applied in real-life networks, the measurement performance is often decreased due to many practical reasons, including partial deployment of sketches, unique traffic characteristics, etc. In this paper, we present sRouting, a practical framework that aims to better utilize the deployed sketches. sRouting improves the measurement performance by optimizing which flows are monitored and where. We first investigate the relationship between the accuracy of a given sketch and the total number of packets, then formulate the offline problem in sRouting as an integer linear programming problem. To solve this problem efficiently, we devise a rounding-based algorithm and provide its performance guarantees. Furthermore, to handle dynamic changes in the network, we design an online adjustment algorithm capable of responding appropriately to these changes. Through experiments using real traces and typologies, we demonstrate that sRouting can significantly improve the volume of monitored traffic and reduce the measurement error without negatively impacting the network throughput.

References

[1]
Mohammad Al-Fares, Alexander Loukissas, and Amin Vahdat. 2008. A scalable, commodity data center network architecture. ACM SIGCOMM Computer Communication Review 38, 4 (2008), 63–74.
[2]
Lei Cai, Dianjun Chen, and Luyong Zhang. 2017. A strategy of dynamic routing based on SDN. Infinite Study.
[3]
Guy Castagnoli, Stefan Brauer, and Martin Herrmann. 1993. Optimization of cyclic redundancy-check codes with 24 and 32 parity bits. IEEE Transactions on Communications 41, 6 (1993), 883–892.
[4]
Moses Charikar, Kevin Chen, and Martin Farach-Colton. 2002. Finding frequent items in data streams. In International Colloquium on Automata, Languages, and Programming. Springer, 693–703.
[5]
Rami Cohen, Liane Lewin-Eytan, Joseph Seffi Naor, and Danny Raz. 2014. On the effect of forwarding table size on SDN network utilization. In IEEE INFOCOM 2014-IEEE Conference on Computer Communications. IEEE, 1734–1742.
[6]
Graham Cormode and Shan Muthukrishnan. 2005. An improved data stream summary: The count-min sketch and its applications. Journal of Algorithms 55, 1 (2005), 58–75.
[7]
Count-Min Sketch 2019. An open source implementation of Count-Min Sketch. https://github.com/rafacarrascosa/countminsketch.
[8]
Damu Ding, Marco Savi, Gianni Antichi, and Domenico Siracusa. 2020. An incrementally-deployable P4-enabled architecture for network-wide heavy-hitter detection. IEEE Transactions on Network and Service Management 17, 1(2020), 75–88.
[9]
Cristian Estan, Ken Keys, David Moore, and George Varghese. 2004. Building a better NetFlow. ACM SIGCOMM Computer Communication Review 34, 4 (2004), 245–256.
[10]
Cristian Estan and George Varghese. 2003. New directions in traffic measurement and accounting: Focusing on the elephants, ignoring the mice. ACM Transactions on Computer Systems (TOCS) 21, 3 (2003), 270–313.
[11]
Ronald L Graham, Eugene L Lawler, Jan Karel Lenstra, and AHG Rinnooy Kan. 1979. Optimization and approximation in deterministic sequencing and scheduling: A survey. In Annals of discrete mathematics. Vol. 5. Elsevier, 287–326.
[12]
Guanyao Huang, Chen-Nee Chuah, Saqib Raza, and Srini Seetharaman. 2011. Dynamic measurement-aware routing in practice. IEEE Network 25, 3 (2011), 29–34.
[13]
Meitian Huang, Weifa Liang, Zichuan Xu, Wenzheng Xu, Song Guo, and Yinlong Xu. 2016. Dynamic routing for network throughput maximization in software-defined networks. In IEEE INFOCOM 2016-The 35th Annual IEEE International Conference on Computer Communications. IEEE, 1–9.
[14]
Qun Huang, Xin Jin, Patrick PC Lee, Runhui Li, Lu Tang, Yi-Chao Chen, and Gong Zhang. 2017. Sketchvisor: Robust network measurement for software packet processing. In Proceedings of the Conference of the ACM Special Interest Group on Data Communication. 113–126.
[15]
Xin Jin, Hongqiang Harry Liu, Rohan Gandhi, Srikanth Kandula, Ratul Mahajan, Ming Zhang, Jennifer Rexford, and Roger Wattenhofer. 2014. Dynamic scheduling of network updates. ACM SIGCOMM Computer Communication Review 44, 4 (2014), 539–550.
[16]
Naga Katta, Omid Alipourfard, Jennifer Rexford, and David Walker. 2016. Cacheflow: Dependency-aware rule-caching for software-defined networks. In Proceedings of the Symposium on SDN Research. 1–12.
[17]
Yuliang Li, Rui Miao, Changhoon Kim, and Minlan Yu. 2016. Flowradar: A better netflow for data centers. In 13th USENIX Symposium on Networked Systems Design and Implementation NSDI 16). 311–324.
[18]
Zaoxing Liu, Ran Ben-Basat, Gil Einziger, Yaron Kassner, Vladimir Braverman, Roy Friedman, and Vyas Sekar. 2019. Nitrosketch: Robust and general sketch-based monitoring in software switches. In Proceedings of the ACM Special Interest Group on Data Communication. 334–350.
[19]
Michael Mitzenmacher and Eli Upfal. 2017. Probability and computing: Randomization and probabilistic techniques in algorithms and data analysis. Cambridge University Press.
[20]
Monash networks 2020. The Network Topology From the Monash University. http://www.ecse.monash.edu.au/twiki/bin/view/InFocus/LargePacketswitchingNetworkTopologies
[21]
Masoud Moshref, Minlan Yu, Ramesh Govindan, and Amin Vahdat. 2015. Scream: Sketch resource allocation for software-defined measurement. In Proceedings of the 11th ACM Conference on Emerging Networking Experiments and Technologies. 1–13.
[22]
GUROBI OPTIMIZATION. 2014. INC. Gurobi optimizer reference manual, 2015. URL: http://www. gurobi. com(2014), 29.
[23]
P. Phaal and M. Lavine.2019. sFlow.https://sflow.org/
[24]
Konstantinos Poularakis, Jaime Llorca, Antonia M Tulino, Ian Taylor, and Leandros Tassiulas. 2019. Joint service placement and request routing in multi-cell mobile edge computing networks. In IEEE INFOCOM 2019-IEEE Conference on Computer Communications. IEEE, 10–18.
[25]
Prabhakar Raghavan and Clark D Tompson. 1987. Randomized rounding: A technique for provably good algorithms and algorithmic proofs. Combinatorica 7, 4 (1987), 365–374.
[26]
Saqib Raza, Guanyao Huang, Chen-Nee Chuah, Srini Seetharaman, and Jatinder Pal Singh. 2011. Measurouting: A framework for routing assisted traffic monitoring. IEEE/ACM Transactions on Networking 20, 1 (2011), 45–56.
[27]
Yang Shi, Mei Wen, and Chunyuan Zhang. 2020. Incremental Deployment of Programmable Switches for Sketch-based Network Measurement. In 2020 IEEE Symposium on Computers and Communications (ISCC). IEEE, 1–7.
[28]
Zhiyang Su, Ting Wang, and Mounir Hamdi. 2017. JOTA: Joint optimization for the task assignment of sketch-based measurement. Computer Communications 102 (2017), 17–27.
[29]
Lu Tang, Qun Huang, and Patrick PC Lee. 2019. MV-Sketch: A fast and compact invertible sketch for heavy flow detection in network data streams. In IEEE INFOCOM 2019-IEEE Conference on Computer Communications. IEEE, 2026–2034.
[30]
Graeme Thomson, Cristian Radu, Andrew Riddell, and Frank Wei. 2011. System and method for network recovery from multiple link failures. US Patent 7,944,815.
[31]
Intel Tofino. 2020. P4-programmable Ethernet switch ASIC that delivers better performance at lower power. https://www.intel.com/content/www/us/en/products/network-io/programmable-ethernet-switch/tofino-series.html.
[32]
C Walsworth, E Aben, KC Claffy, and D Andersen. 2016. The caida anonymized internet traces.
[33]
Jianping Wang, Chunming Qiao, and Hongfang Yu. 2011. On progressive network recovery after a major disruption. In 2011 Proceedings IEEE INFOCOM. IEEE, 1925–1933.
[34]
Xitao Wen, Bo Yang, Yan Chen, Li Erran Li, Kai Bu, Peng Zheng, Yang Yang, and Chengchen Hu. 2016. RuleTris: Minimizing rule update latency for TCAM-based SDN switches. In 2016 IEEE 36th International Conference on Distributed Computing Systems (ICDCS). IEEE, 179–188.
[35]
XPliant Ethernet Switch Product Family 2019. XPliant Ethernet Switch Product Family. http://www.cavium.com/XPliant-Ethernet-Switch-Product-Family.html.
[36]
Tong Yang, Jie Jiang, Peng Liu, Qun Huang, Junzhi Gong, Yang Zhou, Rui Miao, Xiaoming Li, and Steve Uhlig. 2018. Elastic sketch: Adaptive and fast network-wide measurements. In Proceedings of the 2018 Conference of the ACM Special Interest Group on Data Communication. 561–575.
[37]
Yutong Zhai, Hongli Xu, Haibo Wang, Zeyu Meng, and He Huang. 2020. Joint Routing and Sketch Configuration in Software-Defined Networking. IEEE/ACM Transactions on Networking 28, 5 (2020), 2092–2105.

Cited By

View all
  • (2024)CodingSketch: A Hierarchical Sketch with Efficient Encoding and Recursive Decoding2024 IEEE 40th International Conference on Data Engineering (ICDE)10.1109/ICDE60146.2024.00130(1592-1605)Online publication date: 13-May-2024

Recommendations

Comments

Information & Contributors

Information

Published In

ICPP '21: Proceedings of the 50th International Conference on Parallel Processing
August 2021
927 pages
ISBN:9781450390682
DOI:10.1145/3472456
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]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 05 October 2021

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. flow routing
  2. flow size estimation
  3. programmable switch
  4. sketch
  5. software-defined network

Qualifiers

  • Research-article
  • Research
  • Refereed limited

Conference

ICPP 2021

Acceptance Rates

Overall Acceptance Rate 91 of 313 submissions, 29%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)12
  • Downloads (Last 6 weeks)2
Reflects downloads up to 20 Feb 2025

Other Metrics

Citations

Cited By

View all
  • (2024)CodingSketch: A Hierarchical Sketch with Efficient Encoding and Recursive Decoding2024 IEEE 40th International Conference on Data Engineering (ICDE)10.1109/ICDE60146.2024.00130(1592-1605)Online publication date: 13-May-2024

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

HTML Format

View this article in HTML Format.

HTML Format

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy