KTH IMIT/KTH
2G1126: Distributed Computer Systems, 2002/2003
 
 

Paper presentations


Apart from the lectures on distributed algortihms each student is required to read about distributed algorithms and present for the class.
The work will be done in groups of two. Each group should select a paper from the list below which they will write a report on and present for the rest of the class.
Each report will be published on this webpage, after submission and reviewed by the course assistants.

On the 20th of March all groups must have been formed. In class (20/3) the groups should choose the paper they want to read. Remember that a paper might only be choosen by at most one group, possible clashes will be resolved in class.

Important dates

  • 20/3. Groups must have been formed
  • 9/5. Prelimiary reports should be submitted
  • 15/5. Reports reviewed by course assistant and returned for correction
  • 20/5. First part of presentations (primarily for those groups who passed without, or with minor, complaints).
  • 22/5. Second part of presentations.

    Report outline

    The report, not more than 6 pages, must at least consist of the following:

  • Problem description and motivation for the paper. What problem did the author address with the paper.
  • A description of the papers contribution.
  • Strength. What is the strength of the paper's solution.
  • Weaknesses. What are the weaknesses (is it too narrow/not applicable to similar issues etc).
  • The students/groups suggestion on improvement or enhancements.

    • The report should be saved as a PDF file and mailed to one of the course assistants.
    The presentation should at least contain the same items.

    Group members

    Group number Names Report
    1
     
         		 Björn Lundberg
    Johan Eklund
    Kristian Kiamos
    		 group1
    2
         		 Olof Paulsen
    Christoffer Cederwall
    		 group2
    3
         		 Peter Stolt
    Andreas Öhrvall
    		 group3
    4
         		 Denis Gacic
    Vladimir Marinkovic
    		 group4
    5 Per-Arne Löfstrand
    6 Walli Dietric
    7
         		 Måns Rullgård
    Michael Ahlberg
    		 group7
    8
         		 Johan Husman
    Gilbert Netzer
    		 group8
    9
         		 Johanna Svenningsson
    		 group9
    10
         		 Henrik Åhlander
    		 group10

    Report presentations schedule

    The duration of all presentations should be around 30 minutes with a 5 minutes preparation slot between two presentations.
    Time Group
          Tuesday 20
    10.15 - 10.45 1
    10.50 - 11.20 3
    11.25 - 11.55 7
    13.15 - 13.45 2
    13.50 - 14.20 10
          Thursday 22
    10.15 - 10.45 4
    10.50 - 11.20 8
    11.25 - 11.55 9


    List of papers

    Name Link Group
    Self-Stabilization with Global Rooted Synchronizers alima98self 1
    The {Totem} Single-Ring Ordering and Membership Protocol amir95totem 8
    Anthill : A Framework for the Development of Agent-Based Peer-to-Peer Systems babaoglu02anthill 2
    Reliable communication in the presence of failures birman87reliable 5
    SCRIBE: A large-scale and decentralized application-level multicast infrastructure castro02scribe 7
    Practical Byzantine Fault Tolerance castro99practical 4
    Understanding fault-tolerant distributed systems cristian93understand 9
    Automatic service availability management in asynchronous distributed systems cristian94automatic -
    Self-Stabilizing Depth-first token circulation on Networks datta98selfstabilizing 1
    Self-stabilizing systems in spite of distributed control dijkstra74self 1
    The timed asynchronous system model cristian97timed -
    Bubbles: adaptive routing scheme for high-speed dynamic networks dolev95bubbles -
    Specifying and using a partitionable group communication service fekete00specifying -
    Lightweight Fault Tolerance in CORBA felber01lightweight 10
    Highly Available Cluster: A Case Study ftcs-24 -
    Locating Nearby Copies of Replicated Internet Servers guyton95locating -
    On Fully Decentralized Resource Discovery in Grid Environments iamnitchi01fully -
    Using Group Communication to Implement a Fault-Tolerant Directory Service kaashoek93using -
    Consistent Hashing and Random Trees: Distributed Caching Protocols for Relieving Hot Spots on the World Wide Web karger97consistent 6
    The SecureRing Protocols for Securing Group Communication kihlstrom98securering 8
    Optimistic Asynchronous Atomic Broadcast kursawe01optimistic -
    Using Time Instead of Timeout for Fault-Tolerant Distributed Systems. lamport84time -
    the Composition of Authenticated Byzantine Agreement lindell02composition 4
    Kademlia: A peer-to-peer information system based on the XOR metric maymounkov02kademlia -
    A scalable content-addressable network ratnasamy01scalable -
    Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems rowstron01pastry 7
    Engineering an Agent-Based Peer-To-Peer Resource Discovery System smithson02engineering 2
    A Simple and Fast Distributed Algorithm to Compute a Minimum Spanning Tree in the Internet stoica-simple 3