skip to main content
10.1145/3360468.3366780acmconferencesArticle/Chapter ViewAbstractPublication PagesconextConference Proceedingsconference-collections
extended-abstract

Ward: Implementing Arbitrary Hierarchical Policies using Packet Resubmit in Programmable Switches

Published: 09 December 2019 Publication History

Abstract

Datacenters in major cloud providers host thousands of competing tenants and applications. Network operators must ensure that available resources are fairly shared and isolated among tenants to meet Service Level Agreements (SLA). Moreover, operators must be able to meet application requirements inside each tenant to provide end-user satisfaction. Providing isolation among tenants, and enforcing application policies require deep, hierarchical policies to isolate tenants and applications separately. Current state of the art approaches cannot enforce deep, hierarchical policies due to the switches' resource limitations. In this paper, we propose Ward, a practical approach to enforce deep hierarchical network policies using packet resubmit in programmable switches. Packet resubmit allows switches to reuse network resources in enforcing complex traffic policies. Our empirical results in a sample hierarchical policy with two levels show that Ward could enforce tenant isolation and strict priority.

References

[1]
[n.d.]. NS-3 network simulator. http://www.nsnam.org/.
[2]
[n.d.]. P4 Language Consortium. 2018. P4-BMv2. https://github.com/p4lang/behavioral-model.
[3]
[n.d.]. Portable Switch Architecture (PSA). https://p4.org/specs/.
[4]
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 Computer Communication Review 43, 4 (2013), 99--110.
[5]
Y. Chang, A. Rezaei, B. Vamanan, J. Hasan, S. Rao, and T. N. Vijaykumar. 2017. Hydra: Leveraging functional slicing for efficient distributed SDN controllers. In 2017 9th International Conference on Communication Systems and Networks (COMSNETS). 251--258. https://doi.org/10.1109/COMSNETS.2017.7945384
[6]
Vimalkumar Jeyakumar, Mohammad Alizadeh, David Mazières, Balaji Prabhakar, Albert Greenberg, and Changhoon Kim. 2013. EyeQ: Practical network performance isolation at the edge. In Presented as part of the 10th {USENIX} Symposium on Networked Systems Design and Implementation ({NSDI} 13). 297--311.
[7]
Mojtaba Malekpourshahraki, Brent Stephens, and Balajee Vamanan. 2019. Ether: Providing both Interactive Service and Fairness in Multi-Tenant Datacenters. In Proceedings of the 3rd Asia-Pacific Workshop on Networking 2019. ACM, 50--56.
[8]
Lucian Popa, Praveen Yalagandula, Sujata Banerjee, Jeffrey C Mogul, Yoshio Turner, and Jose Renato Santos. 2013. Elasticswitch: Practical work-conserving bandwidth guarantees for cloud computing. In ACM SIGCOMM Computer Communication Review, Vol. 43. ACM, 351--362.
[9]
Ting Qu, Raj Joshi, Mun Choon Chan, Ben Leong, Deke Guo, and Zhong Liu. 2019. SQR: In-network Packet Loss Recovery from Link Failures for Highly Reliable Datacenter Networks. In 2019 IEEE 27th International Conference on Network Protocols (ICNP). IEEE.
[10]
Hamed Rezaei, Muhammad Usama Chaudhry, Hamidreza Almasi, and Balajee Vamanan. 2019. ICON: Incast Congestion Control using Packet Pacing in Data-center Networks. In 2019 11th International Conference on Communication Systems & Networks (COMSNETS). IEEE, 125--132.
[11]
Hamed Rezaei, Mojtaba Malekpourshahraki, and Balajee Vamanan. 2018. Slytherin: Dynamic, network-assisted prioritization of tail packets in datacenter networks. In 2018 27th International Conference on Computer Communication and Networks (ICCCN). IEEE, 1--9.
[12]
Naveen Kr Sharma, Ming Liu, Kishore Atreya, and Arvind Krishnamurthy. 2018. Approximating fair queueing on reconfigurable switches. In 15th {USENIX} Symposium on Networked Systems Design and Implementation ({NSDI} 18). 1--16.
[13]
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.
[14]
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 2016 ACM SIGCOMM Conference. ACM, 44--57.
[15]
Brent Stephens, Aditya Akella, and Michael Swift. 2019. Loom: Flexible and Efficient {NIC} Packet Scheduling. In 16th {USENIX} Symposium on Networked Systems Design and Implementation ({NSDI} 19). 33--46.

Cited By

View all
  • (2024)vPIFO: Virtualized Packet Scheduler for Programmable Hierarchical Scheduling in High-Speed NetworksProceedings of the ACM SIGCOMM 2024 Conference10.1145/3651890.3672270(983-999)Online publication date: 4-Aug-2024

Index Terms

  1. Ward: Implementing Arbitrary Hierarchical Policies using Packet Resubmit in Programmable Switches

        Recommendations

        Comments

        Information & Contributors

        Information

        Published In

        cover image ACM Conferences
        CoNEXT '19 Companion: Proceedings of the 15th International Conference on emerging Networking EXperiments and Technologies
        December 2019
        93 pages
        ISBN:9781450370066
        DOI:10.1145/3360468
        Permission to make digital or hard copies of part or all 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 third-party components of this work must be honored. For all other uses, contact the Owner/Author.

        Sponsors

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        Published: 09 December 2019

        Check for updates

        Qualifiers

        • Extended-abstract
        • Research
        • Refereed limited

        Conference

        CoNEXT '19
        Sponsor:

        Acceptance Rates

        CoNEXT '19 Companion Paper Acceptance Rate 34 of 52 submissions, 65%;
        Overall Acceptance Rate 198 of 789 submissions, 25%

        Contributors

        Other Metrics

        Bibliometrics & Citations

        Bibliometrics

        Article Metrics

        • Downloads (Last 12 months)14
        • Downloads (Last 6 weeks)1
        Reflects downloads up to 10 Feb 2025

        Other Metrics

        Citations

        Cited By

        View all
        • (2024)vPIFO: Virtualized Packet Scheduler for Programmable Hierarchical Scheduling in High-Speed NetworksProceedings of the ACM SIGCOMM 2024 Conference10.1145/3651890.3672270(983-999)Online publication date: 4-Aug-2024

        View Options

        Login options

        View options

        PDF

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader

        Figures

        Tables

        Media

        Share

        Share

        Share this Publication link

        Share on social media