research-article

P5: Policy-driven optimization of P4 pipeline

Authors:

Anubhavnidhi Abhashkumar,

Jean Tourrilhes,

Sujata Banerjee,

Joon-Myung Kang,

Aditya AkellaAuthors Info & Claims

SOSR '17: Proceedings of the Symposium on SDN Research

Pages 136 - 142

https://doi.org/10.1145/3050220.3050235

Published: 03 April 2017 Publication History

Abstract

The physical pipeline of flexible network switches is usually programmed using packet-level programs, such as P4 programs. However, those programs are low level and leave room for further optimization. We propose P5 (Policy-driven optimization of P4 Pipeline), a system that exploits knowledge of application deployments embedded in a high-level policy abstraction to: 1) detect features that are used by applications in a mutually-exclusive way and thereby remove inter-feature dependencies between the tables implementing these features in a network switch. This improves the pipeline concurrency of switches and hence its pipeline efficiency. 2) detect and remove the features that are not used by any application/traffic on the switch in a given topology. This reduces the number of tables and the resource consumed by switches, which also improves its pipeline efficiency. Our experiments on real P4 switch programs show that the resulting switch pipelines are up to 50% more efficient as compared to the cases that do not exploit this information.

References

[1]

Miercom Lab Testing Report, Chapter 12 Resiliency during ISSU. http://miercom.com/pdf/reports/20121129.pdf.

[2]

OpenDaylight Group Policy. https://wiki.opendaylight.org/view/Group_Policy:Main.

[3]

OpenDaylight Network Intent Composition. https://wiki.opendaylight.org/view/Network_Intent_Composition:Main.

[4]

OpenStack Congress. https://wiki.openstack.org/wiki/Congress.

[5]

P4 github repository. https://github.com/p4lang/.

[6]

HP 5400R zl2 Switch Series. See goo.gl/t3kk9D, 2015.

[7]

C. J. Anderson, N. Foster, A. Guha, J.-B. Jeannin, D. Kozen, C. Schlesinger, and D. Walker. Netkat: Semantic foundations for networks. In Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL '14, pages 113--126, New York, NY, USA, 2014. ACM.

Digital Library

[8]

Anu Mercian, Felipe Yrineu, Joon-Myung Kang, Raphael Amorim, Saket M Mahajani, Mario Sanchez and Sujata Banerjee. Network Intent Composition (NIC) Be Feature Update and Demo: Intent Compilation, Lifecycle Management and Automated Mapping. Presented in OpenDaylight Summit 2016, September 2016.

[9]

M. T. Arashloo, Y. Koral, M. Greenberg, J. Rexford, and D. Walker. SNAP: Stateful Network-Wide Abstractions for Packet Processing. In Proceedings of the 2016 Conference on ACM SIGCOMM 2016 Conference, SIGCOMM '16, pages 29--43, New York, NY, USA, 2016. ACM.

Digital Library

[10]

P. Bosshart, D. Daly, G. Gibb, M. Izzard, N. McKeown, J. Rexford, C. Schlesinger, D. Talayco, A. Vahdat, G. Varghese, et al. P4: Programming protocol-independent packet processors. ACM SIGCOMM Computer Communication Review, 44(3):87--95, 2014.

Digital Library

[11]

P. Bosshart, G. Gibb, H.-S. Kim, G. Varghese, N. McKeown, M. Izzard, F. Mujica, and M. Horowitz. Forwarding metamorphosis: Fast programmable match-action processing in hardware for sdn. In ACM SIGCOMM Computer Communication Review, volume 43, pages 99--110. ACM, 2013.

Digital Library

[12]

D. L. et al. Open Networking Foundation -- Intent NBI - Definition and Principles, 2016.

[13]

N. Foster, R. Harrison, M. J. Freedman, C. Monsanto, J. Rexford, A. Story, and D. Walker. Frenetic: A network programming language. In ACM SIGPLAN Notices, volume 46, pages 279--291. ACM, 2011.

Digital Library

[14]

N. Foster, D. Kozen, M. Milano, A. Silva, and L. Thompson. A coalgebraic decision procedure for netkat. In Proceedings of the 42Nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL '15, pages 343--355, New York, NY, USA, 2015. ACM.

Digital Library

[15]

X. Jin, H. H. Liu, R. Gandhi, S. Kandula, R. Mahajan, M. Zhang, J. Rexford, and R. Wattenhofer. Dynamic scheduling of network updates. In ACM SIGCOMM Computer Communication Review, volume 44, pages 539--550. ACM, 2014.

Digital Library

[16]

L. Jose, L. Yan, G. Varghese, and N. McKeown. Compiling packet programs to reconfigurable switches. In USENIX NSDI, 2015.

[17]

J.-M. Kang, J. Lee, V. Nagendra, and S. Banerjee. Lms: Label management service for intent-driven cloud management. In Integrated Network Management, 2017. IM'17. IFIP/IEEE International Symposium on. IEEE, 2017.

[18]

N. Kang, Z. Liu, J. Rexford, and D. Walker. Optimizing the one big switch abstraction in software-defined networks. In Proceedings of the ninth ACM conference on Emerging networking experiments and technologies, pages 13--24. ACM, 2013.

