Challenging the Stateless Quo of Programmable Switches
© 2020 ACM. Programmable switches based on the Protocol Independent Switch Architecture (PISA) have greatly enhanced the flexibility of today's networks by allowing new packet protocols to be deployed without any hardware changes. They have also been instrumental in enabling a new computing par...
| Main Authors: | , , , , , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | English |
| Published: |
ACM
2022
|
| Online Access: | https://hdl.handle.net/1721.1/143564 |
| _version_ | 1826214404285267968 |
|---|---|
| author | Gebara, Nadeen Lerner, Alberto Yang, Mingran Yu, Minlan Costa, Paolo Ghobadi, Manya |
| author2 | Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory |
| author_facet | Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory Gebara, Nadeen Lerner, Alberto Yang, Mingran Yu, Minlan Costa, Paolo Ghobadi, Manya |
| author_sort | Gebara, Nadeen |
| collection | MIT |
| description | © 2020 ACM. Programmable switches based on the Protocol Independent Switch Architecture (PISA) have greatly enhanced the flexibility of today's networks by allowing new packet protocols to be deployed without any hardware changes. They have also been instrumental in enabling a new computing paradigm in which parts of an application's logic run within the network core (in-network computing). The characteristics and requirements of in/-network applications, however, are quite different from those of packet protocols for which programmable switches were originally designed. Packet protocols are typically stateless, while in-network applications require frequent operations on shared state maintained in the switch. This mismatch increases the developing complexity of in-network computing and hampers widespread adoption. In this paper, we describe the key obstacles to developing in-network applications on PISA and propose rethinking the current switch architecture. Rather than changing the existing architecture, we propose augmenting it with a Stateful Data Plane (SDP). The SDP supports the requirements of stateful applications, while the conventional data plane (CDP) performs packet-protocol functions. |
| first_indexed | 2024-09-23T16:04:53Z |
| format | Article |
| id | mit-1721.1/143564 |
| institution | Massachusetts Institute of Technology |
| language | English |
| last_indexed | 2024-09-23T16:04:53Z |
| publishDate | 2022 |
| publisher | ACM |
| record_format | dspace |
| spelling | mit-1721.1/1435642023-02-13T20:44:40Z Challenging the Stateless Quo of Programmable Switches Gebara, Nadeen Lerner, Alberto Yang, Mingran Yu, Minlan Costa, Paolo Ghobadi, Manya Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory © 2020 ACM. Programmable switches based on the Protocol Independent Switch Architecture (PISA) have greatly enhanced the flexibility of today's networks by allowing new packet protocols to be deployed without any hardware changes. They have also been instrumental in enabling a new computing paradigm in which parts of an application's logic run within the network core (in-network computing). The characteristics and requirements of in/-network applications, however, are quite different from those of packet protocols for which programmable switches were originally designed. Packet protocols are typically stateless, while in-network applications require frequent operations on shared state maintained in the switch. This mismatch increases the developing complexity of in-network computing and hampers widespread adoption. In this paper, we describe the key obstacles to developing in-network applications on PISA and propose rethinking the current switch architecture. Rather than changing the existing architecture, we propose augmenting it with a Stateful Data Plane (SDP). The SDP supports the requirements of stateful applications, while the conventional data plane (CDP) performs packet-protocol functions. 2022-06-27T18:24:47Z 2022-06-27T18:24:47Z 2020 2022-06-27T17:55:36Z Article http://purl.org/eprint/type/ConferencePaper https://hdl.handle.net/1721.1/143564 Gebara, Nadeen, Lerner, Alberto, Yang, Mingran, Yu, Minlan, Costa, Paolo et al. 2020. "Challenging the Stateless Quo of Programmable Switches." HotNets 2020 - Proceedings of the 19th ACM Workshop on Hot Topics in Networks. en 10.1145/3422604.3425928 HotNets 2020 - Proceedings of the 19th ACM Workshop on Hot Topics in Networks Creative Commons Attribution-Noncommercial-Share Alike http://creativecommons.org/licenses/by-nc-sa/4.0/ application/pdf ACM MIT web domain |
| spellingShingle | Gebara, Nadeen Lerner, Alberto Yang, Mingran Yu, Minlan Costa, Paolo Ghobadi, Manya Challenging the Stateless Quo of Programmable Switches |
| title | Challenging the Stateless Quo of Programmable Switches |
| title_full | Challenging the Stateless Quo of Programmable Switches |
| title_fullStr | Challenging the Stateless Quo of Programmable Switches |
| title_full_unstemmed | Challenging the Stateless Quo of Programmable Switches |
| title_short | Challenging the Stateless Quo of Programmable Switches |
| title_sort | challenging the stateless quo of programmable switches |
| url | https://hdl.handle.net/1721.1/143564 |
| work_keys_str_mv | AT gebaranadeen challengingthestatelessquoofprogrammableswitches AT lerneralberto challengingthestatelessquoofprogrammableswitches AT yangmingran challengingthestatelessquoofprogrammableswitches AT yuminlan challengingthestatelessquoofprogrammableswitches AT costapaolo challengingthestatelessquoofprogrammableswitches AT ghobadimanya challengingthestatelessquoofprogrammableswitches |