Prism: Proxies without the Pain

Yutaro Hayakawa, Michio Honda, Douglas Santry, Lars Eggert

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract / Description of output

Object storage systems, which store data in a flat name space over multiple storage nodes, are essential components for providing data-intensive services such as video streaming or cloud backup. Their bottleneck is usually either the compute or the network bandwidth of customer-facing frontend machines, despite much more such capacity being available at backend machines and in the network core. Prism addresses this problem by combining the flexibility and security of traditional frontend proxy architectures with the performance and resilience of modern key-value stores that optimize for small I/O patterns and typically use custom, UDP-based protocols inside a datacenter. Prism uses a novel connection hand-off protocol that takes the advantages of a modern Linux kernel feature and programmable switch, and supports both unencrypted TCP and TLS, and a corresponding API for easy integration into applications. Prism can improve throughput by a factor of up to 3.4 with TLS and by up to 3.7 with TCP, when compared to a traditional frontend proxy architecture.
Original languageEnglish
Title of host publicationProceedings of the 18th USENIX Symposium on Networked Systems Design and Implementation
PublisherUSENIX Association
Pages535 - 549
Number of pages15
ISBN (Print)978-1-939133-21-2
Publication statusPublished - 12 Apr 2021
Event18th USENIX Symposium on Networked Systems Design and Implementation - Boston, United States
Duration: 12 Apr 202114 Apr 2021
https://www.usenix.org/conference/nsdi21

Conference

Conference18th USENIX Symposium on Networked Systems Design and Implementation
Abbreviated titleNSDI 2021
Country/TerritoryUnited States
CityBoston
Period12/04/2114/04/21
Internet address

Fingerprint

Dive into the research topics of 'Prism: Proxies without the Pain'. Together they form a unique fingerprint.

Cite this