UsenetDHT: A low-overhead design for Usenet (2009)
Emil Sit, Robert Morris, M. Frans Kaashoek
Usenet is a popular distributed messaging and file sharing service: servers in Usenet flood articles over an overlay network to fully replicate articles across all servers. However, replication of...
Benjie Chen, Kyle Jamieson, Hari Balakrishnan, Robert Morris
Abstract This paper presents Span, a power saving technique for multi-hop ad hoc wireless networks that reduces energy consumption without significantly diminishing the capacity or connectivity of...
Corey: An Operating System for Many Cores (2009)
Ong Mao, Frans Kaashoek, Robert Morris, Aleksey Pesterev, Lex Stein, Ming Wu, ...
Multiprocessor application performance can be limited by the operating system when the application uses the operating system frequently and the operating system services use data structures shared...
Bryan Ford, Jacob Strauss, Chris Lesniewski-laas, Sean Rhea, Frans Kaashoek, Robert Morris
The Unmanaged Internet Architecture (UIA) provides zero-configuration connectivity among mobile devices through personal names. Users assign personal names through an ad hoc device introduction...
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...
Bootstrap percolation in high dimensions (2009)
Balogh, Jozsef, Bollobas, Bela, Morris, Robert
In r-neighbour bootstrap percolation on a graph G, a set of initially infected vertices A \subset V(G) is chosen independently at random, with density p, and new vertices are subsequently infected if...
Shadows of ordered graphs (2009)
Bollobas, Bela, Brightwell, Graham, Morris, Robert
We investigate the possible sub-linear speeds of a hereditary property of ordered graphs, P. Balogh, Bollobas and Morris showed that if |P_k| < k for some k \in \N, then the speed |P_n| is eventually...
The structure of almost all graphs in a hereditary property (2009)
Alon, Noga, Balogh, Jozsef, Bollobas, Bela, Morris, Robert
A hereditary property of graphs is a collection of graphs which is closed under taking induced subgraphs. The speed of \P is the function n \mapsto |\P_n|, where \P_n denotes the graphs of order n in...
Kumar, Sanjeev, Bryant, Christopher S, Chamala, Sreedhar, Qazi, Aamer, Seward, Shelly, Pal, Jagannath, ...
Abstract Background Ovarian cancer is the leading cause of mortality from gynecological malignancies, often undetectable in early stages. The difficulty of detecting the disease in its early stages...
Distributed Spanning Tree Routing (GDSTR), that finds (2009)
Ben Leong, Barbara Liskov, Robert Morris
We present a new geographic routing algorithm, Greedy
Abstract Ivy: A Read/Write Peer-to-Peer File System (2009)
Athicha Muthitacharoen, Robert Morris, Thomer M. Gil, Benjie Chen
Ivy is a multi-user read/write peer-to-peer file system. Ivy has no centralized or dedicated components, and it provides useful integrity properties without requiring users to fully trust either the...
Jinyang Li, Jeremy Stribling, Robert Morris, M. Frans Kaashoek, Thomer M. Gil
performance vs. cost framework for evaluating
Abstract Bandwidth-efficient management of DHT routing tables (2008)
Jinyang Li, Jeremy Stribling, Robert Morris, M. Frans Kaashoek
Today an application developer using a distributed hash table (DHT) with n nodes must choose a DHT protocol from the spectrum between O(1) lookup protocols [9, 18] and O(log n) protocols...
Operating R. Stockton Gaines Systems Editor Password Security: (2008)
This paper describes the history of the design of the password security scheme on a remotely accessed time-sharing system. The present design was the result of countering observed attempts to...
MAJORITY BOOTSTRAP PERCOLATION ON THE HYPERCUBE (2008)
József Balogh, Béla Bollobás, Robert Morris
Abstract. In majority bootstrap percolation on a graph G, an infection spreads according to the following deterministic rule: if at least half of the neighbours of a vertex v are already infected,...
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 Architecture and Evaluation of an Unplanned 802.11b Mesh Network (2008)
John Bicket, Daniel Aguayo, Sanjit Biswas, Robert Morris
This paper evaluates the ability of a wireless mesh architecture to provide high performance Internet access while demanding little deployment planning or operational management. The architecture...
Abstract Resilient Overlay Networks (2008)
David Andersen, Hari Balakrishnan, Frans Kaashoek, Robert Morris
A Resilient Overlay Network (RON) is an architecture that allows distributed Internet applications to detect and recover from path outages and periods of degraded performance within several seconds,...
Jinyang Li, Jeremy Stribling, Robert Morris, M. Frans Kaashoek, Thomer M. Gil
performance vs. cost framework for evaluating
Robert Morris, Eddie Kohler, John Jannotti, M. Frans Kaashoek
Click is a new software architecture for building flexible and configurable routers. A Click router is assembled from packet processing modules called elements. Individual elements implement simple...
Local Search for Optimal Global Map Generation Using Mid-Decadal Landsat Images (2008)
Lina Khatib, John Gasch, Robert Morris, Steven Covington
NASA and the US Geological Survey (USGS) are seeking to generate a map of the entire globe using Landsat 5 Thematic Mapper (TM) and Landsat 7 Enhanced Thematic Mapper Plus (ETM+) sensor data from the...
Abstract Capacity of Ad Hoc Wireless Networks (2008)
Jinyang Li, Charles Blake, Couto Hu, Imm Lee, Robert Morris
Early simulation experience with wireless ad hoc networks suggests that their capacity can be surprisingly low, due to the requirement that nodes forward each others ’ packets. The achievable...
Abstract Bandwidth-efficient management of DHT routing tables (2008)
Jinyang Li, Jeremy Stribling, Robert Morris, M. Frans Kaashoek
Today an application developer using a distributed hash table (DHT) with n nodes must choose a DHT protocol from the spectrum between O(1) lookup protocols [9, 18] and O(log n) protocols...
Max Krohn, Alex Yip, Micah Brodsky, Natan Cliffer, Frans Kaashoek, Eddie Kohler, ...
• Attackers find and exploit these bugs • Data is stolen / Corrupted – “USAJobs.gov hit by Monster.com attack, 146,000 people affected” – “UN Website is Defaced via SQL Injection” –...
The Expandable Network Disk (2008)
Athicha Muthitacharoen, Robert Morris, M. Frans Kaashoek
Many organizations posses large data sets that need to be online but do not require the highest possible performance. It often makes sense to store this data on low-end commodity servers or on idle...
Abstract Middleboxes No Longer Considered Harmful ∗ (2008)
Michael Walfish, Jeremy Stribling, Maxwell Krohn, Hari Balakrishnan, Robert Morris, Scott Shenker
Intermediate network elements, like network address translators (NATs), firewalls, and transparent caches are now commonplace. The usual reaction in the network architecture community to these...
Abstract Resilient Overlay Networks (2008)
David Andersen, Hari Balakrishnan, Frans Kaashoek, Robert Morris
A Resilient Overlay Network (RON) is an architecture that allows distributed Internet applications to detect and recover from path outages and periods of degraded performance within several seconds,...
ABSTRACT Architecture and Evaluation of an Unplanned 802.11b Mesh Network (2008)
John Bicket, Daniel Aguayo, Sanjit Biswas, Robert Morris
This paper evaluates the ability of a wireless mesh architecture to provide high performance Internet access while demanding little deployment planning or operational management. The architecture...
Discrete-Space Lagrangian Optimization for Multi-Objective Temporal Planning ∗ (2008)
Benjamin W. Wah, Yixin Chen, Robert Morris
In this paper, we study multi-objective temporal planning problems in discrete time and space formulated as single-objective dynamic optimization problems with a minimax objective function. We...
Abstract A Scalable Location Service for Geographic Ad Hoc Routing (2008)
Jinyang Li, John Jannotti, Couto David, R. Karger, Robert Morris
GLS is a new distributed location service which tracks mobile node locations. GLS combined with geographic forwarding allows the construction of ad hoc mobile networks that scale to a larger number...
Jinyang Li, Jeremy Stribling, Robert Morris, M. Frans Kaashoek, Thomer M. Gil
performance vs. cost framework for evaluating
Abstract Bandwidth-efficient management of DHT routing tables (2008)
Jinyang Li, Jeremy Stribling, Robert Morris, M. Frans Kaashoek
Today an application developer using a distributed hash table (DHT) with n nodes must choose a DHT protocol from the spectrum between O(1) lookup protocols [9, 18] and O(log n) protocols...
Abstract Resilient Overlay Networks (2008)
David Andersen, Hari Balakrishnan, Frans Kaashoek, Robert Morris
A Resilient Overlay Network (RON) is an architecture that allows distributed Internet applications to detect and recover from path outages and periods of degraded performance within several seconds,...
Abstract Bandwidth-efficient management of DHT routing tables (2008)
Jinyang Li, Jeremy Stribling, Robert Morris, M. Frans Kaashoek
Today an application developer using a distributed hash table (DHT) with n nodes must choose a DHT protocol from the spectrum between O(1) lookup protocols [9, 18] and O(log n) protocols...
The Click, Robert Morris, Eddie Kohler, John Jannotti, M. Frans Kaashoek
Abstract Click is a new software architecture for building flexible and configurable routers. A Click router is assembled from packet processing modules called elements. Individual elements implement...
Abstract A Scalable Location Service for Geographic Ad Hoc Routing (2008)
Jinyang Li, John Jannotti, Couto David, R. Karger, Robert Morris
GLS is a new distributed location service which tracks mobile node locations. GLS combined with geographic forwarding allows the construction of ad hoc mobile networks that scale to a larger number...
Abstract Modular Components for Network Address Translation (2008)
Eddie Kohler, Robert Morris, Massimiliano Poletto
We present a general-purpose toolkit for network address translation in a modular, component-based networking system. Network address translation is a powerful, general technique for building network...
ABSTRACT Architecture and Evaluation of the MIT Roofnet Mesh Network (DRAFT) (2008)
John Bicket, Sanjit Biswas, Daniel Aguayo, Robert Morris
This paper describes the design and performance of Roofnet, an 802.11b mesh network for Internet access. Roofnet consists of more than 40 nodes spread over an eight square kilometer urban area. Its...
Sameer Ajmani, Advisors Barbara Liskov, Robert Morris
Methods and infrastructures for building secure, robust, and evolvable distributed systems. 2002 – Automatic Software Upgrades for Distributed Systems MIT For my PhD research, I am designing and...
Abstract Don’t Give Up on Distributed File Systems (2008)
Jeremy Stribling, Emil Sit, M. Frans Kaashoek, Jinyang Li, Robert Morris
Wide-area distributed applications often reinvent the wheel for their storage needs, each incorporating its own special-purpose storage manager to cope with distribution, intermittent failures,...
Geographic Routing without Planarization (2008)
Ben Leong Barbara, Barbara Liskov, Robert Morris
We present a new geographic routing algorithm, Greedy Distributed Spanning Tree Routing (GDSTR), that finds shorter routes and generates less maintenance traffic than previous algorithms. While...
Computer systems, with specific interests in networking, programming languages, and operating systems. Also, user interfaces and graphic design.
(reformatted) The Click modular router (2007)
Robert Morris, Eddie Kohler, John Jannotti, M. Frans Kaashoek
Click is a new software architecture for building flexible and configurable routers. A Click router is assembled from packet processing modules called elements. Individual elements implement simple...
Implementation of an Activity Coordination System (2007)
An activity coordination system helps its users describe, guide, and monitor processes in which they are involved. The activity coordination system described here is based on a formalism suited to...
Workshop Summary Kasparov vs. Big Blue: The Significance for Artificial Intelligence (2007)
Robert Morris Cs, Robert Morris
econd, and its evaluation function, which was the primary source of improvement in its performance between the 1996 match with Kasparov, and the match this year. In addressing the themes of the...
Brent Venable, Prof Aless, Robert Morris
Machine Learning. I have graduated in mathematichs with a thesis that combines elements from both elds since it presents conceptual description and implementation of a solver for a special class of...
LOOKING UP DATA in P2P Systems � By Hari Balakrishnan, (2007)
M. Frans Kaashoek, David Karger, Robert Morris, Ion Stoica
The main challenge in P2P computing is to design and implement a robust and scalable distributed system composed of inexpensive, individually unreliable computers in unrelated administrative domains....
1 DNS Performance and the Effectiveness of Caching (2007)
Jaeyeon Jung, Emil Sit, Hari Balakrishnan, Robert Morris
Abstract--- This paper presents a detailed analysis of traces of DNS and associated TCP traffic collected on the Internet links of the MIT Laboratory for Computer Science and the Korea Advanced...
Abstract Ivy: A Read/Write Peer-to-Peer File System (2007)
Athicha Muthitacharoen, Robert Morris, Thomer M. Gil, Benjie Chen
Ivy is a multi-user read/write peer-to-peer file system. Ivy has no centralized or dedicated components, and it provides useful integrity properties without requiring users to fully trust either the...
Benjie Chen, Thomer M. Gil, Athicha Muthitacharoen, Robert Morris
Structured peer-to-peer distributed hash tables (DHTs) provide a
General Temporal Knowledge for Planning and Data Mining (2007)
We consider the architecture of systems that combine temporal planning and plan execution and introduce a layer of temporal reasoning that potentially improves both the communication between humans...
Abstract Introducing Tarzan, a Peer-to-Peer Anonymizing Network Layer (2007)
Michael J. Freedman, Emil Sit, Josh Cates, Robert Morris
We introduce Tarzan, a peer-to-peer anonymous network layer that provides generic IP forwarding. Unlike prior anonymizing layers, Tarzan is flexible, transparent, decentralized, and highly scalable....
MIT-LCS-TR-819 Chord: A scalable peer-to-peer lookup service for Internet applications Ion (2007)
Robert Morris, David Karger, M. Frans Kaashoek, Hari Balakrishnan
Efficiently determining the node that stores a data item in a distributed network is an important and challenging problem. This paper describes the motivation and design of the Chord �system, a...
Abstract Effects of Loss Rate on Ad Hoc Wireless Routing (2007)
Couto Daniel, Aguayo Benjamin, A. Chambers, Robert Morris
This paper uses measurements from two deployed wireless ad hoc networks to illustrate the effects of link loss rates on routing protocol performance. Measurements of these networks show that the...
Abstract Effects of Loss Rate on Ad Hoc Wireless Routing (2007)
Couto Daniel, Aguayo Benjamin, A. Chambers, Robert Morris
This paper uses measurements from two deployed wireless ad hoc networks to illustrate the effects of link loss rates on routing protocol performance. Measurements of these networks show that the...
Chord: A scalable peer-to-peer lookup service for Internet applications (2007)
L Lscal, L L Appl, Ion Stoica Robert, Ion Stoica, Robert Morris, David Karger, ...
Efficiently determining the node that stores a data item in a distributed network is an important and challenging problem. This paper describes the motivation and design of the Chord system, a...
Effects of Loss Rate on Ad Hoc Wireless Routing (2007)
Couto Daniel, Aguayo Benjamin, A. Chambers, Robert Morris
This paper uses measurements from two deployed wireless ad hoc networks to illustrate the effects of link loss rates on routing protocol performance. Measurements of these networks show that the...
Performance of Multihop Wireless Networks: Shortest Path is Not Enough (2007)
Couto Daniel, Aguayo Benjamin, A. Chambers, Robert Morris
Existing wireless ad hoc routing protocols typically find routes with the minimum hop-count. This paper presents experimental evidence from two wireless test-beds which shows that there are usually...
Abstract Resilient Overlay Networks (2007)
David Andersen, Hari Balakrishnan, Frans Kaashoek, Robert Morris
A Resilient Overlay Network (RON) is an architecture that allows distributed Internet applications to detect and recover from path outages and periods of degraded performance within several seconds,...
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...
Û�Ö��Ò � � � � � ÓÒ�� × � ÓÓÖ��Ò�ØÓÖ �� � ÒÓ� � ��×� × �Ø × � � � (2007)
Benjie Chen, Kyle Jamieson, Hari Balakrishnan, Robert Morris
The Internet Domain Name System (DNS) is a distributed, hierarchical and flexible system for the mapping of names to matching resource records. Caching was designed into the DNS to improve response...
Technology Square Room, Eddie Kohler, Robert Morris
Click is a new software architecture for building flexible and configurable routers. A Click router is assembled from packet processing modules called elements. Individual elements implement simple...
Alpaca: extensible authorization for distributed services (2007)
Chris Lesniewski-laas, Bryan Ford, Jacob Strauss, Robert Morris, M. Frans Kaashoek
Traditional Public Key Infrastructures (PKI) have not lived up to their promise because there are too many ways to define PKIs, too many cryptographic primitives to build them with, and too many...
Alpaca: extensible authorization for distributed services (2007)
Chris Lesniewski-laas, Bryan Ford, Jacob Strauss, Robert Morris, M. Frans Kaashoek
Traditional Public Key Infrastructures (PKI) have not lived up to their promise because there are too many ways to define PKIs, too many cryptographic primitives to build them with, and too many...
A World Wide Web Without Walls (2007)
Maxwell Krohn, Alex Yip, Micah Brodsky, Robert Morris
Today’s Web depends on a particular pact between sites and users: sites invest capital and labor to create and market a set of features, and users gain access to these features by giving up control...
Labels and event processes in the Asbestos operating system (2007)
Steve Vandebogart, Petros Efstathopoulos, Eddie Kohler, Maxwell Krohn, Cliff Frey, David Ziegler, ...
Asbestos, a new operating system, provides novel labeling and isolation mechanisms that help contain the effects of exploitable software flaws. Applications can express a wide range of policies with...
World Wide Web Without Walls (2007)
Micah Brodsky, Maxwell Krohn, Robert Morris, Michael Walfish, Er Yip, Micah Brodsky, ...
Although the Web is ever more interesting, it is still—despite the opinions of gushing commentators— fragmented and insufficient. The Web 2.0 ethos—to acquire, control, and “monetize ”...
Toward Secure Services From Untrusted Developers (2007)
Micah Brodsky, Petros Efstathopoulos, Eddie Kohler, Maxwell Krohn, Robert Morris, Steve Vandebogart, ...
We present a secure service prototype built from untrusted, contributed code. The service manages private data for a variety of different users, and user programs frequently require access to other...
Pastwatch: A distributed version control system (2006)
Er Yip, Benjie Chen, Robert Morris
Pastwatch is a version control system that acts like a traditional client-server system when users are connected to the network; users can see each other’s changes immediately after the changes are...
Persistent personal names for globally connected mobile devices (2006)
Bryan Ford, Jacob Strauss, Chris Lesniewski-laas, Sean Rhea, Frans Kaashoek, Robert Morris
The Unmanaged Internet Architecture (UIA) provides zero-configuration connectivity among mobile devices through personal names. Users assign personal names through an ad hoc device introduction...
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...
User-Relative Names for (2006)
Globally Connected Personal, Bryan Ford, Jacob Strauss, Chris Lesniewski-laas, Sean Rhea, Frans Kaashoek, ...
INTRODUCTION Personal devices such as mobile phones, digital music players, personal digital assistants, console gaming systems, and digital cameras are now ubiquitous in the lives of ordinary...
User-Relative Names for Globally Connected Personal Devices (2006)
Bryan Ford, Jacob Strauss, Chris Lesniewski-laas, Sean Rhea, Frans Kaashoek, Robert Morris
INTRODUCTION Personal devices such as mobile phones, digital music players, personal digital assistants, console gaming systems, and digital cameras are now ubiquitous in the lives of ordinary...
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...
Pastwatch: a Distributed Version Control System (2006)
Alexander Yip Benjie, Er Yip, Benjie Chen, Robert Morris
Pastwatch is a version control system that acts like a traditional client-server system when users are connected to the network; users can see each other's changes immediately after the changes...
User-Relative Names for (2006)
Globally Connected Personal, Bryan Ford, Jacob Strauss, Chris Lesniewski-laas, Sean Rhea, Frans Kaashoek, ...
INTRODUCTION Personal devices such as mobile phones, digital music players, personal digital assistants, console gaming systems, and digital cameras are now ubiquitous in the lives of ordinary...
Persistent Personal Names for Globally Connected Mobile Devices (2006)
Bryan Ford Jacob, Jacob Strauss, Chris Lesniewski-laas, Sean Rhea, Frans Kaashoek, Robert Morris
The Unmanaged Internet Architecture (UIA) provides zero-configuration connectivity among mobile devices through personal names. Users assign personal names through an ad hoc device introduction...
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...
Persistent personal names for globally connected mobile devices (2006)
Bryan Ford, Jacob Strauss, Chris Lesniewski-laas, Sean Rhea, Frans Kaashoek, Robert Morris
The Unmanaged Internet Architecture (UIA) provides zero-configuration connectivity among mobile devices through personal names. Users assign personal names through an ad hoc device introduction...
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...
Overcite: A distributed, cooperative citeseer (2006)
Jeremy Stribling, Jinyang Li, Isaac G. Councill, M. Frans Kaashoek, Robert Morris
CiteSeer is a popular online resource for the computer science research community, allowing users to search and browse a large archive of research papers. CiteSeer is expensive: it generates 35 GB of...
Overcite: A distributed, cooperative citeseer (2006)
Jeremy Stribling, Jinyang Li, Isaac G. Councill, M. Frans Kaashoek, Robert Morris
CiteSeer is a popular online resource for the computer science research community, allowing users to search and browse a large archive of research papers. CiteSeer is expensive: it generates 35 GB of...
Make least privilege a right (not a privilege (2005)
Maxwell Krohn, Petros Efstathopoulos, Cliff Frey, Frans Kaashoek, Eddie Kohler, David Mazières, ...
Though system security would benefit if programmers routinely followed the principle of least privilege [24], the interfaces exposed by operating systems often stand in the way. We investigate why...
Labels and event processes in the asbestos operating system (2005)
Petros Efstathopoulos, Maxwell Krohn, Steve Vandebogart, Cliff Frey, David Ziegler, Eddie Kohler, ...
Asbestos, a new prototype operating system, provides novel labeling and isolation mechanisms that help contain the effects of exploitable software flaws. Applications can express a wide range of...
Make least privilege a right (not a privilege (2005)
Maxwell Krohn, Petros Efstathopoulos, Cliff Frey, Frans Kaashoek, Eddie Kohler, David Mazières, ...
Though system security would benefit if programmers routinely followed the principle of least privilege [24], the interfaces exposed by operating systems often stand in the way. We investigate why...
ExOR: Opportunistic Multi-Hop Routing for Wireless Networks (2005)
This paper describes ExOR, an integrated routing and MAC protocol that increases the throughput of large unicast transfers in multi-hop wireless networks. ExOR chooses each hop of a packet’s route...
Opportunistic Routing in Multi-Hop Wireless Networks (2005)
This paper describes Extremely Opportunistic Routing (ExOR), a new unicast routing technique for multi-hop wireless networks. ExOR forwards each packet through a sequence of nodes, deferring the...
Opportunistic Routing in Multi-Hop Wireless Networks (2005)
This paper describes Extremely Opportunistic Routing (ExOR), a new unicast routing technique for multi-hop wireless networks. ExOR forwards each packet through a sequence of nodes, deferring the...
OverCite: A Cooperative Digital Research Library (2005)
Jeremy Stribling, Isaac G. Councill, Jinyang Li, M. Frans Kaashoek, David R. Karger, Robert Morris, ...
CiteSeer is a well-known online resource for the computer science research community, allowing users to search and browse a large archive of research papers. Unfortunately, its current centralized...
Overcite: A cooperative digital research library (2005)
Jeremy Stribling, Isaac G. Councill, Jinyang Li, M. Frans Kaashoek, David R. Karger, Robert Morris, ...
CiteSeer is a well-known online resource for the computer science research community, allowing users to search and browse a large archive of research papers. Unfortunately, its current centralized...
Routing Tradeoffs in Dynamic Peer-to-peer Networks (2005)
Distributed Hash Tables (DHTs) are useful tools for building large scale distributed systems. DHTs provide a hash-table-like interface to applications by routing a key to its responsible node among...
Overcite: A cooperative digital research library (2005)
Jeremy Stribling, Isaac G. Councill, Jinyang Li, M. Frans Kaashoek, David R. Karger, Robert Morris, ...
Abstract CiteSeer is a well-known online resource for the com-puter science research community, allowing users to search and browse a large archive of research papers. Unfortunately, its cur-rent...
ExOR: Opportunistic Multi-Hop Routing for Wireless Networks (2005)
This paper describes ExOR, an integrated routing and MAC protocol that increases the throughput of large unicast transfers in multi-hop wireless networks. ExOR chooses each hop of a packet’s route...
Etna: a fault-tolerant algorithm for atomic mutable dht data (2005)
Athicha Muthitacharoen, Athicha Muthitacharoen, Seth Gilbert, Seth Gilbert, Robert Morris, Robert Morris
This paper presents Etna, an algorithm for atomic reads and writes of replicated data stored in a distributed hash table. Etna correctly handles dynamically changing sets of replica hosts, and is...
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...
Strategies for global optimization of temporal preferences (2004)
Paul Morris, Robert Morris, Lina Khatib, Sailesh Ramakrishnan, Andrew Bachmann, Kestrel Technology
Abstract. A temporal reasoning problem can often be naturally characterized as a collection of constraints with associated local preferences for times that make up the admissible values for those...
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...
Middleboxes no longer considered harmful (2004)
Michael Walfish, Jeremy Stribling, Maxwell Krohn, Hari Balakrishnan, Robert Morris, Scott Shenker
Intermediate network elements, such as network address translators (NATs), firewalls, and transparent caches are now commonplace. The usual reaction in the network architecture community to these...
Link-level measurements from an 802.11b mesh network (2004)
Daniel Aguayo, John Bicket, Sanjit Biswas, Glenn Judd, Robert Morris
This paper analyzes the causes of packet loss in a 38-node urban multi-hop 802.11b network. The patterns and causes of loss are important in the design of routing and errorcorrection protocols, as...
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...
Comparing the Performance of Distributed Hash Tables Under Churn (2004)
Jinyang Li Jeremy, Jeremy Stribling, Thomer M. Gil, Robert Morris, M. Frans Kaashoek
A protocol for a distributed hash table (DHT) incurs communication costs to keep up with churn---changes in membership---in order to maintain its ability to route lookups efficiently. This paper...
Middleboxes No Longer Considered Harmful (2004)
Michael Walfish Jeremy, Jeremy Stribling, Maxwell Krohn, Hari Balakrishnan, Robert Morris, Scott Shenker
Intermediate network elements, such as network address translators (NATs), firewalls, and transparent caches are now commonplace. The usual reaction in the network architecture community to these...
Link-level measurements from an 802.11b mesh network (2004)
Daniel Aguayo, John Bicket, Sanjit Biswas, Glenn Judd, Robert Morris
This paper analyzes the causes of packet loss in a 38-node urban multi-hop 802.11b network. The patterns and causes of loss are important in the design of routing and errorcorrection protocols, as...
A Model for Analyzing the Roles of Network and User Behavior in Congestion Control (2004)
Despite the Web-driven exponential growth in traffic volume, the Internet has not suffered widespread congestion collapse. Much credit for this robustness goes to TCP's congestion control...
Vivaldi: A Decentralized Network Coordinate System (2004)
Frank Dabek Russ, Russ Cox, Frans Kaashoek, Robert Morris, Cambridge Ma
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...
Comparing the Performance of Distributed Hash Tables Under Churn (2004)
Jinyang Li Jeremy, Jeremy Stribling, Thomer M. Gil, Robert Morris, M. Frans Kaashoek
A protocol for a distributed hash table (DHT) incurs communication costs to keep up with churn---changes in membership---in order to maintain its ability to route lookups efficiently. This paper...
Electronic Field Guides and User Communities in the Eco-informatics Revolution (2003)
Stevenson, R. D.; University Of Massachusetts Boston; Robert.stevenson@umb.edu, Haber, William A; Missouri Botanical Garden; Whaber@racsa.co.cr, Morris, Robert; UMASS Boston; Ram@cs.umb.edu
The recognition that taxonomy is central to the conservation of biodiversity has reestablished the critical role of taxonomy in biology. However, many of the tools taxonomists produce for the...
Electronic Field Guides and User Communities in the Eco-Informatics Revolution (2003)
Stevenson, R. D., Haber, William A., Morris, Robert
"The recognition that taxonomy is central to the conservation of biodiversity has reestablished the critical role of taxonomy in biology. However, many of the tools taxonomists produce for the...
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...
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...
Certifying program execution with secure processors (2003)
Cerium is a trusted computing architecture that protects a program's execution from being tampered while the program is running. Cerium uses a physically tamperresistant CPU and a-kernel to...
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...
On the Feasibility of Peer-to-Peer Web Indexing and Search (2003)
Jinyang Li, Boon Thau, Loo Joseph, M. Hellerstein, M. Frans Kaashoek, David Karger, ...
This paper discusses the feasibility of peer-to-peer full-text keyword search of the Web. Two classes of keyword search techniques are in use or have been proposed: flooding of queries over an...
A model for analyzing the roles of network and user behavior in congestion control (2003)
Despite the Web-driven exponential growth in traffic volume, the Internet has not suffered a congestion collapse. Much credit for this robustness goes to TCP's congestion control mechanisms....
Building Data Structures on Untrusted Peer-to-Peer Storage with Perparticipant Logs (2003)
Benjie Chen, Thomer M. Gil, Athicha Muthitacharoen, Robert Morris
L ∗ is a technique for building multi-user distributed data structures out of untrusted peer-to-peer distributed hash tables (DHTs). L ∗ uses multiple logs, one log per participant, to store...
Building Data Structures on Untrusted Peer-to-Peer Storage with Perparticipant Logs (2003)
Benjie Chen, Thomer M. Gil, Athicha Muthitacharoen, Robert Morris
L ∗ is a technique for building multi-user distributed data structures out of untrusted peer-to-peer distributed hash tables (DHTs). L ∗ uses multiple logs, one log per participant, to store...
Experience with an Evolving Overlay Network Testbed (2003)
David G. Andersen, Hari Balakrishnan, M. Frans Kaashoek, Robert Morris
The MIT RON testbed consists of 36 Internet-connected nodes at 31 different sites. It has been in operation for two years. This paper presents an overview of the testbed, summarizes some of the...
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...
On the Feasibility of Peer-to-Peer Web Indexing and Search (2003)
Jinyang Li Boon, Boon Thau, Loo Joseph, M. Hellerstein, M. Frans Kaashoek, David Karger, ...
This paper discusses the feasibility of peer-to-peer full-text keyword search of the Web. Two classes of keyword search techniques are in use or have been proposed: flooding of queries over an...
Looking Up Data In P2p Systems (2003)
Hari Balakrishnan Frans, M. Frans Kaashoek, David Karger, Robert Morris, Ion Stoica
this article discusses four recent P2P lookup algorithms that have provable guarantees: CAN, Chord, Pastry, and Tapestry. These algorithms stress the ability to scale well to large numbers of nodes,...
On the Feasibility of Peer-to-Peer Web Indexing and Search (2003)
Jinyang Li Boon, Boon Thau, Loo Joseph, M. Hellerstein, M. Frans Kaashoek, David Karger, ...
This paper discusses the feasibility of peer-to-peer full-text keyword search of the Web. Two classes of keyword search techniques are in use or have been proposed: flooding of queries over an...
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....
Looking up data in P2P systems (2003)
Hari Balakrishnan, M. Frans Kaashoek, David Karger, Robert Morris, Ion Stoica
The recent success of some widely deployed peer-to-peer (P2P) file sharing applications has sparked new research in this area. We are interested in the P2P systems that have no centralized control or...
Discrete-Space Lagrangian Optimization for Multi-Objective Temporal Planning (2003)
Benjamin W. Wah, Yixin Chen, Robert Morris
In this paper, we study multi-objective temporal planning problems in discrete time and space formulated as single-objective dynamic optimization problems with a minimax objective function.
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...
Security considerations for peer-to-peer distributed hash tables (2002)
Recent peer-to-peer research has focused on providing efficient hash lookup systems that can be used to build more complex systems. These systems have good properties when their algorithms are...
Ivy: A Read/Write Peer-to-Peer File System (2002)
Athicha Muthitacharoen, Robert Morris, Thomer M. Gil, Benjie Chen
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...
Document clustering for distributed fulltext search (2002)
Recent research efforts in peer-to-peer (P2P) systems concentrate on providing a “distributed hash table”-like primitive in the P2P system (Stoica et al., 2001). However,
Programming language optimizations for modular router configurations (2002)
Eddie Kohler, Robert Morris, Benjie Chen
Networking systems such as Ensemble,the x-kernel,Scout, and Click achieve flexibility by building routers and other packet processors from modular components. Unfortunately, component designs are...
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...
Tarzan: A peer-to-peer anonymizing network layer (2002)
Michael J. Freedman, Emil Sit, Josh Cates, Robert Morris
We introduce Tarzan, a peer-to-peer anonymous network layer that provides generic IP forwarding. Unlike prior anonymizing layers, Tarzan is flexible, transparent, decentralized, and highly scalable....
Modular components for network address translation (2002)
Eddie Kohler, Robert Morris, Massimiliano Poletto
We present a general-purpose toolkit for network address translation in Click, a modular, component-based networking system. Network address translation, or NAT, was designed to allow disparate...
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...
Programming language optimizations for modular router configurations (2002)
Eddie Kohler, Robert Morris, Benjie Chen
Networking systems such as Ensemble, the x-kernel, Scout, and Click achieve flexibility by building routers and other packet processors from modular components. Unfortunately, component designs are...
Tarzan: A peer-to-peer anonymizing network layer (2002)
Michael J. Freedman, Robert Morris
Tarzan is a peer-to-peer anonymous IP network overlay. Because it provides IP service, Tarzan is general-purpose and transparent to applications. Organized as a decentralized peer-to-peer overlay,...
Ivy: A Read/Write Peer-to-Peer File System (2002)
Athicha Muthitacharoen, Robert Morris, Thomer M. Gil, Benjie Chen
Ivy is a multi-user read/write peer-to-peer file system. Ivy has no centralized or dedicated components, and it provides useful integrity properties without requiring users to fully trust either the...
L+: Scalable landmark routing and address lookup for multi-hop wireless networks (2002)
This paper proposes and analyzes modifications to the Landmark routing system that make it better suited to large ad hoc wireless networks. Most existing ad hoc routing algorithms scale badly in the...
Modular components for network address translation (2002)
Eddie Kohler, Robert Morris, Massimiliano Poletto
We present a general-purpose toolkit for network address translation in a modular, component-based networking system. Network address translation is a powerful, general technique for building network...
Al Globus, James Crawford, Jason Lohn, Robert Morris
We describe work in progress concerning multiinstrument, multi-satellite scheduling. Most, although not all, Earth observing instruments currently in orbit are unique. In the relatively near future,...
Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications (2001)
Ion Stoica, Robert Morris, David Karger, M. Frans Kaashoek, Hari Balakrishnan
A fundamental problem that confronts peer-to-peer applications is to efficiently locate the node that stores a particular data item. This paper presents Chord, a distributed lookup protocol that...
Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications (2001)
Ion Stoica, Robert Morris, David Liben-nowell, David Karger, M. Frans, Kaashoek Frank Dabek, ...
A fundamental problem that confronts peer-to-peer applications is to e#ciently locate the node that stores a particular data item. This paper presents Chord, a distributed lookup protocol that...
Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications (2001)
Ion Stoica, Robert Morris, David Liben-nowell, David Karger, M. Frans, Kaashoek Frank Dabek, ...
A fundamental problem that confronts peer-to-peer applications is to efficiently locate the node that stores a particular data item. This paper presents Chord, a distributed lookup protocol that...
Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications (2001)
Ion Stoica, Robert Morris, David Liben-nowell, David Karger, M. Frans, Kaashoek Frank Dabek, ...
A fundamental problem that confronts peer-to-peer applications is to efficiently locate the node that stores a particular data item. This paper presents Chord, a distributed lookup protocol that...
Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications (2001)
Ion Stoica, Robert Morris, David Karger, M. Frans Kaashoek, Hari Balakrishnan
A fundamental problem that confronts peer-to-peer applications is to efficiently locate the node that stores a particular data item. This paper presents Chord, a distributed lookup protocol that...
Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications (2001)
Ion Stoica, Robert Morris, David Liben-nowell, David Karger, M. Frans, Kaashoek Frank Dabek, ...
A fundamental problem that confronts peer-to-peer applications is to efficiently locate the node that stores a particular data item. This paper presents Chord, a distributed lookup protocol that...
Dns performance and the effectiveness of caching (2001)
Jaeyeon Jung, Emil Sit, Hari Balakrishnan, Robert Morris
Abstract—This paper presents a detailed analysis of traces of domain name system (DNS) and associated TCP traffic collected
Location Proxies and Intermediate Node Forwarding for Practical Geographic Forwarding (2001)
Two main problems prevent the deployment of geographic forwarding in real systems: geographic forwarding requires that all nodes know their locations, and it has trouble routing around local dead...
Dns performance and the effectiveness of caching (2001)
Jaeyeon Jung, Emil Sit, Hari Balakrishnan, Robert Morris
associated TCP traffic collected on the Internet links of the MIT Laboratory
Benjie Chen, Kyle Jamieson, Hari Balakrishnan, Robert Morris
Abstract This paper presents Span, a power saving technique for multi-hop ad hoc wireless networks that reduces energy consumption without significantly diminishing the capacity or connectivity of...
Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications (2001)
Ion Stoica, Robert Morris, David Karger, M. Frans Kaashoek, Hari Balakrishnan
A fundamental problem that confronts peer-to-peer applications is to efficiently locate the node that stores a particular data item. This paper presents Chord, a distributed lookup protocol that...
Benjie Chen, Kyle Jamieson, Hari Balakrishnan, Robert Morris
This paper presents Span, a power saving technique for multi-hop ad hoc wireless networks that reduces energy consumption without significantly diminishing the capacity or connectivity of the...
Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications (2001)
Ion Stoica, Robert Morris, David Karger, M. Frans Kaashoek, Hari Balakrishnan
Efficiently determining the node that stores a data item in a distributed network is an important and challenging problem. This paper describes the motivation and design of the Chord system, a...
Location Proxies and Intermediate Node Forwarding for Practical Geographic Forwarding (2001)
Two main problems prevent the deployment of geographic forwarding in real systems: geographic forwarding requires that all nodes know their locations, and it has trouble routing around local dead...
A trusted third-party computation service (2001)
Sameer Ajmani, Robert Morris, Barbara Liskov
We present TEP, a system that supports general-purpose shared computation between mutually-distrusting parties. TEP is useful for applications, such as auctions and tax preparation, that use private...
A trusted third-party computation service (2001)
Sameer Ajmani, Robert Morris, Barbara Liskov
We present TEP, a system that supports general-purpose shared computation between mutually-distrusting parties. TEP is useful for applications, such as auctions and tax preparation, that use private...
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...
Dns performance and the effectiveness of caching (2001)
Jaeyeon Jung, Emil Sit, Hari Balakrishnan, Robert Morris
Abstract---This paper presents a detailed analysis of traces of DNS and associated TCP traffic collected on the Internet
Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications (2001)
Ion Stoica, Robert Morris, David Karger, M. Frans Kaashoek, Hari Balakrishnan
A fundamental problem that confronts peer-to-peer applications is to efficiently locate the node that stores a particular data item. This paper presents Chord, a distributed lookup protocol that...
The case for resilient overlay networks (2001)
David G. Andersen, Hari Balakrishnan, M. Frans Kaashoek, Robert Morris
In this paper, we motivate and describe the architecture of Resilient Overlay Networks (RON), an application-level packet forwarding service that gives end-hosts and applications the ability to take...
Flexible control of parallelism in a multiprocessor PC router (2001)
SMP Click is a software router that provides both flexibility and high performance on stock multiprocessor PC hardware. It achieves high performance using device, buffer, and queue management...
Benjie Chen, Kyle Jamieson, Hari Balakrishnan, Robert Morris
This paper presents Span, a power saving technique for multi-hop ad hoc wireless networks that reduces energy consumption without signicantly diminishing the capacity or connectivity of the network....
Capacity of ad hoc wireless networks (2001)
Jinyang Li, Charles Blake, Couto Hu, Imm Lee, Robert Morris
Early simulation experience with wireless ad hoc networks suggests that their capacity can be surprisingly low, due to the requirement that nodes forward each others ' packets. The achievable...
Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications (2001)
Robert Morris, David Karger, M. Frans Kaashoek, Hari Balakrishnan
A fundamental problem that confronts peer-to-peer applications is to efficiently locate the node that stores a particular data item. This paper presents Chord, a distributed lookup protocol that...
Resilient Overlay Networks (2001)
David Andersen, Hari Balakrishnan, Frans Kaashoek, Robert Morris
A Resilient Overlay Network (RON) is an architecture that allows distributed Internet applications to detect and recover from path outages and periods of degraded performance within several seconds,...
Dns performance and the effectiveness of caching (2001)
Jaeyeon Jung, Emil Sit, Hari Balakrishnan, Robert Morris
Abstract---This paper presents a detailed analysis of traces of DNS and associated TCP traffic collected on the Internet
Location Proxies and Intermediate Node Forwarding for Practical Geographic Forwarding (2001)
Two main problems prevent the deployment of geographic forwarding in real systems: geographic forwarding requires that all nodes know their locations, and it has trouble routing around local dead...
Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications (2001)
Robert Morris, David Karger, M. Frans Kaashoek, Hari Balakrishnan
A fundamental problem that confronts peer-to-peer applications is to efficiently locate the node that stores a particular data item. This paper presents Chord, a distributed lookup protocol that...
Resilient Overlay Networks (2001)
David Andersen Hari, David Andersen, Hari Balakrishnan, Frans Kaashoek, Robert Morris
A Resilient Overlay Network (RON) is an architecture that allows distributed Internet applications to detect and recover from path outages and periods of degraded performance within several seconds,...
Dynamic Physical Layers For Wireless Networks Using Software Radio (2001)
Vanu Bose, Roger Hu, Robert Morris, Vanu Inc, Cambridge Ma
The communication parameters in mobile ad-hoc networks, such as the distance between nodes, channel characteristics, and user demands can vary quickly. Using traditional design techniques and...
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...
The Case for Resilient Overlay Networks (2001)
David Andersen Hari, David G. Andersen, Hari Balakrishnan, M. Frans Kaashoek, Robert Morris
This paper makes the case for Resilient Overlay Networks (RONs), an application-level routing and packet forwarding service that gives end-hosts and applications the ability to take advantage of...
Resilient Overlay Networks (2001)
David Andersen Hari, David Andersen, Hari Balakrishnan, Frans Kaashoek, Robert Morris
A Resilient Overlay Network (RON) is an architecture that allows distributed Internet applications to detect and recover from path outages and periods of degraded performance within several seconds,...
Dns performance and the effectiveness of caching (2001)
Jaeyeon Jung, Emil Sit, Hari Balakrishnan, Robert Morris
Abstract—This paper presents a detailed analysis of traces of DNS and associated TCP traffic collected on the Internet
The case for resilient overlay networks (2001)
David G. Andersen, Hari Balakrishnan, M. Frans Kaashoek, Robert Morris
This paper makes the case for Resilient Overlay Networks (RONs), an application-level routing and packet forwarding service that gives end-hosts and applications the ability to take advantage of...
Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications (2001)
Ion Stoica, Robert Morris, David Karger, M. Frans Kaashoek, Hari Balakrishnan
A fundamental problem that confronts peer-to-peer applications is to efficiently locate the node that stores a particular data item. This paper presents Chord, a distributed lookup protocol that...
Dns performance and the effectiveness of caching (2001)
Jaeyeon Jung, Emil Sit, Hari Balakrishnan, Robert Morris
Abstract—This paper presents a detailed analysis of traces of DNS and associated TCP traffic collected on the Internet
Planning and Scheduling for Fleets of Earth Observing Satellites (2001)
Jeremy Frank, Ari Jónsson, Robert Morris, David E. Smith
We address the problem of scheduling observations for a collection of earth observing satellites. This scheduling task is a difficult optimization problem, potentially involving many satellites,...
Dynamic Physical Layers For Wireless Networks Using Software Radio (2001)
Vanu Bose, Vanu Inc, Cambridge Ma, Roger Hu, Robert Morris
The communication parameters in mobile ad-hoc networks, such as the distance between nodes, channel characteristics, and user demands can vary quickly. Using traditional design techniques and...
Temporal Constraint Reasoning with Preferences (2001)
Lina Khatib, Robert Morris, Robert Morris, Francesca Rossi
A number of reasoning problems involving the manipulation of temporal information can be viewed as implicitly inducing an ordering of decisions involving time (associated with durations or orderings...
Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications (2001)
Ion Stoica, Robert Morris, David Karger, M. Frans Kaashoek, Hari Balakrishnan
Efficiently determining the node that stores a data item in a distributed network is an important and challenging problem. This paper describes the motivation and design of the Chord system, a...
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...
Dns performance and the effectiveness of caching (2001)
Jaeyeon Jung, Emil Sit, Hari Balakrishnan, Robert Morris
associated TCP traffic collected on the Internet links of the MIT Laboratory
Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications (2001)
Ion Stoica, Robert Morris, David Karger, M. Frans Kaashoek, Hari Balakrishnan Ý
A fundamental problem that confronts peer-to-peer applications is to efficiently locate the node that stores a particular data item. This paper presents Chord, a distributed lookup protocol that...
The click modular router (2000)
Eddie Kohler, Robert Morris, Benjie Chen, John Jannotti, M. Frans Kaashoek
Click is a new software architecture for building flexible and configurable routers. A Click router is assembled from packet processing modules called elements. Individual elements implement simple...
Programming language techniques for modular router configurations (2000)
Eddie Kohler, Benjie Chen, M. Frans Kaashoek, Robert Morris, Massimiliano Poletto
This paper applies programming language techniques to a high-level system description, both to optimize the system and to prove useful properties about it. The system in question is Click, a modular...
The click modular router (2000)
Eddie Kohler, Robert Morris, Benjie Chen, John Jannotti, M. Frans Kaashoek
Click is a new software architecture for building flexible and configurable routers. A Click router is assembled from packet processing modules called elements. Individual elements implement simple...
The click modular router (2000)
Eddie Kohler, Robert Morris, Benjie Chen, John Jannotti, M. Frans Kaashoek
Click is a new software architecture for building flexible and configurable routers. A Click router is assembled from packet processing modules called elements. Individual elements implement simple...
The Click Modular Router (2000)
Eddie Kohler, Robert Morris, Benjie Chen, John Jannotti, M. Frans Kaashoek
ing with credit is permitted. To copy otherwise, to republish, to post on servers, to redistribute to lists, or to use any component of this work in other works, requires prior specific permission...
Programming Language Techniques for Modular Router Configurations (2000)
Eddie Kohler, Benjie Chen, M. Frans Kaashoek, Robert Morris, Massimiliano Poletto
This paper applies programming language techniques to a high-level system description, both to optimize the system and to prove useful properties about it. The system in question is Click, a modular...
Variance of Aggregated Web Traffic (2000)
If data traffic were Poisson, increases in the amount of traffic aggregated on a network would rapidly decrease the relative size of bursts. The discovery of pervasive long-range dependence...
Variance of Aggregated Web Traffic (2000)
Robert Morris Mit, Robert Morris, Dong Lin
If data traffic were Poisson, increases in the amount of traffic aggregated on a network would rapidly decrease the relative size of bursts. The discovery of pervasive long-range dependence...
A Scalable Location Service for Geographic Ad Hoc Routing (2000)
Jinyang Li, John Jannotti, David R. Karger, Robert Morris
GLS is a new distributed location service which tracks mobile node locations. GLS combined with geographic forwarding allows the construction of ad hoc mobile networks that scale to a larger number...
CarNet: A Scalable Ad Hoc Wireless Network System (2000)
Robert Morris, John Jannotti, Frans Kaashoek, Jinyang Li, Douglas Decouto
CarNet is an application for a large ad hoc mobile network system that scales well without requiring a xed network infrastructure to route messages. CarNet places radio nodes in cars, which...
Modular Components for Network Address Translation (2000)
Eddie Kohler Robert, Robert Morris, Massimiliano Poletto
We present a general-purpose toolkit for network address translation in Click, a modular, component-based networking system. Network address translation, or NAT, was designed to allow disparate...
The click modular router (2000)
Robert Morris, Eddie Kohler, John Jannotti, M. Frans Kaashoek
Click is a new software architecture for building flexible and configurable routers. A Click router is assembled from packet processing modules called elements. Individual elements implement simple...
Scalable TCP Congestion Control (2000)
The packet losses imposed by IP networks can cause long and erratic recovery delays, since senders must often use conservative loss detection and retransmission mechanisms. This paper proposes a...
The click modular router (2000)
Eddie Kohler, Robert Morris, Benjie Chen, John Jannotti, M. Frans Kaashoek
Click is a new software architecture for building flexible and configurable routers. A Click router is assembled from packet processing modules called elements. Individual elements implement simple...
Scalable TCP Congestion Control (2000)
The packet losses imposed by IP networks can cause long and erratic recovery delays, since senders must often use conservative loss detection and retransmission mechanisms. This paper proposes a...
A Scalable Location Service for Geographic (2000)
Robert Morris, Arthur C. Smith, Ad Hoc Routing, Jinyang Li, Jinyang Li
GLS is a new distributed location service which tracks mobile node locations. GLS combined with geographic forwarding allows the construction of ad hoc mobile networks that scale to a larger number...
The click modular router (2000)
Eddie Kohler, Robert Morris, Benjie Chen, John Jannotti, M. Frans Kaashoek
Click is a new software architecture for building flexible and configurable routers. A Click router is assembled from packet processing modules called elements. Individual elements implement simple...
The Click Modular Router (1999)
Robert Morris, Eddie Kohler, John Jannotti, M. Frans Kaashoek
Click is a new software architecture for building flexible and configurable routers. A Click router is assembled from packet processing modules called elements. Individual elements implement simple...
Scalable TCP Congestion Control (1999)
The packet losses imposed by IP networks can cause long and erratic recovery delays, since senders must often use conservative loss detection and retransmission mechanisms. This paper proposes a...
The Click modular router (1999)
Robert Morris Eddie, Robert Morris, Eddie Kohler, John Jannotti, M. Frans Kaashoek
Click is a new software architecture for building flexible and configurable routers. A Click router is assembled from packet processing modules called elements. Individual elements implement simple...
Scalable TCP Congestion Control (1999)
Robert Morris Harvard, Robert Morris
The packet losses imposed by IP networks can cause long and erratic recovery delays, since senders must often use conservative loss detection and retransmission mechanisms. This paper proposes a...
The Click modular router (1999)
Robert Morris Eddie, Robert Morris, Eddie Kohler, John Jannotti, M. Frans Kaashoek
Click is a new software architecture for building flexible and configurable routers. A Click router is assembled from packet processing modules called elements. Individual elements implement simple...
†UNIX is a Trademark of Bell Laboratories. DC − An Interactive Desk Calculator (1997)
Robert Morris, Lorinda Cherry, Robert Morris, Lorinda Cherry
DC is an interactive desk calculator program implemented on the UNIX† time-sharing system to do arbitrary-precision integer arithmetic. It has provision for manipulating scaled fixed-point numbers...
Thesis title: Prolac: a language for protocol compilation (1997)
Research interests Computer systems, with specific interests in networking, programming languages, and operating systems. Also, user interfaces and graphic design. Experience Research assistant –...
Dynamics of Random Early Detection (1997)
Dong Lin, Dong Lin, Robert Morris, Robert Morris
In this paper we evaluate the effectiveness of Random Early Detection (RED) over traffic types categorized as nonadaptive, fragile and robust, according to their responses to congestion. We point out...
Thesis title: Prolac: a language for protocol compilation (1997)
Research interests Computer systems, with specific interests in networking, programming languages, and operating systems. Also, user interfaces and graphic design. Experience Research assistant –...
Air Pollution and Hospital Admissions for Cardiovascular Disease in Detroit, Michigan (1995)
Schwartz, Joel, Morris, Robert
In the December 1952 smog disaster in London, a substantial increase in mortality was closely associated with the increase in air pollution. Deaths from cardiovascular causes were elevated as well as...
Credit-Based Flow Control for ATM Networks (1994)
Congestion control ensures that network resources are divided fairly and efficiently among competing connections. Although congestion control has been studied by researchers for a long time, very...
Credit-Based Flow Control for ATM Networks (1994)
Congestion control ensures that network resources are divided fairly and efficiently among competing connections. Although congestion control has been studied by researchers for a long time, very...
Challenges of Aging in Tomorrow's World: Will Gerontology Grow, Stagnate, or Change? (1989)
What impact will social, economic, and political trends have over the next decade on services, policies, and research for the elderly? The author predicts that declining confidence in Social...
Concluding Remarks: Consequences of the Demographic Revolution (1987)
The conseqences of the demographic revolution are only beginning to have a social impact. The presenters solicited for the Ollie Randall Symposium examined how the major institutions of society are...
The Elderly As Surplus People: Is There a Role for Higher Education? (1986)
Morris, Robert, Bass, Scott A.
This paper examines the role of the able elderly in an aging society. The capacity of older people to serve as an economic and social resource is discussed. A proposal to develop a secondary labor...
An Arbitrary Precision Desk-Calculator Language (1984)
Lorinda Cherry, Lorinda Cherry, Robert Morris, Robert Morris
BC is a language and a compiler for doing arbitrary precision arithmetic on the PDP-11 under the UNIX+ time-sharing system. The output of the compiler is interpreted and executed by a collection of...
Password security: A case history (1979)
This paper describes the history of the design of the password security scheme on a remotely accessed time-sharing system. The present design was the result of countering observed attempts to...
Password security: A case history (1979)
This paper describes the history of the design of the password security scheme on a remotely accessed time-sharing system. The present design was the result of countering observed attempts to...
Password security: A case history (1979)
This paper describes the history of the design of the password security scheme on a remotely accessed time-sharing system. The present design was the result of countering observed attempts to...
Password security: A case history (1979)
This paper describes the history of the design of the password security scheme on a remotely accessed time-sharing system. The present design was the result of countering observed attempts to...
Password Security: A Case History (1979)
Robert Morris Ken, Robert Morris, Ken Thompson
This paper describes the history of the design of the password security scheme on a remotely accessed time-sharing system. The present design was the result of countering observed attempts to...
Password Security: A Case History (1979)
This paper describes the history of the design of the password security scheme on a remotely accessed time-sharing system. The present design was the result of countering observed attempts to...
Password Security: A Case History (1979)
Robert Morris Ken, Robert Morris, Ken Thompson
INTRODUCTION Password security on the UNIX+ time-sharing system [1] is provided by a collection of programs whose elaborate and strange design is the outgrowth of many years of experience with...
Password Security: A Case History (1979)
This paper describes the history of the design of the password security scheme on a remotely accessed time-sharing system. The present design was the result of countering observed attempts to...
Password Security: A Case History (1979)
Robert Morris, Robert Morris, Ken Thompson, Ken Thompson
This paper describes the history of the design of the password security scheme on a remotely accessed time-sharing system. The present design was the result of countering observed attempts to...
Password security: A case history (1979)
Robert Morris, Robert Morris, Ken Thompson, Ken Thompson
This paper describes the history of the design of the password security scheme on a remotely accessed time-sharing system. The present design was the result of countering observed attempts to...
An Interactive Desk Calculator (1978)
Robert Morris, Robert Morris, Lorinda Cherry, Lorinda Cherry
DC is an interactive desk calculator program implemented on the UNIX+ timesharing system to do arbitrary-precision integer arithmetic. It has provision for manipulating scaled fixed-point numbers and...
The Development of Parallel Services for the Elderly and Disabled Some Financial Dimensions (1974)
Development of at-home and community care for the disabled has been frustrated by a combination of myths about the costs of at-home care and by a neglect of maintenance in favor of treatment in...
Alternatives to Institutional Care for the Elderly and Disabled (1972)
Studies in Massachusetts and elsewhere have found a significant number of elderly and handicapped persons confined to nursing homes although they are not in need of sheltered nursing care. Lack of...
three aluminum-painted canvas panels joined in the back to form a square, with five inlays of Sculptmetal, zinc photographic plates and lead; sculpmetal, oil, zinc photographic plate, lead plate and...