Sidharth Sharma
Skip Abstract Section
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.
- [1] . 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.Google Scholar
Digital Library
- [2] . 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.Google Scholar
- [3] . 2013. pfabric: Minimal near-optimal datacenter transport. In ACM SIGCOMM Computer Communication Review, Vol. 43. ACM, 435–446.Google Scholar
- [4] . 2009. Robust Optimization. Vol. 28. Princeton University Press.Google ScholarCross Ref
- [5] . 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.Google ScholarCross Ref
- [6] . 1987. Two-dimensional finite bin-packing algorithms. J. Operat. Res. Soc. 38, 5 (1987), 423–429.Google ScholarCross Ref
- [7] . 2000. A framework for integrated services operation over diffserv networks. RFC2998 (November 2000).Google Scholar
- [8] . 2013. Forwarding metamorphosis: Fast programmable match-action processing in hardware for SDN. ACM SIGCOMM Comput. Commun. Rev. 43, 4 (2013), 99–110.Google ScholarDigital Library
- [9] . 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. Google ScholarDigital Library
- [10] . 1998. On finding multi-constrained paths. In Proceedings of the IEEE International Conference on Communications. Conference Record (ICC’98), Vol. 2. IEEE, 874–879.Google Scholar
- [11] . 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.Google ScholarDigital Library
- [12] . 2017. drmt: Disaggregated programmable switching. In Proceedings of the Conference of the ACM Special Interest Group on Data Communication. ACM, 1–14.Google ScholarDigital Library
- [13] . 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.Google ScholarDigital Library
- [14] . 2017. A multiplexing scheme for multimodal teleoperation. ACM Trans. Multimedia Comput. Commun. Appl. 13, 2 (2017), 1–28.Google ScholarDigital Library
- [15] . 1991. A calculus for network delay. II. Network analysis. IEEE Trans. Inf. Theory 37, 1 (1991), 132–141.Google ScholarDigital Library
- [16] . 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.Google ScholarCross Ref
- [17] . 2018. 6lb: Scalable and application-aware load balancing with segment routing. IEEE/ACM Trans. Netw. 26, 2 (2018), 819–834.Google ScholarDigital Library
- [18] . 2015. Bandwidth allocation and pricing for SDN-enabled home networks. In Proceedings of the IEEE International Conference on Communications (ICC’15). IEEE, 5342–5347.Google ScholarCross Ref
- [19] . 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.Google Scholar
- [20] . 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.Google Scholar
- [21] . 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.Google ScholarDigital Library
- [22] . 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.Google Scholar
- [23] . 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.Google ScholarDigital Library
- [24] . 2015. A declarative and expressive approach to control forwarding paths in carrier-grade networks. ACM SIGCOMM Comput. Commun. Rev. 45, 4 (2015), 15–28.Google ScholarDigital Library
- [25] . 2012. Finishing flows quickly with preemptive scheduling. ACM SIGCOMM Comput. Commun. Rev. 42, 4 (2012), 127–138.Google ScholarDigital Library
- [26] . 2013. Achieving high utilization with software-driven WAN. In ACM SIGCOMM Computer Communication Review, Vol. 43. ACM, 15–26.Google Scholar
- [27] . 2013. B4: Experience with a globally-deployed software defined WAN. In ACM SIGCOMM Computer Communication Review, Vol. 43. ACM, 3–14.Google Scholar
- [28] . 2015. Network-aware scheduling for data-parallel jobs: Plan when you can. In ACM SIGCOMM Computer Communication Review, Vol. 45. ACM, 407–420.Google Scholar
- [29] . 2015. Silo: Predictable message latency in the cloud. In Proceedings of the ACM Conference on Special Interest Group on Data Communication. 435–448.Google ScholarDigital Library
- [30] . 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.Google ScholarCross Ref
- [31] . 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.Google ScholarCross Ref
- [32] . 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.Google ScholarDigital Library
- [33] . 2011. QoS in telemedicine. Telemed. Techn. Appl. IntechOpen, 119–138.Google Scholar
- [34] . 2018. Learning scheduling algorithms for data processing clusters. arXiv:1810.01963. Retrieved from https://arxiv.org/abs/1810.01963.Google Scholar
- [35] . 1999. The iSLIP scheduling algorithm for input-queued switches. IEEE/ACM Trans. Netw.2 (1999), 188–201.Google ScholarDigital Library
- [36] . 2014. Application-aware data plane processing in SDN. In Proceedings of the 3rd Workshop on Hot Topics in Software Defined Networking. 13–18.Google ScholarDigital Library
- [37] . 2016. Universal packet scheduling. In Proceedings of the 13th USENIX Symposium on Networked Systems Design and Implementation (NSDI’16). 501–521.Google Scholar
- [38] . 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.Google ScholarDigital Library
- [39] . 2002. Allowable propagation delay for VoIP calls of acceptable quality. In International Workshop on Advanced Internet Services and Applications. Springer, 47–55.Google Scholar
- [40] . 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.Google ScholarDigital Library
- [41] . 2015. Fastpass: A centralized zero-queue datacenter network. ACM SIGCOMM Comput. Commun. Rev. 44, 4 (2015), 307–318.Google ScholarDigital Library
- [42] . 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.Google ScholarDigital Library
- [43] . 2019. Eiffel: Efficient and flexible software packet scheduling. In Proceedings of the USENIX Symposium on Networked Systems Design and Implementation (NSDI’19). 17–32.Google Scholar
- [44] . 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.Google ScholarDigital Library
- [45] . 2011. The future of networking, and the past of protocols. Open Netw. Summit 20 (2011), 1–30.Google Scholar
- [46] . 1996. Efficient fair queuing using deficit round-robin. IEEE/ACM Trans. Netw.3 (1996), 375–385.Google ScholarCross Ref
- [47] . 2019. Fast, scalable, and programmable packet scheduler in hardware. In Proceedings of the ACM Special Interest Group on Data Communication. ACM, 367–379.Google ScholarDigital Library
- [48] . 2016. Packet transactions: High-level programming for line-rate switches. In Proceedings of the ACM SIGCOMM Conference. ACM, 15–28.Google ScholarDigital Library
- [49] . 2016. Programmable packet scheduling at line rate. In Proceedings of the ACM SIGCOMM Conference. ACM, 44–57.Google ScholarDigital Library
- [50] . 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.Google ScholarDigital Library
- [51] . 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.Google Scholar
- [52] . 2001. ITU-T G. 1010 Quality of Service and Performance. Geneva, Switzerland.Google Scholar
- [53] . 1996. Quality-of-service routing for supporting multimedia applications. IEEE J. Select. Areas Commun. 14, 7 (1996), 1228–1234.Google ScholarDigital Library
- [54] . 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.Google Scholar
- [55] . 2019. A QoE-driven multicast strategy with segment routing—A novel multimedia traffic engineering paradigm. IEEE Trans. Broadcast. 66, 1 (2019), 34–46.Google ScholarCross Ref
- [56] . 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.Google ScholarCross Ref
- [57] . 2016. CODA: Toward automatically identifying and scheduling coflows in the dark. In Proceedings of the ACM SIGCOMM Conference. ACM, 160–173.Google ScholarDigital Library
- [58] . 2018. Towards 5G enabled tactile robotic telesurgery. arXiv:1803.03586. Retrieved from https://arxiv.org/abs/1803.03586.Google Scholar
- [59] . 2016. Building application-aware network environments using SDN for optimizing Hadoop applications. In Proceedings of the ACM SIGCOMM Conference. 583–584.Google ScholarDigital Library
- [60] . 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.Google Scholar
- [61] . 2011. TATA. Retrieved January 28, 2020 from http://www.topology-zoo.org/maps/TataNld.jpg.Google Scholar
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