Siddhartha Annapureddy

Learn More
Network file systems offer a powerful, transparent interface for accessing remote data. Unfortunately, in current network file systems like NFS, clients fetch data from a central file server, inherently limiting the system's ability to scale to many clients. While recent distributed (peer-to-peer) systems have managed to eliminate this scalability(More)
Peer-to-peer technologies are increasingly becoming the medium of choice for deliveringmedia content, both professional and home-grown, to large user populations. Indeed, current P2P <i>swarming</i> systems have been shown to be very efficient for large-scale content distribution with few server resources.However, such systems have been designed for generic(More)
Digital media companies have recently started embracing P2P networks as an alternative distribution mechanism. However, with current P2P swarming systems users need to download the full video, and hence have to wait a long time before they can start watching it. While a lot of effort has gone into optimizing the distribution of large files, little research(More)
Currently, the only way to disseminate streaming media to many users is to pay for lots of bandwidth. A more democratic alternative would be for interested users to donate bandwidth to help disseminate the data further. In this paper we discuss the design of P2PCast, a completely decentralized, scalable, fault-tolerant self-organizing system aimed at being(More)
Digital media companies have recently started embracing peer-assisted distribution networks as an alternative to traditional client-server architectures. Such P2P architectures ensure a fast and scalable delivery of media content. However, one of the drawbacks of current P2P architectures is that users need to often wait for the full video to be downloaded(More)
In order to reach their large audiences, today’s Internet publishers primarily use content distribution networks (CDNs) to deliver content. Yet the architectures of the prevalent commercial systems are tightly bound to centralized control, static deployments, and trusted infrastructure, inherently limiting their scope and scale to ensure cost recovery. To(More)
In this thesis, we present design techniques – and systems that illustrate and validate these techniques – for building data-intensive applications over the Internet. We enable the use of a traditional bandwidth-limited server in these applications. A large number of cooperating users contribute resources such as disk space and network bandwidth, and form(More)
We discuss the problem of finding the second largest eigenvalue of an operator that defines a reversible Markov chain. The second largest eigenvalue governs the rate at which the statistics of the Markov chain converge to equilibrium. Scientific applications include understanding the very slow dynamics of some models of dynamic glass. Applications in(More)
  • 1