Projects in DNA Lab - P2P and Overlay

Return to Main Projects Page

• PROOFS: PROOFS is a prototype P2P system I took part in developing. [SRS02] (with an extended version described in [SRS04]) describes the design of this system and evaluates its performance, and includes experiments with our prototype on PlanetLab. There was a cute "mixing" approach to create random graphs with a fairly straightforward undirected search. We also performed a mathematical analysis that demonstrated the scalability of this idea in systems with millions of users in [RS05].

  Publications:

  • [SRS02] A. Stavrou, D. Rubenstein, and S. Sahu. A Lightweight, Robust P2P System to Handle Flash Crowds. In Proceedings of ICNP'02, Paris, France, November 2002.
  • [SRS04] Angelos Stavrou, Dan Rubenstein, and Sambit Sahu. A lightweight, robust, p2p system to handle flash crowds. IEEE Journal on Selected Areas in Communications (JSAC), special issue on Service Overlay Networks, 22(1), January 2004.
  • [RS05] Dan Rubenstein and Sambit Sahu. Can unstructured p2p protocols survive flash crowds? IEEE/ACM Transactions on Networking, 13(3), June 2005.

• Distributed Scalable Replica/Task Placement: Content distribution systems increase their resilience and efficiency in delivering content by replicating the content at multiple points in the network. Wireless 802.11 ad-hoc networks can utilize multiple channels to reduce interference among neighbor's competing transmissions. We viewed the challenge of replicated task placement as a non-traditional graph coloring problem, and constructed distributed, self-configuring algorithms that assign colors to nodes such that the coloring is provably within a constant factor of an optimal assignment.

• P2P Pollution: P2P Systems are highly vulnerable to pollution attacks. We use fluid modeling to explore various strategies by both the polluters and the clients trying to get the valid copy.

  Publications:

  • Rakesh Kumar, David Yao, Amitabha Bagchi, Keith Ross and Dan Rubenstein, Fluid Modeling of Pollution Proliferation in P2P Networks, Proceedings of ACM Sigmetrics, St. Malo, France, June, 2006.