Lecture 9 - Communication III and Lecture 10 - Naming I Flashcards

1
Q

In epidemic (Gossip-based) protocol:

a) Node forwards message to a randomly chosen neighbor
b) Node forwards message to all their neightbors

A

a) Node forwards message to a randomly chosen neighbor

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

Overlay network is formed by:

a) Network routers
b) Application layer processes

A

b) Application layer processes

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

When using flooding multicasting model:

a) Node forwards message to a randomly chosen neighbor
b) Nodes forwards message to all their neighbors

A

b) Nodes forwards message to all their neighbors

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

How many messages can be sent in an ALM of N processes with a mesh topology?

a) N-1
b) 1/2 * N * N-1

A

b) 1/2 * N * N-1

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

What is the major challenge in flooding-based multicasting?

a) Redundant and excessive messages in the network
b) Network outages
c) Not fault tolerant

A

a) Redundant and excessive messages in the network

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

Which overlay network topology is more efficient in the number of messages sent in the network?

a) Tree topology
b) Mesh toplogy

A

a) Tree topology

If G is a tree, we’ll send M = N-1 messages (Optimal situation)

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

Which overlay network is more robust and fault-tolerant for routing messages?

a) Tree topology
b) Mesh topology

A

b) Mesh topology

If G is fully connected (mesh), we’ll send M = ½ . N . (N-1)
messages (worst-case)

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

In gossip-based protocols, which of the nodes initiates a pull update?

a) Infectious node
b) Susceptible node
c) Removed node

A

b) Susceptible node

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

Un gossip-based protocols, which of the nodes initiates a push update?

a) Susceptible node
b) Infectious node
c) Removed node

A

b) Infectious node

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

What are some characteristics of FLAT NAMING?

A
  • Entities are refered to by an ifentifier/name with no meaning
  • It bears no structure
    *e.g. MAC or memory adresses
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

What is the core issue of FLAT NAMING?

A

Needs special mechanisms to trace the location of refered entities

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

What are some approaches for searching/resolving a name/identifier of an entity to its adress in regards to FLAT NAMING?

A
  • Broadcasting
  • Chains of forwarding links
  • Home-based approach
  • Distributed Hash Tables
  • Hierachical Location services
How well did you know this?
1
Not at all
2
3
4
5
Perfectly