Neil Spring

DisCarte: A Disjunctive Internet Cartographer ∗ (2009)

Rob Sherwood, Adam Bender, Neil Spring

Internet topology discovery consists of inferring the inter-router connectivity (“links”) and the mapping from IP addresses to routers (“alias resolution”). Current topology discovery...

Fixing Ally’s Growing Pains with Velocity Modeling (2009)

Adam Bender, Rob Sherwood, Neil Spring

Mapping the router topology is an important component of Internet measurement. Alias resolution, the process of mapping IP addresses to routers, is critical to accurate Internet mapping. Ally, a...

Fighting Spam with the NeighborhoodWatch DHT (2009)

Adam Bender, Rob Sherwood, Derek Monner, Nate Goergen, Neil Spring, Bobby Bhattacharjee

Abstract—In this paper, we present DHTBL, an anti-spam blacklist built upon a novel secure distributed hash table (DHT). We show how DHTBL can be used to replace existing DNS-based blacklists...

Triangle Inequality and Routing Policy Violations in the Internet (2009)

Cristian Lumezanu, Y Baden, Neil Spring, Bobby Bhattacharjee

Abstract. Triangle inequality violations (TIVs) are the effect of packets between two nodes being routed on the longer direct path between them when a shorter detour path through an intermediary is...

Measurement Manipulation and Space Selection in Network Coordinates (2009)

Cristian Lumezanu, Neil Spring

Internet coordinate systems have emerged as an efficient method to estimate the latency between pairs of nodes without any communication between them. However, most coordinate systems have been...

Motivating Participation in Internet Routing Overlays (2009)

Dave Levin, Olph Baden, Cristian Lumezanu, Neil Spring, Bobby Bhattacharjee

PeerWise is an Internet routing overlay that reduces end-to-end latencies by allowing peers to forward through a relay instead of connecting directly to their destinations. Fundamental to PeerWise is...

Motivating Participation in Internet Routing Overlays (2009)

Dave Levin, Olph Baden, Cristian Lumezanu, Neil Spring, Bobby Bhattacharjee

PeerWise is an Internet routing overlay that reduces end-to-end latencies by allowing peers to forward through a relay instead of connecting directly to their destinations. Fundamental to PeerWise is...

DisCarte: A Disjunctive Internet Cartographer ∗ (2009)

Rob Sherwood, Adam Bender, Neil Spring

Internet topology discovery consists of inferring the inter-router connectivity (“links”) and the mapping from IP addresses to routers (“alias resolution”). Current topology discovery...

Abstract Scriptroute: A Public Internet Measurement Facility ∗ (2008)

Neil Spring, David Wetherall, Tom Anderson

We present Scriptroute, a system that allows ordinary Internet users to conduct network measurements from remote vantage points. We seek to combine the flexibility found in dedicated measurement...

ABSTRACT A Structural Approach to Latency Prediction (2008)

Harsha V. Madhyastha, Thomas Anderson, Arvind Krishnamurthy, Neil Spring, Arun Venkataramani

Several models have been recently proposed for predicting the latency of end to end Internet paths. These models treat the Internet as a black-box, ignoring its internal structure. While these models...

Categories and Subject Descriptors C.2.1 [Communication Networks]: Architecture and Design--topology General Terms Measurement (2008)

Neil Spring, Ratul Mahajan, David Wetherall

ABSTRACT To date, realistic ISP topologies have not been accessible to the re-search community, leaving work that depends on topology on an

ABSTRACT A Structural Approach to Latency Prediction (2008)

Harsha V. Madhyastha, Thomas Anderson, Arvind Krishnamurthy, Neil Spring, Arun Venkataramani

Several models have been recently proposed for predicting the latency of end to end Internet paths. These models treat the Internet as a black-box, ignoring its internal structure. While these models...

ABSTRACT User-level Internet Path Diagnosis (2008)

Ratul Mahajan, Neil Spring, David Wetherall, Thomas Anderson

Diagnosing faults in the Internet is arduous and time-consuming, in part because the network is composed of diverse components spread across many administrative domains. We consider an extreme form...

No aversion To recursion (2008)

Ken Yasuhara, Neil Spring, Jeff Hightower

