COSC 7360--Advanced Operating Systems
Spring 2011: Peer to Peer Systems

Papers on the final

Video Streaming

S. Sheu, K. A. Hua, and W. Tavanapong. Chaining: a generalized batching technique for video-on-demand systems. Proc. 3rd IEEE International Conference on Multimedia Computing and Systems (ICMS 1997), pp. 110-117, June 1997. (SC)(PowerPoint)

-        Understand how basic chaining works. You can skip extended chaining.

J.-F. Paris and T. J. Schwarz. An Analysis of Chaining Protocols for Video-on-Demand, Proc. 9th International Information and Telecommunication Technologies Symposium (I2TS 2010), Dec. 2010. (PowerPoint)

-        Understand the differences between basic chaining, expanded chaining and accelerated chaining. You can skip the mathematical developments.

P. Shah and J.-F. Paris. Peer-to-Peer Multimedia Streaming Using BitTorrent, Proc. 26th International Performance of Computers and Communication Conference (IPCCC 2007), pp. 340-347, Apr. 2007 (PowerPoint).

-        Focus on the two contributions of the paper, namely its sliding window and its randomized tit-for-tat policy for incoming peers. Understand that video watching is delayed by the duration of the sliding window.

A. Vlavianos, M. Iliofotou, and M. Faloutsos. BiToS: Enhancing BitTorrent for supporting streaming applications. Proc. 9th IEEE Global Internet Symposium, Apr. 2006. (PowerPoint)

-        Focus on the differences between this scheme and Shah's scheme and how the authors define their sliding window.

A. Carta, M. Mellia, M. Meo, S. Traverso. Efficient Uplink Bandwidth Utilization in P2P-TV Streaming Systems. Proc. 2010 GLOBECOM Conference, pp. 1-6, Dec. 2010. (SK)

-        Focus on the issues discussed by the authors rather than on the solution they propose.

Other Applications

Renesse, R.V, Birman, K.P. and Vogels, W. Astrolabe: A robust and scalable technology for distributed system monitoring, management, and data mining. ACM Transactions on Computer Systems 21, 2 (2003), 164-206.

-        Paper was not covered and will not be on the final.

Incentive Mechanisms

M. Piatek, T. Isdal, T. Anderson, A. Krishnamurthy, A. Venkataramani. Do incentives build robustness in BitTorrent? Proc. 4th USENIX Symposium on Networked Systems Design & Implementation, Apr. 2007. (MK) (PowerPoint)

-        This is an important paper. Focus on the way the BitTyrant client fools other peers.

M. Sirivianos, J. Park, X. Yang, and S. Jarecki, Dandelion: cooperative content distribution with robust incentives. Proc. 2007 USENIX Annual Technical Conference, Santa Clara, California, pp. 157-170, June 2007. (VNC) (PowerPoint)

-        This is another important paper. Focus on how the server can credit an uploading peer before that peer actually starts uploading data. Understand also why Dandelion is less scalable than BitTorrent.

C. Aperjis, C. A. Freedman, and R, Johari. Peer-assisted content distribution with prices, Proc. ACM SIGCOMM Conference on emerging Networking Experiments and Technologies (CoNext 2008), Madrid, Spain, pp. 17:1-17:12, Dec. 2008 (VNC) (PowerPoint)

-        Focus on the first two sections of the paper.

C. Wang, H. Wang, Y. Lin, S.I. Chen, A lightweight currency-based P2P VoD incentive mechanism, Proc. 3rd International Joint Conference on Computational Science and Optimization (CSO 2010), Huangshan, China, vol. 1, pp.272-276, May 2010. (SG) NEW (PowerPoint)

-        Focus on the first two sections and try to understand the general philosophy of the authors’ approach. Do not worry about details.

Fault Tolerance and Security

P. Maniatis, M. Roussopoulos, T. J. Giuli, D. S. H. Rosenthal, M. Baker, Yanto Muliadi, Preserving peer replicas by rate-limited sampled voting, Proc. 19th Symposium on Operating Systems Principles (SOSP 2003), Bolton Landing, NY, Oct. 2003. (PowerPoint)

-        Focus on the problem the authors address. The PowerPoint slides are more than sufficient.

Cox, L.P. Murray, C.D. And Noble, B.D. Pastiche: Making backup cheap and easy. Proc. 5th Symposium on Operating Systems Design and Implementation (OSDI 2003), Dec. 2002. (PowerPoint) (AK)

·       Focus on the long Section 3.

Castro, M., Druschel, P., Ganesh, A., Rowstron, A. and Wallach, D.S. Security for structured peer-to-peer overlay networks, Proc. 5th Symposium on Operating Systems Design and Implementation (OSDI 2003), Dec. 2002. (DP) (PowerPoint)

-        Focus on the overall approach, without getting too much into the details.

Measurements

Saroiu, S., Gummadi, P.K., and Gribble, S.D. A measurement study of peer-to-peer file sharing systems. Proc. SPIE/ACM Conference on Multimedia Computing and Networking (MMCN 2002), Jan. 2002. (MK) (PowerPoint)

-        Focus on the conclusions of the study.

Storage Systems

J. Kubiatowicz, D. Bindel, Y. Chen, S. Czerwinski, P. Eaton, D. Geel, R. Gummadi, S. Rhea, H. Weatherspoon, W. Weimer, C.Wells, and B. Zha. OceanStore: An architecture for global-scale persistent storage, Proc. 9th International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS 2000), Nov. 2000. (AK)

-        Understand the general philosophy of the proposal, but do not spend too much time on this paper. Focus instead on the next paper.

S. Rhea, P. Eaton, D. Geels, H. Weatherspoon, B. Zhao, and J. Kubiatowicz. Pond: the OceanStore Prototype, Proc. 2nd USENIX Conference on File and Storage Technologies (FAST '03), Mar. 2003. (SK) (PowerPoint presentation in progress)

-        Expect to spend some time on the paper.

Open Source Implementations

L. Abeni, C. Kiraly, A. Russo, M. Biazzini, and R. Lo Cigno. GRAPES: a Generic Environment for P2P Streaming, Technical Report # DISI-10-038, Department of Information Engineering and Computer Science, University of Trento Italy, June 2010. (PowerPoint) (AK)

-        Understand the general philosophy of the system, but do not spend too much time on this paper.