Skip to main content
Back to USENIX
  • Conferences
  • Students
Sign in

USENIX Conference Policies

  • Event Code of Conduct
  • Conference Network Policy
  • Statement on Environmental Responsibility Policy

Interposed Request Routing for Scalable Network Storage

This paper explores interposed request routing in Slice, a new storage system architecture for high-speed networks incorporating network- attached block storage. Slice interposes a request switching filter— called a µproxy —along each client's network path to the storage service (e.g., in a network adapter or switch). The µproxy intercepts request traffic and distributes it across a server ensemble. We propose request routing schemes for I/O and file service traffic, and explore their effect on service structure. The Slice prototype uses a packet lter µproxy to virtualize the standard Network File System (NFS) protocol, presenting to NFS clients a unified shared file volume with scalable bandwidth and capacity. Experimental results from the industry- standard SPECsfs97 workload demonstrate that the architecture enables construction of powerful network-attached storage services by aggregating cost-effective components on a switched Gigabit Ethernet LAN.

Darrell Anderson, Duke University

Jeff Chase, Duke University

Amin Vahdat, Duke University

BibTeX
@inproceedings {271161,
author = {Darrell Anderson and Jeff Chase and Amin Vahdat},
title = {Interposed Request Routing for Scalable Network Storage},
booktitle = {Fourth Symposium on Operating Systems Design and Implementation (OSDI 2000)},
year = {2000},
address = {San Diego, CA },
url = {https://www.usenix.org/conference/osdi-2000/interposed-request-routing-scalable-network-storage},
publisher = {USENIX Association},
month = oct
}
Download

Links

Paper: 
http://www.usenix.org/events/osdi2000/full_papers/andersonchase/andersonchase.pdf
  • Log in or register to post comments

© USENIX
EIN 13-3055038

  • Privacy Policy
  • Contact Us