Thursdays 1 pm - 2 pm in 3102 Siebel Center (confirmed)
This course is devoted to a critical analysis of the latest papers and hot topics in distributed systems. Conferences of interest are include (but are not limited to) SOSP, PODC, OSDI, Usenix, NSDI, Sensys, IPTPS, and prominent journals. Some course sessions will be devoted to students giving upcoming conference talks.
To take this seminar course, you should either (1) be formally or informally a part of the DPRG or (2) have permission from Indy (meet him: usually given if you are looking to work with him in the future).
Meets: Thursdays 1 pm - 2 pm in 3102 Siebel Center.
Schedule: Up soon.
please email 2 paper suggestions to Indy by Monday 1/30 with the subject line "CS 591IG Paper Suggestions".
after 1/30 and before Thursday 2/2, sign up for one paper presentation (paper choice and date) by emailing Indy with subject line "CS591IG Paper Choice".
First Meeting: Jan 26 (2nd week of classes).
Each Meeting: ONE Paper discussion + DPRG-specific stuff.
|
Date |
Presenters and Slides |
Topic |
Main Papers |
| Jan 19 | - |
- |
No Meeting. |
| Jan 26 | Indy Gupta |
Introduction Meeting. |
|
| Feb 2 |
Ramses V. Morales |
MapReduce: Simplified Data Processing on Large Clusters, Jeffrey Dean and Sanjay Ghemawat, OSDI 2004. |
|
| Feb 9 |
Ted P. (slides) |
Adaptive Routing with Stale Information, Fischer et al, PODC 2005. |
|
| Feb 16 |
Steve Ko |
Trickles: A Stateless Network Stack for |
|
| Feb 23 |
Charles Yang |
Vigilante: end-to-end containment of internet worms, Costa et al, SOSP 2005 |
|
| Mar 2 |
James Newell (slides) |
Eclipse Attacks on Overlay Networks: Threats and Defenses, Atul Singh et al. Infocomm 06 |
|
| Mar 9 |
Ercan Ucan |
Failure recovery for structured P2P networks: protocol design and performance evaluation, Simon S. Lam, Huaiyu Liu, ACM SIGMETRICS 2004. |
|
| Mar 16 |
Long Vu |
Improving Web Availability for Clients with MONET, Anderson et al, NSDI 2005. |
|
| Mar 23 | NO MEETING - Spring Vacation.
|
||
| Mar 30 |
Jay Patel |
Maintaining High Bandwidth under Dynamic Network Conditions, Kostic et al, USENIX 2005. |
|
| Apr 6 | Jay Patel |
Improving Epidemics via Social Network Algorithms |
|
| Apr 13 | Charles Yang |
Stochastic Detection of Flash Crowds |
|
| Apr 20 |
Ramses Morales |
Reactive Folklore |
|
| Apr 27 |
James Newell/Ted P. |
Masters Thesis presentations |
|
Please email your suggestions to Indy with the subject line "CS 591IG Paper Suggestions".
In addition, please use the list below (DO NOT choose papers previously presented in CS598IG or CS591SN or CS 591IG).
SOSP 2005, Vigilante: End-to-End
Containment of Internet Worms. Manuel Costa (Microsoft Research), Jon Crowcroft
(Cambridge University), Miguel Castro, Antony Rowstron, Lidong Zhou, Lintao
Zhang and Paul Barham (Microsoft Research)
http://www.cs.cornell.edu/People/egs/syslunch-fall05/vigilante.pdf
Infocomm 2006, A Comparative Study of Current DNS with DHT-Based Alternatives.
Vasileios Pappas (University of California, Los Angeles, US); Daniel Massey
(Colorado State University, US); Andreas Terzis (Johns Hopkins University, US);
Lixia Zhang (University of California at Los Angeles, US)
http://www.cs.ucla.edu/~vpappas/p/UCLA_TR050023.pdf
USENIX high bandwidth:
www.cs.duke.edu/~dkostic/publications/bullet-usenix05.pdf
NSDI Trickles:
http://www.cs.cornell.edu/People/egs/papers/trickles-nsdi05.pdf
Non-Cooperation in Competitive P2P
Networks Beverly Yang et al.
http://www-db.stanford.edu/~byang/pubs/noncoop_long.pdf
ICDCS 2005
Improving Web Availability for Clients with MONET David Anderson et al.
http://www.usenix.org.proxy2.library.uiuc.edu/events/nsdi05/tech/full_papers/andersen/andersen.pdf
NSDI 05
Simon S. Lam, Huaiyu Liu, "Failure
recovery for structured P2P
networks: protocol design and performance evaluation", ACM SIGMETRICS 2004.
http://www.cs.utexas.edu/users/lam/Vita/Cpapers/LamLiu04.pdf
Non-Cooperation in Competitive P2P Networks Beverly Yang et al.
http://www-db.stanford.edu/~byang/pubs/noncoop_long.pdf
ICDCS 2005
How to Select a Good Alternate Path in Large Peer-to-Peer Systems?http://rio.ecs.umass.edu/mnilpub/papers/infocom06.pdf
(Old) Fall 2005 Paper Suggestions (Fall 2005 CS 591IG Website)
ICDCS 2005: On Cooperative
Content Distribution and the Price of Barter.
(http://www.cs.berkeley.edu/~mukunds/pubs/cdn_icdcs05_ln.pdf)
IPTPS 2005: FeedTree: Sharing Web micronews with peer-to-peer event
notification
(http://iptps05.cs.cornell.edu/PDFs/CameraReady_221.pdf)
K.
Albrecht, R. Arnold, M. G¨ahwiler, and R.
Wattenhofer. “Aggregating Information in Peer-to-Peer Systems for
Improved Join and Leave”. In 4th IEEE Int. Conference on Peer-to-Peer
Computing (P2P), 2004.
http://www.vs.inf.ethz.ch/publ/papers/DASIS-2004.pdf
Fabian
Kuhn, Stefan Schmid, Roger Wattenhofer, "A
Self-Repairing Peer-to-Peer System Resilient to Dynamic Adversarial
Churn", IPTPS05.
http://iptps05.cs.cornell.edu/PDFs/CameraReady_186.pdf
Simon S.
Lam, Huaiyu Liu, "Failure recovery for
structured P2P networks: protocol design and performance evaluation",
ACM SIGMETRICS 2004.
http://www.cs.utexas.edu/users/lam/Vita/Cpapers/LamLiu04.pdf
Kostoulas,
Dionysios, Dimitrios Psaltoulis, Indranil
Gupta, Ken Birman, Al Demers. "Decentralized schemes for size estimation
in large and dynamic groups," Proc. IEEE Intnl.
Symp. Network Computing and Applications (NCA), Cambridge (MA), 2005.
http://www.cs.cornell.edu/projects/quicksilver/public_pdfs/kostoulas-SizeEstimation.pdf
I.
Abraham, D. Malkhi, and O. Dobzinski. “LAND:
Stretch (1+ e) Locality-Aware Networks for DHTs”. In Proc.
15th Ann. ACM-SIAM Symp. on Discrete Algorithms (SODA),2004.
http://www.cs.huji.ac.il/~ittaia/papers/LAND-SODA.pdf
Stork: Making Data Placement a First Class Citizen in the Grid (ICDCS 2004)
Link: http://www.cs.wisc.edu/condor/stork/papers/stork-icdcs2004.pdf
Profiling Grid Data Transfer Protocols and Servers
In Proceedings of 10th European Conference on Parallel Processing (Euro-Par 2004),
Link: www.cs.wisc.edu/condor/stork/ papers/profiling-europar2004.pdf
Parallax: Managing Storage for a Million
Machines. HOTOS 2005.
http://www.cl.cam.ac.uk/~akw27/papers/parallax-hotos-final.pdf
Vigilante: end-to-end containment of internet worms. SOSP 2005 http://www.cs.cornell.edu/People/egs/syslunch-fall05/vigilante.pdf
X POST: A Secure, Resilient, Cooperative
Messaging System (Mislove et al, HotOS '03) http://www.usenix.org/events/hotos03/tech/full_papers/mislove
/mislove.pdf
Automatic Discovery of Mutual Exclusion Algorithms http://www.faculty.idc.ac.il/gadi/
Cluster Computing on the Fly: P2P
Scheduling of Idle Cycles in the Internet Virginia Lo, Daniel Zappala,
Dayi Zhou, Yuhong Liu, Shanyu Zhao (University of Oregon).
http://iptps04.cs.ucsd.edu/papers/lo-ccof.pdf
Efficient Lookup on Unstructured Topologies Ruggero Morselli, Bobby Bhattacharjee, Michael A. Marsh and Aravind Srinivasan PODC 2005
On the Establishment of Distinct Identities in Overlay Networks Rida Bazzi and Goran Konjevod PODC 2005
Brand Dusthimer, SharedFS
Jay Patel and Charles Yang, Turning Flash Crowds into Smart Mobs
MapReduce: Simplified Data Processing on
Large Clusters Jeffrey Dean and Sanjay Ghemawat http://www.usenix.org/events/osdi04/tech/dean.html
http://labs.google.com/papers/mapreduce-osdi04.pdf
Surviving Internet Catastrophes
Flavio Junqueira, Ranjita Bhagwan, Alejandro Hevia, Keith Marzullo, and
Geoffrey M. Voelker, University of California, San Diego http://www.usenix.org/events/usenix05/tech/general/junqueira.html
http://www.cs.ucsd.edu/~voelker/pubs/phoenix-usenix05.pdf1)
Path-Based Failure and Evolution Management
Mike Y. Chen, University of California, Berkeley; Anthony Accardi,
Tellme; Emre Kiciman, Stanford University; Dave Patterson, University of
California, Berkeley; Armando Fox, Stanford University; Eric Brewer,
University of California, Berkeley NSDI 2004
www.stanford.edu/~emrek/pubs/paths-nsdi.pdf
Causeway: Operating System Support for
Controlling and Analyzing the Execution of Distributed Programs Anupam
Chanda, Khaled Elmeleegy, and Alan L. Cox, Rice University; Willy
Zwaenepoel, EPFL, Lausanne HotOS 2005 www.cs.rice.edu/~kdiaa/papers/hotos05.pdf
Efficient Lookup on Unstructured Topologies http://www.cs.umd.edu/~ruggero/papers/podc05.pdf
On the Establishment of Distinct Identities in Overlay Networks
http://portal.acm.org/citation.cfm?id=1073814.1073873
Aggregating Information in Peer-to-Peer Systems for
Improved Join and
Leave
A Self-Repairing Peer-to-Peer System Resilient to
Dynamic Adversarial Churn 3. Failure recovery for structured P2P
networks: protocol design and
performance evaluation
Report broken links to indy at cs dawt uiuc dawt edu
©ig