Logo Universität Erlangen-Nürnberg
Universität Erlangen-Nürnberg
Logo TU München
Technische Universität München
Logo Universität Stuttgart
Universität Stuttgart
Ferien-Akademie

Ferienakademie 2008, Course 1
Algorithms for Modern Communication Networks

Professors

Assistant:


In the topic list,
  • "M/S: Peer-to-Peer-Netzwerke" denotes the textbook:
    Peter Mahlmann and Christian Schindelhauer. Peer-to-Peer-Netzwerke. Springer, 2007.
and
  • "KPR" denotes the lecture notes:
    Friedhelm Meyer auf der Heide. Kommunikation in Parallelen Rechenmodellen.

Topics

Please download the password protected pdf-files (denoted by ) to your system (right mouse click and "Save target as ...")
  1. Parallel Computing Networks
    1. Online Routing on the Mesh and Offline Routing on the Benes Network [Protsenko,M.]
    2. Online Routing on the Butterfly-Netzwerk: Probabilistic Analysis [Gubichev, A.]
      • For your talk just use the sections beginning with 6.2 from Oblivious Routing from KPR
      • Section 3.4.4 "The Average-Case Behavior of the Greedy Algorithm" (and Sec. 3.4.5) from "F. T. Leighton: Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes".
    3. Deterministic Routing on the Multibutterfly Network [Diebold, F.]
  2. Internet Algorithms
    1. Routing und Packet Forwarding: Shortest Paths and Autonomic Systems [Schmidt, T.]
    2. Establishing the Connection and Avoiding of Congestion [Koopmann, G. B.]
  3. Peer-to-Peer Networks
    1. Peer-to-Peer Networks: Early Networks, Self-Organization, the Small-World Phenomenon [Baier, P.]
    2. Distributed Hash-Tables and CAN [Abdelghani, I.]
    3. Chord: Taking Locality into Account [Rasoulian, A.]
    4. Plaxton's Routing Method [Wederhake, L.]
    5. Pastry: Taking the Neighborhood into Account [Himmelmann, R.]
    6. Viceroy: Minimizing the Node Degree [Barthels, A. M.]
    7. Distance Halving: The Continuous-discrete Approach [Ohst, M.]
    8. Ordered Indexing: Skip-Net [Xue, L.]
    9. A Censorship Resistant Peer-to-Peer Network [Minnerup, P.]

Navigation in the textbook "Peer-to-Peer-Netzwerke"

References for all

All participants should consult the complete textbook Peer-to-Peer-Netzwerke if there are questions. A very good source for Probability Theory (in German) is the 2nd volume of Diskrete Strukturen by Schickinger/Steger.
  • Peter Mahlmann and Christian Schindelhauer. Peer-to-Peer-Netzwerke. Springer, 2007.
  • Friedhelm Meyer auf der Heide. Kommunikation in Parallelen Rechenmodellen. Vorlesungsskript
  • Th. H. Cormen, Ch. E. Leiserson, R. L. Rivest, C. Stein.
    • Introduction to Algorithms. The MIT Press (2nd ed.) September 2001.
    • Algorithmen - Eine Einführung. Oldenbourg, (2.Aufl.) März 2007.
  • Th. Schickinger, A. Steger. Diskrete Strukturen 2: Wahrscheinlichkeitstheorie und Statistik. Springer, 2002.
  • S. Androutsellis-Theotokis, D. Spinellis. A Survey of Peer-to-Peer Content Distribution Technologies . ACM Computing Surveys, Vol. 36, No. 4, Dec. 2004, pp. 335-371. (a survey paper)

Rolf Wanka, 29. Juli 2008. - Impressum