| dc.contributor.author | Gebara, Nadeen | |
| dc.contributor.author | Lerner, Alberto | |
| dc.contributor.author | Yang, Mingran | |
| dc.contributor.author | Yu, Minlan | |
| dc.contributor.author | Costa, Paolo | |
| dc.contributor.author | Ghobadi, Manya | |
| dc.date.accessioned | 2022-06-27T18:24:47Z | |
| dc.date.available | 2022-06-27T18:24:47Z | |
| dc.date.issued | 2020 | |
| dc.identifier.uri | https://hdl.handle.net/1721.1/143564 | |
| dc.description.abstract | © 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. | en_US |
| dc.language.iso | en | |
| dc.publisher | ACM | en_US |
| dc.relation.isversionof | 10.1145/3422604.3425928 | en_US |
| dc.rights | Creative Commons Attribution-Noncommercial-Share Alike | en_US |
| dc.rights.uri | http://creativecommons.org/licenses/by-nc-sa/4.0/ | en_US |
| dc.source | MIT web domain | en_US |
| dc.title | Challenging the Stateless Quo of Programmable Switches | en_US |
| dc.type | Article | en_US |
| dc.identifier.citation | 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. | |
| dc.contributor.department | Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory | |
| dc.relation.journal | HotNets 2020 - Proceedings of the 19th ACM Workshop on Hot Topics in Networks | en_US |
| dc.eprint.version | Author's final manuscript | en_US |
| dc.type.uri | http://purl.org/eprint/type/ConferencePaper | en_US |
| eprint.status | http://purl.org/eprint/status/NonPeerReviewed | en_US |
| dc.date.updated | 2022-06-27T17:55:36Z | |
| dspace.orderedauthors | Gebara, N; Lerner, A; Yang, M; Yu, M; Costa, P; Ghobadi, M | en_US |
| dspace.date.submission | 2022-06-27T17:55:38Z | |
| mit.license | OPEN_ACCESS_POLICY | |
| mit.metadata.status | Authority Work and Publication Information Needed | en_US |