![]() |
![]() |
Harry C. Li - Ph.D. student
|
| research |
paper
pdfs |
python
& systems |
fun |
| Statement
(see below) LasrWiki Dr. Hamming's Research Advice |
BAR
Gossip Paxos Register IT Byzantine Paxos The Game of Paxos |
Python PyCrypto PyOpenSSL Twisted |
Pictures |
| Austin,
TX |
Paris,
France |
New
York, NY |
Ithaca,
NY |
![]() |
![]() |
![]() |
![]() |
| Statement |
||
| I am broadly interested in fault-tolerant distributed systems. I like to think of my research as an eclectic mix of theory and practice. | ||
| Current: I work on
designing robust peer-to-peer protocols for streaming data. The
distributed systems community often touts peer-to-peer technology as
being flexible, robust, adaptive, etc. However, we make these claims
without really examining what we assume about the environment in which
our protocols run. Can we really claim that a peer-to-peer protocol
meant to be deployed over the Internet is in any way robust if it
cannot handle Byzantine behavior? And given the observation that many
file-sharing applications suffer from free-riding behavior, can we
still claim robustness in our protocols without considering selfish
behavior? It is for these reasons that I build peer-to-peer protocols
under the Byzantine-Altruistic-Rational (BAR) model |
||
| Past: Prior to working in
the BAR model, I worked with Lorenzo Alvisi and Allen Clement to create
a new and intuitive way to describe Lamport's Paxos and Casto and
Liskov's PBFT. Many have referred to PBFT as Byzantine Paxos, yet it's
unclear what the similarities and differences between those two
protocols really are. We created a pedagogical abstractions that sheds
light on the insights between Paxos and PBFT. I hope that our paper,
The Paxos Register, helps readers understand the subtleties behind
those two protocols. As an undergraduate at Brown University, I worked with Shriram Krishnamurthi and Kathi Fisler on identifying some problems in modular feature verification and proposing some initial solutions based upon three-valued model checking. |
||
| Publications: |
||
| FlightPath:
Obedience vs. Choice in Cooperative Services (with Allen
Clement, Mirco Marchetti, Manos Kapritsos, Luke Robison, Lorenzo
Alvisi, and Mike Dahlin). To appear
in Operating Systems Design and Implementation (OSDI 2008), San
Diego, California, December 2008. |
||
| BAR
Primer (with Allen Clement, Jeff Napper, J.P. Martin, Lorenzo
Alvisi, and Mike Dahlin). In Proceedings
of the International Conference on Dependable Systems and Networks (DSN
2008), DCC Symposium, Anchorage, Alaska, June 2008. pdf |
||
| How
Robust Are Gossip-Based Communication Protocols? (with Lorenzo
Alvisi, Jeroen Doumen,
Rachid Guerraoui, Boris Koldehofe, Robbert van Renesse,
and Gilles Tredan) In SIGOPS
Operating Systems Review 41,
5 (Oct. 2007), 14-18. |
||
| Compositional
Gossip: A
Conceptual Architecture for Designing Gossip-Based Applications
(with Étienne Riviere, Roberto
Baldoni, and José Pereira. In SIGOPS
Operating Systems Review
41,5 (Oct. 2007), 43-50. |
||
| The Paxos Register (with Allen Clement, Amitanand Aiyer, and Lorenzo Alvisi). In Proceedings of the 26th IEEE International Symposium Reliable Distributed Systems (SRDS '07), Beijing, China, October 2007. pdf | ||
| BAR Gossip (with
Allen Clement, Edmund Wong,
Jeff Napper, Indrajit Roy, Lorenzo Alvisi, and Mike Dahlin).
In Proceedings of the 7th
Symposium on
Operating System Design
and Implementation (OSDI '06), Seattle, WA, November 2006. pdf |
||
| some tech reports... |
||
| Information-Theoretically Secure Byzantine Paxos (with Amitanand S. Aiyer, Lorenzo Alvisi, and Allen Clement). The University of Texas at Austin, Department of Computer Sciences. Technical Report TR-07-21. May 18, 2007. pdf | ||
| The Game of Paxos (with Lorenzo Alvisi and Allen Clement. The University of Texas at Austin, Department of Computer Sciences. Technical Report TR-05-24. May 16, 2005. pdf | ||
| model checking works from
undergrad... |
||
| Interfaces
for modular feature verification (with Shriram Krishnamurthi and
Kathi Fisler). In ASE '02:
Proceedings of the 17th IEEE
International Conference on Automated Software Engineering
(ASE'02),
page 195, Washington, DC, USA, 2002. IEEE Computer Society. |
||
| Verifying cross-cutting features as open systems (with Shriram Krishnamurthi and Kathi Fisler). SIGSOFT Software Engineering Notes, 27(6):89--98, 2002. | ||
| Awards: |
||
| MCD Fellowship awarded by UT Austin (2002) | ||
| NSF Graduate Fellowship Honorable Mention (2002) | ||
| CRA Outstanding Undergraduate Award Honorable Mention (2001) | ||