Lecture 9 - Communication III and Lecture 10 - Naming I Flashcards
In epidemic (Gossip-based) protocol:
a) Node forwards message to a randomly chosen neighbor
b) Node forwards message to all their neightbors
a) Node forwards message to a randomly chosen neighbor
Overlay network is formed by:
a) Network routers
b) Application layer processes
b) Application layer processes
When using flooding multicasting model:
a) Node forwards message to a randomly chosen neighbor
b) Nodes forwards message to all their neighbors
b) Nodes forwards message to all their neighbors
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
b) 1/2 * N * N-1
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) Redundant and excessive messages in the network
Which overlay network topology is more efficient in the number of messages sent in the network?
a) Tree topology
b) Mesh toplogy
a) Tree topology
If G is a tree, we’ll send M = N-1 messages (Optimal situation)
Which overlay network is more robust and fault-tolerant for routing messages?
a) Tree topology
b) Mesh topology
b) Mesh topology
If G is fully connected (mesh), we’ll send M = ½ . N . (N-1)
messages (worst-case)
In gossip-based protocols, which of the nodes initiates a pull update?
a) Infectious node
b) Susceptible node
c) Removed node
b) Susceptible node
Un gossip-based protocols, which of the nodes initiates a push update?
a) Susceptible node
b) Infectious node
c) Removed node
b) Infectious node
What are some characteristics of FLAT NAMING?
- Entities are refered to by an ifentifier/name with no meaning
- It bears no structure
*e.g. MAC or memory adresses
What is the core issue of FLAT NAMING?
Needs special mechanisms to trace the location of refered entities
What are some approaches for searching/resolving a name/identifier of an entity to its adress in regards to FLAT NAMING?
- Broadcasting
- Chains of forwarding links
- Home-based approach
- Distributed Hash Tables
- Hierachical Location services