Digital Library

[19]

H. Kim, J. Reich, A. Gupta, M. Shahbaz, N. Feamster, and R. Clark. Kinetic: Verifiable dynamic network control. In Proceedings of the 12th USENIX Conference on Networked Systems Design and Implementation, NSDI'15, pages 59--72, Berkeley, CA, USA, 2015. USENIX Association.

Digital Library

[20]

C. Monsanto, N. Foster, R. Harrison, and D. Walker. A compiler and run-time system for network programming languages. In Proceedings of the 39th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL '12, pages 217--230, New York, NY, USA, 2012. ACM.

Digital Library

[21]

C. Monsanto, J. Reich, N. Foster, J. Rexford, and D. Walker. Composing software defined networks. In Presented as part of the 10th USENIX Symposium on Networked Systems Design and Implementation (NSDI 13), pages 1--13, Lombard, IL, 2013. USENIX.

[22]

M. Moshref, M. Yu, R. Govindan, and A. Vahdat. Dream: dynamic resource allocation for software-defined measurement. In ACM SIGCOMM Computer Communication Review, volume 44, pages 419--430. ACM, 2014.

Digital Library

[23]

R. Ozdag. Intel® ethernet switch fm6000 series-software defined networking. See goo.gl/AnvOvX, 2012.

[24]

C. Prakash, J. Lee, Y. Turner, J.-M. Kang, A. Akella, S. Banerjee, C. Clark, Y. Ma, P. Sharma, and Y. Zhang. Pga: Using graphs to express and automatically reconcile network policies. SIGCOMM Comput. Commun. Rev., 45(4):29--42, Aug. 2015.

Digital Library

[25]

O. Rottenstreich, I. Keslassy, Y. Revah, and A. Kadosh. Minimizing delay in network function virtualization with shared pipelines. IEEE Transactions on Parallel and Distributed Systems, 28(1):156--169, 2017.

Digital Library

[26]

C. Schlesinger, M. Greenberg, and D. Walker. Concurrent netcore: From policies to pipelines. In Proceedings of the 19th ACM SIGPLAN international conference on Functional programming, pages 11--24. ACM, 2014.

Digital Library

[27]

A. Sivaraman, C. Kim, R. Krishnamoorthy, A. Dixit, and M. Budiu. Dc.p4: Programming the forwarding plane of a data-center switch. In Proceedings of the 1st ACM SIGCOMM Symposium on Software Defined Networking Research, SOSR '15, pages 2:1--2:8, New York, NY, USA, 2015. ACM.

Digital Library

[28]

A. Voellmy, J. Wang, Y. R. Yang, B. Ford, and P. Hudak. Maple: Simplifying sdn programming using algorithmic policies. In Proceedings of the ACM SIGCOMM 2013 Conference on SIGCOMM, SIGCOMM '13, pages 87--98, New York, NY, USA, 2013. ACM.

Digital Library

[29]

M. Yu, A. G. Greenberg, D. A. Maltz, J. Rexford, L. Yuan, S. Kandula, and C. Kim. Profiling network performance for multi-tier data center applications. In NSDI, 2011.

Digital Library

[30]

M. Yu, A. Wundsam, and M. Raju. Nosix: A lightweight portability layer for the sdn os. SIGCOMM Comput. Commun. Rev., 44(2):28--35, Apr. 2014.

Digital Library

Cited By

Wen CLi ZJafri SQiu XRao S(2024)P4CGO: Control Plane Guided P4 Program OptimizationProceedings of the 2024 SIGCOMM Workshop on Formal Methods Aided Network Operation10.1145/3672199.3673892(1-7)Online publication date: 4-Aug-2024
https://dl.acm.org/doi/10.1145/3672199.3673892
Xiao YZhao YLin SKuzmanovic A(2024)Snatch: Online Streaming Analytics at the Network EdgeProceedings of the Nineteenth European Conference on Computer Systems10.1145/3627703.3629577(349-369)Online publication date: 22-Apr-2024
https://dl.acm.org/doi/10.1145/3627703.3629577
Kröger NHarkous HMehmeti FKellerer W(2024)Performance Modeling and Analysis of P4 Programmable Devices With General Service TimesIEEE Transactions on Network and Service Management10.1109/TNSM.2024.340481321:4(4543-4562)Online publication date: Aug-2024
https://doi.org/10.1109/TNSM.2024.3404813
Show More Cited By

P5: Policy-driven optimization of P4 pipeline
1. Networks
  1. Network services

Recommendations

Precise Time-synchronization in the Data-Plane using Programmable Switching ASICs
SOSR '19: Proceedings of the 2019 ACM Symposium on SDN Research

Current implementations of time synchronization protocols (e.g. PTP) in standard industry-grade switches handle the protocol stack in the slow-path (control-plane). With new use cases of in-network computing using programmable switching ASICs, global ...
Delay Analysis in Programmable Data Plane Using Jitter Calculations
IC3-2023: Proceedings of the 2023 Fifteenth International Conference on Contemporary Computing

