Show simple item record

dc.contributor.authorGebara, Nadeen
dc.contributor.authorLerner, Alberto
dc.contributor.authorYang, Mingran
dc.contributor.authorYu, Minlan
dc.contributor.authorCosta, Paolo
dc.contributor.authorGhobadi, Manya
dc.date.accessioned2022-06-27T18:24:47Z
dc.date.available2022-06-27T18:24:47Z
dc.date.issued2020
dc.identifier.urihttps://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.isoen
dc.publisherACMen_US
dc.relation.isversionof10.1145/3422604.3425928en_US
dc.rightsCreative Commons Attribution-Noncommercial-Share Alikeen_US
dc.rights.urihttp://creativecommons.org/licenses/by-nc-sa/4.0/en_US
dc.sourceMIT web domainen_US
dc.titleChallenging the Stateless Quo of Programmable Switchesen_US
dc.typeArticleen_US
dc.identifier.citationGebara, 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.departmentMassachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
dc.relation.journalHotNets 2020 - Proceedings of the 19th ACM Workshop on Hot Topics in Networksen_US
dc.eprint.versionAuthor's final manuscripten_US
dc.type.urihttp://purl.org/eprint/type/ConferencePaperen_US
eprint.statushttp://purl.org/eprint/status/NonPeerRevieweden_US
dc.date.updated2022-06-27T17:55:36Z
dspace.orderedauthorsGebara, N; Lerner, A; Yang, M; Yu, M; Costa, P; Ghobadi, Men_US
dspace.date.submission2022-06-27T17:55:38Z
mit.licenseOPEN_ACCESS_POLICY
mit.metadata.statusAuthority Work and Publication Information Neededen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record