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

Michael J. Demmer

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

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

Computer networks · 4 · 2 first-authorDatabases, data management, data science and information retrieval · 2 · 1 first-authorSystems, architecture and hardware · 1 · 1 first-authorApplied, interdisciplinary, general and emerging 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 architecture, parallel and distributed computing, and storage systems
3 papers
Storage systems · 37% Distributed systems · 35% Memory systems · 28%
Computer networks
2 papers
Network measurement and analytics · 32% Cellular and mobile networks · 32% Internet of things and sensor networks · 28%

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

TopicWeightPapersLastEvidence papers
Storage systems › file systems
distributed file system
0.112008
TierStore: A Distributed Filesystem for Challenged Networks in Developing Regions · FAST 2008
Cellular and mobile networks
developing regions
0.112006
Analysis of WWW traffic in Cambodia and Ghana · WWW 2006
Network measurement and analytics › traffic analysis
web traffic analysis
0.112006
Analysis of WWW traffic in Cambodia and Ghana · WWW 2006
Memory systems › cache
cache performance
0.112006
Analysis of WWW traffic in Cambodia and Ghana · WWW 2006
Distributed systems
web caching
0.112006
Analysis of WWW traffic in Cambodia and Ghana · WWW 2006
Internet of things and sensor networks
delay tolerant networks
0.112005
Using redundancy to cope with failures in a delay tolerant network · SIGCOMM 2005
Internet architecture and protocols › world wide web › web protocols
HTTP
0.012006
Analysis of WWW traffic in Cambodia and Ghana · WWW 2006
Distributed systems
fault tolerance
0.012005
Using redundancy to cope with failures in a delay tolerant network · SIGCOMM 2005

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

trace analysis · 0.1simulation · 0.1portfolio theory optimization · 0.1erasure coding · 0.1
YearPublicationVenuePosition
2009 The design and implementation of a session layer for delay-tolerant networks
Michael J. Demmer, Kevin R. Fall
Comput. Commun.1
2008 TierStore: A Distributed Filesystem for Challenged Networks in Developing Regions
Michael J. Demmer, Bowei Du, Eric A. Brewer
FAST1
2007 Towards a Modern Communications API
Michael J. Demmer, Kevin R. Fall, Teemu Koponen, Scott Shenker
HotNets1
2007 A Message Oriented Phone System for Low Cost Connectivity
R. J. Honicky, Eric A. Brewer, Omar Bakr, Michael J. Demmer
HotNets4
2006 Analysis of WWW traffic in Cambodia and Ghana
abstract
In this paper we present an analysis of HTTP traffic captured from Internet cafés and kiosks from two different developing countries -- Cambodia and Ghana. This paper has two main contributions. The first contribution is a analysis of the characteristics of the web trace, including the distribution and classification of the web objects requested by the users. We outline notable features of the data set which effect the performance of the web for users in developing regions. Using the trace data, we also perform several simulation analyses of cache performance, including both traditional caching and more novel off-line caching proposals. The second contribution is a set of suggestions on mechanisms to improve the user experience of the web in these regions. These mechanisms include both applications of well-known research techniques as well as offering some less well-studied suggestions based on intermittent connectivity.
Bowei Du, Michael J. Demmer, Eric A. Brewer
WWW2
2005 Using redundancy to cope with failures in a delay tolerant network
abstract
We consider the problem of routing in a delay tolerant network (DTN) in the presence of path failures. Previous work on DTN routing has focused on using precisely known network dynamics, which does not account for message losses due to link failures, buffer overruns, path selection errors, unscheduled delays, or other problems. We show how to split, replicate, and erasure code message fragments over multiple delivery paths to optimize the probability of successful message delivery. We provide a formulation of this problem and solve it for two cases: a 0/1 (Bernoulli) path delivery model where messages are either fully lost or delivered, and a Gaussian path delivery model where only a fraction of a message may be delivered. Ideas from the modern portfolio theory literature are borrowed to solve the underlying optimization problem. Our approach is directly relevant to solving similar problems that arise in replica placement in distributed file systems and virtual node placement in DHTs. In three different simulated DTN scenarios covering a wide range of applications, we show the effectiveness of our approach in handling failures.
Sushant Jain, Michael J. Demmer, Rabin K. Patra, Kevin R. Fall
SIGCOMM2
1998 The Arrow Distributed Directory Protocol
Michael J. Demmer, Maurice Herlihy
DISC1