Charles Blake 0001

dblp:68/5778 · DBLP profile ↗
← Back
4ranked-venue papers
2as first author
0since 2021 · last 2004
—ORCID · none

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

Computer networks · 2Systems, architecture and hardware · 1 · 1 first-authorSoftware engineering, systems software and programming languages · 1 · 1 first-author

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
Wireless networking · 48% Network measurement and analytics · 24% Network performance modeling · 21%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Performance modeling and evaluation · 100%
Software engineering, system software, and programming languages
1 paper
Program analysis · 100%

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

TopicWeightPapersLastEvidence papers
Network measurement and analytics › bandwidth estimation
network path capacity measurement
0.012004
MultiQ: automated detection of multiple bottleneck capacities along a path · Internet Measurement Conference 2004
Performance modeling and evaluation
profiling
0.012002
Simple and General Statistical Profiling with PCT · USENIX ATC, General Track 2002
Performance modeling and evaluation › profiling
statistical profiling
0.012002
Simple and General Statistical Profiling with PCT · USENIX ATC, General Track 2002
Wireless networking › network capacity
capacity scaling
0.012001
Capacity of Ad Hoc wireless networks · MobiCom 2001
Wireless networking
mobile ad hoc networks
0.012001
Capacity of Ad Hoc wireless networks · MobiCom 2001
Wireless networking
network capacity
0.012001
Capacity of Ad Hoc wireless networks · MobiCom 2001
Network performance modeling
scaling laws
0.012001
Capacity of Ad Hoc wireless networks · MobiCom 2001
Transport protocols and congestion control › transport protocols
TCP flow analysis
0.012004
MultiQ: automated detection of multiple bottleneck capacities along a path · Internet Measurement Conference 2004
Program analysis
performance analysis tools
0.012002
Simple and General Statistical Profiling with PCT · USENIX ATC, General Track 2002

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

packet interarrival time distribution analysis · 0.0mode gap detection · 0.0simulation · 0.0first-principles analysis · 0.0
YearPublicationVenuePosition
2004 MultiQ: automated detection of multiple bottleneck capacities along a path
abstract
multiQ is a passive capacity measurement tool suitable for large-scale studies of Internet path characteristics. It is the first passive tool that discovers the capacity of multiple congested links along a path from a single flow trace, and the first tool that effectively extracts capacity information from ack-only traces. It uses equally-spaced mode gaps in TCP flows' packet interarrival time distributions to detect multiple bottleneck capacities in their relative order.We validate multiQ in depth using the RON overlay network, which provides more than 400 heterogeneous, well-understood Internet paths. We compare multiQ with two other capacity measurement tools (Nettimer and Pathrate) in the first large-scale wide-area evaluation of capacity measurement techniques, and find that multiQ is highly accurate; for instance, though multiQ is passive, it achieves the same accuracy as Pathrate, which is active.
Sachin Katti, Dina Katabi, Charles Blake 0001, Eddie Kohler, Jacob Strauss
Internet Measurement Conference3
2003 High Availability, Scalable Storage, Dynamic Peer Networks: Pick Two
Charles Blake 0001, Rodrigo Rodrigues 0001
HotOS1
2002 Simple and General Statistical Profiling with PCT
Charles Blake 0001, Steven J. Bauer
USENIX ATC, General Track1
2001 Capacity of Ad Hoc wireless networks
abstract
Early simulation experience with wireless ad hoc networks suggests that their capacity can be surprisingly low, due to the requirement that nodes forward each others' packets. The achievable capacity depends on network size, traffic patterns, and detailed local radio interactions. This paper examines these factors alone and in combination, using simulation and analysis from first principles. Our results include both specific constants and general scaling relationships helpful in understanding the limitations of wireless ad hoc networks.
Jinyang Li 0001, Charles Blake 0001, Douglas S. J. De Couto, Hu Imm Lee, Robert Morris 0005
MobiCom2