William D. Strathearn

My Masters Thesis defense presentation. Describes the method developed to dynamically adapt to un-predictable network service loads by allocating whole servers from one service to another. Practical only in the context of large Internet Data Centers, this work extends previous efforts by determining the optimal resource usage based on prior, most recent performance output.

A presentation describing DAFS, a very efficient network file system designed to replace NFS. This was in support of our group's current efforts in a Cluster Based Storage System - Sorrento

This was a presentation done for a seminar on Peer-to-Peer Systems. The use of game theory is relatively new in p2p computing and our presentation aimed to give a brief overview of the subject and how it can be applied to p2p problems. The presentation is heavily influenced by two books by Philip D. Straffin and Robert Gibbons.

This was a presentation done for a seminar on Grid Computing. Effective scheduling in grid systems requires accurate prediction and modeling of network and machine conditions. For this presentation, we discuss a paper by Vern Paxon and Scott Shenker and Yin Zhang that attempts to find stationarity in Internet path properties. It involved a lot of complex mathematics (for a CS paper) and was one of the tougher papers I've read so far. It also all turned out to be fairly superfluous and was later disproved in larger part by later work.

In preparation for research on service migration in large scale Internet clusters, this presentation was created to give an brief overview of the state of the current research on this topic.

The presentation of our groups work on finding efficient methods of matching peers in an unstructured P2P network. The paper accompanying this presentation can be found here .