Adam Greenhalgh

dblp:56/2873 · DBLP profile ↗
← Back
8ranked-venue papers
1as first author
0since 2021 · last 2011
—ORCID · none

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

Computer networks · 6Systems, architecture and hardware · 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
4 papers
Transport protocols and congestion control · 48% Routing and switching · 34% Internet architecture and protocols · 14%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Cloud and datacenter computing · 87% Performance modeling and evaluation · 13%

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

TopicWeightPapersLastEvidence papers
Transport protocols and congestion control › multipath transport
multipath TCP
0.222011
Improving datacenter performance and robustness with multipath TCP · SIGCOMM 2011
Design, Implementation and Evaluation of Congestion Control for Multipath TCP · NSDI 2011
Routing and switching
multipath routing
0.112011
Improving datacenter performance and robustness with multipath TCP · SIGCOMM 2011
Transport protocols and congestion control
multipath transport
0.112011
Design, Implementation and Evaluation of Congestion Control for Multipath TCP · NSDI 2011
Routing and switching › packet forwarding
high-speed packet forwarding
0.112008
Towards high performance virtual routers on commodity hardware · CoNEXT 2008
Routing and switching › router architecture
software router
0.112008
Towards high performance virtual routers on commodity hardware · CoNEXT 2008
Cloud and datacenter computing › virtualization › network virtualization
network function virtualization
0.112008
Towards high performance virtual routers on commodity hardware · CoNEXT 2008
Cloud and datacenter computing
virtualization
0.112008
Towards high performance virtual routers on commodity hardware · CoNEXT 2008
Datacenter networks
data center network topology
0.012011
Improving datacenter performance and robustness with multipath TCP · SIGCOMM 2011
Transport protocols and congestion control
TCP
0.012011
Improving datacenter performance and robustness with multipath TCP · SIGCOMM 2011
Performance modeling and evaluation
workload characterization
0.012008
Towards high performance virtual routers on commodity hardware · CoNEXT 2008

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

measurement · 0.3core mapping · 0.2multipath transport · 0.1
YearPublicationVenuePosition
2011 Is it still possible to extend TCP?
abstract
We've known for a while that the Internet has ossified as a result of the race to optimize existing applications or enhance security. NATs, performance-enhancing-proxies,firewalls and traffic normalizers are only a few of the middleboxes that are deployed in the network and look beyond the IP header to do their job. IP itself can't be extended because "IP options are not an option". Is the same true for TCP?
Michio Honda, Yoshifumi Nishida, Costin Raiciu, Adam Greenhalgh, Mark Handley, Hideyuki Tokuda
Internet Measurement Conference4
2011 Design, Implementation and Evaluation of Congestion Control for Multipath TCP
Damon Wischik, Costin Raiciu, Adam Greenhalgh, Mark Handley
NSDI3
2011 Improving datacenter performance and robustness with multipath TCP
abstract
The latest large-scale data centers offer higher aggregate bandwidth and robustness by creating multiple paths in the core of the net- work. To utilize this bandwidth requires different flows take different paths, which poses a challenge. In short, a single-path transport seems ill-suited to such networks.
Costin Raiciu, Sébastien Barré, Christopher Pluntke, Adam Greenhalgh, Damon Wischik, Mark Handley
SIGCOMM4
2010 Data center networking with multipath TCP
abstract
Recently new data center topologies have been proposed that offer higher aggregate bandwidth and location independence by creating multiple paths in the core of the network. To effectively use this bandwidth requires ensuring different flows take different paths, which poses a challenge.
Costin Raiciu, Christopher Pluntke, Sébastien Barré, Adam Greenhalgh, Damon Wischik, Mark Handley
HotNets4
2009 Improved Forwarding Architecture and Resource Management for Multi-Core Software Routers
abstract
Recent technological advances in commodity server architectures, with multiple multi-core CPUs, integrated memory controllers, high-speed interconnects and enhanced network interface cards, provide substantial computational capacity and thus an attractive platform for packet forwarding. However, to exploit this available capacity, we need a suitable software platform that allows effective parallel packet processing and resource management. In this paper, we at first introduce an improved forwarding architecture for software routers that enhances parallelism by exploiting hardware classification and multi-queue support, already available in recent commodity network interface cards. After evaluating the original scheduling algorithm of the widely-used Click modular router, we propose solutions for extending this scheduler for improved fairness, throughput and more precise resource management. To illustrate the potential benefits of our proposal, we implement and evaluate a few key elements of our overall design.
Norbert Egi, Adam Greenhalgh, Mark Handley, Gianluca Iannaccone, Maziar Manesh, Laurent Mathy, Sylvia Ratnasamy
NPC2
2008 Towards high performance virtual routers on commodity hardware
abstract
Modern commodity hardware architectures, with their multiple multi-core CPUs and high-speed system interconnects, exhibit tremendous power. In this paper, we study performance limitations when building both software routers and software virtual routers on such systems. We show that the fundamental performance bottleneck is currently the memory system, and that through careful mapping of tasks to CPU cores, we can achieve forwarding rates of 7 million minimum-sized packets per second on mid-range server-class systems, thus demonstrating the viability of software routers. We also find that current virtualisation systems, when used to provide forwarding engine virtualisation, yield aggregate performance equivalent to that of a single software router, a tenfold improvement on current virtual router platform performance. Finally, we identify principles for the construction of high-performance software router systems on commodity hardware, including full router virtualisation support.
Norbert Egi, Adam Greenhalgh, Mark Handley, Mickaël Hoerdt, Felipe Huici, Laurent Mathy
CoNEXT2
2007 Evaluating Xen for Router Virtualization
abstract
In this paper, we evaluate the performance of a software IP router forwarding plane inside the Xen virtual machine monitor environment with a view to identifying (some) design issues in Virtual Routers. To this end, we evaluate and compare the forwarding performance of two identical Linux software router configurations, run either above the Xen hypervisor or within vanilla Linux. Even with minimal sized packets, we show that the Xen DomO privileged domain offers near native forwarding performance at the condition that the sollicitation to unpriviledged domains stay minimal, whereas Xen unprivileged domains offer very poor performance in every cases. This shows that an important design principle for virtual router platforms must be to handle all forwarding, for all virtual routers, onto the same forwarding engine, in order to avoid much detrimental per-packet context switching.
Norbert Egi, Adam Greenhalgh, Mark Handley, Mickaël Hoerdt, Laurent Mathy, Tim Schooley
ICCCN2
2005 A summary of the complex behaviour from simple power conserving protocols
abstract
In this paper we examine the complex behavior that emerges from the implementation of an energy-aware system using a simple transmission power control algorithm that exploits overheard MAC-level information to reduce a device's energy consumption. We evaluate this simple algorithm using two radio systems and show that, in spite of the complexity, energy savings can be obtained using a scheme that takes advantage of overheard information
Adam Greenhalgh, Stephen Hailes
PIMRC1