Chord: A scalable peer-to-peer lookup protocol for internet applications (2009)
Ion Stoica, Robert Morris, David Liben-nowell, David R. Karger, M. Frans Kaashoek, Frank Dabek, ...
A fundamental problem that confronts peer-to-peer applications is the efficient location of the node that stores a desired data item. This paper presents Chord, a distributed lookup protocol that...
Abstract Wide-area cooperative storage with CFS (2008)
Frank Dabek, M. Frans Kaashoek, David Karger, Robert Morris, Ion Stoica
The Cooperative File System (CFS) is a new peer-to-peer readonly storage system that provides provable guarantees for the efficiency, robustness, and load-balance of file storage and retrieval. CFS...
Abstract Multiprocessor Support for Event-Driven Programs (2008)
Nickolai Zeldovich, Er Yip, Frank Dabek, Robert T. Morris, David Mazières, Frans Kaashoek
This paper presents a new asynchronous programming library (libasync-smp) that allows event-driven applications to take advantage of multiprocessors by running code for event handlers in parallel. To...
Abstract Multiprocessor Support for Event-Driven Programs (2007)
Nickolai Zeldovich, Er Yip, Frank Dabek, Robert T. Morris, David Mazières, Frans Kaashoek
This paper presents a new asynchronous programming library (libasync-smp) that allows event-driven applications to take advantage of multiprocessors by running code for event handlers in parallel. To...
Frank Dabek, Ben Zhao, Peter Druschel, John Kubiatowicz
In this paper, we describe an ongoing effort to define common APIs for structured peer-to-peer overlays and the key abstractions that can be built on them. In doing so, we hope to facilitate...
Frank Dabek, Ben Zhao, Peter Druschel, John Kubiatowicz
In this paper, we describe an ongoing effort to define common APIs for structured peer-to-peer overlays and the key abstractions that can be built on them. In doing so, we hope to facilitate...
Abstract Multiprocessor Support for Event-Driven Programs (2007)
Nickolai Zeldovich, Er Yip, Frank Dabek, Robert T. Morris, David Mazières, Frans Kaashoek
This paper presents a new asynchronous programming library (libasync-smp) that allows event-driven applications to take advantage of multiprocessors by running code for event handlers in parallel. To...
Abstract Wide-area cooperative storage with CFS (2007)
Frank Dabek, M. Frans Kaashoek, David Karger, Robert Morris, Ion Stoica
The Cooperative File System (CFS) is a new peer-to-peer readonly storage system that provides provable guarantees for the efficiency, robustness, and load-balance of file storage and retrieval. CFS...
Towards a Common API for Structured (2007)
Frank Dabek, Ben Zhao, Peter Druschel, John Kubiatowicz
In this paper, we describe an ongoing effort to define common APIs for structured peer-to-peer overlays and the key abstractions that can be built on them. In doing so, we hope to facilitate...
Efficient replica maintenance for distributed storage systems (2006)
Byung-gon Chun, Frank Dabek, Andreas Haeberlen, Emil Sit, Hakim Weatherspoon, M. Frans Kaashoek, ...
This paper considers replication strategies for storage systems that aggregate the disks of many nodes spread over the Internet. Maintaining replication in such systems can be prohibitively...
Efficient replica maintenance for distributed storage systems (2006)
Byung-gon Chun, Frank Dabek, Andreas Haeberlen, Emil Sit, Hakim Weatherspoon, M. Frans Kaashoek, ...
This paper considers replication strategies for storage systems that aggregate the disks of many nodes spread over the Internet. Maintaining replication in such systems can be prohibitively...
Proactive Replication for Data Durability (2006)
Emil Sit Andreas, Andreas Haeberlen, Frank Dabek, Byung-gon Chun, Hakim Weatherspoon, Robert Morris, ...
Many wide-area storage systems replicate data for durability. A common way of maintaining the replicas is to detect node failures and respond by creating additional copies of objects that were stored...
Efficient Replica Maintenance for Distributed Storage Systems (2006)
Byung-gon Chun, Frank Dabek, Andreas Haeberlen, Emil Sit, Hakim Weatherspoon, ...
This paper considers replication strategies for storage systems that aggregate the disks of many nodes spread over the Internet. Maintaining replication in such systems can be prohibitively...
Proactive replication for data durability (2006)
Emil Sit, Andreas Haeberlen, Frank Dabek, Byung-gon Chun, Hakim Weatherspoon, Robert Morris, ...
Many wide-area storage systems replicate data for durability. A common way of maintaining the replicas is to detect node failures and respond by creating additional copies of objects that were stored...
Efficient replica maintenance for distributed storage systems (2006)
Byung-gon Chun, Frank Dabek, Andreas Haeberlen, Emil Sit, Hakim Weatherspoon, M. Frans Kaashoek, ...
This paper considers replication strategies for storage systems that aggregate the disks of many nodes spread over the Internet. Maintaining replication in such systems can be prohibitively...
Proactive replication for data durability (2006)
Emil Sit, Andreas Haeberlen, Frank Dabek, Byung-gon Chun, Hakim Weatherspoon, Robert Morris, ...
Many wide-area storage systems replicate data for durability. A common way of maintaining the replicas is to detect node failures and respond by creating additional copies of objects that were stored...
A Distributed Hash Table (2005)
Frank Dabek, M. Frans Kaashoek, C. Smith
DHash is a new system that harnesses the storage and network resources of computers distributed across the Internet by providing a wide-area storage service, DHash. DHash frees applications from...
A Distributed Hash Table (2005)
Frank Dabek, M. Frans Kaashoek, C. Smith
DHash is a new system that harnesses the storage and network resources of computers distributed across the Internet by providing a wide-area storage service, DHash. DHash frees applications from...
Vivaldi: A Decentralized Network Coordinate System (2004)
Frank Dabek, Russ Cox, Frans Kaashoek, Robert Morris
Large-scale Internet applications can benefit from an ability to predict round-trip times to other hosts without having to contact them first. Explicit measurements are often unattractive because the...
Vivaldi: A Decentralized Network Coordinate System (2004)
Frank Dabek, Russ Cox, Frans Kaashoek, Robert Morris
Large-scale Internet applications can benefit from an ability to predict round-trip times to other hosts without having to contact them first. Explicit measurements are often unattractive because the...
Vivaldi: A Decentralized Network Coordinate System (2004)
Frank Dabek, Russ Cox, Frans Kaashoek, Robert Morris
Large-scale Internet applications can benefit from an ability to predict round-trip times to other hosts without having to contact them first. Explicit measurements are often unattractive because the...
Vivaldi: A Decentralized Network Coordinate System (2004)
Frank Dabek, Russ Cox, Frans Kaashoek, Robert Morris
Large-scale Internet applications can benefit from an ability to predict round-trip times to other hosts without having to contact them first. Explicit measurements are often unattractive because the...
Designing a DHT for low latency and high throughput (2004)
Frank Dabek, Jinyang Li, Emil Sit, James Robertson, M. Frans Kaashoek, Robert Morris
Designing a wide-area distributed hash table (DHT) that provides high-throughput and low-latency network storage is a challenge. Existing systems have explored a range of solutions, including...
UsenetDHT: A Low Overhead Usenet Server (2004)
Emil Sit Frank, Frank Dabek, James Robertson
UsenetDHT is a system that reduces the storage and bandwidth resources required to run a Usenet server by spreading the burden of data storage across participants. UsenetDHT distributes data using a...
UsenetDHT: A Low Overhead Usenet Server (2004)
Emil Sit Frank, Frank Dabek, James Robertson
UsenetDHT is a system that reduces the storage and bandwidth resources required to run a Usenet server by spreading the burden of data storage across participants. UsenetDHT distributes data using a...
Towards a common API for structured peer-to-peer overlays (2003)
Frank Dabek, Ben Zhao, Peter Druschel, John Kubiatowicz, Ion Stoica
Abstract. In this paper, we describe an ongoing effort to define common APIs for structured peer-to-peer overlays and the key abstractions that can be built on them. In doing so, we hope to...
Practical, distributed network coordinates (2003)
Russ Cox, Frank Dabek, Frans Kaashoek, Jinyang Li, Robert Morris
ABSTRACT – Vivaldi is a distributed algorithm that assigns synthetic coordinates to Internet hosts, so that the Euclidean distance between two hosts ’ coordinates predicts the network latency...
Towards a common API for structured peer-to-peer overlays (2003)
Frank Dabek, Ben Zhao, Peter Druschel, John Kubiatowicz, Ion Stoica
In this paper, we describe an ongoing effort to define common APIs for structured peer-to-peer overlays and the key abstractions that can be built on them. In doing so, we hope to facilitate...
Multiprocessor support for event-driven programs (2003)
Nickolai Zeldovich, Er Yip, Frank Dabek, Robert T. Morris, David Mazières, Frans Kaashoek
Rights to individual papers remain with the author or the author's employer. Permission is granted for noncommercial reproduction of the work for educational or research purposes. This copyright...
Chord: a scalable peer-to-peer lookup protocol for internet applications (2003)
Ion Stoica, Robert Morris, David Liben-nowell, David R. Karger, M. Frans Kaashoek, Frank Dabek, ...
Abstract—A fundamental problem that confronts peer-to-peer applications is the efficient location of the node that stores a desired data item. This paper presents Chord, a distributed lookup...
Towards a common API for structured peer-to-peer overlays (2003)
Frank Dabek, Ben Zhao, Peter Druschel, John Kubiatowicz, Ion Stoica
In this paper, we describe an ongoing effort to define common APIs for structured peer-to-peer overlays and the key abstractions that can be built on them. In doing so, we hope to facilitate...
Towards a common API for structured peer-to-peer overlays (2003)
Frank Dabek, Ben Zhao, Peter Druschel, John Kubiatowicz
In this paper, we describe an ongoing effort to define common APIs for structured peer-to-peer overlays and the key abstractions that can be built on them. In doing so, we hope to facilitate...
Chord: a scalable peer-to-peer lookup protocol for internet applications (2003)
Ion Stoica, Robert Morris, David Liben-nowell, David R. Karger, M. Frans Kaashoek, Frank Dabek, ...
A fundamental problem that confronts peer-to-peer applications is the efficient location of the node that stores a desired data item. This paper presents Chord, a distributed lookup protocol that...
Chord: a scalable peer-to-peer lookup protocol for internet applications (2003)
Ion Stoica, Robert Morris, David Liben-nowell, David R. Karger, M. Frans Kaashoek, Frank Dabek, ...
A fundamental problem that confronts peer-to-peer applications is the efficient location of the node that stores a desired data item. This paper presents Chord, a distributed lookup protocol that...
Practical, distributed network coordinates (2003)
Russ Cox, Frank Dabek, Frans Kaashoek, Jinyang Li, Robert Morris
ABSTRACT-- Vivaldi is a distributed algorithm that assigns synthetic coordinates to Internet hosts, so that the Euclidean distance between two hosts ' coordinates predicts the network latency...
Practical, Distributed Network Coordinates (2003)
Russ Cox Frank, Frank Dabek, Frans Kaashoek, Jinyang Li, Robert Morris
Vivaldi is a distributed algorithm that assigns synthetic coordinates to Internet hosts, so that the Euclidean distance between two hosts' coordinates predicts the network latency between them....
Towards a common API for structured peer-to-peer overlays (2003)
Frank Dabek, Ben Zhao, Peter Druschel, John Kubiatowicz
In this paper, we describe an ongoing effort to define common APIs for structured peer-to-peer overlays and the key abstractions that can be built on them. In doing so, we hope to facilitate...
Bankable Postage for Network Services (2003)
Martín Abadi, Andrew Birrell, Mike Burrows, Frank Dabek, Ted Wobber
Abstract. We describe a new network service, the “ticket server”. This service provides “tickets ” that a client can attach to a request for a network service (such as sending email or asking...
Bankable Postage for Network Services (2003)
Martín Abadi, Andrew Birrell, Mike Burrows, Frank Dabek, Ted Wobber
Abstract. We describe a new network service, the “ticket server”. This service provides “tickets ” that a client can attach to a request for a network service (such as sending email or asking...
Event-driven programming for robust software (2002)
Frank Dabek, Nickolai Zeldovich, Frans Kaashoek, David Mazieres, Robert Morris
Events are a better means of managing I/O concurrency in server software than threads: events help avoid bugs caused by the unnecessary CPU concurrency introduced by threads. Event-based programs...
Event-driven programming for robust software (2002)
Frank Dabek, Nickolai Zeldovich, Frans Kaashoek, David Mazières, Robert Morris
Events are a better means of managing I/O concurrency in server software than threads: events help avoid bugs caused by the unnecessary CPU concurrency introduced by threads. Event-based programs...
Event-driven programming for robust software (2002)
Frank Dabek, Nickolai Zeldovich, Frans Kaashoek, David Mazières, Robert Morris
Events are a better means of managing I/O concurrency in server software than threads: events help avoid bugs caused by the unnecessary CPU concurrency introduced by threads. Event-based programs...
Wide-area cooperative storage with CFS (2001)
Frank Dabek, M. Frans Kaashoek, David Karger, Robert Morris, Ion Stoica
The Cooperative File System (CFS) is a new peer-to-peer readonly storage system that provides provable guarantees for the efficiency, robustness, and load-balance of file storage and retrieval. CFS...
A Cooperative File System (2001)
M. Frans Kaashoek, Frank Dabek, Frank Dabek
The Cooperative File System (CFS) is a new peer-to-peer read-only storage system that provides provable guarantees for the eciency, robustness, and load-balance of le storage and retrieval. CFS does...
Chord: A Scalable Peer-to-Peer Lookup Protocol for Internet Applications (2001)
Ion Stoica, Robert Morris, David Liben-nowell, David R. Karger, M. Frans Kaashoek, Frank Dabek, ...
A fundamental problem that confronts peer-to-peer applications is the efficient location of the node that stores a desired data item. This paper presents Chord, a distributed lookup protocol that...
Chord: A Scalable Peer-to-peer Lookup Protocol for Internet Applications (2001)
Ion Stoica, Robert Morris, David Liben-Nowell, David R. Karger, M. Frans Kaashoek, Frank Dabek, ...
A fundamental problem that confronts peer-to-peer applications is the efficient location of the node that stores a desired data item. This paper presents Chord, a distributed lookup protocol that...
A New Affect-Perceiving Interface and Its Application to Personalized Music Selection (1998)
Jennifer Healey, Rosalind Picard, Frank Dabek
A wearable computer that perceives and responds to the wearer’s affective state offers a new kind of perceptual interface. Instead of asking the user to continuously select preferences from a menu,...
A New Affect-Perceiving Interface and Its Application to Personalized Music Selection (1998)
Jennifer Healey, Rosalind Picard, Frank Dabek
A wearable computer that perceives and responds to the wearer's affective state offers a new kind of perceptual interface. Instead of asking the user to continuously select preferences from a...