Demo Data from SIGIR 2026 / reviewers in the wild / expert
Michael Blodgett
dblp:08/2229 · also Mike Blodgett
· DBLP profile ↗
3ranked-venue papers
0as first author
0since 2021 · last 2011
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Computer networks · 2Systems, 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
1 paper |
Network measurement and analytics · 77% Wireless networking · 23% |
Topics — the 2 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Network measurement and analytics
traffic classification |
0.1 | 1 | 2011 | Fingerprinting 802.11 rate adaption algorithms · INFOCOM 2011 |
Wireless networking › link adaptation
802.11 rate adaptation |
0.0 | 1 | 2011 | Fingerprinting 802.11 rate adaption algorithms · INFOCOM 2011 |
Methods — techniques the papers use, named apart from their topics
support vector machine · 0.1passive measurement · 0.1packet trace analysis · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2011 | Fingerprinting 802.11 rate adaption algorithmsabstractThe effectiveness of rate adaptation algorithms is an important determinant of 802.11 wireless network performance. The diversity of algorithms that has resulted from efforts to improve rate adaptation has introduced a new dimension of variability into 802.11 wireless networks, further complicating the already difficult task of understanding and debugging 802.11 performance. To assist with this task, in this paper we present and evaluate a methodology for accurately fingerprinting 802.11 rate adaptation algorithms. Our approach uses a Support Vector Machine (SVM)-based classifier that requires only simple passive measurements of 802.11 traffic. We demonstrate that careful conversion of raw packet traces into input features for SVM is necessary for achieving high classification accuracy. We tested our classifier on the four rate adaptation algorithms available in MadWifi, cards. The classifier performs with an accuracy of 95% – 100%. We also show that the classifier is robust over a variety of network conditions if the training data includes a sufficient sampling of the range of an algorithm's behavior. Mariyam Mirza, Paul Barford, Xiaojin Zhu 0001, Suman Banerjee 0001, Michael Blodgett |
INFOCOM | 5 |
| 2009 | On The Accuracy of TCP Throughput Prediction for Opportunistic Wireless NetworksabstractThe increasing density of WiFi access points (APs) in metropolitan areas is enabling an opportunistic model of wireless networking, whereby a "guest" user within range of one or more wireless APs can gain temporary Internet access through these APs. In this paper, we address the problem of TCP throughput prediction for opportunistic networks. Applications of opportunistic networking can benefit from such predictions by adapting to prevailing network conditions. Our approach is different from prior efforts to model wireless network throughput in that only the two communicating endpoints participate in the prediction, and no information about network topology or traffic loads generated by interfering sources is required. Our goal is to understand how accurate throughput predictions can be under the above assumptions. The physical environment considered in our study includes varying degrees of interference, indoor and outdoor networks, and nodes that are stationary or moving at walking or driving speeds. We use throughput predictors based on time series analysis and machine learning techniques, as they are well-suited to predicting phenomena with unknown variables. The prediction accuracy that our methods yield is cause for cautious optimism. We find that 80% to 100% of predictions are within a factor of two of actual throughput. This bound on accuracy means that predictions are useful for certain applications, because this bound (a) can be achieved by measurements lasting for as little as 0.3 seconds, and (b) holds even when nodes are driving at speeds of 15-25 mph. Mariyam Mirza, Kevin Springborn, Suman Banerjee 0001, Paul Barford, Michael Blodgett, Xiaojin Zhu 0001 |
SECON | 5 |
| 2003 | Splat: A Network Switch/Port Configuration Management Tool
Cary Abrahamson, Michael Blodgett, Adam Kunen, Nathan Mueller, David W. Parter |
LISA | 2 |