Network


Latest external collaboration on country level. Dive into details by clicking on the dots.

Hotspot


Dive into the research topics where Darrell C. Anderson is active.

Publication


Featured researches published by Darrell C. Anderson.


ACM Transactions on Computer Systems | 2002

Interposed request routing for scalable network storage

Darrell C. Anderson; Jeffrey S. Chase; Amin Vahdat

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 clients 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 filter µ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.


acm special interest group on data communication | 2000

SmartBridge: a scalable bridge architecture

Thomas L. Rodeheffer; Chandramohan A. Thekkath; Darrell C. Anderson

As the number of hosts attached to a network increases beyond what can be connected by a single local area network (LAN), forwarding packets between hosts on different LANs becomes an issue. Two common solutions to the forwarding problem are IP routing and spanning tree bridging. IP routing scales well, but imposes the administrative burden of managing subnets and assigning addresses. Spanning tree bridging, in contrast, requires no administration, but often does not perform well in a large network, because too much traffic must detour toward the root of the spanning tree, wasting link bandwidth.


workshop on hot topics in operating systems | 1999

A case for buffer servers

Darrell C. Anderson; Ken Yocum; Jeffrey S. Chase

Faster networks and cheaper storage have brought us to a point where I/O caching servers have an important role in the design of scalable, high-performance file systems. These intermediary I/O servers-or buffer servers-can be deployed at strategic points in the network, interposed between clients and data sources such as standard file servers, Internet data servers and tertiary storage. Their purpose is to provide a fast and incrementally scalable I/O service throughout the network while reducing and smoothing demands on shared data servers and the network backbone. This paper outlines a case for caching buffer servers and addresses some of the key technical challenges in the design of a buffer service. We also describe the role of buffer servers in the Trapeze project, which uses Gbit/s networks as a vehicle for high-speed network I/O.


Cluster Computing | 2002

Failure-Atomic File Access in the Slice Interposed Network Storage System

Darrell C. Anderson; Jeffrey S. Chase

This paper presents a recovery protocol for block I/O operations in Slice, a storage system architecture for high-speed LANs incorporating network-attached block storage. The goal of the Slice architecture is to provide a network file service with scalable bandwidth and capacity while preserving compatibility with off-the-shelf clients and file server appliances. The Slice prototype virtualizes the Network File System (NFS) protocol by interposing a request switching filter at the clients interface to the network storage system. The distributed Slice architecture separates functions typically combined in central file servers, introducing new challenges for failure atomicity. This paper presents a protocol for atomic file operations and recovery in the Slice architecture, and related support for reliable file storage using mirrored striping. Experimental results from the Slice prototype show that the protocol has low cost in the common case, allowing the system to deliver client file access bandwidths approaching gigabit-per-second network speeds.


symposium on operating systems principles | 2001

Managing energy and server resources in hosting centers

Jeffrey S. Chase; Darrell C. Anderson; Prachi N. Thakar; Amin Vahdat; Ronald P. Doyle


usenix annual technical conference | 1998

Cheating the I/O bottleneck: network storage with Trapeze/Myrinet

Darrell C. Anderson; Jeffrey S. Chase; Syam Gadde; Andrew J. Gallatin; Ken Yocum; Michael J. Feeley


usenix symposium on internet technologies and systems | 2003

Anypoint: extensible transport switching on the edge

Ken Yocum; Darrell C. Anderson; Jeffrey S. Chase; Amin Vahdat


IEEE Transactions on Reliability | 2002

Fstress: A Flexible Network File Service Benchmark

Darrell C. Anderson


high performance interconnects | 1999

Network I/O with Trapeze

Jeffrey S. Chase; Darrell C. Anderson; Andrew J. Gallatin; Alvin R. Lebeck; Ken Yocum


high performance distributed computing | 2000

Failure-atomic file access in an interposed network storage system

Darrell C. Anderson; Jeffrey S. Chase

Collaboration


Dive into the Darrell C. Anderson's collaboration.

Top Co-Authors

Avatar
Top Co-Authors

Avatar

Ken Yocum

University of California

View shared research outputs
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar

Anna R. Karlin

University of Washington

View shared research outputs
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Researchain Logo
Decentralizing Knowledge