Network Topologies & Characteristics

Choose a study mode

Play Quiz
Study Flashcards
Spaced Repetition
Chat to Lesson

Podcast

Play an AI-generated podcast conversation about this lesson
Download our mobile app to listen on the go
Get App

Questions and Answers

Which network topology has a diameter of 2?

  • Linear array
  • Hypercube
  • Completely-connected
  • Star (correct)

Which of the following network topologies has a bisection width of $p^2/4$?

  • Star
  • Completely-connected (correct)
  • Linear array
  • Hypercube

What is the arc connectivity of a 2-D mesh network with no wraparound?

  • 4
  • 1
  • 2 (correct)
  • $p-1$

Which network topology has a cost (number of links) of $p-1$?

<p>Complete binary tree (C)</p> Signup and view all the answers

A network has an arc connectivity of $2d$. Which topology does it likely represent?

<p>Wraparound k-ary d-cube (C)</p> Signup and view all the answers

What is the bisection width of a linear array?

<p>1 (A)</p> Signup and view all the answers

Which network topology has a cost (number of links) proportional to $p \log p / 2$?

<p>Hypercube (B)</p> Signup and view all the answers

What is the diameter of a completely-connected network?

<p>1 (D)</p> Signup and view all the answers

Which of the following is the bisection width for a Hypercube network?

<p>$p/2$ (A)</p> Signup and view all the answers

Given $p$ nodes, what is the cost (number of links) for a 2-D wraparound mesh network?

<p>$2p$ (D)</p> Signup and view all the answers

What is the diameter of a linear array network with $p$ nodes?

<p>$p - 1$ (D)</p> Signup and view all the answers

What is the arc connectivity of a star network?

<p>1 (A)</p> Signup and view all the answers

What is the cost (number of links) associated with setting up a star network?

<p>$p-1$ (D)</p> Signup and view all the answers

What characterizes the cost (number of links) of a wraparound k-ary d-cube?

<p>Directly proportional to $dp$ (A)</p> Signup and view all the answers

For a 2-D mesh network without wraparound, how does the bisection width scale with the number of nodes, $p$?

<p>It scales with the square root of $p$, $\sqrt{p}$ (D)</p> Signup and view all the answers

If a network has a limited budget for links and needs high connectivity, which of these topologies would be the LEAST suitable choice?

<p>Completely-connected (A)</p> Signup and view all the answers

Considering cost and diameter, which network provides the most efficient communication between nodes for a small number of nodes?

<p>Completely-connected (C)</p> Signup and view all the answers

How does the diameter of a complete binary tree scale as the number of nodes ($p$) increases?

<p>Logarithmically with $p$ (B)</p> Signup and view all the answers

Given a fixed number of nodes ($p$), which network topology would generally have the highest bisection width?

<p>Completely-connected (C)</p> Signup and view all the answers

Suppose you need a network where the cost scales linearly with p. Which options are viable?

<p>Star (B)</p> Signup and view all the answers

Signup and view all the answers

Signup and view all the answers

Flashcards

Completely-connected network

In a completely-connected network, every node is directly connected to every other node.

Star network

A network topology where all nodes connect to a single central node.

Complete binary tree network

A tree structure where each node has at most two children.

Linear array network

Arranges nodes in a single line, connected to their immediate neighbors.

Signup and view all the flashcards

2-D mesh network (no wraparound)

Nodes arranged in a grid, connected to their horizontal and vertical neighbors; no wrap-around connections.

Signup and view all the flashcards

2-D wraparound mesh network

Similar to a 2-D mesh, but the edges wrap around to connect to the opposite side.

Signup and view all the flashcards

Hypercube network

A network topology where each node is connected to 'd' neighbors in a d-dimensional space.

Signup and view all the flashcards

Wraparound k-ary d-cube network

A generalization of the hypercube, where each dimension has 'k' nodes.

Signup and view all the flashcards

Network diameter

Maximum distance between any two nodes in the network.

Signup and view all the flashcards

Bisection width

Minimum number of wires that must be cut to divide network into two equal halves.

Signup and view all the flashcards

Arc connectivity

Minimum number of arcs that must be removed to disconnect the graph.

Signup and view all the flashcards

Study Notes

  • Static network topologies connect p nodes and have different characteristics.

Network Topologies and Characteristics.

  • Completely-connected: Diameter of 1, bisection width of p²/4, arc connectivity of p-1, and cost of p(p-1)/2.
  • Star: Diameter of 2, bisection width of 1, arc connectivity of 1, and cost of p-1.
  • Complete binary tree: Diameter of 2 log((p+1)/2), bisection width of 1, arc connectivity of 1, and cost of p-1.
  • Linear array: Diameter of p-1, bisection width of 1, arc connectivity of 1, and cost of p-1.
  • 2-D mesh, no wraparound: Diameter of 2(√p - 1), bisection width of √p, arc connectivity of 2, and cost of 2(p - √p).
  • 2-D wraparound mesh: Diameter of 2⌊√p/2⌋, bisection width of 2√p, arc connectivity of 4, and cost of 2p.
  • Hypercube: Diameter of log p, bisection width of p/2, arc connectivity of log p, and cost of (p log p)/2.
  • Wraparound k-ary d-cube: Diameter of d⌊k/2⌋, bisection width of 2k^(d-1), arc connectivity of 2d, and cost of dp.

Studying That Suits You

Use AI to generate personalized quizzes and flashcards to suit your learning preferences.

Quiz Team

More Like This

Use Quizgecko on...
Browser
Browser