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

Aus VoWi
Zur Navigation springen Zur Suche springen

1. Explain consistent hashing. What problem did it solve and why is Chord based on consistent hashing?

2. Explain how a new node joins in Chord.

3. Kademlia network given: explain how buckets are built and what are the buckets for each node.

4. Explain scale-free distribution formula. What other properties does Gnutella have?

5. Explain phases of BitTorrent.

6. Explain routing in Tapestry.

7. How are the links built in Koorde? How do virtual nodes help?

8. What is the maximum number of steps needed in routing in DH, what's the average path length?

Abgerufen von „https://vowi.fsinf.at/index.php?title=TU_Wien:Peer-to-peer_Systems_VU_(Bessler)/Prüfung_2019-02-01&oldid=109326“