March 17th question


The following network represents the way the computers in a distributed system are connected to each other. The communication between computers flows through the links in any direction.

The system started presenting performance issues, after some investigation, the cause was determined to be due to nodes communication bottleneck. By looking at the network, which one of the options presents both a proper hypothesis for this bottleneck cause and a reasonable solution for this?

  1. Node 6 has a high clustering coefficient, which indicates a network vulnerability for failures. By removing node 6, the system communication should improve.
  2. Node 4 may be overloaded since many nodes depends on it to communicate with each other. By adding a link (3,4), performance should improve.
  3. Link (3,5) may be overloaded, since it is a bridge and if removed, two large connected components is created. By adding a link (2,6), performance should improve.
  4. The network diameter is 5 composed by the links {(2,1), (1,3), (4,5), (5,7), (7,8)}, which is too high. By adding a link (2,8) performance should improve.
  5. None of the above

Original idea by: Christian Konishi

Comentários

  1. Anônimo18 de março de 2023 às 03:22

    Great question! I took it. Had to fix English prose somewhat.

    ResponderExcluir
  2. Joao Meidanis18 de março de 2023 às 03:23

    Sorry for posting as anonymous, It's me, Joao. Last comment too.

    ResponderExcluir

Postar um comentário

Postagens mais visitadas deste blog

March 31th question

Suppose that we are trying to project a distributed system with random architecture. Every time a new computer \( i \) tries to ingress, for each existing machine \( j \) in the network, a connection \( \left( i, j \right) \) may be created with a probability of \( p \). For this architecture, it is desired that any computer must be reachable from any node, however a few exceptions are tolerable. Also, \( p \) cannot be too big, because of cost reasons. Which one of these options presents a reasonable choice for the value of \( p \)? Assume that \( N \) is the number of expected computers in the network, and it is large enough to apply the law of large numbers. \( p = \frac{1}{N} \), because it is the critical point. \( p = \frac{ln\ N}{N} \), because it is the boundary between the supercritical and the connected regime. \( p = \frac{ln\ N}{ln\ \langle k \rangle} \), because it is the boundary between the supercritical and the connected regime. \( p
Leia mais

April 21st question

Assume that a certain network can be approximated by a particular continuous model, and its number of nodes increases at a rate given by the function \( f(t) = e^{\frac{-t}{1000}+10} \). Given that at \( t=0 \), the number of nodes is 0, what is the approximate maximum number of nodes that this network can have? Tip: get an expression for the number of nodes \( N(t) \) and its limit when \( t \rightarrow \infty \). \( e^{\frac{-1}{3}+10} \). \( 1000\ e^{\frac{-1}{3}+10} \). \( 1000\ e^{10} \). \( e^{10} \). None of the above Original idea by: Christian Konishi
Leia mais

June 2nd question

Imagem
Consider the following network. The fuchsia nodes are all part of a weak community. Which option presents a modification that makes this community a strong one? Remove node 8 from the community. Add node 5 to the community. Add node 9 to the community. Remove node 6 from the community. None of the above Original idea by: Christian Konishi
Leia mais