Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Andrew D. Ferguson

dblp:61/11188 · DBLP profile ↗
← Back
7ranked-venue papers
4as first author
2since 2021 · last 2024
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 5 · 3 first-author · 2 since 2021Systems, architecture and hardware · 1 · 1 first-authorSoftware engineering, systems software and programming languages · 1Theory of computation · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer networks
6 papers
Software-defined and programmable networks · 33% Network management and operations · 30% Datacenter networks · 28%
Computer architecture, parallel and distributed computing, and storage systems
2 papers
Cloud and datacenter computing · 93% Parallel and multicore computing · 7%
Software engineering, system software, and programming languages
1 paper
Program analysis · 100%

Topics — the 10 heaviest of 14, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Software-defined and programmable networks
SDN control plane
0.722021
Orion: Google's Software-Defined Networking Control Plane · NSDI 2021
Participatory networking: an API for application control of SDNs · SIGCOMM 2013
Network measurement and analytics
internet topology measurement
0.212013
Growth analysis of a large ISP · Internet Measurement Conference 2013
Cloud and datacenter computing
datacenter network
0.112021
Orion: Google's Software-Defined Networking Control Plane · NSDI 2021
Cloud and datacenter computing › datacenter network
software-defined networking
0.112021
Orion: Google's Software-Defined Networking Control Plane · NSDI 2021
Cloud and datacenter computing
cluster resource management and scheduling
0.112012
Jockey: guaranteed job latency in data parallel clusters · EuroSys 2012
Cloud and datacenter computing › resource allocation
dynamic resource allocation
0.112012
Jockey: guaranteed job latency in data parallel clusters · EuroSys 2012
Network management and operations
network verification
0.112014
Tierless Programming and Reasoning for Software-Defined Networks · NSDI 2014
Wireless networking › multiple access protocols
conflict resolution
0.012013
Participatory networking: an API for application control of SDNs · SIGCOMM 2013
Internet architecture and protocols › network topology
inter-domain topology
0.012013
Growth analysis of a large ISP · Internet Measurement Conference 2013
Parallel and multicore computing › parallel scheduling
data-parallel job scheduling
0.012012
Jockey: guaranteed job latency in data parallel clusters · EuroSys 2012

Methods — techniques the papers use, named apart from their topics

network architecture design · 0.8time series analysis · 0.2reverse DNS analysis · 0.2iffinder · 0.2simulation · 0.1control policy · 0.1
YearPublicationVenuePosition
2024 CAPA: An Architecture For Operating Cluster Networks With High Availability
Bingzhe Liu, Colin Scott, Mukarram Tariq, Andrew D. Ferguson, Phillipa Gill, Richard Alimi, Omid Alipourfard, Deepak Arulkannan, Virginia Beauregard, Patrick Conner, Brighten Godfrey, Xander Lin, Joon Ong, Mayur Patel, Amr Sabaa, Alex Smirnov, Manish Verma, Prerepa V. Viswanadham, Amin Vahdat
NSDI4
2021 Orion: Google's Software-Defined Networking Control Plane
Andrew D. Ferguson, Steve D. Gribble, Chi-Yao Hong, Chip Killian, Waqar Mohsin, Henrik Mühe, Joon Ong, Leonid B. Poutievski, Lorenzo Vicisano, Richard Alimi, Shawn Shuoshuo Chen, Mike Conley, Subhasree Mandal, Karthik Nagaraj, Kondapa Naidu Bollineni, Amr Sabaa, Shidong Zhang, Amin Vahdat
NSDI1
2015 Static Differential Program Analysis for Software-Defined Networks
Tim Nelson, Andrew D. Ferguson, Shriram Krishnamurthi
FM2
2014 Tierless Programming and Reasoning for Software-Defined Networks
Tim Nelson, Andrew D. Ferguson, Michael J. G. Scheer, Shriram Krishnamurthi
NSDI2
2013 Growth analysis of a large ISP
abstract
We present a time-series analysis of Cogent's inter-continental network. The analysis is based on descriptions of Cogent's routers and their interfaces, collected each week for more than one year. These descriptions are collected from public reverse DNS records, which we cross-validate using iffinder, a full Internet scan, and limited ground truth data provided by Cogent. For example, our dataset, which we make available to the research community, shows that while the number of Cogent routers grew by approximately 11.3 each week, the average number of interfaces per router, and the effective diameter of the inferred network remained stable over the same period. Our collected dataset includes information about interface types, port identifications, router locations, peer and customer attachments, and more.
Andrew D. Ferguson, Jordan Place, Rodrigo Fonseca
Internet Measurement Conference1
2013 Participatory networking: an API for application control of SDNs
abstract
We present the design, implementation, and evaluation of an API for applications to control a software-defined network (SDN). Our API is implemented by an OpenFlow controller that delegates read and write authority from the network's administrators to end users, or applications and devices acting on their behalf. Users can then work with the network, rather than around it, to achieve better performance, security, or predictable behavior. Our API serves well as the next layer atop current SDN stacks. Our design addresses the two key challenges: how to safely decompose control and visibility of the network, and how to resolve conflicts between untrusted users and across requests, while maintaining baseline levels of fairness and security. Using a real OpenFlow testbed, we demonstrate our API's feasibility through microbenchmarks, and its usefulness by experiments with four real applications modified to take advantage of it.
Andrew D. Ferguson, Arjun Guha, Rodrigo Fonseca, Shriram Krishnamurthi
SIGCOMM1
2012 Jockey: guaranteed job latency in data parallel clusters
abstract
Data processing frameworks such as MapReduce [8] and Dryad [11] are used today in business environments where customers expect guaranteed performance. To date, however, these systems are not capable of providing guarantees on job latency because scheduling policies are based on fair-sharing, and operators seek high cluster use through statistical multiplexing and over-subscription. With Jockey, we provide latency SLOs for data parallel jobs written in SCOPE. Jockey precomputes statistics using a simulator that captures the job's complex internal dependencies, accurately and efficiently predicting the remaining run time at different resource allocations and in different stages of the job. Our control policy monitors a job's performance, and dynamically adjusts resource allocation in the shared cluster in order to maximize the job's economic utility while minimizing its impact on the rest of the cluster. In our experiments in Microsoft's production Cosmos clusters, Jockey meets the specified job latency SLOs and responds to changes in cluster conditions.
Andrew D. Ferguson, Peter Bodík, Srikanth Kandula, Eric Boutin, Rodrigo Fonseca
EuroSys1