Functional programming often elicits groans and complaints about its lack of utility in the Javaand C++-dominated “real world. ” To assist in overcoming student obstinance, we have prepared the...

Abstract Reverse Engineering the Internet (2008)

Neil Spring

Understanding the structure and design of the Internet is is increasingly important as we seek to improve its reliability and robustness. At the same time, as the network grows in scale and...

advisors: (2008)

Cristian Lumezanu, Neil Spring, Bobby Bhattacharjee

We describe a method to order messages in a distributed system without centralized control or vector timestamps. We show that it is practical—little state is required; it is scalable—the maximum...

Executive Summary (2008)

Kc Claffy, Mark Crovella, Timur Friedman, Colleen Shannon, Neil Spring

Up-to-date, relevant Internet research requires comprehensive network measurement [1], [2], but conducting and supporting Internet measurement raises several daunting challenges for the research...

ABSTRACT Quantifying the Causes of Path Inflation (2008)

Neil Spring, Ratul Mahajan, Thomas Anderson

Researchers have shown that the Internet exhibits path inflation – end-to-end paths can be significantly longer than necessary. We present a trace-driven study of 65 ISPs that characterizes the...

ABSTRACT Quantifying the Causes of Path Inflation (2008)

Neil Spring, Ratul Mahajan, Thomas Anderson

Researchers have shown that the Internet exhibits path inflation – end-to-end paths can be significantly longer than necessary. We present a trace-driven study of 65 ISPs that characterizes the...

ABSTRACT A Structural Approach to Latency Prediction (2008)

Harsha V. Madhyastha, Thomas Anderson, Arvind Krishnamurthy, Neil Spring, Arun Venkataramani

Several models have been recently proposed for predicting the latency of end to end Internet paths. These models treat the Internet as a black-box, ignoring its internal structure. While these models...

Boycotting and Extorting Nodes in an Internetwork (2008)

Dave Levin, Adam Bender, Cristian Lumezanu, Neil Spring, Bobby Bhattacharjee

A boycott is a protest or a demand for change based on consumers following a simple rule: do not purchase service or goods from specific producers. In any network, and especially in the Internet,...

Decentralized Message Ordering for Publish/Subscribe Systems (2008)

Cristian Lumezanu, Neil Spring, Bobby Bhattacharjee

Abstract. We describe a method to order messages across groups in a publish/subscribe system without centralized control or large vector timestamps. We show that our scheme is practical—little...

On the fidelity of 802.11 packet traces (2008)

Aaron Schulman, Dave Levin, Neil Spring

Abstract. Packet traces from 802.11 wireless networks are incomplete both fundamentally, because antennas do not pick up every transmission, and practically, because the hardware and software of...

Bittorrent is an auction: analyzing and improving bittorrent’s incentives (2008)

Dave Levin, Katrina Lacurts, Neil Spring, Bobby Bhattacharjee

Incentives play a crucial role in BitTorrent, motivating users to upload to others to achieve fast download times for all peers. Though long believed to be robust to strategic manipulation, recent...

On the fidelity of 802.11 packet traces (2008)

Aaron Schulman, Dave Levin, Neil Spring

Abstract. Packet traces from 802.11 wireless networks are incomplete both fundamentally, because antennas do not pick up every transmission, and practically, because the hardware and software of...

Discarte: A disjunctive internet cartographer (2008)

Rob Sherwood, Adam Bender, Neil Spring

Internet topology discovery consists of inferring the inter-router connectivity (“links”) and the mapping from IP addresses to routers (“alias resolution”). Current topology discovery...

ABSTRACT User-level Internet Path Diagnosis (2007)

Ratul Mahajan, Neil Spring, David Wetherall, Thomas Anderson

Diagnosing faults in the Internet is arduous and time-consuming, in part because the network is composed of diverse components spread across many administrative domains. We consider an extreme form...

Is here, in ML. (2007)

Ken Yasuhara, Neil Spring, Je Hightower

Functional programming often elicits groans and complaints about its lack of utility in the Javaand C++-dominated "real world. " To assist in overcoming student obstinance, we have...

