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

Colin Dixon

dblp:00/4008 · DBLP profile ↗
← Back
11ranked-venue papers
5as first author
0since 2021 · last 2014
—ORCID · none

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

Computer networks · 7 · 4 first-authorSoftware engineering, systems software and programming languages · 2 · 1 first-authorSystems, architecture and hardware · 1Human-computer interaction and ubiquitous computing · 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
5 papers
Routing and switching · 31% Datacenter networks · 26% Network management and operations · 17%
Human-computer interaction and pervasive computing
2 papers
Ubiquitous computing and smart environments · 100%
Software engineering, system software, and programming languages
1 paper
Operating systems · 100%
Computer architecture, parallel and distributed computing, and storage systems
3 papers
Distributed systems · 100%
Network and information security
1 paper
Network security · 100%

Topics — the 15 heaviest of 20, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Routing and switching › traffic engineering
congestion-aware rerouting
0.212014
Planck: millisecond-scale monitoring and control for commodity networks · SIGCOMM 2014
Datacenter networks
lossless ethernet
0.212014
Practical DCB for improved data center networks · INFOCOM 2014
Network management and operations
network monitoring
0.212014
Planck: millisecond-scale monitoring and control for commodity networks · SIGCOMM 2014
Transport protocols and congestion control
TCP variants
0.212014
Practical DCB for improved data center networks · INFOCOM 2014
Routing and switching
traffic engineering
0.212014
Planck: millisecond-scale monitoring and control for commodity networks · SIGCOMM 2014
Ubiquitous computing and smart environments
smart home
0.222012
Home automation in the wild: challenges and opportunities · CHI 2011
An Operating System for the Home · NSDI 2012
Datacenter networks
data center network topology
0.112012
PAST: scalable ethernet for data centers · CoNEXT 2012
Datacenter networks › data center network topology
fat-tree
0.112012
PAST: scalable ethernet for data centers · CoNEXT 2012
Network performance modeling › protocol performance analysis › routing performance
routing scalability
0.112012
PAST: scalable ethernet for data centers · CoNEXT 2012
Routing and switching › routing protocol
spanning tree routing
0.112012
PAST: scalable ethernet for data centers · CoNEXT 2012
Ubiquitous computing and smart environments › smart home
home automation
0.112011
Home automation in the wild: challenges and opportunities · CHI 2011
Network security › attack resilience › attack mitigation
denial-of-service defense
0.112008
Phalanx: Withstanding Multimillion-Node Botnets · NSDI 2008
Distributed systems
fault tolerance
0.122011
ETTM: A Scalable Fault Tolerant Network Manager · NSDI 2011
Phalanx: Withstanding Multimillion-Node Botnets · NSDI 2008
Routing and switching
deadlock-free routing
0.112014
Practical DCB for improved data center networks · INFOCOM 2014
Software-defined and programmable networks
openflow
0.012012
PAST: scalable ethernet for data centers · CoNEXT 2012

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

