Cited By
View all- Sharma SLai YGumaste ALin Y(2024)P4+NFV: Optimal offloading from P4 switches to NFV for diverse traffic streamsComputer Networks10.1016/j.comnet.2024.110907(110907)Online publication date: Nov-2024
Tuneman: Customizing Networks to Guarantee Application Bandwidth and Latency
Authors: 
Sidharth Sharma, Aniruddha Kushwaha, Mohammad Alizadeh, George Varghese, Ashwin GumasteAuthors Info & Claims
Article No.: 20, Pages 1 - 26
Abstract
We examine how to provide applications with dedicated bandwidth and guaranteed latency in a programmable mission-critical network. Unlike other SDN approaches such as B4 or SWAN, our system Tuneman optimizes both routes and packet schedules at each node to provide flows with sub-second bandwidth changes. Tuneman uses node-level optimization to compute node schedules in a slotted switch and does dynamic routing using a search procedure with Quality of Service– (QoS) based weights. This allows Tuneman to provide an efficient solution for mission-critical networks that have stringent QoS requirements. We evaluate Tuneman on a telesurgery network using a switch prototype built using FPGAs and also via simulations on India’s Tata Network. For mission-critical networks with multiple QoS levels, Tuneman has comparable or better utilization than SWAN while providing delay bounds guarantees.
References
[1]
Saksham Agarwal, Shijin Rajakrishnan, Akshay Narayan, Rachit Agarwal, David Shmoys, and Amin Vahdat. 2018. Sincronia: Near-optimal network design for coflows. In Proceedings of the Conference of the ACM Special Interest Group on Data Communication. ACM, 16–29.
[2]
Mohammad Alizadeh, Abdul Kabbani, Tom Edsall, Balaji Prabhakar, Amin Vahdat, and Masato Yasuda. 2012. Less is more: Trading a little bandwidth for ultra-low latency in the data center. In Proceedings of the 9th USENIX Symposium on Networked Systems Design and Implementation (NSDI’12). 253–266.
[3]
Mohammad Alizadeh, Shuang Yang, Milad Sharif, Sachin Katti, Nick McKeown, Balaji Prabhakar, and Scott Shenker. 2013. pfabric: Minimal near-optimal datacenter transport. In ACM SIGCOMM Computer Communication Review, Vol. 43. ACM, 435–446.
[4]
Aharon Ben-Tal, Laurent El Ghaoui, and Arkadi Nemirovski. 2009. Robust Optimization. Vol. 28. Princeton University Press.
[5]
Jon C. R. Bennett and Hui Zhang. 1996. WF/sup 2/Q: Worst-case fair weighted fair queueing. In Proceedings of the IEEE International Conference on Computer Communications (INFOCOM’96), Vol. 1. IEEE, 120–128.
[6]
Judith O. Berkey and Pearl Y. Wang. 1987. Two-dimensional finite bin-packing algorithms. J. Operat. Res. Soc. 38, 5 (1987), 423–429.
[7]
Yoram Bernet, Peter Ford, Raj Yavatkar, Fred Baker, Lixia Zhang, Michael Speer, Robert Braden, Bruce Davie, John Wroclawski, and Eyal Felstaine. 2000. A framework for integrated services operation over diffserv networks. RFC2998 (November 2000).
[8]
Pat Bosshart, Glen Gibb, Hun-Seok Kim, George Varghese, Nick McKeown, Martin Izzard, Fernando Mujica, and Mark Horowitz. 2013. Forwarding metamorphosis: Fast programmable match-action processing in hardware for SDN. ACM SIGCOMM Comput. Commun. Rev. 43, 4 (2013), 99–110.
[9]
Jing Cao and Wei Wu. 2008. A multi-metric QoS routing method for Ad Hoc network. In Proceedings of the 4th International Conference on Mobile Ad-hoc and Sensor Networks. 99–102.
[10]
Shigang Chen and Klara Nahrstedt. 1998. On finding multi-constrained paths. In Proceedings of the IEEE International Conference on Communications. Conference Record (ICC’98), Vol. 2. IEEE, 874–879.
[11]
Inho Cho, Keon Jang, and Dongsu Han. 2017. Credit-scheduled delay-bounded congestion control for datacenters. In Proceedings of the Conference of the ACM Special Interest Group on Data Communication. ACM, 239–252.
[12]
Sharad Chole, Andy Fingerhut, Sha Ma, Anirudh Sivaraman, Shay Vargaftik, Alon Berger, Gal Mendelson, Mohammad Alizadeh, Shang-Tse Chuang, Isaac Keslassy, et al. 2017. drmt: Disaggregated programmable switching. In Proceedings of the Conference of the ACM Special Interest Group on Data Communication. ACM, 1–14.
[13]
Guo Chuanxiong. 2001. SRR: An O (1) time complexity packet scheduler for flows in multi-service packet networks. ACM SIGCOMM Comput. Commun. Rev. 31, 4 (2001), 211–222.
[14]
Burak Cizmeci, Xiao Xu, Rahul Chaudhari, Christoph Bachhuber, Nicolas Alt, and Eckehard Steinbach. 2017. A multiplexing scheme for multimodal teleoperation. ACM Trans. Multimedia Comput. Commun. Appl. 13, 2 (2017), 1–28.
[15]
Rene L. Cruz. 1991. A calculus for network delay. II. Network analysis. IEEE Trans. Inf. Theory 37, 1 (1991), 132–141.
[16]
Guo-Cin Deng and Kuochen Wang. 2018. An application-aware QoS routing algorithm for SDN-based IoT networking. In Proceedings of the IEEE Symposium on Computers and Communications (ISCC’18). IEEE, 00186–00191.
[17]
Yoann Desmouceaux, Pierre Pfister, Jérôme Tollet, Mark Townsley, and Thomas Clausen. 2018. 6lb: Scalable and application-aware load balancing with segment routing. IEEE/ACM Trans. Netw. 26, 2 (2018), 819–834.
[18]
Homa Eghbali and Vincent W. S. Wong. 2015. Bandwidth allocation and pricing for SDN-enabled home networks. In Proceedings of the IEEE International Conference on Communications (ICC’15). IEEE, 5342–5347.
[19]
Peixuan Gao, Anthony Dalleggio, Yang Xu, and H. Jonathan Chao. 2022. Gearbox: A hierarchical packet scheduler for approximate weighted fair queuing. In Proceedings of the 19th USENIX Symposium on Networked Systems Design and Implementation (NSDI’22). 551–565.
[20]
Jeremy Bogle Nikhil Bhatia Manya Ghobadi, Ishai Menache, Nikolaj Bjørner, Asaf Valadarsky, and Michael Schapira. 2019. TeaVaR: Striking the right utilization-availability balance in WAN traffic engineering. In Proceedings of the Conference of the ACM Special Interest Group on Data Communication. ACM.
[21]
Soudeh Ghorbani, Zibin Yang, P. Godfrey, Yashar Ganjali, and Amin Firoozshahian. 2017. DRILL: Micro load balancing for low-latency data center networks. In Proceedings of the Conference of the ACM Special Interest Group on Data Communication. ACM, 225–238.
[22]
Matthew P. Grosvenor, Malte Schwarzkopf, Ionel Gog, Robert N. M. Watson, Andrew W. Moore, Steven Hand, and Jon Crowcroft. 2015. Queues don’t matter when you can \(\lbrace\)JUMP\(\rbrace\) them! In Proceedings of the 12th USENIX Symposium on Networked Systems Design and Implementation (NSDI’15). 1–14.
[23]
Nikola Gvozdiev, Stefano Vissicchio, Brad Karp, and Mark Handley. 2018. On low-latency-capable topologies, and their impact on the design of intra-domain routing. In Proceedings of the Conference of the ACM Special Interest Group on Data Communication. ACM, 88–102.
[24]
Renaud Hartert, Stefano Vissicchio, Pierre Schaus, Olivier Bonaventure, Clarence Filsfils, Thomas Telkamp, and Pierre Francois. 2015. A declarative and expressive approach to control forwarding paths in carrier-grade networks. ACM SIGCOMM Comput. Commun. Rev. 45, 4 (2015), 15–28.
[25]
Chi-Yao Hong, Matthew Caesar, and P. Brighten Godfrey. 2012. Finishing flows quickly with preemptive scheduling. ACM SIGCOMM Comput. Commun. Rev. 42, 4 (2012), 127–138.
[26]
Chi-Yao Hong, Srikanth Kandula, Ratul Mahajan, Ming Zhang, Vijay Gill, Mohan Nanduri, and Roger Wattenhofer. 2013. Achieving high utilization with software-driven WAN. In ACM SIGCOMM Computer Communication Review, Vol. 43. ACM, 15–26.
[27]
Sushant Jain, Alok Kumar, Subhasree Mandal, Joon Ong, Leon Poutievski, Arjun Singh, Subbaiah Venkata, Jim Wanderer, Junlan Zhou, Min Zhu, et al. 2013. B4: Experience with a globally-deployed software defined WAN. In ACM SIGCOMM Computer Communication Review, Vol. 43. ACM, 3–14.
[28]
Virajith Jalaparti, Peter Bodik, Ishai Menache, Sriram Rao, Konstantin Makarychev, and Matthew Caesar. 2015. Network-aware scheduling for data-parallel jobs: Plan when you can. In ACM SIGCOMM Computer Communication Review, Vol. 45. ACM, 407–420.
[29]
Keon Jang, Justine Sherry, Hitesh Ballani, and Toby Moncaster. 2015. Silo: Predictable message latency in the cloud. In Proceedings of the ACM Conference on Special Interest Group on Data Communication. 435–448.
[30]
Rakesh Kumar, Monowar Hasan, Smruti Padhy, Konstantin Evchenko, Lavanya Piramanayagam, Sibin Mohan, and Rakesh B. Bobba. 2017. End-to-end network delay guarantees for real-time systems using sdn. In Proceedings of the IEEE Real-Time Systems Symposium (RTSS’17). IEEE, 231–242.
[31]
Aniruddha Kushwaha, Naveen Bazard, and Ashwin Gumaste. 2021. IPv6 flow-label based application aware routing in SDNs. In Proceedings of the IEEE International Conference on Computer Communications Workshops (INFOCOM WKSHPS’21). IEEE, 1–6.
[32]
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. ACM, 334–350.
[33]
Phumzile Malindi. 2011. QoS in telemedicine. Telemed. Techn. Appl. IntechOpen, 119–138.
[34]
Hongzi Mao, Malte Schwarzkopf, Shaileshh Bojja Venkatakrishnan, Zili Meng, and Mohammad Alizadeh. 2018. Learning scheduling algorithms for data processing clusters. arXiv:1810.01963. Retrieved from https://arxiv.org/abs/1810.01963.
[35]
Nick McKeown. 1999. The iSLIP scheduling algorithm for input-queued switches. IEEE/ACM Trans. Netw.2 (1999), 188–201.
[36]
Hesham Mekky, Fang Hao, Sarit Mukherjee, Zhi-Li Zhang, and T. V. Lakshman. 2014. Application-aware data plane processing in SDN. In Proceedings of the 3rd Workshop on Hot Topics in Software Defined Networking. 13–18.
[37]
Radhika Mittal, Rachit Agarwal, Sylvia Ratnasamy, and Scott Shenker. 2016. Universal packet scheduling. In Proceedings of the 13th USENIX Symposium on Networked Systems Design and Implementation (NSDI’16). 501–521.
[38]
Behnam Montazeri, Yilong Li, Mohammad Alizadeh, and John Ousterhout. 2018. Homa: A receiver-driven low-latency transport protocol using network priorities. In Proceedings of the Conference of the ACM Special Interest Group on Data Communication. ACM, 221–235.
[39]
Songun Na and Seungwha Yoo. 2002. Allowable propagation delay for VoIP calls of acceptable quality. In International Workshop on Advanced Internet Services and Applications. Springer, 47–55.
[40]
Abhay K. Parekh and Robert G. Gallager. 1994. A generalized processor sharing approach to flow control in integrated services networks: The multiple node case. IEEE/ACM Trans. Netw. 2, 2 (1994), 137–150.
[41]
Jonathan Perry, Amy Ousterhout, Hari Balakrishnan, Devavrat Shah, and Hans Fugal. 2015. Fastpass: A centralized zero-queue datacenter network. ACM SIGCOMM Comput. Commun. Rev. 44, 4 (2015), 307–318.
[42]
Ahmed Saeed, Nandita Dukkipati, Vytautas Valancius, Carlo Contavalli, Amin Vahdat, et al. 2017. Carousel: Scalable traffic shaping at end hosts. In Proceedings of the Conference of the ACM Special Interest Group on Data Communication. ACM, 404–417.
[43]
Ahmed Saeed, Yimeng Zhao, Nandita Dukkipati, Ellen W. Zegura, Mostafa H. Ammar, Khaled Harras, and Amin Vahdat. 2019. Eiffel: Efficient and flexible software packet scheduling. In Proceedings of the USENIX Symposium on Networked Systems Design and Implementation (NSDI’19). 17–32.
[44]
Brandon Schlinker, Hyojeong Kim, Timothy Cui, Ethan Katz-Bassett, Harsha V. Madhyastha, Italo Cunha, James Quinn, Saif Hasan, Petr Lapukhov, and Hongyi Zeng. 2017. Engineering egress with edge fabric: Steering oceans of content to the world. In Proceedings of the Conference of the ACM Special Interest Group on Data Communication. ACM, 418–431.
[45]
Scott Shenker, Martin Casado, Teemu Koponen, Nick McKeown, et al. 2011. The future of networking, and the past of protocols. Open Netw. Summit 20 (2011), 1–30.
[46]
Madhavapeddi Shreedhar and George Varghese. 1996. Efficient fair queuing using deficit round-robin. IEEE/ACM Trans. Netw.3 (1996), 375–385.
[47]
Vishal Shrivastav. 2019. Fast, scalable, and programmable packet scheduler in hardware. In Proceedings of the ACM Special Interest Group on Data Communication. ACM, 367–379.
[48]
Anirudh Sivaraman, Alvin Cheung, Mihai Budiu, Changhoon Kim, Mohammad Alizadeh, Hari Balakrishnan, George Varghese, Nick McKeown, and Steve Licking. 2016. Packet transactions: High-level programming for line-rate switches. In Proceedings of the ACM SIGCOMM Conference. ACM, 15–28.
[49]
Anirudh Sivaraman, Suvinay Subramanian, Mohammad Alizadeh, Sharad Chole, Shang-Tse Chuang, Anurag Agrawal, Hari Balakrishnan, Tom Edsall, Sachin Katti, and Nick McKeown. 2016. Programmable packet scheduling at line rate. In Proceedings of the ACM SIGCOMM Conference. ACM, 44–57.
[50]
Ted H. Szymanski and Dave Gilbert. 2010. Provisioning mission-critical telerobotic control systems over internet backbone networks with essentially-perfect QoS. IEEE J. Select. Areas Commun. 28, 5 (2010), 630–643.
[51]
Vojislav Ðukić, Sangeetha Abdu Jyothi, Bojan Karlaš, Muhsen Owaida, Ce Zhang, and Ankit Singla. 2019. Is advance knowledge of flow sizes a plausible assumption? In Proceedings of the 16th USENIX Symposium on Networked Systems Design and Implementation (NSDI’19). 565–580.
[52]
IT UNION. 2001. ITU-T G. 1010 Quality of Service and Performance. Geneva, Switzerland.
[53]
Zheng Wang and Jon Crowcroft. 1996. Quality-of-service routing for supporting multimedia applications. IEEE J. Select. Areas Commun. 14, 7 (1996), 1228–1234.
[54]
Le Xu, Shivaram Venkataraman, Indranil Gupta, Luo Mai, and Rahul Potharaju. 2021. Move fast and meet deadlines: Fine-grained real-time stream processing with cameo. In Proceedings of the 18th USENIX Symposium on Networked Systems Design and Implementation (NSDI’21). 389–405.
[55]
Shujie Yang, Changqiao Xu, Lujie Zhong, Jiahao Shen, and Gabriel-Miro Muntean. 2019. A QoE-driven multicast strategy with segment routing—A novel multimedia traffic engineering paradigm. IEEE Trans. Broadcast. 66, 1 (2019), 34–46.
[56]
Jin Y. Yen. 1970. An algorithm for finding shortest routes from all source nodes to a given destination in general networks. Quart. Appl. Math. 27, 4 (1970), 526–530.
[57]
Hong Zhang, Li Chen, Bairen Yi, Kai Chen, Mosharaf Chowdhury, and Yanhui Geng. 2016. CODA: Toward automatically identifying and scheduling coflows in the dark. In Proceedings of the ACM SIGCOMM Conference. ACM, 160–173.
[58]
Qi Zhang, Jianhui Liu, and Guodong Zhao. 2018. Towards 5G enabled tactile robotic telesurgery. arXiv:1803.03586. Retrieved from https://arxiv.org/abs/1803.03586.
[59]
Shuai Zhao, Ali Sydney, and Deep Medhi. 2016. Building application-aware network environments using SDN for optimizing Hadoop applications. In Proceedings of the ACM SIGCOMM Conference. 583–584.
[60]
Noa Zilberman, Gabi Bracha, and Golan Schzukin. 2019. Stardust: Divide and conquer in the data center network. In Proceedings of the 16th USENIX Symposium on Networked Systems Design and Implementation (NSDI’19). 141–160.
[61]
Topology Zoo. 2011. TATA. Retrieved January 28, 2020 from http://www.topology-zoo.org/maps/TataNld.jpg.
Index Terms
- Tuneman: Customizing Networks to Guarantee Application Bandwidth and Latency
Recommendations
On dynamic packet fragmentation for traffic integration over bandwidth-limited links
We consider a home networking system for integrating packetised isochronous and best-effort traffic over a shared link with limited bandwidth, wherein the isochronous traffic comprises multiple isochronous flows, each associated with a periodic packet ...
Video multicasting in an autonomic future internet with essentially-perfect throughput and QoS guarantees
NEW2AN'11/ruSMART'11: Proceedings of the 11th international conference and 4th international conference on Smart spaces and next generation wired/wireless networkingA framework for an Autonomic Future Internet which supports 2 services classes, the Essentially-Perfect QoS (QoS) class and the Best-Effort (BE) class, is proposed. All provisioned traffic flows in the QoS class can achieve 100% throughput and ...
QoS guarantee for multimedia traffic in smart homes
With the advent of home networking and widespread deployment of broadband connectivity to homes, a wealth of new services with real-time Quality of Service (QoS) requirements have emerged, e.g., Video on Demand (VoD), IP Telephony, which have to co-...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
February 2023
564 pages
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: 23 February 2023
Online AM: 09 December 2022
Accepted: 21 September 2022
Revised: 05 August 2022
Received: 01 March 2022
Published in TOIT Volume 23, Issue 1
Check for updates
Author Tags
Qualifiers
- Research-article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 647Total Downloads
- Downloads (Last 12 months)213
- Downloads (Last 6 weeks)21
Reflects downloads up to 23 Nov 2024
Other Metrics
Citations
Cited By
View all- Sharma SLai YGumaste ALin Y(2024)P4+NFV: Optimal offloading from P4 switches to NFV for diverse traffic streamsComputer Networks10.1016/j.comnet.2024.110907(110907)Online publication date: Nov-2024
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign inFull Access
View options
View or Download as a PDF file.
PDFeReader
View online with eReader.
eReaderFull Text
View this article in Full Text.
Full TextHTML Format
View this article in HTML Format.
HTML Format