(Submitted to SIGMETRICS '99) (2007)

Rich Wolski, Neil Spring, Jim Hayes

In this paper, we focus on the problem of making short and medium term forecasts of CPU availability on time-shared Unix systems. We evaluate the accuracy with which availability can be measured...

y (2007)

David Ely, Neil Spring, David Wetherall, Stefan Savage, Tom Anderson

We present an improved Explicit Congestion Notification (ECN) mechanism that enables a router to signal congestion to the sender without trusting the receiver or other network devices along the...

y (2007)

Rich Wolski, John Brevik, Chandra Krintz, Graziano Obertelli, Neil Spring, Alan Su

The Computational Grid [10] has recently been proposed for the implementation of high-performance applications using widely dispersed computational resources. The goal of a Computational Grid is to...

A Secure DHT via the Pigeonhole Principle (2007)

Baden, Randy, Bender, Adam, Levin, Dave, Sherwood, Rob, Spring, Neil, Bhattacharjee, Bobby

The standard Byzantine attack model assumes no more than some fixed fraction of the participants are faulty. This assumption does not accurately apply to peer-to-peer settings, where Sybil attacks...

A Secure DHT via the Pigeonhole Principle (2007)

Baden, Randy, Bender, Adam, Levin, Dave, Sherwood, Rob, Spring, Neil, Bhattacharjee, Bobby

The standard Byzantine attack model assumes no more than some fixed fraction of the participants are faulty. This assumption does not accurately apply to peer-to-peer settings, where Sybil attacks...

Accountability as a service (2007)

Adam Bender, Neil Spring, Dave Levin, Bobby Bhattacharjee

We propose that accountability be a first-class network service, independent of addressing and routing. We design a scheme for allowing accountability services, rather than connectivity-providing...

Accountability as a service (2007)

Adam Bender, Neil Spring, Dave Levin, Bobby Bhattacharjee

We propose that accountability be a first-class network service, independent of addressing and routing. We design a scheme for allowing accountability services, rather than connectivity-providing...

Playing Vivaldi in Hyperbolic Space (2006)

Lumezanu, Cristian, Spring, Neil

Internet coordinate systems have emerged as an efficient method to estimate the latency between pairs of nodes without any communication between them. They avoid the cost of explicit measurements by...

Playing Vivaldi in Hyperbolic Space (2006)

Lumezanu, Cristian, Spring, Neil

Internet coordinate systems have emerged as an efficient method to estimate the latency between pairs of nodes without any communication between them. They avoid the cost of explicit measurements by...

National Science Foundation Postmodern Internetwork Architecture (2006)

Bobby Bhattacharjee, Ken Calvert, Jim Griffioen, Neil Spring, Bobby Bhattacharjee, ...

Network-layer innovation has proven surprisingly difficult, in part because internetworking protocols ignore competing economic interests and because a few protocols dominate, enabling layer...

A structural approach to latency prediction (2006)

Harsha V. Madhyastha, Thomas Anderson, Arvind Krishnamurthy, Neil Spring

Several models have been recently proposed for predicting the latency of end to end Internet paths. These models treat the Internet as a black-box, ignoring its internal structure. While these models...

Using PlanetLab for network research: myths, realities, and best practices (2006)

Best Practices, Neil Spring, Larry Peterson, Andy Bavier, Vivek Pai

PlanetLab is a continuously-evolving global network research testbed that is simultaneously used by hundreds of researchers for diverse tasks, ranging from shortterm self-contained experiments among...

Playing Vivaldi in Hyperbolic Space (2006)

Cristian Lumezanu, Neil Spring

Internet coordinate systems have emerged as an efficient method to estimate the latency between pairs of nodes without any communication between them. They avoid the cost of explicit measurements by...

Postmodern Internetwork Architecture (2006)

Bobby Bhattacharjee, Ken Calvert, Jim Griffioen, Neil Spring, James Sterbenz

Network-layer innovation has proven surprisingly difficult, in part because internetworking protocols ignore competing economic interests and because a few protocols dominate, enabling layer...

Using PlanetLab for network research: myths, realities, and best practices (2006)

Best Practices, Neil Spring, Larry Peterson, Andy Bavier, Vivek Pai

PlanetLab is a continuously-evolving global network research testbed that is simultaneously used by hundreds of researchers for diverse tasks, ranging from shortterm self-contained experiments among...

Status: Final Version. Using PlanetLab for Network Research: (2005)

Larry Peterson, Vivek Pai, Neil Spring, Andy Bavier, Best Practices, Larry Peterson, ...

PlanetLab is designed to be used by a wide range of network services and experiments. There are 428 slices running on PlanetLab (June 2005), and there are likely just as many different perceptions...

Reverse Engineering the Internet (2003)

Neil Spring, David Wetherall, Thomas Anderson

Abstract — To provide insight into Internet operation and performance, recent efforts have measured various aspects of the Internet, developing and improving measurement tools in the process. In...

No aversion To recursion (2003)

Ken Yasuhara, Neil Spring, Jeff Hightower, Vibha Sazawal

Functional programming often elicits groans and complaints about its lack of utility in the Javaand C++-dominated “real world. ” To assist in overcoming student obstinance, we have prepared the...

User-level Internet Path Diagnosis (2003)

Ratul Mahajan Neil, Neil Spring, David Wetherall, Thomas Anderson

Diagnosing faults in the Internet is arduous and time-consuming, in part because the network is composed of diverse components spread across many administrative domains. We consider an extreme form...

Adaptive Computing on the Grid Using AppLeS (2003)

Francine Berman, Richard Wolski, Henri Casanova, Walfredo Cirne, Holly Dail, Marcio Faerman, ...

Ensembles of distributed, heterogeneous resources, also known as Computational Grids have emerged as critical platforms for high-performance and resource-intensive applications. Such platforms...

Quantifying the Causes of Path Inflation (2003)

Neil Spring, Ratul Mahajan, Thomas Anderson

Researchers have shown that the Internet exhibits path inflation -- end-to-end paths can be significantly longer than necessary. We present a trace-driven study of 65 ISPs that characterizes the root...

Educational Materials to Assist in Motivating Functional Programming (2003)

Ken Yasuhara Neil, Neil Spring, Jeff Hightower

Functional programming often elicits groans and complaints about its lack of utility in the Javaand C++-dominated "real world." To assist in overcoming student obstinance, we have prepared...

Some big questions (2003)

Neil Spring

We depend on the Internet, yet, Can’t dissect it. Can’t crash-test it. Can’t buy a new one if it breaks. Should we believe the Internet is well-designed?... robust to failure or attack? Are...

Measuring ISP topologies with Rocketfuel (2002)

Neil Spring, Ratul Mahajan, David Wetherall

To date, realistic ISP topologies have not been accessible to the research community, leaving work that depends on topology on an uncertain footing. In this paper, we present new Internet mapping...

Inferring Link Weights using End-to-End Measurements (2002)

Ratul Mahajan, Neil Spring, David Wetherall, Tom Anderson

Abstract---We describe a novel constraint-based approach to approximate ISP link weights using only end-to-end measurements. Common routing protocols such as OSPF and IS-IS choose least-cost paths...

Measuring ISP topologies with Rocketfuel (2002)

Neil Spring, Ratul Mahajan, David Wetherall, Thomas Anderson

To date, realistic ISP topologies have not been accessible to the research community, leaving work that depends on topology on an uncertain footing. In this paper, we present new Internet mapping...

Inferring Link Weights using End-to-End Measurements (2002)

Ratul Mahajan, Neil Spring, David Wetherall, Tom Anderson

Abstract—We describe a novel constraint-based approach to approximate ISP link weights using only end-to-end measurements. Common routing protocols such as OSPF and IS-IS choose least-cost paths...

Scriptroute: A Public Internet Measurement Facility (2002)

Neil Spring, David Wetherall, Tom Anderson

We present Scriptroute, a system that allows ordinary Internet users to conduct network measurements from remote vantage points. We seek to combine the flexibility found in dedicated measurement...

Measuring ISP Topologies with Rocketfuel (2002)

Neil Spring Ratul, Neil Spring, Ratul Mahajan, David Wetherall

To date, realistic ISP topologies have not been accessible to the research community, leaving work that depends on topology on an uncertain footing. In this paper, we present new Internet mapping...

Inferring Link Weights using End-to-End Measurements (2002)

Ratul Mahajan, Neil Spring, David Wetherall, Tom Anderson

Abstract—We describe a novel constraint-based approach to approximate ISP link weights using only end-to-end measurements. Common routing protocols such as OSPF and IS-IS choose least-cost paths...

Abstract (2002)

Rich Wolski, John Brevik, Neil Spring, Chandra Krintz, Alan Su, Graziano Obertelli

The Computational Grid [10] has recently been proposed for the implementation of high-performance applications using widely dispersed computational resources. The goal of a Computational Grid is to...

Measuring ISP topologies with Rocketfuel (2002)

Neil Spring, Ratul Mahajan, David Wetherall, Thomas Anderson

Abstract—To date, realistic ISP topologies have not been accessible to the research community, leaving work that depends on topology on an uncertain footing. In this paper, we present new Internet...

Robust congestion signaling (2001)

David Ely, Neil Spring, David Wetherall, Stefan Savage, Tom Anderson

We present an improved Explicit Congestion Notification (ECN) mechanism that enables a router to signal congestion to the sender without trusting the receiver or other network devices along the...

Robust Congestion Signaling (2001)

David Ely Neil, Neil Spring, David Wetherall, Stefan Savage, Tom Anderson

We present an improved Explicit Congestion Notification (ECN) mechanism that enables a router to signal congestion to the sender without trusting the receiver or other network devices along the...

Writing Programs that Run EveryWare on the Computational Grid (2001)

Rich Wolski, John Brevik, Graziano Obertelli, Neil Spring, Alan Su

The Computational Grid [12] has been proposed for the implementation of high-performance applications using widely dispersed computational resources. The goal of a Computational Grid is to aggregate...

11 Feedback-directed binary code specialization (2000)

Cathy Miller Mlis, Gretta Bartels, Jonathan Deutscher, Michael Levin, Julien Sebot, Sameh Elnikety, ...

This document features informal reports by interns who spent the summer of 2000 working with researchers at

Predicting the CPU availability of time-shared unix systems (1999)

Rich Wolski, Neil Spring, Jim Hayes

In this paper we focus on the problem of making short and medium term forecasts of CPU availability on timeshared Unix systems. We evaluate the accuracy with which availability can be measured using...

Running EveryWare on the Computational Grid (1999)

Rich Wolski, John Brevik, Chandra Krintz, Graziano Obertelli, Neil Spring, Alan Su

The Computational Grid [10] has recently been proposed for the implementation of high-performance applications using widely dispersed computational resources. The goal of a Computational Grid is to...

Abstract (1999)

Rich Wolski, John Brevik, Neil Spring, Chandra Krintz, Alan Su, Graziano Obertelli

The Computational Grid [10] has recently been proposed for the implementation of high-performance applications using widely dispersed computational resources. The goal of a Computational Grid is to...

Application Level Scheduling of Gene Sequence Comparison on Metacomputers (1998)

Neil Spring, Rich Wolski

This paper investigates the efficacy of ApplicationLevel Scheduling (AppLeS) [3] for a parallel gene sequence library comparison application in production metacomputing settings. We compare an...

Implementing a Performance Forecasting System for Metacomputing: The Network Weather Service (Extended Abstract) (1997)

Submitted To Sc, Rich Wolski, Neil Spring, Chris Peterson

) submitted to SC97 UCSD Technical Report TR-CS97-540 Rich Wolski Neil Spring Chris Peterson May 20, 1997 Abstract In this paper we describe the design and implementation of a system called the...

Implementing a Performance Forecasting System for Metacomputing: The Network Weather Service (1997)

Rich Wolski, Neil Spring, Chris Peterson

In this paper we describe the design and implementation of a system called the Network Weather Service (NWS) that takes periodic measurements of deliverable resource performance from distributed...

USENIX Association (1992)

Usits Th Usenix, Neil Spring, David Wetherall, Tom Anderson

We present Scriptroute, a system that allows ordinary Internet users to conduct network measurements from remote vantage points. We seek to combine the flexibility found in dedicated measurement...