Quanto: Tracking Energy in Networked Embedded Systems (2009)
Rodrigo Fonseca, Prabal Dutta, Philip Levis, Ion Stoica
We present Quanto, a network-wide time and energy profiler for embedded network devices. By combining well-defined interfaces for hardware power states, fast high-resolution energy metering, and...
Improving MapReduce Performance in Heterogeneous Environments (2009)
Matei Zaharia, Andy Konwinski, Anthony D. Joseph, Y Katz, Ion Stoica
MapReduce is emerging as an important programming model for large-scale data-parallel applications such as web indexing, data mining, and scientific simulation. Hadoop is an open-source...
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...
their valuable feedback. A Policy-aware Switching Layer for Data Centers (2009)
Dilip Antony Joseph, Arsalan Tavakoli, Ion Stoica, Gautam Altekar, Ganesh Ananthanarayanan, Rodrigo Fonseca, ...
personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the...
Access NetworksAccess Networks (2009)
Prof Randy, H. Katzprof, Ion Stoica, Prof David Brillinger, Accessnetwork Operator, Corenetwork Operator, ...
Technological Trend "Service and content providers play an increasing role in the value chain. The dominant part of the revenues moves from the network operator to the content provider. It is...
Stabilizing BGP, Safely (2009)
P. Brighten Godfrey, Matthew Caesar, Ian Haken, Yaron Singer, Scott Shenker, Ion Stoica
Route instability incurs significant load core routers and is widely recognized as a major contributor to data plane unreliability on the Internet. Route flap damping provides some protection against...
ABSTRACT Internet Indirection Infrastructure (2009)
Ion Stoica, Daniel Adkins, Shelley Zhuang, Scott Shenker
Attempts to generalize the Internet’s point-to-point communication abstraction to provide services like multicast, anycast, and mobility have faced challenging technical problems and deployment...
Declarative Networking: Language, Execution and Optimization (2009)
Boon Thau, Loo Tyson, Condie Minos, Garofalakis David, E. Gay, Joseph M. Hellerstein, ...
The networking and distributed systems communities have recently explored a variety of new network architectures, both for applicationlevel overlay networks, and as prototypes for a next-generation...
Karthik Lakshminarayanan, Ion Stoica, Scott Shenker, Karthik Lakshminarayanan, Ion Stoica, Scott Shenker
1 Introduction Taming IP Packet Flooding Attacks (2008)
Karthik Lakshminarayanan, Daniel Adkins, Adrian Perrig, Ion Stoica
Modeling the Adoption of new Network Architectures ABSTRACT (2008)
Dilip Joseph, Nikhil Shetty, John Chuang, Ion Stoica
We propose an economic model based on user utility to study the adoption of new network architectures such as IPv6. We use mathematical analysis and simulation studies to understand the role of...
ABSTRACT Micro Power Meter for Energy Monitoring of Wireless Sensor Networks at Scale (2008)
Xiaofan Jiang, Prabal Dutta, David Culler, Ion Stoica
We present SPOT, a scalable power observation tool that enables in situ measurement of nodal power and energy over a dynamic range exceeding four decades or a temporal resolution of microseconds....
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...
Michael J. Freedman, Karthik Lakshminarayanan, Sean Rhea, Ion Stoica
The most basic functionality of a distributed hash table, or DHT, is to partition a key space across the set of nodes in a distributed system such that all nodes agree on the partitioning. For...
Hertz Foundation. Towards a More Functional and Secure Network Infrastructure Abstract (2008)
Daniel Adkins, Karthik Lakshminarayanan, Adrian Perrig, Ion Stoica, Daniel Adkins, Karthik Lakshminarayanan, ...
We propose an overlay network infrastructure that provides better protection against DoS attacks as well as more functionality than today’s Internet. Our solution is based on three simple...
Router mechanisms designed to achieve fair bandwidth al-locations, like Fair Queueing, have many desirable proper-ties for congestion control in the Internet. However, such mechanisms usually need to...
Brief Announcement: Towards a Secure Indirection Infrastructure ABSTRACT (2008)
Karthik Lakshminarayanan, Daniel Adkins, Adrian Perrig, Ion Stoica
Designing a flexible, yet secure communication infrastructure has long been an elusive goal. Most of the proposals that seek to address the problem of flexibility have opened up the system for new...
ABSTRACT Geographic Routing without Location Information (2008)
Ananth Rao, Sylvia Ratnasamy, Christos Papadimitriou, Scott Shenker, Ion Stoica
For many years, scalable routing for wireless communication systems was a compelling but elusive goal. Recently, several routing algorithms that exploit geographic information (e.g., GPSR) have been...
Abstract Routing as a Service (2008)
Karthik Lakshminarayanan, Ion Stoica, Scott Shenker, Karthik Lakshminarayanan, Ion Stoica, Scott Shenker
Many recent proposals have argued for giving end-hosts control over routing in the network to satisfy the growing demands of applications. However, these proposals either run at an overlay level...
1 Introduction Taming IP Packet Flooding Attacks ∗ (2008)
Karthik Lakshminarayanan, Daniel Adkins, Adrian Perrig, Ion Stoica
One of the major problems faced by Internet hosts is denialof-service
Sylvia Ratnasamy, Scott Shenker, Ion Stoica, Harlan Yu
OTHER INTELLECTUAL PROPERTY RIGHT. Intel products are not intended for use in
Brief Announcement: Towards a Secure Indirection Infrastructure ABSTRACT (2008)
Karthik Lakshminarayanan, Daniel Adkins, Adrian Perrig, Ion Stoica
Designing a flexible, yet secure communication infrastructure has long been an elusive goal. Most of the proposals that seek to address the problem of flexibility have opened up the system for new...
Decoupling Connectivity from Routing (2008)
Karthik Lakshminarayanan, Thomas Anderson, Scott Shenker, Ion Stoica, David Wetherall
To provide routing flexibility, that is, to accommodate various performance and policy goals, routing protocols (such as OSPF and EIGRP) include many complex knobs. Owing to this complexity,...
Abstract Routing as a Service (2008)
Karthik Lakshminarayanan, Ion Stoica, Scott Shenker, Jennifer Rexford
In Internet routing, there is a fundamental tussle between the end users who want control over the end-to-end paths and the Autonomous Systems (ASes) who want control over the flow of traffic through...
Stabilizing BGP, Safely (2008)
P. Brighten Godfrey, Matthew Caesar, Ian Haken, Scott Shenker, Ion Stoica
Route instability is widely recognized as a major problem in the Internet. Core routers are barraged with millions of updates daily, leading to massive infrastructural costs and worsened data-plane...
Abstract Friday: Global Comprehension for Distributed Replay (2008)
Dennis Geels, Gautam Altekar, Petros Maniatis Φ, Timothy Roscoe Φ, Ion Stoica
Debugging and profiling large scale distributed applications is a daunting task. We present Friday, a system for debugging distributed applications that combines deterministic replay of components...
Towards a Next Generation Inter-domain Routing Protocol (2008)
Morley Mao, Scott Shenker, Ion Stoica
After a long period of neglect, there has been a recent resurgence of research on BGP, the current interdomain routing protocol. Some of these papers have
1 Introduction Taming IP Packet Flooding Attacks (2008)
Karthik Lakshminarayanan, Daniel Adkins, Adrian Perrig, Ion Stoica
Why Using the Request Abstraction in Proportional Share Allocation Systems is Useful? (2008)
Kevin Je ay z In the recent years, the proportional share schedulers have emerged as a viable alternative for integrating the new multimedia applications with conventional interactive and batch...
Declarative Networking: Language, Execution and Optimization (2008)
Boon Thau, Loo Tyson, Condie Minos, Garofalakis David, E. Gay, Joseph M. Hellerstein, ...
The networking and distributed systems communities have recently explored a variety of new network architectures, both for applicationlevel overlay networks, and as prototypes for a next-generation...
Sean Rhea, Brighten Godfrey, Brad Karp, John Kubiatowicz, Sylvia Ratnasamy, Scott Shenker, ...
Large-scale distributed systems are hard to deploy, and distributed hash tables (DHTs) are no exception. To lower the barriers facing DHT-based applications, we have created a public DHT service...
Supporting Best-Effort Traffic with Fair Service Curve (2008)
T. S. Eugene, Ng Donpaul, C. Stephens, Ion Stoica, Hui Zhang
Views and conclusions contained in this document are those of the authors and should not be interpreted as representing the official policies, either expressed or implied, of DARPA, NSF, Intel, or...
OverDoSe: A Generic DDoS ProtectionService Using an Overlay Network (2008)
Elaine Shi, Ion Stoica, David Andersenadrian Perrig
Abstract We present the design and implementation of OverDoSe, an overlay network offering genericDDoS protection for targeted sites. OverDoSe clients and servers are isolated at the IP level....
1 Introduction Taming IP Packet Flooding Attacks (2008)
Karthik Lakshminarayanan, Daniel Adkins, Adrian Perrig, Ion Stoica
Abstract Replay Debugging for Distributed Applications (2008)
Dennis Geels, Gautam Altekar, Scott Shenker, Ion Stoica
We have developed a new replay debugging tool, liblog, for distributed C/C++ applications. It logs the execution of deployed application processes and replays them deterministically, faithfully...
ABSTRACT Micro Power Meter for Energy Monitoring of Wireless Sensor Networks at Scale (2008)
Xiaofan Jiang, Prabal Dutta, David Culler, Ion Stoica
We present SPOT, a scalable power observation tool that enables in situ measurement of nodal power and energy over a dynamic range exceeding four decades or a temporal resolution of microseconds....
Why Using the Request Abstraction in Proportional Share Allocation Systems is Useful ? (2008)
Ion Stoica, Hui Zhang, Kevin Jeffay
ion in Proportional Share Allocation Systems is Useful ? Ion Stoica Hui Zhang y Kevin Jeffay z Abstract In the recent years, the proportional share schedulers have emerged as a viable alternative for...
A Policy-aware Switching Layer for Data Centers (2008)
Dilip Antony Joseph, Arsalan Tavakoli, Ion Stoica, Dilip Joseph, Arsalan Tavakoli, Ion Stoica
personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the...
The generalized dominance computation (GDC) problem is stated as follows: Let A = fa 1 ; a 2 ; : : : ; a n g be a set of triplets, i.e. a i = (x i ; y i ; f i ), "! " be a linear order...
Abstract Analyzing P2P Overlays with Recursive Queries (2007)
Boon Thau Loo, Boon Thau Loo, Ryan Huebsch, Ryan Huebsch, Joseph M. Hellerstein, Joseph M. Hellerstein, ...
We explore the utility and execution of recursive queries as an interface for querying distributed network graph structures. To illustrate the power of recursive queries, we give several examples of...
Ion Stoica, Scott Shenker, Hui Zhang
Abstract--- Router mechanisms designed to achieve fair bandwidth allocations, like Fair Queueing, have many desirable properties for congestion control in the Internet. However, such mechanisms...
1 Load Balancing in Structured P2P Systems (2007)
Ananth Rao, Karthik Lakshminarayanan, Sonesh Surana, Richard Karp, Ion Stoica
Most P2P systems that provide a DHT abstraction distribute objects among "peer nodes " by choosing random identifiers for the objects. This could result in an O(log N) imbalance....
Chapter 1 Modeling Communication in Cluster Computing (2007)
Ion Stoica, Florin Sultan, David Keyes
We introduce a model for communication costs in parallel processing environments, called the "hyperbolic model " that generalizes two-parameter dedicated-link models in an...
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 Load Balancing in Structured P2P Systems (2007)
Ananth Rao, Karthik Lakshminarayanan, Sonesh Surana, Richard Karp, Ion Stoica
Most P2P systems that provide a DHT abstraction distribute objects among "peer nodes " by choosing random identifiers for the objects. This could result in an O(log N) imbalance....
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...
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...
We propose the Robust Overlay Architecture for Mobility (2007)
Shelley Zhuang, Kevin Lai, Ion Stoica, Randy Katz, Scott Shenker
MultiChord: A Resilient Namespace Management Protocol (2007)
Nancy Lynch, Nancy Lynch, Ion Stoica, Ion Stoica
MultiChord is a new variant of the Chord namespace management algorithm [7] that includes lightweight mechanisms for accommodating a limited rate of change, specifically, process joins and failures....
Enhancing P2P File-Sharing with an Internet-Scale Query Processor (2007)
Boon Thau, Loo Joseph, M. Hellerstein, Ryan Huebsch, Scott Shenker, Ion Stoica
In this paper, we address the problem of designing a scalable, accurate query processor for peerto-peer filesharing and similar distributed keyword search systems. Using a globally-distributed...
Abstract Customizable Routing with Declarative Queries (2007)
Boon Thau, Loo Joseph, M. Hellerstein, Ion Stoica
To meet the demands of new Internet applications, recent work argues for giving end-hosts more control over routing. To achieve this goal, we propose the use of a recursive query language, which can...
Enhancing P2P File-Sharing with an Internet-Scale Query Processor (2007)
Boon Thau, Loo Joseph, M. Hellerstein, Ryan Huebsch, Scott Shenker, Ion Stoica
In this paper, we address the problem of designing a scalable, accurate query processor for peerto-peer filesharing and similar distributed keyword search systems. Using a globally-distributed...
X-trace: A pervasive network tracing framework (2007)
Rodrigo Fonseca, George Porter, Randy H. Katz, Scott Shenker, Ion Stoica
Modern Internet systems often combine different applications (e.g., DNS, web, and database), span different administrative domains, and function in the context of network mechanisms like tunnels,...
Flush: A reliable bulk transport protocol for multihop wireless networks (2007)
Sukun Kim, Rodrigo Fonseca, Prabal Dutta, Arsalan Tavakoli, David Culler, Philip Levis, ...
We present Flush, a reliable, high goodput bulk data transport protocol for wireless sensor networks. Flush provides end-to-end reliability, reduces transfer time, and adapts to time-varying network...
Sharing aggregate computation for distributed queries (2007)
Ryan Huebsch, Minos Garofalakis, Joseph M. Hellerstein, Ion Stoica
An emerging challenge in modern distributed querying is to efficiently process multiple continuous aggregation queries simultaneously. Processing each query independently may be infeasible, so...
Sharing aggregate computation for distributed queries (2007)
Ryan Huebsch, Minos Garofalakis, Joseph M. Hellerstein, Ion Stoica
An emerging challenge in modern distributed querying is to efficiently process multiple continuous aggregation queries simultaneously. Processing each query independently may be infeasible, so...
EFLoW: End-to-end Fairness using Local Weights in Wireless Networks (2007)
Ananth Rao, Ion Stoica, Ananth Rao
personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the...
Flush: A reliable bulk transport protocol for multihop wireless networks (2007)
Sukun Kim, Rodrigo Fonseca, Prabal Dutta, Arsalan Tavakoli, David E. Culler, Philip Levis, ...
personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the...
X-trace: A pervasive network tracing framework (2007)
Rodrigo Fonseca, George Porter, Randy H. Katz, Scott Shenker, Ion Stoica
Modern Internet systems often combine different applications (e.g., DNS, web, and database), span different administrative domains, and function in the context of network mechanisms like tunnels,...
Modeling the Adoption of new Network Architectures (2007)
Dilip Antony Joseph, John Chuang, Ion Stoica, Dilip Joseph, John Chuang, Ion Stoica
personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the...
Friday: Global comprehension for distributed replay (2007)
Dennis Geels, Gautam Altekar, Petros Maniatis Φ, Timothy Roscoe, Ion Stoica
Debugging and profiling large-scale distributed applications is a daunting task. We present Friday, a system for debugging distributed applications that combines deterministic replay of components...
Sharing aggregate computation for distributed queries (2007)
Ryan Huebsch, Minos Garofalakis, Joseph M. Hellerstein, Ion Stoica
An emerging challenge in modern distributed querying is to efficiently process multiple continuous aggregation queries simultaneously. Processing each query independently may be infeasible, so...
Securing user-controlled routing infrastructures (2007)
Karthik Lakshminarayanan, Daniel Adkins, Adrian Perrig, Ion Stoica
Abstract—Designing infrastructures that give untrusted thirdparties (such as end-hosts) control over routing is a promising research direction for achieving flexible and efficient communication....
X-trace: A pervasive network tracing framework (2007)
Rodrigo Fonseca, George Porter, Randy H. Katz, Scott Shenker, Ion Stoica
Modern Internet systems often combine different applications (e.g., DNS, web, and database), span different administrative domains, and function in the context of network mechanisms like tunnels,...
Achieving convergence-free routing using failure-carrying packets (2007)
Karthik Kalambur Lakshminarayanan, Matthew Chapman Caesar, Murali Rangan, Thomas Anderson, Scott Shenker, Ion Stoica, ...
personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the...
06131 Executive Summary -- Peer-to-Peer-Systems and -Applications (2007)
Joseph, Anthony D., Steinmetz, Ralf, Stoica, Ion, Wehrle, Klaus
This is the executive summary of Dagstuhl Seminar 06131, "Peer-to-Peer-Systems and ââ¬âApplications". The seminar was held from March 26th to March 29th, 2006, at the International...
06131 Abstracts Collection -- Peer-to -Peer -Systems and -Applications (2007)
Joseph, Anthony D., Steinmetz, Ralf, Stoica, Ion, Wehrle, Klaus
From 26.03.06 to 29.03.06, the Dagstuhl Seminar 06131 ``Peer-to-Peer-Systems and -Applications'' was held in the International Conference and Research Center (IBFI), Schloss Dagstuhl. During the...
Democratizing Content Distribution (2007)
Michael Joseph Freedman, Great Colleagues, Including Siddhartha Annapureddy, Christina Aperjis, Eric Freudenthal, Maxwell Krohn, ...
brethren to dwell together in unity.” — Psalms 133-1To my future wife Jennifer for her warmth and support and To my brother Daniel for his courage of convictions v Acknowledgments My advisor,...
Declarative Networking: Language, Execution and Optimization (2006)
Loo, Boon Thau, Condie, Tyson, Garofalakis, Minos, Gay, David E, Hellerstein, Joseph M, Maniatis, Petros, ...
The networking and distributed systems communities have recently explored a variety of new network architectures, both for application-level overlay networks, and as prototypes for a next-generation...
A modular network layer for sensornets (2006)
Cheng Tien Ee, Rodrigo Fonseca, Sukun Kim, Daekyeong Moon, Arsalan Tavakoli, David Culler, ...
An overall sensornet architecture would help tame the increasingly complex structure of wireless sensornet software and help foster greater interoperability between different codebases. A previous...
Declarative Networking: Language, Execution and Optimization (2006)
Boon Thau Loo, Tyson Condie, Minos Garofalakis, Loo Tyson, Condie Minos, Garofalakis David, ...
The networking and distributed systems communities have recently explored a variety of new network architectures, both for applicationlevel overlay networks, and as prototypes for a next-generation...
Group Therapy for Systems: Using link attestations to manage failures (2006)
Michael J. Freedman, Ion Stoica, David Mazieres, Scott Shenker
Managing failures and configuring systems properly are of critical importance for robust distributed services. Unfortunately, protocols offering strong fault-tolerance guarantees are generally too...
Minimizing Churn in Distributed Systems (2006)
P. Brighten Godfrey, Scott Shenker, Ion Stoica
A pervasive requirement of distributed systems is to deal with churn -- change in the set of participating nodes due to joins, graceful leaves, and failures. A high churn rate can increase costs or...
End-host Controlled Multicast Routing (2006)
Karthik Lakshminarayanan, Ananth Rao, Ion Stoica, Scott Shenker
The last decade has seen a deluge of proposals for supporting multicast in the Internet. These proposals can be categorized as either infrastructure-based, with the multicast functionality provided...
ROFL: Routing on Flat Labels (2006)
Matthew Caesar Tyson, Matthew Caesar, Tyson Condie, Jayanthkumar Kannan, Karthik Lakshminarayanan, Ion Stoica, ...
It is accepted wisdom that the current Internet architecture conflates network locations and host identities, but there is no agreement on how a future architecture should distinguish the two. One...
A modular network layer for sensornets (2006)
Cheng Tien Ee, Rodrigo Fonseca, Sukun Kim, Daekyeong Moon, Arsalan Tavakoli, David Culler, ...
An overall sensornet architecture would help tame the increasingly complex structure of wireless sensornet software and help foster greater interoperability between different codebases. A previous...
OCALA: An architecture for supporting legacy applications over overlays (2006)
Dilip Joseph, Jayanth Kannan, Ayumu Kubota, Karthik Lakshminarayanan, Ion Stoica, Klaus Wehrle
In order for overlays and new network architectures to gain real user acceptance, users should be able to leverage overlay functionality without any modifications to their applications and operating...
Overdose: A generic ddos protection service using an overlay network (2006)
Elaine Shi, Ion Stoica, David Andersen, Adrian Perrig
We present the design and implementation of OverDoSe, an overlay network offering generic DDoS protection for targeted sites. OverDoSe clients and servers are isolated at the IP level. Overlay nodes...
Rofl: routing on flat labels (2006)
Matthew Caesar, Tyson Condie, Jayanthkumar Kannan, Karthik Lakshminarayanan, Ion Stoica, Scott Shenker
It is accepted wisdom that the current Internet architecture conflates network locations and host identities, but there is no agreement on how a future architecture should distinguish the two. One...
The design and implementation of a declarative sensor network system (2006)
David Chiyuan Chu, David Chu, Lucian Popa, Lucian Popa, Arsalan Tavakoli, Arsalan Tavakoli, ...
personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the...
OCALA: An architecture for supporting legacy applications over overlays (2006)
Dilip Joseph, Jayanth Kannan, Ayumu Kubota, Karthik Lakshminarayanan, Ion Stoica, Klaus Wehrle
In order for overlays and new network architectures to gain real user acceptance, users should be able to leverage overlay functionality without any modifications to their applications and operating...
Implementing Declarative Overlays (2005)
Loo, Boon Thau, Condie, Tyson, Hellerstein, Joseph M, Maniatis, Petros, Roscoe, Timothy, Stoica, Ion
Overlay networks are used today in a variety of distributed systems ranging from file-sharing and storage systems to communication infrastructures. However, designing, building and adapting these...
Declarative Routing: Extensible Routing with Declarative Queries (2005)
Loo, Boon Thau, Hellerstein, Joseph M, Stoica, Ion, Ramakrishnan, Raghu
The Internet's core routing infrastructure, while arguably robust and efficient, has proven to be difficult to evolve to accommodate the needs of new applications. Prior research on this problem has...
The Architecture of PIER: an Internet-Scale Query Processor (2005)
Huebsch, Ryan, Chun, Brent, Hellerstein, Joseph M, Loo, Boon Thau, Maniatis, Petros, Roscoe, Timothy, ...
Beacon vector routing: Scalable point-to-point routing in wireless sensornets (2005)
Rodrigo Fonseca, Rodrigo Fonseca, Sylvia Ratnasamy, Sylvia Ratnasamy, David Culler, David Culler, ...
This paper proposes a practical and scalable technique for point-to-point routing in wireless sensornets. This method, called Beacon Vector Routing (BVR), assigns coordinates to nodes based on the...
Report of the NSF Workshop on Research Challenges in Distributed Computer Systems (2005)
M. Frans, Kaashoek Barbara, Liskov David, Andersen Mike Dahlin, Carla Ellis, Steve Gribble, ...
This report 1 summarizes recommendations from a workshop on research challenges in distributed computer systems, sponsored by the National Science Foundation. A program committee solicited input from...
Declarative Routing: Extensible Routing with Declarative queries (2005)
Boon Thau, Loo Joseph, M. Hellerstein, Ion Stoica, Raghu Ramakrishnan
The Internet’s core routing infrastructure, while arguably robust and efficient, has proven to be difficult to evolve to accommodate the needs of new applications. Prior research on this problem...
Yong Xia, Lakshminarayanan Subramanian, Ion Stoica, Shivkumar Kalyanaraman
Achieving efficient and fair bandwidth allocation while minimizing packet loss in high bandwidth-delay product networks has long been a daunting challenge. Existing endto-end congestion control...
IP options are not an option (2005)
Rodrigo Fonseca, George Manning Porter, Randy H. Katz, Scott Shenker, Ion Stoica, Rodrigo Fonseca, ...
personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the...
Analyzing cooperative containment of fast scanning worms (2005)
Jayanthkumar Kannan, Lakshminarayanan Subramanian, Ion Stoica, Y H. Katz
Fast scanning worms, that can infect nearly the entire vulnerable population in order of minutes, are among the most serious threats to the Internet today. In this work, we investigate the efficacy...
Heterogeneity and load balance in distributed hash tables (2005)
P. Brighten Godfrey, Ion Stoica
Abstract — Existing solutions to achieve load balancing in DHTs incur a high overhead either in terms of routing state or in terms of load movement generated by nodes arriving or departing the...
The Architecture of PIER: an Internet-Scale Query Processor (2005)
Ryan Huebsch, Brent Chun, Joseph M. Hellerstein, Boon Thau Loo, Petros Maniatis, Timothy Roscoe, ...
This paper presents the architecture of PIER 1, an Internetscale query engine we have been building over the last three
The Architecture of PIER: an Internet-Scale Query Processor (2005)
Ryan Huebsch, Brent Chun, Joseph M. Hellerstein, Boon Thau Loo, Petros Maniatis, Timothy Roscoe, ...
This paper presents the architecture of PIER , an Internetscale query engine we have been building over the last three years. PIER is the first general-purpose relational query processor targeted at...
The Architecture of PIER: an Internet-Scale Query Processor (2005)
Ryan Huebsch, Brent Chun, Joseph M. Hellerstein, Boon Thau Loo, Petros Maniatis, Timothy Roscoe, ...
This paper presents the architecture of PIER , an Internetscale query engine we have been building over the last three years. PIER is the first general-purpose relational query processor targeted at...
Towards a Sensor Network Architecture: Lowering the Waistline (2005)
David Culler, Prabal Dutta, Cheng Tien Ee, Rodrigo Fonseca, Jonathan Hui, Philip Levis, ...
this paper that the primary factor currently limiting progress in sensornets is not any specific technical challenge (though many remain, and deserve much further study) but is instead the lack of an...
Declarative Routing: Extensible Routing with Declarative Queries (2005)
Boon Thau Loo, Loo Joseph, Joseph M. Hellerstein, Ion Stoica, Raghu Ramakrishnan
The Internet's core routing infrastructure, while arguably robust and e#cient, has proven to be di#cult to evolve to accommodate the needs of new applications. Prior research on this problem has...
Towards a Sensor Network Architecture: Lowering the Waistline (2005)
David Culler, Prabal Dutta, Cheng Tien Ee, Rodrigo Fonseca, Jonathan Hui, Philip Levis, ...
this paper that the primary factor currently limiting research progress in sensornets today is not any specific technical challenge (though many remain, and deserve much further study) but is instead...
The Architecture of PIER: an Internet-Scale Query Processor (2005)
Ryan Huebsch, Brent Chun, Joseph M. Hellerstein, Boon Thau Loo, Petros Maniatis, Timothy Roscoe, ...
This paper presents the architecture of PIER, an Internetscale query engine we have been building over the last three years. PIER is the first general-purpose relational query processor targeted at a...
The Architecture of PIER: an Internet-Scale Query Processor (2005)
Ryan Huebsch Brent, Brent Chun, Joseph M. Hellerstein, Boon Thau Loo, Petros Maniatis, Timothy Roscoe, ...
This paper presents the architecture of PIER , an Internetscale query engine we have been building over the last three years. PIER is the first general-purpose relational query processor targeted at...
OpenDHT: A Public DHT Service and Its Uses (2005)
Sean Rhea Brighten, Sean Rhea, Brighten Godfrey, Brad Karp, John Kubiatowicz, Sylvia Ratnasamy, ...
Large-scale distributed systems are hard to deploy, and distributed hash tables (DHTs) are no exception. To lower the barriers facing DHT-based applications, we have created a public DHT service...
Heterogeneity and Load Balance in Distributed Hash Tables (2005)
P. Brighten Godfrey, Ion Stoica
Existing solutions to balance load in DHTs incur a high overhead either in terms of routing state or in terms of load movement generated by nodes arriving or departing the system. In this paper, we...
Heterogeneity and Load Balance (2005)
In Distributed Hash, P. Brighten Godfrey, Ion Stoica
Existing solutions to achieve load balancing in DHTs incur a high overhead either in terms of routing state or in terms of load movement generated by nodes arriving or departing the system. In this...
A unifying link abstraction for wireless sensor networks (2005)
Joseph Polastre, Jonathan Hui, Philip Levis, Jerry Zhao, David Culler, Scott Shenker, ...
Recent technological advances and the continuing quest for greater efficiency have led to an explosion of link and network protocols for wireless sensor networks. These protocols embody very...
Declarative Routing: Extensible Routing with Declarative queries (2005)
Boon Thau, Loo Joseph, M. Hellerstein, Ion Stoica, Raghu Ramakrishnan
The Internet’s core routing infrastructure, while arguably robust and efficient, has proven to be difficult to evolve to accommodate the needs of new applications. Prior research on this problem...
Yong Xia, Lakshminarayanan Subramanian, Ion Stoica, Shivkumar Kalyanaraman
Achieving efficient and fair bandwidth allocation while minimizing packet loss in high bandwidth-delay product networks has long been a daunting challenge. Existing endto-end congestion control...
Non-transitive connectivity and DHTs (2005)
Michael J. Freedman, Karthik Lakshminarayanan, Sean Rhea, Ion Stoica
The most basic functionality of a distributed hash table, or DHT, is to partition a key space across the set of nodes in a distributed system such that all nodes agree on the partitioning. For...
Beacon vector routing: Scalable point-to-point routing in wireless sensornets (2005)
Rodrigo Fonseca, Sylvia Ratnasamy, Jerry Zhao, Cheng Tien, Ee David, Culler Scott Shenker, ...
We propose a practical and scalable technique for point-to-point routing in wireless sensornets. This method, called Beacon Vector Routing (BVR), assigns coordinates to nodes based on the vector of...
Declarative Routing: Extensible Routing with Declarative queries (2005)
Boon Thau, Loo Joseph, M. Hellerstein, Ion Stoica, Raghu Ramakrishnan
The Internet’s core routing infrastructure, while arguably robust and efficient, has proven to be difficult to evolve to accommodate the needs of new applications. Prior research on this problem...
Yong Xia, Lakshminarayanan Subramanian, Ion Stoica, Shivkumar Kalyanaraman
Achieving efficient and fair bandwidth allocation while minimizing packet loss in high bandwidth-delay product networks has long been a daunting challenge. Existing endto-end congestion control...
Yong Xia, Lakshminarayanan Subramanian, Ion Stoica, Shivkumar Kalyanaraman
Achieving efficient and fair bandwidth allocation while minimizing packet loss in high bandwidth-delay product networks has long been a daunting challenge. Existing endto-end congestion control...
Declarative Routing: Extensible Routing with Declarative queries (2005)
Boon Thau, Loo Joseph, M. Hellerstein, Ion Stoica, Raghu Ramakrishnan
The Internet’s core routing infrastructure, while arguably robust and efficient, has proven to be difficult to evolve to accommodate the needs of new applications. Prior research on this problem...
Yong Xia, Lakshminarayanan Subramanian, Ion Stoica, Shivkumar Kalyanaraman
Abstract — Achieving efficient and fair bandwidth allocation while minimizing bottleneck queue length and congestion-induced packet loss rate for high Bandwidth-Delay Product (BDP) networks has...
Yong Xia, Lakshminarayanan Subramanian, Ion Stoica, Shivkumar Kalyanaraman
Achieving efficient and fair bandwidth allocation while minimizing packet loss and bottleneck queue in high bandwidthdelay product networks has long been a daunting challenge. Existing end-to-end...
Customizable Routing with Declarative Queries (2004)
Loo, Boon Thau, Hellerstein, Joseph M, Stoica, Ion
To meet the demands of new Internet applications, recent work argues for giving end-hosts more control over routing. To achieve this goal, we propose the use of a recursive query language, which...
Enhancing P2P File-Sharing with an Internet-Scale Query Processor (2004)
Loo, Boon Thau, Hellerstein, Joseph M, Huebsch, Ryan, Shenker, Scott, Stoica, Ion
In this paper, we address the problem of designing a scalable, accurate query processor for peer-to-peer filesharing and similar distributed keyword search systems. Using a globally-distributed...
Querying at Internet Scale (2004)
Chun, Brent, Hellerstein, Joseph M, Huebsch, Ryan, Jeffery, Shawn R, Loo, Boon Thau, Mardanbeigi, Sam, ...
We are developing a distributed query processor called PIER, which is designed to run on the scale of the entire Internet. PIER utilizes a Distributed Hash Table (DHT) as its communication substrate...
The Case for a Hybrid P2P Search Infrastructure (2004)
Loo, Boon Thau, Huebsch, Ryan, Stoica, Ion, Hellerstein, Joseph M
Popular P2P file-sharing systems like Gnutella and Kazaa use unstructured network designs. These networks typically adopt flooding-based search techniques to locate files. While flooding-based...
The case for a hybrid P2P search infrastructure (2004)
Boon Thau Loo, Ryan Huebsch, Ion Stoica, Joseph M. Hellerstein
Abstract. Popular P2P file-sharing systems like Gnutella and Kazaa use unstructured network designs. These networks typically adopt flooding-based search techniques to locate files. While...
I.: Querying at internet scale (2004)
Brent Chun, Joseph M. Hellerstein, Ryan Huebsch, Shawn R. Jeffery, Boon Thau Loo, Sam Mardanbeigi, ...
We are developing a distributed query processor called PIER, which is designed to run on the scale of the entire Internet. PIER utilizes a Distributed Hash Table (DHT) as its communication substrate...
Characterizing selfishly constructed overlay routing networks (2004)
Byung-gon Chun, Rodrigo Fonseca, Ion Stoica, John Kubiatowicz
Abstract — We analyze the characteristics of overlay routing networks generated by selfish nodes playing competitive network construction games. We explore several networking scenarios— some...
Karthik Lakshminarayanan, Ion Stoica, Scott Shenker
Typically routing is either scalable but inflexible, such as current Internet routing, or flexible but unscalable, such as source routing with with per-flow route discovery. In this paper we argue...
Abstract Supporting Legacy Applications over i3 (2004)
Jayanthkumar Kannan, Ayumu Kubota, Karthik Lakshminarayanan, Ion Stoica, Klaus Wehrle, Jayanthkumar Kannan, ...
Providing support for legacy applications is a crucial component of many overlay networks, as it allows end-users to instantly benefit from the functionality introduced by these overlays. This paper...
SCONE: A Tool to Estimate Shared Congestion Among Internet Paths (2004)
Weidong Cui, Weidong Cui, Sridhar Machiraju, Sridhar Machiraju, Y H. Katz, Y H. Katz, ...
It is well-known that the use of path diversity, i.e., the use of multiple end-to-end paths can improve the performance of applications such as multimedia streaming and Voice over IP. Leveraging path...
Listen and Whisper: Security Mechanisms for BGP (2004)
Lakshminarayanan Subramanian, Volker Roth, Ion Stoica, Scott Shenker, Randy H. Katz, Y H. Katz
BGP, the current inter-domain routing protocol, assumes that the routing information propagated by authenticated routers is correct. This assumption renders the current infrastructure vulnerable to...
A Layered Naming Architecture for the Internet (2004)
Hari Balakrishnan, Karthik Lakshminarayanan, Sylvia Ratnasamy, Scott Shenker, Ion Stoica, Michael Walfish
Currently the Internet has only one level of name resolution, DNS, which converts user-level domain names into IP addresses. In this paper we borrow liberally from the literature to argue that there...
The Case for a Hybrid P2P Search Infrastructure (2004)
Boon Thau Loo, Ryan Huebsch, Ion Stoica, Joseph M. Hellerstein
Popular P2P file-sharing systems like Gnutella and Kazaa use unstructured network designs. These networks typically adopt flooding-based search techniques to locate files. While flooding-based...
OverQoS: An Overlay based Architecture for Enhancing Internet QoS (2004)
Lakshminarayanan Subramanian, Ion Stoica, Hari Balakrishnan, Randy H. Katz
This paper describes the design, implementation, and experimental evaluation of OverQoS, an overlay-based architecture for enhancing the best-effort service of today's Internet. Using a...
A Layered Naming Architecture for the Internet (2004)
Hari Balakrishnan, Karthik Lakshminarayanan, Sylvia Ratnasamy, Scott Shenker, Michael Walfish, Hari Balakrishnan A, ...
Currently the Internet has only one level of name resolution, DNS, which converts user-level domain names into IP addresses. In this paper we borrow liberally from the literature to argue that there...
Load Balancing in Dynamic Structured P2P Systems (2004)
Brighten Godfrey Karthik, Karthik Lakshminarayanan, Sonesh Surana, Richard Karp, Ion Stoica
Most P2P systems that provide a DHT abstraction distribute objects randomly among "peer nodes" in a way that results in some nodes having \Theta(log N) times as many objects as the average...
Characterizing Selfishly Constructed Overlay (2004)
Byung-gon Chun, Rodrigo Fonseca, Ion Stoica, John Kubiatowicz
We analyze the characteristics of overlay routing networks generated by selfish nodes playing competitive network construction games. We explore several networking scenarios--- some simplistic,...
Support for Service Composition in (2004)
Karthik Lakshminarayanan Ion, Ion Stoica, Klaus Wehrle
ÔÓ×�Ø�ÓÒ Ï � �� × Ù× × Ø� � ��ÐÐ�Ò�� × �Ò �ÑÔÐ�Ñ�ÒØ�Ò � ×�ÖÚ � �
Support for Service Composition in i3 (2004)
Karthik Lakshminarayanan Ion, Ion Stoica, Klaus Wehrle
We consider the problem of service composition in a wide area network, where an end-user can send its packets through intermediate processing points (middleboxes) which can perform a variety of...
Characterizing selfishly constructed overlay routing networks (2004)
Byung-gon Chun, Rodrigo Fonseca, Ion Stoica, John Kubiatowicz
Abstract — We analyze the characteristics of overlay routing networks generated by selfish nodes playing competitive network construction games. We explore several networking scenarios— some...
SCONE: A Tool to Estimate Shared Congestion Among Internet Paths (2004)
Weidong Cui, Weidong Cui, Sridhar Machiraju, Sridhar Machiraju, Y H. Katz, Y H. Katz, ...
It is well-known that the use of path diversity, i.e., the use of multiple end-to-end paths can improve the performance of applications such as multimedia streaming and Voice over IP. Leveraging path...
Analyzing P2P Overlays with Recursive Queries (2003)
Loo, Boon Thau, Huebsch, Ryan, Hellerstein, Joseph M, Roscoe, Timothy, Stoica, Ion
We explore the utility and execution of recursive queries as an interface for querying distributed network graph structures. To illustrate the power of recursive queries, we give several examples of...
Measurement and Analysis of Ultrapeer-based P2P Search Networks (2003)
Loo, Boon Thau, Hellerstein, Joseph, Huebsch, Ryan, Shenker, Scott, Stoica, Ion
Unstructured Networks have been used extensively in P2P search systems today primarily for file sharing. These networks exploit heterogeneity in the network and offload most of the query processing...
Querying the Internet with PIER (2003)
Huebsch, Ryan, Hellerstein, Joseph M, Lanham, Nick, Loo, Boon Thau, Shenker, Scott, Stoica, Ion
The database research community prides itself on scalable technologies. Yet database systems traditionally do not excel on one important scalability dimension: the degree of distribution. This...
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...
Load balancing in structured p2p systems (2003)
Ananth Rao, Karthik Lakshminarayanan, Sonesh Surana, Richard Karp, Ion Stoica
Most P2P systems that provide a DHT abstraction distribute objects among “peer nodes ” by choosing random identifiers for the objects. This could result in an O(log N) imbalance. Besides, P2P...
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...
Thesis: Intrinsic Locality Properties of Web Reference Streams (2003)
Advisors Prof, Ion Stoica, Prof Scott Shenker, Advisors Prof, Virgilio Almeida, ...
under the guidance of Prof. Ion Stoica and Prof. Scott Shenker, as a member of the Networking Group and of the RAD Lab (Reliable Adaptive Distributed Systems Lab). Dissertation work on the design and...
Load balancing in structured p2p systems (2003)
Ananth Rao, Karthik Lakshminarayanan, Sonesh Surana, Richard Karp, Ion Stoica
Most P2P systems that provide a DHT abstraction distribute objects among “peer nodes ” by choosing random identifiers for the objects. This could result in an O(log N) imbalance. Besides, P2P...
Building a flexible and efficient routing infrastructure: Need and challenges (2003)
Karthik Lakshminarayanan, Ion Stoica, Scott Shenker
choose routes over the infrastructure, thus enabing the end-hosts to achieve various services they desire. The foremost challenge we face here is to design flexible primitives thatthe infrastructure...
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...
Thesis: Intrinsic Locality Properties of Web Reference Streams (2003)
Advisors Prof, Ion Stoica, Prof Scott Shenker, Advisors Prof, Virgilio Almeida, ...
under the guidance of Prof. Ion Stoica and Prof. Scott Shenker, as a member of the Networking Group and of the RAD Lab (Reliable Adaptive Distributed Systems Lab). Dissertation work on the design and...
Exploring tradeoffs in failure detection in routing overlays (2003)
Shelley Zhuang, Dennis Geels, Ion Stoica, Randy Katz, Shelley Zhuang, Dennis Geels, ...
One of the key reasons overlay networks are seen as an excellent platform for large scale distributed systems is their resilience in the presence of node failures. This resilience rely on accurate...
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...
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...
Load balancing in structured p2p systems (2003)
Ananth Rao, Karthik Lakshminarayanan, Sonesh Surana, Richard Karp, Ion Stoica
Most P2P systems that provide a DHT abstraction distribute objects among “peer nodes ” by choosing random identifiers for the objects. This could result in an O(log N) imbalance. Besides, P2P...
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...
Towards a more functional and secure network infrastructure (2003)
Daniel Adkins, Karthik Lakshminarayanan, Adrian Perrig, Ion Stoica, Daniel Adkins, Karthik Lakshminarayanan, ...
We propose an overlay network infrastructure that provides better protection against DoS attacks as well as more functionality than today’s Internet. Our solution is based on three simple...
Taming IP packet flooding attacks (2003)
Karthik Lakshminarayanan, Daniel Adkins, Adrian Perrig, Ion Stoica
Querying the internet with pier (2003)
Ryan Huebsch, Joseph M. Hellerstein, Nick Lanham, Boon Thau, Loo Scott Shenker, Ion Stoica
The database research community prides itself on scalable technologies. Yet database systems traditionally do not excel on one important scalability dimension: the degree of distribution. This...
Geographic routing without location information (2003)
Ananth Rao, Sylvia Ratnasamy, Christos Papadimitriou, Scott Shenker, Ion Stoica
For many years, scalable routing for wireless communication systems was a compelling but elusive goal. Recently, several routing algorithms that exploit geographic information (e.g., GPSR) have been...
Geographic routing without location information (2003)
Ananth Rao, Ananth Rao, Sylvia Ratnasamy, Sylvia Ratnasamy, Christos Papadimitriou, Christos Papadimitriou, ...
For many years, scalable routing for wireless communication systems was a compelling but elusive goal. Recently, several routing algorithms that exploit geographic information (e.g., GPSR) have been...
The impact of DHT routing geometry on resilience and proximity (2003)
Krishna Gummadi, Ramakrishna Gummadi, Steve Gribble, Sylvia Ratnasamy, Ion Stoica, K. Gummadi, ...
The various proposed DHT routing algorithms embody several different underlying routing geometries. These geometries include hypercubes, rings, tree-like structures, and butterfly networks. In this...
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,...
Geographic Routing without Location Information (2003)
Ananth Rao, Sylvia Ratnasamy, Christos Papadimitriou, Scott Shenker, Ion Stoica
For many years, scalable routing for wireless communication systems was a compelling but elusive goal. Recently, several routing algorithms that exploit geographic information (e.g., GPSR) have been...
On Failure Detection Algorithms in Overlay Networks (2003)
Shelley Zhuang Dennis, Dennis Geels, Ion Stoica, Randy H. Katz
One of the key reasons overlay networks are seen as an excellent platform for large scale distributed systems is their resilience in the presence of node failures. This resilience rely on accurate...
On Failure Detection Algorithms in Overlay Networks (2003)
Shelley Zhuang Dennis, Dennis Geels, Ion Stoica, Randy H. Katz
One of the key reasons overlay networks are seen as an excellent platform for large scale distributed systems is their resilience in the presence of node failures. This resilience rely on accurate...
Geographic routing without location information (2003)
Ananth Rao, Sylvia Ratnasamy, Christos Papadimitriou, Scott Shenker, Ion Stoica
For many years, scalable routing for wireless communication systems was a compelling but elusive goal. Recently, several routing algorithms that exploit geographic information (e.g., GPSR) have been...
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...
Load balancing in structured p2p systems (2003)
Ananth Rao, Karthik Lakshminarayanan, Sonesh Surana, Richard Karp, Ion Stoica
Most P2P systems that provide a DHT abstraction distribute objects among “peer nodes ” by choosing random identifiers for the objects. This could result in an O(log N) imbalance. Besides, P2P...
Host Mobility Using an Internet Indirection Infrastructure (2003)
Shelley Zhuang, Kevin Lai, Ion Stoica, Randy Katz, Scott Shenker
(ROAM) to provide seamless mobility for Internet hosts. ROAM is built on top of the Internet Indirection Infrastructure ( ¢ ¡). With £ ¡ , instead of explicitly sending a packet to a...
Thesis: Intrinsic Locality Properties of Web Reference Streams (2003)
Advisors Prof, Ion Stoica, Prof Scott Shenker, Advisors Prof, Virgilio Almeida, ...
under the guidance of Prof. Ion Stoica and Prof. Scott Shenker, as a member of the Networking Group and of the RAD Lab (Reliable Adaptive Distributed Systems Lab). Dissertation work on the design and...
Taming IP Packet Flooding Attacks (2003)
Karthik Lakshminarayanan, Daniel Adkins, Adrian Perrig, Ion Stoica
this paper is that hosts -- not the network -- should be given control to respond to packet floods and overload. Ideally, hosts should have fine-grained control over how routers process the packets...
The Case for a Hybrid P2P Search Infrastructure (2003)
Ion Stoica, Joseph M. Hellerstein, Boon Thau Loo, Boon Thau Loo, Ryan Huebsch, Ryan Huebsch
Popular P2P file-sharing systems like Gnutella and Kazaa use unstructured network designs. These networks typically adopt flooding-based search techniques to locate files. While flooding-based...
Complex Queries in DHT-based Peer-to-Peer Networks (2002)
Harren, Matthew, Hellerstein, Joseph M, Huebsch, Ryan, Loo, Boon Thau, Shenker, Scott, Stoica, Ion
Recently a new generation of P2P systems, offering distributed hash table (DHT) functionality, have been proposed. These systems greatly improve the scalability and exact-match accuracy of P2P...
A scalable and robust solution for bandwidth allocation (2002)
Sridhar Machiraju, Mukund Seshadri, Ion Stoica
Abstract---We propose a novel architecture for providing bandwidth allocation and reservation that is both scalable and robust. Scalability is achieved by not requiring routers to maintain perflow...
Ion Stoica, Hui Zhang, Scott Shenker
Recently, a class of solutions including Core-Stateless Fair Queueing (CSFQ), Rainbow Fair Queueing, and Diffserv have been proposed to address the scalability concerns that have plagued stateful...
Internet indirection infrastructure (2002)
Ion Stoica, Daniel Adkins, Shelley Zhuang, Scott Shenker, Sonesh Surana
Attempts to generalize the Internet's point-to-point communication abstraction to provide services like multicast, anycast, and mobility have faced challenging technical problems and deployment...
Internet indirection infrastructure (2002)
Ion Stoica, Daniel Adkins, Shelley Zhuang, Scott Shenker, Sonesh Surana
Abstract—Attempts to generalize the Internet’s point-to-point communication abstraction to provide services like multicast, anycast, and mobility have faced challenging technical problems and...
The SAHARA Model for Service Composition Across Multiple Providers (2002)
Bhaskaran Raman, Sharad Agarwal, Yan Chen, Matthew Caesar, Weidong Cui, Per Johansson, ...
Weidong Cui, Ion Stoica, Y H. Katz
Communication reliability is a desired property in computer networks. One key technology to increase the reliability of a communication path is to provision a disjoint backup path. One of the main...
TCP Model for Short Lived Flows (2002)
Marco Mellia, Ion Stoica, Hui Zhang
Abstract—We propose a recursive, analytical model to predict the TCP performance in terms of completion time for short-lived flows. Based on the knowledge of the average dropping probability, the...
Internet indirection infrastructure (2002)
Ion Stoica, Dan Adkins, Sylvia Ratnasamy, Scott Shenker, Sonesh Surana, Shelley Zhuang
Today’s Internet is designed around the point-to-point communication abstraction. This simple abstraction is one of the main reasons behind the scalability and the efficiency of the Internet....
The SAHARA Model for Service Composition Across Multiple Providers (2002)
Bhaskaran Raman, Sharad Agarwal, Yan Chen, Matthew Caesar, Weidong Cui, Kevin Lai, ...
Abstract. Services are capabilities that enable applications and range from basic network connectivity to sophisticated middleware functionalities. They are of crucial importance to enable pervasive...
Design guidelines for robust internet protocols (2002)
Tom Anderson, Scott Shenker, Ion Stoica, David Wetherall
Robustness has long been a central design goal of the Internet. Much of the initial effort towards robustness focused on the 'ail-stop " model, where node failures are complete and...
Routing Algorithms for DHTs: Some Open Questions (2002)
Sylvia Ratnasamy, Scott Shenker, Ion Stoica
this paper is not about finished work, but instead is about a research agenda for future work (by us and others). We hope that presenting such a discussion to this audience will promote synergy...
Backup Path Allocation Based On A Correlated Link Failure (2002)
Probability Model In, Weidong Cui, Ion Stoica, Y H. Katz
Communication reliability is a desired property in computer networks. One key technology to increase the reliability of a communication path is to provision a disjoint backup path. One of the main...
Host Mobility Using an Internet Indirection Infrastructure (2002)
Shelley Zhuang Kevin, Kevin Lai, Ion Stoica, Randy Katz, Scott Shenker
We propose the Robust Overlay Architecture for Mobility (ROAM) to provide seamless mobility for Internet hosts. ROAM is built on top of the Internet Indirection Infrastructure ). With , instead of...
The SAHARA Model for Service Composition Across (2002)
Multiple Providers Bhaskaran, Bhaskaran Raman, Sharad Agarwal, Yan Chen, Matthew Caesar, Weidong Cui, ...
Services are capabilities that enable applications and are of crucial importance to pervasive computing in next-generation networks. Service Composition is the construction of complex services from...
The SAHARA Model for Service Composition Across Multiple Providers (2002)
Bhaskaran Raman, Sharad Agarwal, Yan Chen, Matthew Caesar, Weidong Cui, Per Johansson, ...
The SAHARA Model for Service Composition Across Multiple Providers (2002)
Bhaskaran Raman, Sharad Agarwal, Yan Chen, Matthew Caesar, Weidong Cui, Per Johansson, ...
Abstract. Services are capabilities that enable applications and are of crucial importance to pervasive computing in next-generation networks. Service Composition is the construction of complex...
The SAHARA Model for Service Composition Across Multiple Providers (2002)
Bhaskaran Raman, Sharad Agarwal, Yan Chen, Matthew Caesar, Weidong Cui, Per Johansson, ...
Weidong Cui, Ion Stoica, Y H. Katz
Communication reliability is a desired property in computer networks. One key technology to increase the reliability of a communication path is to provision a disjoint backup path. One of the main...
Weidong Cui, Ion Stoica, Y H. Katz
Communication reliability is a desired property in computer networks. One key technology to increase the reliability of a communication path is to provision a disjoint backup path. One of the main...
The Chord Ad-hoc Routing Protocol (2002)
George Porter Kevin, Kevin Lai, Ion Stoica, Jeremy Condit
This paper describes the Chord Ad-Hoc Routing Protocol, which is a multi-hop, ad-hoc networking protocol that provides the Chord Distributed Hash Table (DHT) abstraction to the network. Nodes form a...
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...
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 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...
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...
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...
A Waypoint Service Approach to Connect Heterogeneous Internet Address Spaces (2001)
The rapid growth of the Internet has made IP addresses a scarce resource. To get around this problem, today and in the foreseeable future, networks will be deployed with reusable-IP addresses (a.k.a....
A Distributed Waypoint Service Approach to Connect Heterogeneous Internet Address Spaces (2001)
The rapid growth of the Internet has made IPv4 addresses a scarce resource. Today we witness two major trends to get around this problem. The first is to upgrade and deploy networks using IPv6; the...
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 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 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...
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...
Endpoint admission control: Architectural issues and performance (2000)
Lee Breslau, Edward W. Knightly, Scott Shenker, Ion Stoica, Hui Zhang Y
The traditional approach to implementing admission control, as exemplified by the Integrated Services proposal in the IETF, uses a signalling protocol to establish reservations at all routers along...
Minors in Jazz Performance and Trumpet Performance (2000)
Advisor Prof, Ion Stoica, Advisor Prof, Ion Stoica
Networking and distributed systems: in particular, routing architecture, algorithms for and analysis of distributed systems, and applications of theory to systems design.
Minors in Jazz Performance and Trumpet Performance (2000)
Advisor Prof, Ion Stoica, Advisor Prof, Ion Stoica
Networking and distributed systems: in particular, routing architecture, algorithms for and analysis of distributed systems, and applications of theory to systems design.
Stateless core: A scalable approach for quality of service in the internet (2000)
Ion Stoica, Garth A. Gibson, Thomas Gross, Peter Steenkiste, Scott Shenker, Icsi Berkeley
Today's Internet provides one simple service: best effort datagram delivery. This minimalist service allows the Internet to be stateless, that is, routers do not need to maintain any fine...
Endpoint admission control: Architectural issues and performance (2000)
Lee Breslau, Edward W. Knightly, Scott Shenker, Ion Stoica, Hui Zhang Y
The traditional approach to implementing admission control, as exemplified by the Integrated Services proposal in the IETF, uses a signalling protocol to establish reservations at all routers along...
Endpoint admission control: Architectural issues and performance (2000)
Lee Breslau, Edward W. Knightly, Scott Shenker, Ion Stoica, Hui Zhang
The traditional approach to implementing admission control, as exemplified by the Integrated Services proposal in the IETF, uses a signalling protocol to establish reservations at all routers along...
Supporting Best-Effort Traffic with Fair Service Curve (2000)
Donpaul C. Stephens, T. S. Eugene, Ng Donpaul, C. Stephens, Ion Stoica, ...
Packet Fair Queueing (PFQ) algorithms are the most popular and well studied scheduling algorithms for integrated services networks for two reasons: (1) With reservation, they can provide per-flow...
Endpoint Admission Control: Architectural Issues and Performance (2000)
Lee Breslau, Edward W. Knightly, Scott Shenker, Ion Stoica, Hui Zhang
The traditional approach to implementing admission control, as exemplified by the Integrated Services proposal in the IETF, uses a signalling protocol to establish reservations at all routers along...
Stateless core: A scalable approach for quality of service in the internet (2000)
Ion Stoica, Garth A. Gibson, Thomas Gross, Peter Steenkiste, Scott Shenker, Icsi Berkeley
Copyright c
Endpoint admission control: Architectural issues and performance (2000)
Lee Breslau, Edward W. Knightly, Scott Shenker, Ion Stoica, Hui Zhang Y
The traditional approach to implementing admission control, as exemplified by the Integrated Services proposal in the IETF, uses a signalling protocol to establish reservations at all routers along...
Minors in Jazz Performance and Trumpet Performance (2000)
Advisor Prof, Ion Stoica, Advisor Prof, Ion Stoica
Networking and distributed systems: in particular, routing architecture, algorithms for and analysis of distributed systems, and applications of theory to systems design.
Supporting Best-Effort Traffic with Fair Service Curve (1999)
Donpaul C. Stephens, Ion Stoica, Hui Zhang
While PFQ algorithms can provide per-flow end-to-end delay guarantees for real-time traffic or protection among competing best-effort traffic, they have two important limitations. The first one is...
Supporting Best-Effort Traffic with Fair Service Curve (1999)
Eugene Ng Donpaul, Donpaul C. Stephens, Ion Stoica
While PFQ algorithms can provide per-flow end-to-end delay guarantees for real-time traffic or protection among competing best-effort traffic, they have two important limitations. The first one is...
REUNITE: A Recursive Unicast Approach to Multicast (1999)
We propose a new multicast protocol called REUNITE. The key idea of REUNITE is to use recursive unicast trees to implement multicast service. REUNITE does not use class D IP addresses. Instead, both...
Supporting Best-Effort Traffic with Fair Service Curve (1999)
Donpaul C. Stephens, Ion Stoica, Hui Zhang
this paper [2], we show that, when used for best-effort traffic, FSC can eliminate the bias against delaysensitive bursty applications without negatively affecting the performance of...
Providing Guaranteed Services Without Per Flow Management (1999)
this paper, we developed two distributed algorithms that implement QoS scheduling and admission control in a SCORE network where core routers do not maintain per flow state. Combined, these two...
Providing Guaranteed Services Without Per Flow Management (1999)
Existing approaches for providing guaranteed services require routers to manage per flow states and perform per flow operations [12, 3]. Such a stateful network architecture is less scalable and...
Providing Guaranteed Services Without Per Flow Management (1999)
Previous proposals for providing guaranteed services require routers to manage per flow states and perform per flow operations, which raises scalability concerns for both the data and control planes...
Providing Guaranteed Services Without Per Flow Management (1999)
Views and conclusions contained in this document are those of the authors and should not be interpreted as representing the o cial policies, either expressed or implied, of DARPA, NSF, Intel, or the...
Ion Stoica, Scott Shenker, Hui Zhang
Router mechanisms designed to achieve fair bandwidth allocations, like Fair Queueing, have many desirable properties for congestion control in the Internet. However, such mechanisms usually need to...
Ion Stoica, Scott Shenker, Hui Zhang
U.S. government.
LIRA: An Approach for Service Differentiation in the Internet (1998)
In this paper, we study the Assured Service model proposed by Clark and Wroclawski [3, 4]. While existing schemes use service profiles that are defined in terms of absolute bandwidth, it is...
Exact Emulation of an Output Queueing Switch by a Combined Input Output Queueing Switch (1998)
Combined input output queueing switches (CIOQ) have better scaling properties than output queueing (OQ) switches. However, a CIOQ switch may have lower switch throughput, and more importantly, it is...
An efficient packet service algorithm for high speed ATM switches (1998)
Ion Stoica, Hussein Abdel-wahab
The unprecedent development of the World Wide Web, and the emerging of new types of applications such as video-on-demand and teleconferencing put an increasing pressure on the communication...
Packet Fair Queueing Algorithms for Wireless Networks with Location-Dependent Errors (1998)
Abstract--- While Packet Fair Queueing (PFQ) algorithms provide both bounded delay and fairness in wired networks, they cannot be applied directly to wireless networks. The key difficulty is that in...
Packet Fair Queueing Algorithms for Wireless Networks with Location-Dependent Errors (1998)
While Packet Fair Queueing (PFQ) algorithms provide both bounded delay and fairness in wired networks, they cannot be applied directly to wireless networks. The key difficulty is that in wireless...
Mu Edu, Ion Stoica, Scott Shenker, Hui Zhang
Router mechanisms designed to achieve fair bandwidth allocations, like Fair Queueing, have many desirable properties for congestion control in the Internet. However, such mechanisms usually need to...
Mu Edu, Ion Stoica, Scott Shenker, Hui Zhang
Router mechanisms designed to achieve fair bandwidth allocations, like Fair Queueing, have many desirable properties for congestion control in the Internet. However, such mechanisms usually need to...
Ion Stoica, Scott Shenker, Hui Zhang
Router mechanisms designed to achieve fair bandwidth allocations, like Fair Queueing, have many desirable properties for congestion control in the Internet. However, such mechanisms usually need to...
LIRA: An Approach for Service Differentiation in the Internet (1998)
In this paper, we study the Assured Service model proposed by Clark and Wroclawski [3, 4]. While existing schemes use service profiles that are defined in terms of absolute bandwidth, it is...
Ion Stoica, Scott Shenker, Hui Zhang
Views and conclusions contained in this document are those of the authors and should no be interpreted as representing the o cial policies, either expressed or implied, of DARPA, NSF, Intel, MCI,...
A hierarchical fair service curve algorithm for link-sharing, real-time and priority services (1997)
Abstract—In this paper, we study hierarchical resource management models and algorithms that support both link-sharing and guaranteed real-time services with priority (decoupled delay and bandwidth...
A hierarchical fair service curve algorithm for link-sharing, real-time and priority services (1997)
Abstract — In this paper, we study hierarchical resource management models and algorithms that support both link-sharing and guaranteed realtime services with priority (decoupled delay and...
On the Duality between Resource Reservation and Proportional Share Resource Allocation (1997)
Ion Stoica, Hussein Abdel-wahab, Kevin Jeffay
We describe a new framework for resource allocation that unifies the well-known proportional share and resource reservation policies. Each client is characterized by two parameters: a weight that...
A Hierarchical Fair Service Curve Algorithm for Link-Sharing, Real-Time and Priority Services (1997)
In this paper, we study hierarchical resource management models and algorithms that support both link-sharing and guaranteed realtime services with priority (decoupled delay and bandwidth...
A Hierarchical Fair Service Curve Algorithm for Link-Sharing, Real-Time and Priority Services (1997)
In this paper, we study hierarchical resource management models and algorithms that support both link-sharing and guaranteed real-time services with decoupled delay (priority) and bandwidth...
A Hierarchical Fair Service Curve Algorithm for Link-Sharing, Real-Time and Priority Services (1997)
In this paper, we study hierarchical resource management models and algorithms that support both linksharing and guaranteed real-time services with priority (decoupled delay and bandwidth...
A hierarchical fair service curve algorithm for link-sharing, real-time and priority services (1997)
Abstract — In this paper, we study hierarchical resource management models and algorithms that support both link-sharing and guaranteed realtime services with priority (decoupled delay and...
On the Duality between Resource Reservation and Proportional Share Resource Allocation (1997)
Ion Stoica, Hussein Abdel-wahab, Kevin Jeffay
We describe a new framework for resource allocation that unifies the well-known proportional share and resource reservation policies. Each client is characterized by two parameters: a weight that...
A hyperbolic model for communications in layered parallel processing environments (1996)
Ion Stoica, Florin Sultan, David Keyes Y
We introduce a model for communication costs in parallel processing environments, called the hyperbolic model, which generalizes two-parameter dedicated-link models in an analytically simple way. The...
A Proportional Share Resource Allocation Algorithm For Real-Time, Time-Shared Systems (1996)
Ion Stoica, Hussein Abdel-wahab, Kevin Jeffay, Sanjoy K. Baruah, Johannes E. Gehrke, C. Greg Plaxton
We propose and analyze a proportional share resource allocation algorithm for realizing real-time performance in time-shared operating systems. In a proportional share system, processes are assigned...
A Proportional Share Resource Allocation Algorithm for Real-Time, Time-Shared Systems (1996)
Ion Stoica, Hussein Abdel-wahab, Kevin Jeffay, Sanjoy K. Baruah, Johannes E. Gehrke, C. Greg Plaxton
We propose and analyze a proportional share resource allocation algorithm for realizing real-time performance in time-shared operating systems. Processes are assigned a weight which determines a...
Fair On-Line Scheduling of a Dynamic Set of Tasks on a Single Resource (1996)
Sanjoy K. Baruah, Johannes E. Gehrke, C. Greg Plaxton, Ion Stoica, Hussein Abdel-wahab, Kevin Je Ay
Consider a set of #tasks" competing for the use of a single #resource", where: #i# only one task is allowed to use the resource at a time, #ii# the resource is scheduled in unit-time...
Evaluating the Hyperbolic Model on a Variety of Architectures (1996)
Ion Stoica, Florin Sultan, David Keyes
We illustrate the application of the hyperbolic model, which generalizes standard two-parameter dedicated-link models for communication costs in messagepassing environments, to four rather different...
Fair On-Line Scheduling of a Dynamic Set of Tasks on a Single Resource (1996)
Sanjoy K. Baruah, Johannes E. Gehrke, C. Greg Plaxton, Ion Stoica, Hussein Abdel-wahab, Kevin Jeffay
Consider a set of "tasks" competing for the use of a single "resource", where: (i) only one task is allowed to use the resource at a time, (ii) the resource is scheduled in...
A Robust and Flexible Microeconomic Scheduler for Parallel Computers (1996)
this paper we compare, through simulation experiments, the microeconomic scheduler that we have developed with other scheduling policies. We have tried to design a systematic set of experiments that...
A Hyperbolic Model for Communication in Layered Parallel Processing Environments (1996)
Ion Stoica, Florin Sultan, David Keyes
We introduce a model for communication costs in parallel processing environments, called the hyperbolic model, which generalizes two-parameter dedicated-link models in an analytically simple way. The...
Fair On-Line Scheduling of a Dynamic Set of Tasks on a Single Resource (1996)
Sanjoy K. Baruah, Johannes E. Gehrke, C. Greg Plaxton, Ion Stoica, Hussein Abdel-wahab, ...
Consider a set of "tasks" competing for the use of a single "resource", where: (i) only one task is allowed to use the resource at a time, (ii) the resource is scheduled in...
A Proportional Share Resource Allocation Algorithm for Real-Time, Time-Shared Systems (1996)
Ion Stoica, Hussein Abdel-wahab, Kevin Jeffay, Sanjoy K. Baruah, Johannes E. Gehrke, C. Greg Plaxton
We propose and analyze a proportional share resource allocation algorithm for realizing real-time performance in time-shared operating systems. Processes are assigned a weight which determines a...
Evaluating the Hyperbolic Model on a Variety of Architectures (1996)
Ion Stoica, Florin Sultan, David Keyes
. We illustrate the application of the hyperbolic model, which generalizes standard two-parameter dedicated-link models for communication costs in message-passing environments, to four rather...
A Proportional Share Resource Allocation Algorithm For Real-Time, Time-Shared Systems (1996)
Ion Stoica, Hussein Abdel-wahab, Kevin Jeffay, Sanjoy K. Baruah, Johannes E. Gehrke, C. Greg Plaxton
We propose and analyze a proportional share resource allocation algorithm for realizing real-time performance in time-shared operating systems. In a proportional share system, processes are assigned...
A new approach to implement proportional share resource allocation (1995)
Ion Stoica, Hussein Abdel-wahab
We describe a new approach to implement proportional share resource allocation and to provide different levels of service quality. We consider multiple clients that compete for a time-shared...
A microeconomic scheduler for parallel computers (1995)
Ion Stoica, Hussein Abdel-wahab, Alex Pothen
Abstract. We describe a scheduler based on the microeconomic paradigm for scheduling on-line a set of parallel jobs in a multiprocessor system. In addition to increasing the system throughput and...
A Time-Optimal Multiple-Query Nearest-Neighbor Algorithm on Meshes with Multiple Broadcasting (1995)
The multiple-query nearest-neighbor (MQNN) problem is stated as follows: given a set S of n points in plane and a set Q of m (1 m n) query points, determine for every point in Q its closest neighbor...
A Microeconomic Scheduler for Parallel Computers (1994)
Ion Stoica, Hussein Abdel-wahab, Alex Pothen
. We describe a scheduler based on the microeconomic paradigm for scheduling on-line a set of parallel jobs in a multiprocessor system. In addition to increasing the system throughput and reducing...
Group Communication in Distributed Computer Systems (1992)
M. Frans Kaashoek, Barbara Liskov, David Andersen, Mike Dahlin, Carla Ellis, Steve Gribble, ...
This report 1 summarizes recommendations from a workshop on research challenges in distributed computer systems, sponsored by the National Science Foundation. A program committee solicited input from...
Customizable Routing with Declarative Queries
Boon Thau Loo, Loo Joseph, Joseph M. Hellerstein, Ion Stoica
To meet the demands of new Internet applications, recent work argues for giving end-hosts more control over routing. To achieve this goal, we propose the use of a recursive query language, which...