Tiered Fault Tolerance for Long-Term Integrity (2009)
Byung-gon Chun, Petros Maniatis, Scott Shenker, John Kubiatowicz
Fault-tolerant services typically make assumptions about the type and maximum number of faults that they can tolerate while providing their correctness guarantees; when such a fault threshold is...
Minuet: Rethinking Concurrency Control in Storage Area Networks (2009)
Andrey Ermolinskiy, Daekyeong Moon, Byung-gon Chun, Scott Shenker
Clustered applications in storage area networks (SANs), widely adopted in enterprise datacenters, have traditionally relied on distributed locking protocols to coordinate concurrent access to shared...
Ashok An, Archit Gupta, Aditya Akella, Srinivasan Seshan, Scott Shenker
Many past systems have explored how to eliminate redundant transfers from network links and improve network efficiency. Several of these systems operate at the application layer, while the more...
Rethinking Packet Forwarding Hardware (2009)
Martin Casado, Teemu Koponen, Daekyeong Moon, Scott Shenker
For routers and switches to handle ever-increasing bandwidth requirements, the packet “fast-path ” must be handled with specialized hardware. There have been two approaches to building such...
Natasha Gude, Ben Pfaff, Teemu Koponen, Martín Casado, Scott Shenker, Justin Pettit, ...
This article is an editorial note submitted to CCR. It has NOT been peer reviewed. Authors take full responsibility for this article’s technical content. Comments can be posted through CCR Online....
Accountable Internet Protocol (AIP) (2009)
David G. Andersen, Hari Balakrishnan, Nick Feamster, Teemu Koponen, Daekyeong Moon, Scott Shenker
This paper presents AIP (Accountable Internet Protocol), a network architecture that provides accountability as a first-order property. AIP uses a hierarchy of self-certifying addresses, in which...
David G. Andersen, Hari Balakrishnan, Nick Feamster, Teemu Koponen, Daekyeong Moon, Scott Shenker
This paper presents AIP (Accountable Internet Protocol), a network architecture that provides accountability as a first-order property. AIP uses a hierarchy of self-certifying addresses, in which...
OpenFlow: Enabling Innovation in Campus Networks (2009)
Nick Mckeown, Scott Shenker, Tom Anderson, Larry Peterson, Jonathan Turner, Hari Balakrishnan, ...
This article is an editorial note submitted to CCR. It has NOT been peer reviewed. Authors take full responsibility for this article’s technical content. Comments can be posted through CCR Online....
Byung-gon Chun, Kuang Chen, Gunho Lee, Randy H. Katz, Scott Shenker, Byung-gon Chun, ...
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...
permission. Reducing Transient Disconnectivity using Anomaly-Cognizant Forwarding (2009)
Andrey Ermolinskiy, Scott Shenker, Andrey Ermolinskiy, Scott Shenker
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...
Reducing Transient Disconnectivity using Anomaly-Cognizant Forwarding (2009)
Andrey Ermolinskiy, Scott Shenker
It is well known that BGP convergence can cause widespread temporary losses of connectivity resulting from inconsistent routing state. In this paper, we present Anomaly-Cognizant Forwarding (ACF)- a...
permission. Minuet: Rethinking Concurrency Control in Storage Area Networks (2009)
Andrey Ermolinskiy, Daekyeong Moon, Byung-gon Chun, Scott Shenker, Andrey Ermolinskiy, Daekyeong Moon, ...
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...
Flexibility as an instrument in digital rights management (2009)
Dirk Bergemann, Thomas Eisenbach, Joan Feigenbaum, Scott Shenker
We consider the optimal design of ‡exible use in a digital-rights-management policy. The basic model considers a single distributor of digital goods and a continuum of consumers. Each consumer can...
Overcoming the Internet Impasse through (2009)
Most current Internet research involves either empirical measurement studies or incremental modifications that can be deployed without major architectural changes. Easy access to virtual testbeds...
Abstract Tiered Byzantine-Fault Tolerance for Long-Term Integrity ∗ (2009)
Byung-gon Chun, Petros Maniatis, Scott Shenker, John Kubiatowicz
Long-term services that operate reliably are hard to construct. In this paper, we argue that for long-term services we need a stronger service property called Healthy-Write-Implies-Correct-Read...
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...
Abstract SANE: A Protection Architecture for Enterprise Networks (2009)
Martin Casado, Tal Garfinkel, Aditya Akella, Michael J. Freedman, Dan Boneh, Nick Mckeown, ...
Connectivity in today’s enterprise networks is regulated by a combination of complex routing and bridging policies, along with various interdiction mechanisms such as ACLs, packet filters, and...
Karthik Lakshminarayanan, Ion Stoica, Scott Shenker, Karthik Lakshminarayanan, Ion Stoica, Scott Shenker
Sharing the Cost of Multicast Transmissions 1 (2008)
Joan Feigenbaum, Christos H. Papadimitriou, Scott Shenker
We investigate cost-sharing algorithms for multicast transmission. Economic considerations point to two distinct mechanisms, marginal cost and Shapley value, as the two solutions most appropriate in...
Hongsuda Tangmunarunkit, Scott Shenker
Following the long-held belief that the Internet is hierarchical, the network topology generators most widely used by the Internet research community, Transit-Stub and Tiers, create networks with a...
Key consistency in dhts (2008)
Sriram Sankararaman, Byung-gon Chun, Chawathe Yatin, Scott Shenker, Sriram Sankararaman, Byung-gon Chun, ...
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...
Abstract Best-Effort versus Reservations: A Simple Comparative Analysis* (2008)
Using a simple analytical model, ’ this paper addresses the following question: Should the Internet retain its best-effort-only architecture, or should it adopt one that is reservation-capable? We...
Hari Balakrishnan, Scott Shenker, Karthik Lakshminarayanan, Sylvia Ratnasamy, 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...
Lixia Zhang, Stephen Deering, Deborah Estrin, Scott Shenker
Whe origin of the RSVP protocol can be traced back to 1991, when a team of network researchers, including myself, started playing with a number of packet scheduling algorithms on the DARTNET (DARPA...
Sharing the Cost of Multicast Transmissions 1 (2008)
Joan Feigenbaum, Christos H. Papadimitriou, Scott Shenker
We investigate cost-sharing algorithms for multicast transmission. Economic considerations point to two distinct mechanisms, marginal cost and Shapley value, as the two solutions most appropriate in...
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...
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...
Richard M. Karp, Scott Shenker, Christos H. Papadimitriou
We present a simple, exact algorithm for identifying in a multiset the items with frequency more than a threshold θ. The algorithm requires two passes, linear time, and space 1/θ. The first pass is...
ABSTRACT Distributed Algorithmic Mechanism Design: Recent Results and Future Directions ∗ (2008)
Joan Feigenbaum, Scott Shenker
Distributed Algorithmic Mechanism Design (DAMD) combines theoretical computer science’s traditional focus on computational tractability with its more recent interest in incentive compatibility and...
Sylvia Ratnasamy, Scott Shenker, Ion Stoica, Harlan Yu
OTHER INTELLECTUAL PROPERTY RIGHT. Intel products are not intended for use in
ABSTRACT Distributed Algorithmic Mechanism Design: Recent Results and Future Directions ∗ (2008)
Joan Feigenbaum, Scott Shenker
Distributed Algorithmic Mechanism Design (DAMD) combines theoretical computer science’s traditional focus on computational tractability with its more recent interest in incentive compatibility and...
ABSTRACT Distributed Algorithmic Mechanism Design: Recent Results and Future Directions ∗ (2008)
Joan Feigenbaum, Scott Shenker
Distributed Algorithmic Mechanism Design (DAMD) combines theoretical computer science’s traditional focus on computational tractability with its more recent interest in incentive compatibility and...
Joseph M. Hellerstein, Vern Paxson, Larry Peterson, Timothy Roscoe, Scott Shenker, David Wetherall, ...
Aksj Jay Aikat, Jasleen Kaur, F. Donelson Smith, Ally Sanjeewa Athuraliya, Victor H. Li, ...
Recommendations on queue management and congestion avoidance in the Internet.
Sean Rhea, Byung-gon Chun, John Kubiatowicz, Scott Shenker
The distributed hash table, or DHT, is a distributed system
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...
A Distributed System For Resolving Flat Names (2008)
Mythili Vutukuru, Michael Walfish, Hari Balakrishnan, Scott Shenker
This poster describes the design of a distributed system to resolve flat semantic-free identifiers. Because Distributed Hash Tables (DHTs, [10, 13]) in theory allow users of the DHT to perform fast...
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...
Alan Demers, Srinivasan Keshavü, Scott Shenker
(Originally published in Proceedings SIGCOMM ë89,
A Modular Sensornet Architecture: Past, Present, and Future Directions (2008)
Arsalan Tavakoli, Prabal Dutta, Jaein Jeong, Sukun Kim, Jorge Ortiz, David Culler, ...
Wireless sensornets provide an unprecedented opportunity to gather huge volumes of data about the physical world around us. Sensornets, however, have severe resource constraints, in terms of power,...
A Modular Sensornet Architecture: Past, Present, and Future Directions (2008)
Arsalan Tavakoli, Prabal Dutta, Jaein Jeong, Sukun Kim, Jorge Ortiz, David Culler, ...
Wireless sensornets provide an unprecedented opportunity to gather huge volumes of data about the physical world around us. Sensornets, however, have severe resource constraints, in terms of power,...
• PSFQ: A Reliable Transport Protocol For Wireless Sensor Networks (2008)
Ibrahim Matta, Georgios Smaragdakis, Wei Li, Vijay Erramilli, Wendi Rabiner Heinzelman, J. Kulik, ...
• Sensor nodes perform sensing tasks and report back data to user (via the “sink”) • Sensor nodes are resource-constrained (limited battery power, processing power, memory, etc.) • High...
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...
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
Posted Price Profit Maximization for Multicast by Approximating Fixed Points (2008)
Aranyak Mehta, Scott Shenker, Vijay V. Vazirani
We describe an iterative fixed point approach for the following stochastic optimization problem: given a multicast tree and probability distributions of user utilities, find an optimal posted price...
Mechanism Design for Policy Routing Received: Accepted: (2008)
Joan Feigenbaum, Rahul Sami, Scott Shenker, J. Feigenbaum, R. Sami, S. Shenker
Abstract The Border Gateway Protocol (BGP) for interdomain routing is designed to allow autonomous systems (ASes) to express policy preferences over alternative routes. We model these preferences as...
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...
redirect is the model for the future (2008)
Sumeet Singh, Scott Shenker, George Varghese
The Internet provides tremendous flexibility, in that it can support a wide variety of services, and accessibility, in that these services can be invoked from anywhere. However, the current Internet...
Overcoming the Internet Impasse through (2008)
Most current Internet research involves either empirical measurement studies or incremental modifications that can be deployed without major architectural changes. Easy access to virtual testbeds...
ABSTRACT Distributed Algorithmic Mechanism Design: Recent Results and Future Directions ∗ (2008)
Joan Feigenbaum, Scott Shenker
Distributed Algorithmic Mechanism Design (DAMD) combines theoretical computer science’s traditional focus on computational tractability with its more recent interest in incentive compatibility and...
David D. Clarkl, Scott Shenker, Lixia Zhang
This paper considers the support of real-time applications
Abstract SANE: A Protection Architecture for Enterprise Networks (2008)
Martin Casado, Tal Garfinkel, Aditya Akella, Michael J. Freedman, Dan Boneh, Nick Mckeown, ...
Connectivity in today’s enterprise networks is regulated by a combination of complex routing and bridging policies, along with various interdiction mechanisms such as ACLs, packet filters, and...
Middleboxes No Longer Considered Harmful (2008)
Abstract Intermediate network elements, such as network addresstranslators (NATs), firewalls, and transparent caches are
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...
Middleboxes No Longer Considered Harmful (2008)
Abstract Intermediate network elements, such as network addresstranslators (NATs), firewalls, and transparent caches are
Diverse replication for single-machine Byzantine-fault tolerance (2008)
Byung-gon Chun, Petros Maniatis, Scott Shenker
New single-machine environments are emerging from abundant computation available through multiple cores and secure virtualization. In this paper, we describe the research challenges and opportunities...
Diverse replication for single-machine Byzantine-fault tolerance (2008)
Byung-gon Chun, Petros Maniatis, Scott Shenker
New single-machine environments are emerging from abundant computation available through multiple cores and secure virtualization. In this paper, we describe the research challenges and opportunities...
Eric J. Friedman, Scott Shenker
We introduce a slightly modified version of a standard learning automaton and show that this `responsive ' learning automata eliminates dominated strategies when playing against an unknown...
Sugih Jamin, Scott Shenker, Lixia Zhang, David D. Clark
) Sugih Jamin 1 , Scott Shenker 2 , Lixia Zhang 2 , and David D. Clark 3 1 Department of Computer Science, University of Southern California 2 Palo Alto Research Center, Xerox Corporation 3...
Aaron Archer, Joan Feigenbaum, Arvind Krishnamurthy, Rahul Sami, Scott Shenker
We investigate multicast cost sharing from both computational and economic perspectives. Recent work in economics leads to the consideration of two mechanisms: marginal cost (MC), which is ecient and...
Joan Feigenbaum, Christos Papadimitriou, Rahul Sami, Scott Shenker
Summary. The routing of traffic between Internet domains, or Autonomous Systems (ASs), a task known as interdomain routing, is currently handled by the Border Gateway Protocol (BGP). In this paper,...
Sriram Ramabhadran, Sylvia Ratnasamy, Joseph M. Hellerstein, Scott Shenker, Hash Tables
The explosive growth but primitive design of peer-to-peer file-sharing applications such as Gnutella inspired the research community to invent Distributed Hash Tables [1]. While the DHT has enjoyed...
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...
Incentives and Internet computation (2007)
Sergio Rajsbaum, Joan Feigenbaum, Scott Shenker
The Distributed Computing Column covers the theory of systems that are composed of a number of interacting computing elements. These include problems of communication and networking, databases,...
Abstract Data-Centric Storage in Sensornets with GHT, A Geographic Hash Table (2007)
Sylvia Ratnasamy, Scott Shenker, Ramesh Govindan
Making effective use of the vast amounts of data gathered by largescale sensor networks (sensornets) will require scalable, self-organizing, and energy-efficient data dissemination algorithms. For...
Aaron Archer, Joan Feigenbaum, Arvind Krishnamurthy, Rahul Sami, Scott Shenker
Multicast routing is a technique for transmitting a packet from a single source to multiple receivers without wasting network bandwidth. To achieve transmission e#ciency, multicast routing constructs...
Hari Balakrishnan, Scott Shenker, Michael Walfish
Every distributed system that employs linking requires a Reference Resolution Service (RRS) to convert link references to locations. We argue that the Web's use of DNS for this function is a bad...
Patterns of Congestion Collapse (2007)
Tom Kelly, Sally Floyd, Scott Shenker
In this paper we consider the potential for congestion collapse in a range of network scenarios. In particular, we are interested in the effect of the topology, the scheduling discipline (FIFO or FQ...
1 Approximate Fairness through Differential Dropping (2007)
Rong Pan, Lee Breslau, Balaji Prabhakar, Scott Shenker
Abstract--- Many researchers have argued that the Internet architecture would be more robust and more accommodating of heterogeneity if routers allocated bandwidth fairly. However, most of the...
Fraction of 1-Second Rates (2007)
Rong Pan, Lee Breslau, Balaji Prabhakar, Scott Shenker
Abstract--- The current Internet architecture relies on congestion avoidance mechanisms implemented in the transport layer protocols, like TCP, to provide good service under heavy load. If routers...
Hongsuda Tangmunarunkit, Scott Shenker
Following the long-held belief that the Internet is hierarchical, the network topology generators most widely used by the Internet research community, Transit-Stub and Tiers, create networks with a...
Sylvia Ratnasamy, Paul Francis, Mark Handley, Richard Karp, Scott Shenker
Hash tables-- which map "keys " onto "values "-- are an essential building block in modern software systems. We believe a similar functionality would be equally...
Sylvia Ratnasamy, Mark Handley, Richard Karp, Scott Shenker
Most currently proposed solutions to application-level multicast organize the group members into an application-level mesh over which a Distance-Vector routing protocol, or a similar algorithm, is...
Hongsuda Tangmunarunkit, John Doyle, Ramesh Govindan, Sugih Jamin, Scott Shenker, Walter Willinger
AT&T
Internet Path In ation Due to Policy Routing (2007)
Hongsuda Tangmunarunkit, Ramesh Govindan, Scott Shenker
In our previous work, 1 we used a simplied model of routing policy in the Internet to study the impact of policy routing on Internet path-lengths. This prior work suered from two shortcomings|it was...
Sylvia Ratnasamy, Paul Francis, Mark Handley, Richard Karp, Scott Shenker
Hash tables-- which map "keys " onto "values "-- are an essential building block in modern software systems. We believe a similar functionality would be equally...
Ramesh Govindan, Sugih Jamin, Scott Shenker, Walter Willinger
It has long been thought that the Internet, and its constituent networks, are hierarchical in nature. Consequently, the network topology generators most widely used by the Internet research...
Joan Feigenbaum, Arvind Krishnamurthy, Rahul Sami, Scott Shenker
We investigate multicast cost sharing from both computational and economic points of view. Recent work in economics (Moulin and Shenker, 2001) leads naturally to the consideration of two mechanisms:...
Eric J. Friedman, Scott Shenker, Amy Greenwald, Amy Greenwald
The authors would like to thank Dean Foster for extensive discussions and insightful suggestions. 3
Sylvia Ratnasamy, Paul Francis, Mark Handley, Richard Karp, Scott Shenker
Hash tables-- which map "keys " onto "values "-- are an essential building block in modern software systems. We believe a similar functionality would be equally...
Hari Balakrishnan, Scott Shenker, Michael Walfish
Every distributed system that employs linking requires a Reference Resolution Service (RRS) to convert link references to locations. We argue that the Web's use of DNS for this function is a bad...
Joan Feigenbaum, Christos Papadimitriou, Rahul Sami, Scott Shenker
The routing of trac between Internet domains or Autonomous Systems (ASs), a task known as interdomain routing, is currently handled by the Border Gateway Protocol (BGP). In this paper, we address the...
Michael Walfish, Hari Balakrishnan, Scott Shenker
The Web relies on the Domain Name System (DNS) to resolve the hostname portion of URLs into IP addresses. This marriage-of-convenience enabled the Web's meteoric rise, but the resulting...
We propose the Robust Overlay Architecture for Mobility (2007)
Shelley Zhuang, Kevin Lai, Ion Stoica, Randy Katz, Scott Shenker
Hari Balakrishnan, Scott Shenker, Sylvia Ratnasamy, 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...
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...
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...
Attested append-only memory: Making adversaries stick to their word (2007)
Byung-gon Chun, Petros Maniatis, Scott Shenker, John Kubiatowicz
Researchers have made great strides in improving the fault tolerance of both centralized and replicated systems against arbitrary (Byzantine) faults. However, there are hard limits to how much can be...
David Clark Mit, Scott Shenker, Uc Berkeley, Lorenzo Alvisi, Ramesh Govindan Usc, Joe Hellerstein
This is the last version to be released under auspices of the GENI Research Coordination
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,...
An architecture for energy management in wireless sensor networks (2007)
Xiaofan Jiang, Jay Taneja, Jorge Ortiz, Arsalan Tavakoli, Prabal Dutta, Jaein Jeong, ...
Sensornets are becoming more widely adopted for commercial and scientific use and, in settings where battery replacement or recharging is difficult, it is important that sensornets have long and...
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...
Simplifying Access Control in Enterprise Networks (2007)
Cheng Tien Ee, John Lee, Dave Maltz, Scott Shenker, Lakshminarayanan Subramanian, Cheng Tien Ee, ...
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...
Understanding and Exploiting Network Traffic Redundancy (2007)
Archit Gupta, Aditya Akella, Srinivasan Seshan, Scott Shenker, Jia Wang, Archit Gupta, ...
Abstract — The Internet carries a vast amount and a wide range of content. Some of this content is more popular, and accessed more frequently, than others. The popularity of content could be quite...
ETHANE: Taking Control of the Enterprise (2007)
Martín Casado, Michael J. Freedman, Justin Pettit, Jianying Luo, Nick Mckeown, Scott Shenker
This paper presents Ethane, a new network architecture for the enterprise. Ethane allows managers to define a single networkwide fine-grain policy, and then enforces it directly. Ethane couples...
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...
An architecture for energy management in wireless sensor networks (2007)
Xiaofan Jiang, Jay Taneja, Jorge Ortiz, Arsalan Tavakoli, Prabal Dutta, Jaein Jeong, ...
Sensornets are becoming more widely adopted for commercial and scientific use and, in settings where battery replacement or recharging is difficult, it is important that sensornets have long and...
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,...
Towards a Modern Communications API (2007)
Michael Demmer, Kevin Fall, Teemu Koponen, Scott Shenker
We contend that a new networking API could better serve the needs of data- and service-oriented applications, and could more easily map to heterogeneous environments, than the pervasive Sockets API...
Holding the Internet accountable (2007)
David Andersen, Hari Balakrishnan, Nick Feamster, Teemu Koponen, Daekyeong Moon, Scott Shenker
Today’s IP network layer provides little to no protection against misconfiguration or malice. Despite some progress in improving the robustness and security of the IP layer, misconfigurations and...
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,...
Towards a Modern Communications API (2007)
Michael Demmer, Kevin Fall, Teemu Koponen, Scott Shenker
We contend that a new networking API could better serve the needs of data- and service-oriented applications, and could more easily map to heterogeneous environments, than the pervasive Sockets API...
Resolving inter-domain policy disputes (2007)
Vijay Ramachandran, Cheng Tien Ee, Cheng Tien Ee, Vijay Ramach, Byung-gon Chun, Byung-gon Chun, ...
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...
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...
The design and implementation of a declarative sensor network system (2006)
David Chu, Lucian Popa, Arsalan Tavakoli, Joseph M. Hellerstein, Philip Levis, Scott Shenker
Sensor networks are notoriously difficult to program, given that they encompass the complexities of both distributed and embedded systems. To address this problem, we present the design and...
Distributed quota enforcement for spam control (2006)
Michael Walfish, J. D. Zamfirescu, Hari Balakrishnan, David Karger, Scott Shenker
Spam, by overwhelming inboxes, has made email a less reliable medium than it was just a few years ago. Spam filters are undeniably useful but unfortunately can flag non-spam as spam. To restore...
Sapheniea: Simplifying Configuration Using Classes (2006)
Cheng Tien Ee, Scott Shenker, Lakshminarayanan Subramanian, Cheng Tien Ee, Scott Shenker
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...
DDoS Defense by Offense (2006)
Michael Walfish, Mythili Vutukuru, Hari Balakrishnan, David Karger, Scott Shenker
This paper presents the design, implementation, analysis, and experimental evaluation of speak-up, a defense against applicationlevel distributed denial-of-service (DDoS), in which attackers cripple...
Distributed segment tree: Support of range query and cover query over dht (2006)
Changxi Zheng, Guobin Shen, Shipeng Li, Scott Shenker
Range query, which is defined as to find all the keys in a certain range over the underlying P2P network, has received a lot of research attentions recently. However, cover query, which is to find...
DDoS Defense by Offense (2006)
Michael Walfish, Mythili Vutukuru, Hari Balakrishnan, David Karger, Scott Shenker
This paper presents the design, implementation, analysis, and experimental evaluation of speak-up, a defense against applicationlevel distributed denial-of-service (DDoS), in which attackers cripple...
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...
Cookies Along Trust-boundaries (CAT): Accurate and Deployable Flood Protection (2006)
Martin Casado, Aditya Akella, Pei Cao, Niels Provos, Scott Shenker
Packet floods targeting a victim’s incoming bandwidth are notoriously difficult to defend against. While a number of solutions have been proposed, such as network capabilities, thirdparty traffic...
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...
Fighting Coordinated Attackers with Cross-Organizational Information Sharing (2006)
Mark Allman, Ethan Blanton, Vern Paxson, Scott Shenker
In this paper we propose an architecture for using crossorganization information sharing to identify members of a group of hosts enslaved for malicious purposes on the Internet. We root our system in...
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...
The design and implementation of a declarative sensor network system (2006)
David Chu, Lucian Popa, Arsalan Tavakoli, Joseph M. Hellerstein, Philip Levis, Scott Shenker
Sensor networks are notoriously difficult to program, given that they encompass the complexities of both distributed and embedded systems. To address this problem, we present the design and...
DDoS Defense by Offense (2006)
Michael Walfish, Mythili Vutukuru, Hari Balakrishnan, David Karger, Scott Shenker
This paper presents the design, implementation, analysis, and experimental evaluation of speak-up, a defense against applicationlevel distributed denial-of-service (DDoS), in which attackers cripple...
Distributed quota enforcement for spam control (2006)
Michael Walfish, J. D. Zamfirescu, Hari Balakrishnan, David Karger, Scott Shenker
Spam, by overwhelming inboxes, has made email a less reliable medium than it was just a few years ago. Spam filters are undeniably useful but unfortunately can flag non-spam as spam. To restore...
Cookies Along Trust-boundaries (CAT): Accurate and Deployable Flood Protection (2006)
Martin Casado, Aditya Akella, Pei Cao, Niels Provos, Scott Shenker
Packet floods targeting a victim’s incoming bandwidth are notoriously difficult to defend against. While a number of solutions have been proposed, such as network capabilities, thirdparty traffic...
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...
Lazy Cross-Link Removal for Geographic Routing (2006)
Young-jin Kim, Ramesh Govindan, Brad Karp, Scott Shenker
Geographic techniques promise highly scalable any-toany routing in wireless sensor networks. In one thread of research on geographic routing, researchers have explored robust, distributed graph...
Distributed segment tree: Support of range query and cover query over dht (2006)
Changxi Zheng, Guobin Shen, Shipeng Li, Scott Shenker
Range query, which is defined as to find all the keys in a certain range over the underlying P2P network, has received a lot of research attentions recently. However, cover query, which is to find...
Supplement to “Distributed Quota Enforcement for Spam Control (2006)
Michael Walfish, Michael Walfish, J. D. Zamfirescu, J. D. Zamfirescu, Hari Balakrishnan, David Karger, ...
This report is a supplement to our paper “Distributed Quota Enforcement for Spam Control ” [1]. We assume here that the reader has read the main paper. In this report, we first analyze the...
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...
SmartSeer: Using a DHT to process continuous queries over peer-to-peer networks (2006)
Jayanthkumar Kannan, Beverly Yang, Scott Shenker, Puneet Sharma, Sujata Banerjee, Sujoy Basu, ...
Abstract — As the academic world moves away from physical journals and proceedings towards online document repositories, the ability to efficiently locate work of interest among the torrent of...
Revisiting Internet address: Back to the future (2006)
Mythili Vutukuru, Mythili Vutukuru, Nick Feamster, Nick Feamster, Michael Walfish, Michael Walfish, ...
IP prefixes undermine three goals of Internet routing: accurate reflection of network-layer reachability, secure routing messages, and effective traffic control. This paper presents Atomic IP (AIP),...
Cheng Tien Ee, Vijay Ramachandran, Byung-gon Chun, Scott Shenker, Cheng Tien Ee, Vijay Ramachandran
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...
David Chu, Lucian Popa, Arsalan Tavakoli, Joseph M. Hellerstein, Philip Levis, Scott Shenker
Sensor networks are notoriously difficult to program, given that they encompass the complexities of both distributed and embedded systems. To address this problem, we present the design and...
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...
Status: Final Overcoming the Internet Impasse through Virtualization (2005)
Thomas Anderson, Larry Peterson, Scott Shenker, Jonathan Turner, Tom Anderson, Larry Peterson, ...
Abstract: The current Internet is at an impasse because new architectures cannot be deployed, or even adequately evaluated. This paper urges the community to confront this impasse, and suggests a way...
On the pitfalls of geographic face routing (2005)
Young-jin Kim, Ramesh Govindan, Brad Karp, Scott Shenker
Geographic face routing algorithms have been widely studied in the literature [1, 8, 13]. All face routing algorithms rely on two primitives: planarization and face traversal. The former computes a...
Geographic routing made practical (2005)
Young-jin Kim, Ramesh Govindan, Brad Karp, Scott Shenker
Geographic routing has been widely hailed as the most promising approach to generally scalable wireless routing. However, the correctness of all currently proposed geographic routing algorithms...
Hitesh Ballani, Yatin Chawathe, Sylvia Ratnasamy, Timothy Roscoe, Scott Shenker
The original Internet architecture was designed to provide universal reachability; any host can send any amount of traffic (modulo congestion control) to any destination. This blanket openness...
Geographic routing made practical (2005)
Young-jin Kim, Ramesh Govindan, Brad Karp, Scott Shenker
Geographic routing has been widely hailed as the most promising approach to generally scalable wireless routing. However, the correctness of all currently proposed geographic routing algorithms...
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...
Overcoming Barriers to Disruptive Innovation in Networking (2005)
Thomas Anderson, Larry Peterson, Scott Shenker, Jonathan Turner
Any opinions, findings, conclusions or recommendations expressed in this report are those of the workshop participants and do not necessarily reflect the views of their institutions or 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...
Peering Peer-to-Peer Providers (2005)
Hari Balakrishnan Scott, Scott Shenker, Michael Walfish
The early peer-to-peer applications eschewed commercial arrangements and instead established a grass-roots model in which the collection of end-users provided their own distributed computational...
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...
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...
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...
A Case Study in Building Layered DHT Applications (2005)
Yatin Chawathe, Sriram Ramabhadran, Sylvia Ratnasamy, Anthony Lamarca, Scott Shenker
Recent research has shown that one can use Distributed Hash Tables (DHTs) to build scalable, robust and e#cient applications. One question that is often left unanswered is that of simplicity of...
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...
Peering Peer-to-Peer Providers (2005)
Hari Balakrishnan Scott, Scott Shenker, Michael Walfish
The early peer-to-peer applications eschewed commercial arrangements and instead established a grass-roots model in which the collection of end-users provided their own distributed computational...
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...
DoS: Fighting Fire with Fire (2005)
Michael Walfish Hari, Hari Balakrishnan, David Karger, Scott Shenker
We consider DoS attacks on servers in which attackers' requests are indistinguishable from legitimate requests. Most current defenses against this class of attack rely on legitimate users in...
Fixing the Embarrassing Slowness of OpenDHT on PlanetLab (2005)
Sean Rhea, Byung-gon Chun, John Kubiatowicz, Scott Shenker
Introduction The distributed hash table, or DHT, is a distributed system that provides a traditional hash table's simple put/get interface using a peer-to-peer overlay network. To echo the...
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...
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...
Hitesh Ballani, Yatin Chawathe, Sylvia Ratnasamy, Timothy Roscoe, Scott Shenker
The original Internet architecture was designed to provide universal reachability; any host can send any amount of traffic (modulo congestion control) to any destination. This blanket openness...
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, ...
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...
Fighting coordinated attackers with cross-organizational information sharing (2005)
Mark Allman, Ethan Blanton, Vern Paxson, Scott Shenker
In this paper we propose an architecture for using crossorganization information sharing to identify members of a group of hosts enslaved for malicious purposes on the Internet. We root our system in...
Joseph M. Hellerstein, Vern Paxson, Larry Peterson, Timothy Roscoe, Scott Shenker, David Wetherall
This paper sets out a high-level research agenda aimed at building a collaborative, global end-system monitoring and information infrastructure for the Internet’s core state. We argue that such a...
Geographic routing made practical (2005)
Young-jin Kim, Ramesh Govindan, Brad Karp, Scott Shenker
Geographic routing has been widely hailed as the most promising approach to generally scalable wireless routing. However, the correctness of all currently proposed geographic routing algorithms...
Joan Feigenbaum, Christos Papadimitriou, Rahul Sami, Scott Shenker
Summary. The routing of traffic between Internet domains, or Autonomous Systems (ASs), a task known as interdomain routing, is currently handled by the Border Gateway Protocol (BGP). In this paper,...
On the pitfalls of geographic face routing (2005)
Young-jin Kim, Ramesh Govindan, Brad Karp, Scott Shenker
Geographic face routing algorithms have been widely studied in the literature [1, 8, 13]. All face routing algorithms rely on two primitives: planarization and face traversal. The former computes a...
Digital Rights Management and the Pricing of Digital Products. working paper (2005)
Yooki Park, Scott Shenker, Especially Emmanuel Farhi
Abstract: As it becomes cheaper to copy and share digital content, vendors are turning to technical protections such as encryption. We argue that if protection is nevertheless imperfect, this...
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...
Overcoming the internet impasse through virtualization (2004)
Larry Peterson, Scott Shenker, Jonathan Turner
Abstract: The current Internet is at an impasse because new architectures cannot be deployed, or even adequately evaluated. This paper urges the community to confront this impasse, and suggests a way...
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...
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...
Philip Levis, Neil Patel, David Culler, Scott Shenker
We present Trickle, an algorithm for propagating and maintaining code updates in wireless sensor networks. Borrowing techniques from the epidemic/gossip, scalable multicast, and wireless broadcast...
Towards an Economic Analysis of Trusted Systems (2004)
Dirk Bergemann, Scott Shenker, Joan Feigenbaum, Jonathan Smith
this paper was completed while he was at the Univ. of Pennsylvania
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...
A Layered Naming Architecture for the Internet (2004)
Hari Balakrishnan Hari, Karthik Lakshminarayanan, Sylvia Ratnasamy, Scott Shenker, 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...
Global Synchronization in Sensornets (2004)
Richard Karp Jeremy, Richard M. Karp, Jeremy Elson, Christos H. Papadimitriou, Scott Shenker
Time synchronization is necessary in many distributed systems, but achieving synchronization in sensornets, which combine stringent precision requirements with severe resource constraints, is...
Spurring Adoption of DHTs with OpenHash, a Public DHT Service (2004)
Brad Karp Sylvia, Scott Shenker
this paper is an examination of what one can do to extend the functionality of a DHT service so that such application-specific requirements can be reasonably accommodated. That is, we seek to share 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...
Prefix Hash Tree: An Indexing Data Structure over Distributed Hash Tables (2004)
Sriram Ramabhadran, Sylvia Ratnasamy, Joseph M. Hellerstein, Scott Shenker
Distributed Hash Tables are scalable, robust, and self-organizing peer-to-peer systems that support exact match lookups. This paper describes the design and implementation of a Prefix Hash Tree - a...
Providing Packet Obituaries (2004)
Katerina Argyraki, Petros Maniatis, David Cheriton, Scott Shenker
The Internet is transparent to success but opaque to failure. This veil of ignorance prevents ISPs from detecting failures by peering partners, and hosts from intelligently adapting their routes to...
Reduced State Routing in the Internet (2004)
Ramakrishna Gummadi, Ramesh Govindan, Nupur Kothari, Brad Karp, Young-Jin Kim, Scott Shenker
In today's Internet core, routers store forwarding state proportional to the number of edge networks. As the Internet grows and core line rates increase, routers require memories that are...
Brief Announcement: Prefix Hash Tree (2004)
Sriram Ramabhadran Sylvia, Sylvia Ratnasamy, Joseph M. Hellerstein, Scott Shenker, Hash Tables
This paper describes the Prefix Hash Tree, a distributed data structure that enables range queries over Distributed Hash Tables.
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...
Overcoming the internet impasse through virtualization (2004)
Larry Peterson, Scott Shenker, Jonathan Turner
Abstract: The current Internet is at an impasse because new architectures cannot be deployed, or even adequately evaluated. This paper urges the community to confront this impasse, and suggests a way...
Philip Levis, Neil Patel, Scott Shenker, David Culler
We present Trickle, an algorithm for propagating and maintaining code updates in wireless sensor networks. Trickle uses a "polite gossip" policy, where nodes periodically broadcast a code...
Global synchronization in sensornets (2004)
Richard M. Karp, Jeremy Elson, Christos H. Papadimitriou, Scott Shenker
Time synchronization is necessary in many distributed systems, but achieving synchronization in sensornets, which combine stringent precision requirements with severe resource constraints, is...
Practical and robust geographic routing in wireless networks (2004)
Young-jin Kim, Ramesh Govindan, Brad Karp, Scott Shenker
Existing geographic face routing algorithms use planarization techniques that rely on the unit-graph assumption, and thus can exhibit persistent routing failure when used with real radios, whose...
Data-centric storage in sensornets with GHT, a geographic hash table (2003)
Sylvia Ratnasamy, Brad Karp, Scott Shenker, Deborah Estrin, Li Yin
Abstract. Making effective use of the vast amounts of data gathered by large-scale sensor networks (sensornets) will require scalable, self-organizing, and energy-efficient data dissemination...
Making Gnutella-like P2P systems scalable (2003)
Sylvia Ratnasamy, Lee Breslau, Scott Shenker, Yatin Chawathe, Yatin Chawathe, Nick Lanham, ...
Napster pioneered the idea of peer-to-peer file sharing, and supported it with a centralized file search facility. Subsequent P2P systems like Gnutella adopted decentralized search algorithms....
Data-centric storage in sensornets with GHT, a geographic hash table (2003)
Brad Karp, Deborah Estrin, Fang Yu, Sylvia Ratnasamy, Sylvia Ratnasamy, Scott Shenker, ...
Making effective use of the vast amounts of data gathered by largescale sensor networks (sensornets) will require scalable, self-organizing, and energy-efficient data dissemination algorithms. For...
On Selfish Routing in Internet-Like Environments (2003)
Lili Qiu, Yang Richard Yang, Yin Zhang, Scott Shenker
Abstract — A recent trend in routing research is to avoid inefficiencies in network-level routing by allowing hosts to either choose routes themselves (e.g., source routing) or use overlay routing...
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...
On Selfish Routing in Internet-Like Environments (2003)
Lili Qiu, Yang Richard Yang, Yin Zhang, Scott Shenker
Abstract—A recent trend in routing research is to avoid inefficiencies in network-level routing by allowing hosts to either choose routes themselves (e.g., source routing) or use overlay routing...
Optimal and global time synchronization in sensornets (2003)
Richard Karp, Jeremy Elson, Deborah Estrin, Scott Shenker
Time synchronization is necessary in many distributed systems, but achieving synchronization in sensornets, which combine stringent precision requirements with severe resource constraints, is...
Difs: A distributed index for features in sensor networks (2003)
Benjamin Greenstein, Deborah Estrin, Ramesh Govindan, Sylvia Ratnasamy, Scott Shenker
Abstract — Sensor networks pose new challenges in the collection and distribution of data. Recently, much attention has been focused on standing queries that use in-network aggregation of time...
A simple algorithm for finding frequent elements in streams and bags (2003)
Richard M. Karp, Christos H. Papadimitriou, Scott Shenker
Abstract. We present a simple, exact algorithm for iceberg queries (identifying in a multidet the items with frequency more than a threshold ) that requires two passes, linear time, and space 1=. 1.
Data-centric storage in sensornets (2003)
Scott Shenker, Sylvia Ratnasamy, Brad Karp, Ramesh Govindan, Deborah Estrin
Recent engineering advances in the design of small energy-efficient hardware and compact operating systems have enabled the development of large-scale distributed sensing networks (sensornets) made
Data-centric storage in sensornets with GHT, a geographic hash table (2003)
Brad Karp, Deborah Estrin, Li Yin, Fang Yu, Sylvia Ratnasamy, Sylvia Ratnasamy, ...
Making effective use of the vast amounts of data gathered by largescale sensor networks (sensornets) will require scalable, self-organizing, and energy-efficient data dissemination algorithms. For...
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...
Mechanism Design for Policy Routing (2003)
Joan Feigenbaum, Rahul Sami, Scott Shenker
The Border Gateway Protocol (BGP) for interdomain routing is designed to allow autonomous systems (ASes) to express policy preferences over alternative routes. We model these preferences as arising...
On Selfish Routing in Internet-Like Environments (2003)
Lili Qiu, Yang Richard Yang, Yin Zhang, Yang Yin, Scott Shenker
A recent trend in routing research is to avoid inefficiencies in networklevel routing by allowing hosts to either choose routes themselves (e.g., source routing) or use overlay routing networks...
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...
Optimal and Global Time Synchronization in Sensornets (2003)
Richard Karp, Jeremy Elson, Deborah Estrin, Scott Shenker
Time synchronization is necessary in many distributed systems, but achieving synchronization in sensornets, which combine stringent precision requirements with severe resource constraints, is...
Range Queries over DHTs (2003)
Sylvia Ratnasamy, Sylvia Ratnasamy, Joseph M. Hellerstein, Joseph M. Hellerstein, Scott Shenker, Scott Shenker
Distributed Hash Tables (DHTs) are scalable peer-to-peer systems that support exact match lookups. This paper describes the construction and use of a Prefix Hash Tree (PHT) -- a distributed data...
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...
Profit-Maximizing Multicast Pricing by Approximating Fixed Points (Extended Abstract) (2003)
Aranyak Mehta, Scott Shenker, Vijay V. Vazirani
Aranyak Mehta Atlanta, GA 30332 aranyak@cc.gatech.edu Scott Shenker ICSI Berkeley, CA 94704 shenker@icsi.berkeley.edu Vijay V. Vazirani Atlanta, Ga 30332 vazirani@cc.gatech.edu ABSTRACT We describe a...
Profit-Maximizing Multicast Pricing by Approximating Fixed Points (2003)
Aranyak Mehta, Scott Shenker, Vijay V. Vazirani
We describe a xed point approach for the following stochastic optimization problem: given a multicast tree and probability distributions of user utilities, compute prices to oer the users in order to...
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...
Internet Topology: Discovery and Policy Impact (2003)
Hongsuda Tangmunarunkit, Ramesh Govindan, Scott Shenker
We cannot begin to understand the large-scale structure of the Internet without accurate representations of the Internet topology. Mercator is a program that uses hop-limited probes---the same...
Topologically-aware overlay construction and server selection (2002)
Sylvia Ratnasamy, Mark Handley, Richard Karp, Scott Shenker
A number of large-scale distributed Internet applications could potentially benefit from some level of knowledge about the relative proximity between its participating host nodes. For example, the...
Can heterogeneity make gnutella scalable (2002)
Qin Lv, Sylvia Ratnasamy, Scott Shenker
Even though recent research has identified many different uses for peer-to-peer (P2P) architectures, file sharing remains the dominant (by far) P2P application on
Hardness results for multicast cost sharing (2002)
Joan Feigenbaum, Arvind Krishnamurthy, Rahul Sami, Scott Shenker
We continue the study of multicast cost sharing from the viewpoints of both computational complexity and economic mechanism design. We provide fundamental lower bounds on the network complexity of...
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...
Observed structure of addresses in IP traffic (2002)
Eddie Kohler, Jinyang Li, Vern Paxson, Scott Shenker
This paper investigates the structure of addresses contained in IP traffic. Specifically, we analyze the structural characteristics of destination IP addresses seen on Internet links, considered as a...
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...
Controlling high bandwidth aggregates in the network (2002)
Ratul Mahajan, Steven M. Bellovin, Sally Floyd, John Ioannidis, Vern Paxson, Scott Shenker
The current Internet infrastructure has very few built-in protection mechanisms, and is therefore vulnerable to attacks and failures. In particular, recent events have illustrated the Internet’s...
Hardness results for multicast cost sharing (2002)
Joan Feigenbaum, Arvind Krishnamurthy, Rahul Sami, Scott Shenker
We continue the study of multicast cost sharing from the viewpoints of both computational complexity and economic mechanism design. We provide fundamental lower bounds on the network complexity of...
Observed structure of addresses in IP traffic (2002)
Eddie Kohler, Jinyang Li, Vern Paxson, Scott Shenker
This paper considers the structure of addresses contained in IP traffic. Specifically, we investigate the structural characteristics of destination IP addresses seen on Internet links, considered as...
Controlling high bandwidth aggregates in the network (2002)
Ratul Mahajan, Steven M. Bellovin, Sally Floyd, John Ioannidis, Vern Paxson, Scott Shenker
Controlling high bandwidth aggregates in the network (2002)
Ratul Mahajan, Steven M. Bellovin, Sally Floyd, John Ioannidis, Vern Paxson, Scott Shenker
The current Internet infrastructure has very few built-in protection mechanisms, and is therefore vulnerable to attacks and failures. In particular, recent events have illustrated the Internet’s...
Search and replication in unstructured peer-to-peer networks (2002)
Qin Lv, Pei Cao, Edith Cohen, Kai Li, Scott Shenker
Abstract Decentralized and unstructured peer-to-peer networks such as Gnutella are attractive for certain applicationsbecause they require no centralized directories and no precise control over...
Observed structure of addresses in IP traffic (2002)
Eddie Kohler, Jinyang Li, Vern Paxson, Scott Shenker
Abstract—We investigate the structure of addresses contained in IPv4 traffic—specifically, the structural characteristics of destination IP addresses seen on Internet links, considered as a...
GHT: A geographic hash table for data-centric storage (2002)
Sylvia Ratnasamy, Brad Karp, Li Yin, Fang Yu, Deborah Estrin, Ramesh Govindan, ...
Making effective use of the vast amounts of data gathered by largescale sensor networks will require scalable, self-organizing, and energy-efficient data dissemination algorithms. Previous work has...
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....
Topologically-aware overlay construction and server selection (2002)
Sylvia Ratnasamy, Mark H, Richard Karp, Scott Shenker
Abstract — A number of large-scale distributed Internet applications could potentially benefit from some level of knowledge about the relative proximity between its participating host nodes. For...
On the characteristics and origins of Internet flow rates (2002)
Yin Zhang, Lee Breslau, Vern Paxson, Scott Shenker
This paper considers the distribution of the rates at which flows transmit data, and the causes of these rates. First, using packet level traces from several Internet links, and summary flow...
Agents’ privacy in distributed algorithmic mechanisms. Position Paper (2002)
Joan Feigenbaum, Noam Nisan, Vijay Ramachandran, Rahul Sami, Scott Shenker
In traditional theoretical computer science (TCS), computational agents are typically assumed either to be obedient (i.e., to follow the prescribed algorithm) or to be adversaries who “play against...
Aggregate-based congestion control (2002)
Ratul Mahajan, Steven M. Bellovin, Sally Floyd, John Ioannidis, Vern Paxson, Scott Shenker
Recent events have illustrated the Internet's vulnerability to both denial of service (DoS) attacks and flash crowds in which links (or servers) in the network become severely congested. In both...
Distributed Algorithmic Mechanism Design: Recent Results and Future Directions (2002)
Joan Feigenbaum, Scott Shenker
Distributed Algorithmic Mechanism Design (DAMD) combines theoretical computer science's traditional focus on computational tractability with its more recent interest in incentive compatibility...
Hardness results for multicast cost sharing (2002)
Joan Feigenbaum, Arvind Krishnamurthy, Rahul Sami, Scott Shenker
We continue the study of multicast cost sharing from the viewpoints of both computational complexity and economic mechanism design. We provide fundamental lower bounds on the network complexity of...
A BGP-based Mechanism for Lowest-Cost Routing (2002)
Joan Feigenbaum, Christos Papadimitriou, Rahul Sami, Scott Shenker
The routing of tra#c between Internet domains or Autonomous Systems (ASs), a task known as interdomain routing, is currently handled by the Border Gateway Protocol (BGP). In this paper, we address...
Controlling high bandwidth aggregates in the network (2002)
Ratul Mahajan, Steven M. Bellovin, Sally Floyd, John Ioannidis, Vern Paxson, Scott Shenker
The current Internet infrastructure has very few built-in protection mechanisms, and is therefore vulnerable to attacks and failures. In particular, recent events have illustrated the Internet's...
Observed structure of addresses in IP traffic (2002)
Eddie Kohler, Jinyang Li, Vern Paxson, Scott Shenker
This paper investigates the structure of addresses contained in IP traffic. Specifically, we analyze the structural characteristics of destination IP addresses seen on Internet links, considered as a...
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...
Controlling high bandwidth aggregates in the network (2002)
Ratul Mahajan, Steven M. Bellovin, Sally Floyd, John Ioannidis, Vern Paxson, Scott Shenker
The current Internet infrastructure has very few built-in protection mechanisms, and is therefore vulnerable to attacks and failures. In particular, recent events have illustrated the Internet's...
Hardness Results for Multicast Cost Sharing (Extended Abstract (2002)
Joan Feigenbaum, Arvind Krishnamurthy, Rahul Sami, Scott Shenker
Abstract. We continue the study of multicast cost sharing from the viewpoints of both computational complexity and economic mechanism design. We provide fundamental lower bounds on the network...
Controlling high bandwidth aggregates in the network (2002)
Ratul Mahajan, Steven M. Bellovin, Sally Floyd, John Ioannidis, Vern Paxson, Scott Shenker
The current Internet infrastructure has very few built-in protection mechanisms and is therefore vulnerable to attacks and failures. In particular, recent events have illustrated the Internet's...
Controlling high bandwidth aggregates in the network (2002)
Ratul Mahajan, Steven M. Bellovin, Sally Floyd, John Ioannidis, Vern Paxson, Scott Shenker
The current Internet infrastructure has very few built-in protection mechanisms and is therefore vulnerable to attacks and failures. In particular, recent events have illustrated the Internet's...
Controlling high bandwidth aggregates in the network (2002)
Ratul Mahajan, Steven M. Bellovin, Sally Floyd, John Ioannidis, Vern Paxson, Scott Shenker
The current Internet infrastructure has very few built-in protection mechanisms and is therefore quite vulnerable to attacks and failures. In particular, recent events have illustrated the...
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...
GHT: A Geographic Hash Table for Data-Centric Storage (2002)
Sylvia Ratnasamy And, Sylvia Ratnasamy, Brad Karp, Yin Li, Fang Yu, Deborah Estrin, ...
Making effective use of the vast amounts of data gathered by largescale sensor networks will require scalable, self-organizing, and energy-efficient data dissemination algorithms. Previous work has...
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 Sensor Network as a Database (2002)
Ramesh Govindan, Joseph M. Hellerstein, Wei Hong, Samuel Madden, Michael Franklin, Scott Shenker
Wireless sensor networks are an emerging area of research interest with a number of compelling potential applications. By architecting sensor networks as virtual databases, we can provide a...
Topologically-aware overlay construction and server selection (2002)
Sylvia Ratnasamy, Mark H, Richard Karp, Scott Shenker
Abstract — A number of large-scale distributed Internet applications could potentially benefit from some level of knowledge about the relative proximity between its participating host nodes. For...
Aggregate-based congestion control (2002)
Ratul Mahajan, Steven M. Bellovin, Sally Floyd, John Ioannidis, Vern Paxson, Scott Shenker
Recent events have illustrated the Internet’s vulnerability to both denial of service (DoS) attacks and flash crowds in which links (or servers) in the network become severely congested. In both...
Hardness Results for Multicast Cost Sharing (Extended Abstract) (2002)
Joan Feigenbaum, Arvind Krishnamurthy, Rahul Sami, Scott Shenker
Joan Feigenbaum Arvind Krishnamurthy Rahul Sami + Yale University, Computer Science Dept., New Haven, CT 06520-8285.
Network Topology Generators: Degree-Based vs. Structural (2002)
Hongsuda Tangmunarunkit, Ramesh Govindan, Sugih Jamin, Scott Shenker, Walter Willinger
Following the long-held belief that the Internet is hierarchical, the network topology generators most widely used by the Internet research community, Transit-Stub and Tiers, create networks with a...
Network Topology Generators: Degree-Based vs. Structural (2002)
Hongsuda Tangmunarunkit, Ramesh Govindan, Sugih Jamin, Scott Shenker, Walter Willinger
Following the long-held belief that the Internet is hierarchical, the network topology generators most widely used by the Internet research community, Transit-Stub and Tiers, create networks with a...
Internet Indirection Infrastructure (2002)
Ion Stoica Daniel, 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...
Controlling high bandwidth aggregates in the network (2002)
Ratul Mahajan, Steven M. Bellovin, Sally Floyd, John Ioannidis, Vern Paxson, Scott Shenker
A BGP-based Mechanism for Lowest-Cost Routing (2002)
Joan Feigenbaum, Rahul Sami, Christos Papadimitriou, Scott Shenker
The routing of traffic between Internet domains or Autonomous Systems (ASs), a task known as interdomain routing, is currently handled by the Border Gateway Protocol (BGP). In this paper, we address...
Observed structure of addresses in IP traffic (2002)
Eddie Kohler, Jinyang Li, Vern Paxson, Scott Shenker
Abstract—We investigate the structure of addresses contained in IPv4 traffic—specifically, the structural characteristics of destination IP addresses seen on Internet links, considered as a...
Aggregate-based congestion control (2002)
Ratul Mahajan, Steven M. Bellovin, Sally Floyd, John Ioannidis, Vern Paxson, Scott Shenker
The current Internet infrastructure is highly vulnerable to bothdenial of service (DoS) attacks and flash crowds. During these, all traffic traversing the congested links experiences sig-nificantly...
Controlling high bandwidth aggregates in the network (2002)
Ratul Mahajan, Steven M. Bellovin, Sally Floyd, John Ioannidis, Vern Paxson, Scott Shenker
However, even when all links are adequately provisioned, and all flows are using conformant end-to-end congestion control, persistent congestion can still occur. Two examples
Data-centric storage in sensornets (2002)
Scott Shenker, Ramesh Govindan
Recent engineering advances in the design of small energy-efficient hardware and compact operating systems have enabled the development of large-scale distributed sensing networks (sensornets) made...
Hardness Results for Multicast Cost Sharing (2002)
Joan Feigenbaum Arvind, Arvind Krishnamurthy, Rahul Sami, Scott Shenker
We continue the study of multicast cost sharing from the viewpoints of both computational complexity and economic mechanism design. We provide fundamental lower bounds on the network complexity of...
Network Topology Generators: Degree-Based vs. Structural (2002)
Hongsuda Tangmunarunkit, Ramesh Govindan, Sugih Jamin, Scott Shenker, Walter Willinger
Following the long-held belief that the Internet is hierarchical, the network topology generators most widely used by the Internet research community, Transit-Stub and Tiers, create networks with a...
Search and replication in unstructured peer-to-peer networks (2002)
Qin Lv, Pei Cao, Edith Cohen, Kai Li, Scott Shenker
Decentralized and unstructured peer-to-peer networks such as Gnutella are attractive for certain applications because they require no centralized directories and no precise control over network...
Incentive-Compatible Interdomain Routing (2002)
Joan Feigenbaum Christos, Christos Papadimitriou, Rahul Sami, Scott Shenker
The routing of traffic between Internet domains or Autonomous Systems (ASs), a task known as interdomain routing, is currently handled by the Border Gateway Protocol (BGP). In this paper, we address...
Data-centric storage in sensornets (2002)
Scott Shenker, Ramesh Govindan
Recent engineering advances in the design of small energy-efficient hardware and compact operating systems have enabled the development of large-scale distributed sensing networks (sensornets) made...
Exploring Congestion Control 1 (2002)
Aditya Akella, Srinivasan Seshan, Scott Shenker
IBM. Views and conclusions contained in this document are those of the authors and should not be interpreted as respresenting the official policies, either expressed or implied, of DARPA, IBM or the...
Approximation and collusion in multicast cost sharing (2001)
Aaron Archer, Joan Feigenbaum, Arvind Krishnamurthy, Rahul Sami, Scott Shenker
We investigate multicast cost sharing from both computational and economic perspectives. Recent work in economics leads to the consideration of two mechanisms: marginal cost (MC), which is efficient...
The impact of routing policy on internet paths (2001)
Hongsuda Tangmunarunkit, Ramesh Govindan, Scott Shenker, Deborah Estrin
Abstract — The impact of routing policy on Internet paths is poorly understood. In theory, policy can inflate shortest-router-hop paths. To our knowledge, the extent of this inflation has not been...
Application-level Multicast using Content-Addressable Networks (2001)
Sylvia Ratnasamy, Mark Handley, Richard Karp, Scott Shenker
Abstract. Most currently proposed solutions to application-level multicast organize the group members into an application-level mesh over which a DistanceVector routing protocol, or a similar...
Sharing the Cost of Multicast Transmissions (2001)
Joan Feigenbaum, Christos H. Papadimitriou, Scott Shenker
We investigate cost-sharing algorithms for multicast transmission. Economic considerations point to two distinct mechanisms, marginal cost and Shapley value, as the two solutions most appropriate in...
On the constancy of Internet path properties (2001)
Yin Zhang, Nick Duffield, Vern Paxson, Scott Shenker
Abstract — Many Internet protocols and operational procedures use measurements to guide future actions. This is an effective strategy if the quantities being measured exhibit a degree of constancy:...
A Scalable Content-Addressable Network (2001)
Sylvia Ratnasamy, Paul Francis, Scott Shenker, Mark Handley
Hash tables – which map “keys ” onto “values ” – are an essential building block in modern software systems. We believe a similar functionality would be equally valuable to large...
On the constancy of Internet path properties (2001)
Yin Zhang, Nick Duffield, Vern Paxson, Scott Shenker
Abstract--- Many Internet protocols and operational procedures use measurements to guide future actions. This is an effective strategy if the quantities being measured exhibit a degree of constancy:...
On the constancy of Internet path properties (2001)
Yin Zhang, Nick Duffield, Vern Paxson, Scott Shenker
Abstract — Many Internet protocols and operational procedures use measurements to guide future actions. This is an effective strategy if the quantities being measured exhibit a degree of constancy:...
A Scalable Content-Addressable Network (2001)
Ley Richard Karp, Scott Shenker
Hash tables – which map “keys ” onto “values ” – are an essential building block in modern software systems. We believe a similar functionality would be equally valuable to large...
Network topologies, power laws, and hierarchy (2001)
Hongsuda Tangmunarunkit, Ramesh Govindan, Sugih Jamin, Scott Shenker, Walter Willinger
It has long been thought that the Internet, and its constituent networks, are hierarchical in nature. Consequently, the network topology generators most widely used by the Internet research...
On the constancy of Internet path properties (2001)
Yin Zhang, Nick Duffield, Vern Paxson, Scott Shenker
Abstract--- Many Internet protocols and operational procedures use measurements to guide future actions. This is an effective strategy if the quantities being measured exhibit a degree of constancy:...
Strategyproof sharing of submodular costs: Budget balance versus efficiency (2001)
Scott Shenker, Jel D, Bhaskar Dutta, Joan Feigenbaum, Wolfgang Pesendorfer
A service is produced for a set of agents. The service is binary, each agent either receives service or not, and the total cost of service is a submodular function of the set receiving service. We...
Dynamic behavior of slowly-responsive congestion control algorithms (2001)
Deepak Bansal, Hari Balakrishnan, Sally Floyd, Scott Shenker
The recently developed notion of TCP-compatibility has led to a number of proposals for alternative congestion control algorithms whose long-term throughput as a function of a steady-state loss rate...
Strategyproof sharing of submodular costs: Budget balance versus efficiency (2001)
Scott Shenker, Bhaskar Dutta, Joan Feigenbaum, Wolfgang Pesendorfer
A service is produced for a set of agents. The service is binary, each agent either receives service or not, and the total cost of service is a submodular function of the set receiving service. We...
Adaptive RED: An Algorithm for Increasing the Robustness of RED (2001)
Sally Floyd, Ramakrishna Gummadi, Scott Shenker
The RED active queue management algorithm allows network operators to simultaneously achieve high throughput and low average delay. However, the resulting average queue length is quite sensitive to...
Approximation and collusion in multicast cost sharing (2001)
Joan Feigenbaum, Arvind Krishnamurthy, Rahul Sami, Scott Shenker
We investigate multicast cost sharing from both computational and economic points of view. Recent work in economics [MS97] leads naturally to the consideration of two mechanisms: marginal cost (MC),...
The impact of routing policy on internet paths (2001)
Hongsuda Tangmunarunkit, Ramesh Govindan, Scott Shenker, Deborah Estrin
Abstract--- The impact of routing policy on Internet paths is poorly understood. In theory, policy can inflate shortest-router-hop paths. To our knowledge, the extent of this inflation has not been...
Sharing the Cost of Multicast Transmissions (2001)
Joan Feigenbaum, Christos Papadimitriou, Scott Shenker
We investigate cost-sharing algorithms for multicast transmission. Economic considerations point to two distinct mechanisms, marginal cost and Shapley value, as the two solutions most appropriate in...
Dynamic Behavior of Slowly-Responsive Congestion (2001)
Control Algorithms Deepak, Deepak Bansal, Hari Balakrishnan, Sally Floyd, Scott Shenker
The recently developed notion of TCP-compatibility has led to a number of proposals for alternative congestion control algorithms whose long-term throughput as a function of a steady-state loss rate...
Search and Replication in Unstructured Peer-to-Peer Networks (2001)
Qin Lv, Pei Cao, Edith Cohen, Kai Li, Scott Shenker
Decentralized and unstructured peer-to-peer networks such as Gnutella are attractive for certain applications because they require no centralized directories and no precise control over network...
A Scalable Content-Addressable Network (2001)
Sylvia Ratnasamy Paul, Paul Francis, Mark H, Richard Karp, Scott Shenker, Written Vladimir Eske
Contents 1 Motivation 2 2 Basic CAN architecture 3 2.1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 2.2 Data Model . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3...
Application-level multicast using content-addressable networks (2001)
Sylvia Ratnasamy, Mark H, Richard Karp, Scott Shenker
Abstract. Most currently proposed solutions to application-level multicast organize the group members into an application-level mesh over which a Distance-Vector routing protocol, or a similar...
Highly-Resilient, Energy-Efficient Multipath Routing in Wireless Sensor Networks (2001)
Deepak Ganesan, Ramesh Govindan, Scott Shenker, Deborah Estrin
Previously proposed sensor network data dissemination schemes require periodic low-rate flooding of data in order to allow recovery from failure. We consider constructing two kinds of multipaths to...
On the constancy of Internet path properties (2001)
Yin Zhang, Nick Duffield, Vern Paxson, Scott Shenker
Abstract — Many Internet protocols and operational procedures use measurements to guide future actions. This is an effective strategy if the quantities being measured exhibit a degree of constancy:...
A Scalable Content-Addressable Network (2001)
Ley Richard Karp, Scott Shenker
Hash tables – which map “keys ” onto “values ” – are an essential building block in modern software systems. We believe a similar functionality would be equally valuable to large...
From joint work with Steve Bellovin, John Ioannidis, Ratul Mahajan, (2001)
Sally Floyd, Vern Paxson, Scott Shenker
Observations on the Internet as a large-scale complex system: – Heterogeneity and change. – What we know about the current Internet. – End-to-end congestion control. Addressing Congestion from...
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...
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...
Optimization Problems in Congestion Control (2000)
Richard Karp, Elias Koutsoupias, Christos Papadimitriou, Scott Shenker
One of the crucial elements in the Internet's success is its ability to adequately control congestion. This paper defines and solves several optimization problems related to Internet congestion...
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...
The Stationarity of Internet Path Properties: Routing, Loss, and Throughput (2000)
Yin Zhang, Vern Paxson, Scott Shenker
There is much interest in using network measurements for both modeling and operational purposes. In this paper we focus on the fundamental question of the stationarity of such measurements. That is,...
Sharing the Cost of Multicast Transmissions (2000)
Joan Feigenbaum, Christos H. Papadimitriou, Scott Shenker
this paper, we focus on the communication burden of algorithms for implementing the MC and SH cost-sharing mechanisms. We prove a lower bound suggesting that any cost-sharing algorithm implementing...
Comments on the Performance of Measurement-Based Admission Control Algorithms (2000)
Lee Breslau, Sugih Jamin, Scott Shenker
Relaxed real-time services that do not provide guaranteed loss rates or delay bounds are of considerable interest in the Internet, since these services can achieve higher utilization than hard...
A Web caching bibliography (2000)
Guillaume Pierre, Haobo Yu, Lee Breslau, Scott Shenker, A Web, Philip S. Yu, ...
haracterizing Web resources and server responses to better understand the potential of caching. In Proceedings of the Web Characterization Workshop, Cambridge, MA, November 1998. World Wide Web...
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...
On Characterizing Network Topologies and Analyzing Their Impact on Protocol Design (2000)
Pavlin Radoslavov, Hongsuda Tangmunarunkit, Haobo Yu, Ramesh Govindan, Scott Shenker, Deborah Estrin
Recently there have been several papers examining aspects of the Internet topology. This paper follows in that tradition and addresses two issues related to Internet topology. First, we use three...
Sharing the Cost of Multicast Transmissions (2000)
Joan Feigenbaum, Christos H. Papadimitriou, Scott Shenker
this paper, we focus on the communication burden of algorithms for implementing the MC and SH cost-sharing mechanisms. We prove a lower bound suggesting that any cost-sharing algorithm implementing...
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...
Comments on the Performance of Measurement-based Admission Control Algorithms (2000)
Lee Breslau, Sugih Jamin, Scott Shenker
Relaxed real-time services that do not provide guaranteed loss rates or delay bounds are of considerable interest in the Internet, since these services can achieve higher utilization than hard...
: www.idealibrary.com on Sharing the Cost of Multicast Transmissions 1 (1999)
Joan Feigenbaum, Christos H. Papadimitriou, Scott Shenker
We investigate cost-sharing algorithms for multicast transmission. Economic considerations point to two distinct mechanisms, marginal cost and Shapley value, as the two solutions most appropriate in...
Web caching and zipf-like distributions: Evidence and implications (1999)
Lee Breslau, Pei Cao, Li Fan, Graham Phillips, Scott Shenker
This paper addresses two unresolved issues about web caching. The first issue is whether web requests from a fixed user community are distributed according to Zipf’s law [22]. Several early studies...
Scaling of multicast trees: Comments on the Chuang-Sirbu scaling law (1999)
Graham Phillips, Scott Shenker, Hongsuda Tangmunarunkit
One of the many benefits of multicast, when compared to traditional unicast, is that multicast reduces the overall network load. While the importance of multicast is beyond dispute, there have been...
Web Caching and Zipf-like Distributions: Evidence and Implications (1999)
Lee Breslau, Pei Cao, Li Fan, Graham Phillips, Scott Shenker
This paper addresses two unresolved issues about web caching. The #rst issue is whether web requests from a #xed user community are distributed according to Zipf's law #22#. Several early...
A Scalable Web Cache Consistency Architecture (1999)
Haobo Yu, Lee Breslau, Scott Shenker
The rapid increase in web usage has led to dramatically increased loads on the network infrastructure and on individual web servers. To ameliorate these mounting burdens, there has been much recent...
Scaling of Multicast Trees: Comments on the Chuang-Sirbu scaling law (1999)
Graham Phillips, Scott Shenker, Hongsuda Tangmunarunkit
One of the many benefits of multicast, when compared to traditional unicast, is that multicast reduces the overall network load. While the importance of multicast is beyond dispute, there have been...
Web Caching and Zipf-like Distributions: Evidence and Implications (1999)
Lee Breslau, Pei Cao, Li Fan, Graham Phillips, Scott Shenker
This paper addresses two unresolved issues about web caching. The first issue is whether web requests from a fixed user community are distributed according to Zipf's law [22]. Several early...
Scaling of Multicast Trees: Comments on the Chuang-Sirbu Scaling Law (1999)
Graham Phillips, Scott Shenker, Hongsuda Tangmunarunkit
One of the many benefits of multicast, when compared to traditional unicast, is that multicast reduces the overall network load. While the importance of multicast is beyond dispute, there have been...
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.
On the Implications of Zipf's Law for Web Caching (1998)
Lee Breslau, Pei Cao, Li Fan, Graham Phillips, Scott Shenker
Recently, a number of studies on characteristics of Web proxy traces have shown that the hit-ratios of the traces exhibit certain properties that are uniform across the different sets of the traces...
Best-Effort versus Reservations: A Simple Comparative Analysis (1998)
The current Internet only offers best-effort service. In recent years much research effort, and IETF standardization activity, has been devoted to extending the Internet architecture to support...
Web Caching and Zipf-like Distributions: Evidence and Implications (1998)
Lee Breslau, Pei Cao, Li Fan, Graham Phillips, Scott Shenker
This paper addresses two unresolved issues about Web caching. The first issue is whether Web requests from a fixed user community are distributed according to Zipf's law [Zip29]. Several early...
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...
Uniform versus Priority Dropping for Layered Video (1998)
Sandeep Bajaj, Lee Breslau, Scott Shenker
In this paper, we analyze the relative merits of uniform versus priority dropping for the transmission of layered video. We first present our original intuitions about these two approaches, and then...
Sandeep Bajaj Lee Breslau Scott Shenker (1998)
Fbajaj Breslau, Sandeep Bajaj, Lee Breslau, Scott Shenker
A key question in the definition of new services for the Internet is whether to provide a single class of relaxed real-time service or multiple levels differentiated by their delay characteristics....
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...
Is Service Priority Useful in Networks? (1998)
Sandeep Bajaj, Lee Breslau, Scott Shenker
A key question in the definition of new services for the Internet is whether to provide a single class of relaxed real-time service or multiple levels differentiated by their delay characteristics....
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,...
Learning and implementation on the internet (1997)
Eric J. Friedman, Scott Shenker
We address the problem of learning and implementation in the Internet. When agents play repeated games in distributed environments like the Internet, they have very limited a priori information about...
Learning and implementation on the internet (1997)
Eric J. Friedman, Scott Shenker
Abstract We address the problem of learning and implementation on the Internet. When agents play repeated games in distributed environments like the Internet, they have very limited a priori...
Local Error Recovery in SRM: Comparison of Two Approaches (1997)
Ching-gung Liu, Deborah Estrin, Scott Shenker, Lixia Zhang
Abstract--- SRM is a framework for reliable multicast delivery. In order to maximize the collaboration among the group members in error recovery, both retransmission requests and replies are...
Learning and implementation on the internet (1997)
Eric J. Friedman, Scott Shenker
We address the problem of learning and implementation on the Internet. When agents play repeated games in distributed environments like the Internet, they have very limited a priori information about...
A measurement-based admission control algorithm for integrated services packet networks (1997)
Sugih Jamin, Peter B. Danzig, Scott Shenker, Lixia Zhang
Many designs for integrated service networks offer a bounded delay packet delivery service to support real-time applications. To provide bounded delay service, networks must use admission control to...
Local Error Recovery in SRM: Comparison of Two Approaches (1997)
Ching-Gung Liu, Deborah Estrin, Scott Shenker, Lixia Zhang
SRM is a framework for reliable multicast delivery. In order to maximize the collaboration among the group members in error recovery, both retransmission requests and replies are multicast to the...
Recovery Timer Adaptation in SRM (1997)
Ching-Gung Liu, Deborah Estrin, Scott Shenker, Lixia Zhang
SRM is a generic framework for reliable multicast data delivery. The retransmission requests and replies used in SRM error recovery are multicast to the entire group. SRM uses random timers to avoid...
Recommendations on Queue Management and Congestion Avoidance in the Internet (1997)
Bob Braden, Jon Crowcroft, Bruce Davie, Steve Deering, Deborah Estrin, Sally Floyd, ...
This memo presents two recommendations to the Internet community concerning measures to improve and preserve Internet performance. It presents a strong recommendation for testing, standardization,...
Interdomain Multicast Routing Support for Integrated Services Networks (1997)
Daniel Zappala, Bob Braden, Deborah Estrin, Scott Shenker
This document describes an architecture for interdomain multicast routing support of integrated services networks. The key features of this architecture are a multicast route setup protocol and local...
Recovery Timer Adaptation in SRM (1997)
Ching-Gung Liu, Deborah Estrin, Scott Shenker, Lixia Zhang
SRM is a generic framework for reliable multicast data delivery. The retransmission requests and replies used in SRM error recovery are multicast to the entire group. SRM uses random timers to avoid...
Timer Adjustment in SRM (1997)
Ching-Gung Liu, Deborah Estrin, Scott Shenker, Lixia Zhang, Deborah Estrin (usc/isi, ...
SRM is a generic framework for reliable multicast data delivery. The retransmission requests and replies used in SRM error recovery are multicast to the entire group. SRM uses random timers to avoid...
Local Error Recovery in SRM: Comparison of Two Approaches (1997)
Ching-Gung Liu, Deborah Estrin, Scott Shenker, Lixia Zhang, Deborah Estrin (usc/isi, ...
SRM is a generic framework for reliable multicast delivery. In order to maximize the collaboration among the group members in error recovery, both retransmission requests and replies are multicast to...
Alternate Path Routing and Pinning for Interdomain Multicast Routing (1997)
Daniel Zappala, Deborah Estrin, Scott Shenker
Many researchers have explored enhancements of the Internet's best-effort service model that allow real-time and other inelastic applications to obtain preferential Quality of Service. However,...
Recovery Timer Adaptation in SRM (1997)
Ching-gung Liu, Deborah Estrin, Scott Shenker, Lixia Zhang
SRM is a generic framework for reliable multicast data delivery. The retransmission requests and replies used in SRM error recovery are multicast to the entire group. SRM uses random timers to avoid...
Local Error Recovery in SRM : Comparison of Two Approaches (1997)
Ching-gung Liu, Deborah Estrin, Scott Shenker, Lixia Zhang
SRM is a framework for reliable multicast delivery. In order to maximize the collaboration among the group members in error recovery, both retransmission requests and replies are multicast to the...
Synchronous and asynchronous learning by responsive learning automata (1996)
Eric J. Friedman, Scott Shenker
We consider the ability of economic agents to learn in a decentralized environment in which agents do not know the (stochastic) payoff matrix and can not observe their opponents ' actions; they...
A Study of Reservation Dynamics in Integrated Services Packet Networks (1996)
Danny Mitzel, Deborah Estrin, Scott Shenker, Lixia Zhang
The Integrated Services Packet Network (ISPN) architecture proposed within the Internet community [2] incorporates a resource reservation mechanism for those applications requiring Quality of Service...
Sharing the "Cost" of Multicast Trees: An Axiomatic Analysis (1995)
Shai Herzog, Scott Shenker, Deborah Estrin
Given the need to provide users with reasonable feedback about the "costs " their network usage incurs, and the increasingly commercial nature of the Internet, we believe that the...
Sharing the "Cost" of Multicast Trees: An Axiomatic Analysis (1995)
Shai Herzog, Scott Shenker, Deborah Estrin
Given the need to provide users with reasonable feedback about the "costs " their network usage incurs, and the increasingly commercial nature of the Internet, we believe that the...
Two Issues in Reservation Establishment (1995)
Scott Shenker And, Scott Shenker, Lee Breslau
This paper addresses two issues related to resource reservation establishment in packet switched networks offering realtime services. The first issue arises out of the natural tension between the...
Service Models and Pricing Policies for an Integrated Services Internet (1995)
This paper addresses the integration of services in the Internet and the resulting impact on pricing policies. I first address why an integrated services Internet is desirable, and give an overview...
Fundamental Design Issues for the Future Internet (1995)
Scott Shenker Xerox, Scott Shenker
The Internet has been a startling and dramatic success. However, multimedia applications, with their novel traffic characteristics and service requirements, pose an interesting challenge to the...
The Internet Engineering Task Force (IETF) is considering the adoption of the controlled-load service, a real-time service with very relaxed service guarantees [Wro95]. Measurement-based admission...
Two Issues in Reservation Establishment (1995)
Scott Shenker And, Scott Shenker, Lee Breslau
This paper addresses two issues related to resource reservation establishment in packet switched networks offering realtime services. The first issue arises out of the natural tension between the...
Managing Shared Ephemeral Teleconferencing State: Policy and Mechanism (1995)
Scott Shenker, Abel Weinrib, Eve Schooler
. In recent years there has been dramatic progress on the enabling technologies for workstation-based multimedia teleconferencing applications. We expect that such applications will soon become an...
Fundamental Design Issues for the Future Internet (1995)
The Internet has been a startling and dramatic success. However, multimedia applications, with their novel traffic characteristics and service requirements, pose an interesting challenge to the...
Two Issues in Reservation Establishment (1995)
This paper addresses two issues related to resource reservation establishment in packet switched networks offering realtime services. The first issue arises out of the natural tension between the...
Fundamental Design Issues for the Future Internet (1995)
The Internet has been a startling and dramatic success. However, multimedia applications, with their novel traffic characteristics and service requirements, pose an interesting challenge to the...
A Measurement-Based Admission Control Algorithm for Integrated Services Packet Networks (1995)
Sugih Jamin, Peter B. Danzig, Scott Shenker, Lixia Zhang
: Many designs for integrated service networks offer a bounded delay packet delivery service to support real-time applications. To provide bounded delay service, networks must use admission control...
Sharing the "Cost" of Multicast Trees: An Axiomatic Analysis (1995)
Shai Herzog, Scott Shenker, Deborah Estrin
Given the need to provide users with reasonable feedback about the "costs" their network usage incurs, and the increasingly commercial nature of the Internet, we believe that the allocation...
Routing Support For RSVP (1995)
Deborah Estrin, Scott Shenker, Daniel Zappala
This memo describes an interface between RSVP and routing protocols. The interface allows RSVP to request information and services from routing in the form of an asynchronous query-reply protocol....
An Architectural Comparison of ST-II and RSVP (1994)
Danny J. Mitzel, Deborah Estrin, Scott Shenker, Lixia Zhang
This paper presents a comparative analysis of two resource reservation protocols, ST-II [6] and RSVP [7], in support of an Integrated Services Packet Network (ISPN). We use simulations to examine the...
Integrated Services in the internet architecture: an overview (1994)
Group R. Braden, S. Shenker, Scott Shenker, Lixia Zhang, Deborah Estrin, Sugih Jamin
Status of this Memo This memo provides information for the Internet community. This memo does not specify an Internet standard of any kind. Distribution of this memo is unlimited. This memo discusses...
Integrated Services in the internet architecture: an overview (1994)
Group R. Braden, S. Shenker, Scott Shenker, Lixia Zhang, Deborah Estrin, Sugih Jamin
Status of this Memo This memo provides information for the Internet community. This memo does not specify an Internet standard of any kind. Distribution of this memo is unlimited. This memo discusses...
Asymptotic Resource Consumption in Multicast Reservation Styles (1994)
Danny J. Mitzel, Scott Shenker
The goal of network design is to meet the needs of resident applications in an efficient manner. Adding real-time service and point-to-multipoint multicast routing to the Internet 's traditional...
MACAW: A Media Access Protocol for Wireless LAN's (1994)
Vaduvur Bharghavan, Alan Demers, Scott Shenker, Lixia Zhang
In recent years, a wide variety of mobile computing devices has emerged, including portables, palmtops, and personal digital assistants. Providing adequate network connectivity for these devices will...
Asymptotic Resource Consumption in Multicast Reservation Styles (1994)
Danny Mitzel Scott, Scott Shenker
The goal of network design is to meet the needs of resident applications in an efficient manner. Adding real-time service and point-to-multipoint multicast routing to the Internet 's traditional...
Making Greed Work in Networks: A Game-Theoretic Analysis of Switch Service Disciplines (1994)
Scott Shenker Xerox, Scott Shenker
This paper discusses congestion control from a game-theoretic perspective. There are two basic premises: (1) users are assumed to be independent and selfish, and (2) central administrative control is...
MACAW: A Media Access Protocol for Wireless LAN's (1994)
Vaduvur Bharghavan, Alan Demers, Scott Shenker, Lixia Zhang
In recent years, a wide variety of mobile computing devices has emerged, including portables, palmtops, and personal digital assistants. Providing adequate network connectivity for these devices will...
Making Greed Work in Networks: A Game-Theoretic Analysis of Switch Service Disciplines (1994)
Scott Shenker Palo, Scott Shenker
This paper discusses congestion control from a game-theoretic perspective. There are two basic premises: (1) users are assumed to be independent and selfish, and (2) central administrative control is...
Asymptotic Resource Consumption in Multicast Reservation Styles (1994)
Danny Mitzel Scott, Scott Shenker
The goal of network design is to meet the needs of resident applications in an efficient manner. Adding real-time service and point-to-multipoint multicast routing to the Internet 's traditional...
Status Of This, S. Shenker, Scott Shenker, Lixia Zhang, Deborah Estrin, Sugih Jamin
This memo discusses a proposed extension to the Internet architecture and protocols to provide integrated services, i.e., to support realtime as well as the current non-real-time service of IP. This...
An Architectural Comparison of ST-II and RSVP (1994)
Danny J. Mitzel, Deborah Estrin, Scott Shenker, Lixia Zhang
This paper presents a comparative analysis of two resource reservation protocols, ST-II [6] and RSVP [7], in support of an Integrated Services Packet Network (ISPN). We use simulations to examine the...
Asymptotic Resource Consumption in Multicast Reservation Styles (1994)
Danny J. Mitzel, Danny J. Mitzel, Scott Shenker, Scott Shenker
The goal of network design is to meet the needs of resident applications in an efficient manner. Adding real-time service and point-to-multipoint multicast routing to the Internet 's traditional...
An Architectural Comparison of ST-II and RSVP (1994)
Lixia Zhang, Danny J. Mitzel, Danny J. Mitzel, Deborah Estrin, Deborah Estrin, ...
This paper presents a comparative analysis of two resource reservation protocols, ST-II [6] and RSVP [7], in support of an Integrated Services Packet Network (ISPN). We use simulations to examine the...
Making Greed Work in Networks: A Game-Theoretic Analysis of Switch Service Disciplines (1994)
This paper discusses congestion control from a game-theoretic perspective. There are two basic premises: (1) users are assumed to be independent and selfish, and (2) central administrative control is...
Scheduling for Reduced CPU Energy (1994)
Mark Weiser, Brent Welch, Alan Demers, Scott Shenker
The energy usage of computer systems is becoming more important, especially for battery operated systems. Displays, disks, and cpus, in that order, use the most energy. Reducing the energy used by...
Making greed work in networks: A game-theoretic analysis of switch service disciplines (1994)
This paper discusses congestion control from a game-theoretic perspective. There are two basic premises: (1) users are assumed to be independent and sel sh, and (2) central administrative control is...
Scheduling for reduced CPU energy (1994)
Mark Weiser, Brent Welch, Alan Demers, Scott Shenker
The energy usage of computer systems is becoming more important, especially for battery operated systems. Displays, disks, and cpus, in that order, use the most energy. Reducing the energy used by...
RSVP: A New Resource ReSerVation Protocol (1993)
Lixia Zhang, Steve Deering, Deborah Estrin, Scott Shenker
The current Internet architecture, as embodied in the IP network protocol, o ers a very simple service model: point-to-point best-e ort service. In recent years, several new classes of distributed...
RSVP: A New Resource ReSerVation Protocol (1993)
Lixia Zhang, Steve Deering, Deborah Estrin, Scott Shenker
The current Internet architecture, as embodied in the IP network protocol, o ers a very simple service model: point-to-point best-e ort service. In recent years, several new classes of distributed...
Pricing in Computer Networks: Motivation, Formulation, and Example (1993)
Ron Cocchi, Scott Shenker, Deborah Estrin, Lixia Zhang
We study the role of pricing policies in multiple service class networks. We first argue that some form of service-class sensitive pricing is required for any multiclass service discipline 4 to...
On the Strategy-Proof and Smooth Allocation of Private Goods in Production Economies (1993)
We consider the problem of allocating private goods in a production economy, which is an economy where the total consumption bundle must lie on some smooth manifold in ! m + . We describe a family of...
Some Technical Results on Continuity, Strategy-proofness, and Related Strategic Concepts (1993)
Scott Shenker Palo, Scott Shenker
There are many concepts of nonmanipulability, including strategy-proofness (and its several coalitional variants), Nash implementability, self Nash implementability, and nonbossiness. We explore the...
Pricing in computer networks: Motivation, formulation, and example (1993)
Ron Cocchi, Deborah Estrin, Scott Shenker, Lixia Zhang
We study the role of pricing policies in multiple service class networks. We first argue that some form of service-class sensitive pricing is required in order for any multiclass service discipline...
RSVP: A New Resource ReSerVation Protocol (1993)
Lixia Zhang, Steve Deering, Deborah Estrin, Scott Shenker, Daniel Zappala
this article we describe another.
Scott Shenker, David D. Clark, Lixia Zhang
Integrated Services Packet Networks (ISPN) are designed to integrate the network service requirements of a wide variety of computer-based applications. Some of these services are delivered primarily...
A Service Model for an Integrated Services Internet (1993)
Scott Shenker, David D. Clark, Lixia Zhang
The Internet is currently being confronted with service demands from a new generation of applications. Supporting these applications effectively and efficiently will require extending the current...
RSVP: A New Resource Reservation Protocol (1993)
Lixia Zhang, Steve Deering, Deborah Estrin, Scott Shenker
The current Internet architecture, as embodied in the IP network protocol, o ers a very simple service model: point-to-point best-e ort service. In recent years, several new classes of distributed...
David D. Clark, Scott Shenker, Lixia Zhang
This paper considers the support of real-time applications in an Integrated Services Packet Network (ISPN). We first review the characteristics of real-time applications. We observe that, contrary to...
David D. Clark, Scott Shenker, Lixia Zhang
This paper considers the support of real-time applications in an Integrated Services Packet Network (ISPN). We first review the characteristics of real-time applications. We observe that, contrary to...
Mostly Parallel Garbage Collection (1991)
Hans-J. Boehm, Alan J. Demers, Scott Shenker
We present a method for adapting garbage collectors designed to run sequentially with the client, so that they may run concurrently with it. We rely on virtual memory hardware to provide information...
A Study of Priority Pricing in Multiple Service Class Networks (1991)
Ron Cocchi, Deborah Estrin, Scott Shenker, Lixia Zhang
We study the role of pricing policies in multiple service class networks. We argue that some form of graduated prices are required in order for any multiclass service discipline to have the desired...
Lixia Zhang, Scott Shenker, David D. Clark
We use simulation to study the dynamics of the congestion control algorithm embedded in the BSD 4.3-Tahoe TCP implementation. We investigate the simple case of a few TCP connections, originating and...
Some Observations on the Dynamics of a Congestion Control Algorithm (1990)
Scott Shenker, Lixia Zhang, David D. Clark
this paper, we will assume that all window sizes are measured in units of maximum size packets, instead of bytes. In the original TCP specification [10], the window used by the sender, which we will...
Congestion Control for Best Effort Service: why we need a new paradigm
Christopher Lefelhocz, Bryan Lyles, Scott Shenker, Lixia Zhang
Congestion control for best effort service in the Internet and other packet-switched networks (e.g., ATM) has been intensely studied in recent years. Many different congestion control mechanisms have...
Sharing the "Cost" of Multicast Trees: An Axiomatic Analysis
Shai Herzog, Scott Shenker, Deborah Estrin
Given the need to provide users with reasonable feedback about the "costs" their network usage incurs, and the increasingly commercial nature of the Internet, we believe that the allocation...