home OS design · 0.3ETTM · 0.2port mirroring · 0.2deadlock-free routing · 0.2TCP congestion control · 0.2phalanx · 0.2per-address spanning tree routing · 0.1semi-structured interviews · 0.1home visits · 0.1
YearPublicationVenuePosition
2014 OpenSample: A Low-Latency, Sampling-Based Measurement Platform for Commodity SDN
Junho Suh, Ted Taekyoung Kwon, Colin Dixon, Wes Felter, John B. Carter
ICDCS3
2014 Practical DCB for improved data center networks
abstract
Storage area networking is driving commodity data center switches to support lossless Ethernet (DCB). Unfortunately, to enable DCB for all traffic on arbitrary network topologies, we must address several problems that can arise in lossless networks, e.g., large buffering delays, unfairness, head of line blocking, and deadlock. We propose TCP-Bolt, a TCP variant that not only addresses the first three problems but reduces flow completion times by as much as 70%. We also introduce a simple, practical deadlock-free routing scheme that eliminates deadlock while achieving aggregate network throughput within 15% of ECMP routing. This small compromise in potential routing capacity is well worth the gains in flow completion time. We note that our results on deadlock-free routing are also of independent interest to the storage area networking community. Further, as our hardware testbed illustrates, these gains are achievable today, without hardware changes to switches or NICs.
Brent E. Stephens, Alan L. Cox, Ankit Singla, John B. Carter, Colin Dixon, Wes Felter
INFOCOM5
2014 Planck: millisecond-scale monitoring and control for commodity networks
abstract
Software-defined networking introduces the possibility of building self-tuning networks that constantly monitor network conditions and react rapidly to important events such as congestion. Unfortunately, state-of-the-art monitoring mechanisms for conventional networks require hundreds of milliseconds to seconds to extract global network state, like link utilization or the identity of "elephant" flows. Such latencies are adequate for responding to persistent issues, e.g., link failures or long-lasting congestion, but are inadequate for responding to transient problems, e.g., congestion induced by bursty workloads sharing a link. In this paper, we present Planck, a novel network measurement architecture that employs oversubscribed port mirroring to extract network information at 280 µs--7 ms timescales on a 1 Gbps commodity switch and 275 µs--4 ms timescales on a 10 Gbps commodity switch,over 11x and 18x faster than recent approaches, respectively (and up to 291x if switch firmware allowed buffering to be disabled on some ports). To demonstrate the value of Planck's speed and accuracy, we use it to drive a traffic engineering application that can reroute congested flows in milliseconds. On a 10 Gbps commodity switch, Planck-driven traffic engineering achieves aggregate throughput within 1--4% of optimal for most workloads we evaluated, even with flows as small as 50 MiB, an improvement of up to 53% over previous schemes.
Jeff Rasley, Brent E. Stephens, Colin Dixon, Eric Rozner, Wes Felter, Kanak Agarwal 0001, John B. Carter, Rodrigo Fonseca
SIGCOMM3
2012 PAST: scalable ethernet for data centers
abstract
We present PAST, a novel network architecture for data center Ethernet networks that implements a Per-Address Spanning Tree routing algorithm. PAST preserves Ethernet's self-configuration and mobility support while increasing its scalability and usable bandwidth. PAST is explicitly designed to accommodate unmodified commodity hosts and Ethernet switch chips. Surprisingly, we find that PAST can achieve performance comparable to or greater than Equal-Cost Multipath (ECMP) forwarding, which is currently limited to layer-3 IP networks, without any multipath hardware support. In other words, the hardware and firmware changes proposed by emerging standards like TRILL are not required for high-performance, scalable Ethernet networks. We evaluate PAST on Fat Tree, HyperX, and Jellyfish topologies, and show that it is able to capitalize on the advantages each offers. We also describe an OpenFlow-based implementation of PAST in detail.
Brent E. Stephens, Alan L. Cox, Wes Felter, Colin Dixon, John B. Carter
CoNEXT4
2012 An Operating System for the Home
Colin Dixon, Ratul Mahajan, Sharad Agarwal, A. J. Bernheim Brush, Bongshin Lee, Stefan Saroiu, Paramvir Bahl
NSDI1
2011 Home automation in the wild: challenges and opportunities
abstract
Visions of smart homes have long caught the attention of researchers and considerable effort has been put toward enabling home automation. However, these technologies have not been widely adopted despite being available for over three decades. To gain insight into this state of affairs, we conducted semi-structured home visits to 14 households with home automation. The long term experience, both positive and negative, of the households we interviewed illustrates four barriers that need to be addressed before home automation becomes amenable to broader adoption. These barriers are high cost of ownership, inflexibility, poor manageability, and difficulty achieving security. Our findings also provide several directions for further research, which include eliminating the need for structural changes for installing home automation, providing users with simple security primitives that they can confidently configure, and enabling composition of home devices.
A. J. Bernheim Brush, Bongshin Lee, Ratul Mahajan, Sharad Agarwal, Stefan Saroiu, Colin Dixon
CHI6
2011 ETTM: A Scalable Fault Tolerant Network Manager
Colin Dixon, Hardeep Uppal, Vjekoslav Brajkovic, Dane Brandon, Thomas E. Anderson, Arvind Krishnamurthy
NSDI1
2010 The home needs an operating system (and an app store)
abstract
We argue that heterogeneity is hindering technological innovation in the home---homes differ in terms of their devices and how those devices are connected and used. To abstract these differences, we propose to develop a home-wide operating system. A HomeOS can simplify application development and let users easily add functionality by installing new devices or applications. The development of such an OS is an inherently inter-disciplinary exercise. Not only must the abstractions meet the usual goals of being efficient and easy to program, but the underlying primitives must also match how users want to manage and secure their home. We describe the preliminary design of HomeOS and our experience with developing applications for it.
Colin Dixon, Ratul Mahajan, Sharad Agarwal, A. J. Bernheim Brush, Bongshin Lee, Stefan Saroiu, Paramvir Bahl
HotNets1
2009 An End to the Middle
Colin Dixon, Arvind Krishnamurthy, Thomas E. Anderson
HotOS1
2008 Phalanx: Withstanding Multimillion-Node Botnets
Colin Dixon, Thomas E. Anderson, Arvind Krishnamurthy
NSDI1
2006 iPlane: An Information Plane for Distributed Services
Harsha V. Madhyastha, Tomas Isdal, Michael Piatek, Colin Dixon, Thomas E. Anderson, Arvind Krishnamurthy, Arun Venkataramani
OSDI4