The second generation of Software Defined Networks (SDN) made the network more flexible and automated with the introduction of programmable forwarding devices. This programmability has reduced the delay and processing time taken by a traditional router ...
Hard Virtualization of P4-based switches with VirtP4
SIGCOMM Posters and Demos '19: Proceedings of the ACM SIGCOMM 2019 Conference Posters and Demos

We present VirtP4, a conceptual architecture for hard (type-1) virtualization of P4-based switch programs in a NetFPGA SUME board. In contrast to existing (type-2) solutions like Hyper4, HyperVDP, and P4Visor, our design does not require access to switch ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Conferences

SOSR '17: Proceedings of the Symposium on SDN Research

April 2017

211 pages

ISBN:9781450349475

DOI:10.1145/3050220

Copyright © 2017 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 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]

Sponsors

SIGCOMM: ACM Special Interest Group on Data Communication
ONS: Open Networking Summit

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 03 April 2017

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article
Research
Refereed limited

Conference

SOSR '17

Sponsor:

SIGCOMM
ONS

SOSR '17: Symposium on SDN Research

April 3 - 4, 2017

CA, Santa Clara, USA

Acceptance Rates

Overall Acceptance Rate 7 of 43 submissions, 16%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

16
Total Citations
View Citations
463
Total Downloads

Downloads (Last 12 months)33
Downloads (Last 6 weeks)3

Reflects downloads up to 10 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

Wen CLi ZJafri SQiu XRao S(2024)P4CGO: Control Plane Guided P4 Program OptimizationProceedings of the 2024 SIGCOMM Workshop on Formal Methods Aided Network Operation10.1145/3672199.3673892(1-7)Online publication date: 4-Aug-2024
https://dl.acm.org/doi/10.1145/3672199.3673892
Xiao YZhao YLin SKuzmanovic A(2024)Snatch: Online Streaming Analytics at the Network EdgeProceedings of the Nineteenth European Conference on Computer Systems10.1145/3627703.3629577(349-369)Online publication date: 22-Apr-2024
https://dl.acm.org/doi/10.1145/3627703.3629577
Kröger NHarkous HMehmeti FKellerer W(2024)Performance Modeling and Analysis of P4 Programmable Devices With General Service TimesIEEE Transactions on Network and Service Management10.1109/TNSM.2024.340481321:4(4543-4562)Online publication date: Aug-2024
https://doi.org/10.1109/TNSM.2024.3404813
Miano SSanaee ARisso FRétvári GAntichi G(2024)Morpheus: A Run Time Compiler and Optimizer for Software Data PlanesIEEE/ACM Transactions on Networking10.1109/TNET.2023.334628632:3(2269-2284)Online publication date: 1-Jun-2024
https://dl.acm.org/doi/10.1109/TNET.2023.3346286
Iliadis-Apostolidis DManaa KKadosh MIoannou IVassiliou VKosta SVegas Olmos J(2024)Towards Accelerating the Network Performance on DPUs by optimising the P4 runtime2024 32nd Euromicro International Conference on Parallel, Distributed and Network-Based Processing (PDP)10.1109/PDP62718.2024.00040(238-244)Online publication date: 20-Mar-2024
https://doi.org/10.1109/PDP62718.2024.00040
Xing JQiu YHsu KSui SManaa KShabtai OPiasetzky YKadosh MKrishnamurthy ANg TChen ASchulzrinne HKohler EMaltz DMisra V(2023)Unleashing SmartNIC Packet Processing Performance in P4Proceedings of the ACM SIGCOMM 2023 Conference10.1145/3603269.3604882(1028-1042)Online publication date: 10-Sep-2023
https://dl.acm.org/doi/10.1145/3603269.3604882
Akarte HYadav D(2023)Packet processing and data plane program verification: A survey with tools, techniques, and challengesInternational Journal of Communication Systems10.1002/dac.555436:14Online publication date: 14-Jun-2023
https://doi.org/10.1002/dac.5554
Luinaud TLanglois JSavaria Y(2022)Symbolic Analysis for Data Plane Programs SpecializationACM Transactions on Architecture and Code Optimization10.1145/355772720:1(1-21)Online publication date: 17-Nov-2022
https://dl.acm.org/doi/10.1145/3557727
Miano SSanaee ARisso FRétvári GAntichi GFalsafi BFerdman MLu SWenisch T(2022)Domain specific run time optimization for software data planesProceedings of the 27th ACM International Conference on Architectural Support for Programming Languages and Operating Systems10.1145/3503222.3507769(1148-1164)Online publication date: 28-Feb-2022
https://dl.acm.org/doi/10.1145/3503222.3507769
Wintermeyer PApostolaki MDietmüller AVanbever LZhao BZheng HMadhyastha HPadmanabhan V(2020)P2GO: P4 Profile-Guided OptimizationsProceedings of the 19th ACM Workshop on Hot Topics in Networks10.1145/3422604.3425941(146-152)Online publication date: 4-Nov-2020
https://dl.acm.org/doi/10.1145/3422604.3425941
Show More Cited By

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents