Application Layer Protocol Flashcards

1
Q

How does peer-to-peer architecture work?

A

No always on server

Peers intermittently connected

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

Why do we use hash tables?

A

Convenient to store and search

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

How do we get a hashed key?

A

Hash(original key)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

How does a distributed hash table work?

A

Assign each peer identifier
Any number stored in n bits
Define hash function
Make hash available to every peer

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

What is a circular hash?

A

Each peer only aware of immediate successor/predecessor

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

What is peer churn?

A

Peers may come and go

Each peer periodically pings successors

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

What is a torrent file?

A

Calculates hash code

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

What is a magnet link?

A

Use distributed hash table

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

What is a tracker in a BitTorrent?

A

Tracks peers participating in torrent

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

What is a torrent in a BitTorrent?

A

Group of peers exchanging chunks of file

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

How does the tit-for-tat approach for a BitTorrent work?

A

Peers join network and register with tracker
Tracker sends list of IPs of S out of N peers
Peer establishes concurrent TCP connections with each node in S
Peer periodically requests neighbours send chunk lists
Rarest chunk is 1st
Peers track neighbourhood that transmit fastest (unchoked = send 1st)
Neighbours are choked
Once peer has file, selfish leave or altruistically remain

How well did you know this?
1
Not at all
2
3
4
5
Perfectly