We study the average number of delays suffered by packets routed using greedy (work conserving) scheduling policies. We obtain tight bounds on the worst-case average number of del...
We consider the server scheduling problem in hybrid P2P networks in the context of a fluid model. Specifically, we examine how to allocate the limited amount of server upload ca...
Abstract. Developing efficient distributed applications while managing complexity can be challenging. Managing network latency is a key challenge for distributed applications. We ...
We introduce a generic framework for the distributed execution of combinatorial optimization tasks. Instead of relying on custom hardware (like dedicated parallel machines or clus...
Apple's release of the Xgrid framework for distributed computing introduces a new technology solution for loosely coupled distributed computation. In this paper systematicall...