• Home
  • Textbooks
  • Introduction to Distributed Algorithms
  • Deadlock-free Packet Switching

Introduction to Distributed Algorithms

Gerard Tel

Chapter 5

Deadlock-free Packet Switching - all with Video Answers

Educators


Chapter Questions

Problem 1

Show that there exists no deadlock-free controller that uses only one buffer per node and allows each node to send packets to at least one other node.

Check back soon!

Problem 2

Show that dest is not deadlock-free of packet routing is as in Figure 5.2.

Check back soon!

Problem 3

(The hops-to-go scheme) Give the buffer graph and the fb and $n b$ functions for a controller that uses buffer $b_{\mathrm{u}}[i]$ to store packets that have $i$ more hojs to travel towards their destination.
What is the butier class of $b_u[i]$ ? Is it necessary to maintain a hop count in each packet?

Check back soon!

Problem 4

Complete the proof that the yraph $B G_{\mathrm{a}}$ /defined in the proof of Theorem 5.13; is indeed a buffer graph, i.e., for eacil path $P \in \mathcal{P}$ there exists a guaranteed path with image $P$ Show that, as claimed, $f b$ and $n b$ do undeed describe a path in $B G_{\mathrm{a}}$.

Check back soon!

Problem 5

Prove that there exists a deadlock-free controller, for packet switching on a hypercube, which uses only two buffers in each node and allows packets to he routed usa minimum-hop paths.
Is it possible to obtain the collection of used paths by means of the interval routing algorithm (Subsection 4.4.2)? Is it possible to use a linear interval labelung scheme?

Check back soon!
02:50

Problem 6

Prove that $\mathrm{BC}$ and $\mathrm{BS}$ are deadlock-free controllers.

Nick Johnson
Nick Johnson
Numerade Educator
02:33

Problem 7

Prove that each move allowed by $\mathbf{B C}$ is also allowed by FC.

Mohamed Mohamed
Mohamed Mohamed
Numerade Educator