TU Wien:Peer-to-peer Systems VU (Bessler)/Prüfung 2011-01-26

Aus VoWi
Zur Navigation springen Zur Suche springen


  1. Why is it desireable to have small diameter, small degree P2P networks?
  2. Explain the join process of SCRIBE.
  3. Why is locality in P2P networks important? How does Pastry deal with locality?
  4. Explain constant hashing. Which P2P technologies from the lecture use it?
  5. Explain the self-organization aspects of Chord.
  6. Explain surrogate routing.
  7. Binary representations of 8 data objects were given; the task was to the corresponding load-balanced P-Grid tree with 4 peers.
  8. Why is the node degree constant when using distance halving?
Abgerufen von „https://vowi.fsinf.at/index.php?title=TU_Wien:Peer-to-peer_Systems_VU_(Bessler)/Prüfung_2011-01-26&oldid=97220“