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

Toby Moncaster

dblp:26/6511 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
0since 2021 · last 2015
—ORCID · none

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

Computer networks · 3

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
2 papers
Internet architecture and protocols · 38% Network optimization and economics · 34% Network performance modeling · 28%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Cloud and datacenter computing · 100%

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

TopicWeightPapersLastEvidence papers
Internet architecture and protocols › quality of service › performance guarantees
bandwidth and delay guarantees
0.212015
Silo: Predictable Message Latency in the Cloud · SIGCOMM 2015
Network performance modeling
network calculus
0.212015
Silo: Predictable Message Latency in the Cloud · SIGCOMM 2015
Cloud and datacenter computing › multi-tenancy
multi-tenant datacenter
0.212015
Silo: Predictable Message Latency in the Cloud · SIGCOMM 2015
Network optimization and economics
fairness
0.112008
Policing freedom to use the internet resource pool · CoNEXT 2008
Network optimization and economics
resource allocation
0.112008
Policing freedom to use the internet resource pool · CoNEXT 2008
Network optimization and economics
resource sharing
0.112008
Policing freedom to use the internet resource pool · CoNEXT 2008
Internet architecture and protocols
traffic policing
0.112008
Policing freedom to use the internet resource pool · CoNEXT 2008
Cloud and datacenter computing › virtualization › virtual machine management
virtual machine placement
0.112015
Silo: Predictable Message Latency in the Cloud · SIGCOMM 2015
Network optimization and economics › network economics › internet economics
network neutrality
0.012008
Policing freedom to use the internet resource pool · CoNEXT 2008

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

packet pacing · 0.4network calculus · 0.4hypervisor-based policing · 0.4architectural analysis · 0.1
YearPublicationVenuePosition
2015 Silo: Predictable Message Latency in the Cloud
abstract
Many cloud applications can benefit from guaranteed latency for their network messages, however providing such predictability is hard, especially in multi-tenant datacenters. We identify three key requirements for such predictability: guaranteed network bandwidth, guaranteed packet delay and guaranteed burst allowance. We present Silo, a system that offers these guarantees in multi-tenant datacenters. Silo leverages the tight coupling between bandwidth and delay: controlling tenant bandwidth leads to deterministic bounds on network queuing delay. Silo builds upon network calculus to place tenant VMs with competing requirements such that they can coexist. A novel hypervisor-based policing mechanism achieves packet pacing at sub-microsecond granularity, ensuring tenants do not exceed their allowances. We have implemented a Silo prototype comprising a VM placement manager and a Windows filter driver. Silo does not require any changes to applications, guest OSes or network switches. We show that Silo can ensure predictable message latency for cloud applications while imposing low overhead.
Keon Jang, Justine Sherry, Hitesh Ballani, Toby Moncaster
SIGCOMM4
2013 Trevi: watering down storage hotspots with cool fountain codes
abstract
Datacenter networking has brought high-performance storage systems' research to the foreground once again. Many modern storage systems are built with commodity hardware and TCP/IP networking to save costs. In this paper, we highlight a group of problems that are present in such storage systems and which are all related to the use of TCP. As an alternative, we explore Trevi: a fountain coding-based approach for distributing I/O requests that overcomes these problems while still efficiently scheduling resources across both networking and storage layers. We also discuss how receiver-driven flow and congestion control, in combination with fountain coding, can guide the design of Trevi and provide a viable alternative to TCP for datacenter storage.
George Parisis, Toby Moncaster, Anil Madhavapeddy, Jon Crowcroft
HotNets2
2008 Policing freedom to use the internet resource pool
abstract
Ideally, everyone should be free to use as much of the Internet resource pool as they can take. But, whenever too much load meets too little capacity, everyone's freedoms collide. We show that attempts to isolate users from each other have corrosive side-effects - discouraging mutually beneficial sharing of the resource pool and harming the Internet's evolvability. We describe an unusual form of traffic policing which only pushes back against those who use their freedom to limit the freedom of others. This offers a vision of how much better the Internet could be. But there are subtle aspects missing from the current Internet architecture that prevent this form of policing being deployed. This paper aims to shift the research agenda onto those issues, and away from earlier attempts to isolate users from each other.
Arnaud Jacquet, Bob Briscoe, Toby Moncaster
CoNEXT3