466 views
1 votes
1 votes
In order to control traffic, a network router, $A$ periodically sends a message to its neighbor, $B,$ telling it to increase or decrease the number of packets that it can handle. At some point in time, Router $A$ is flooded with traffic and sends $B$ a message telling it to cease sending traffic. It does this by specifying that the number of bytes $B$ may send ($A’s$ window size) is $0.$ As traffic surges decrease, A sends a new message, telling $B$ to restart transmission. It does this by increasing the window size from $0$ to a positive number. That message is lost. As described, neither side will ever transmit. What type of deadlock is this?

1 Answer

1 votes
1 votes
It is communication deadlock. It is similar to problem we face in TCP Congestion control which is solved using persistent timer.

Related questions

0 votes
0 votes
0 answers
2
1 votes
1 votes
1 answer
3
0 votes
0 votes
0 answers
4
admin asked Oct 30, 2019
309 views
Consider Fig. 6-4. Suppose that in step $(o)\: C$ requested $S$ instead of requesting $R.$ Would this lead to deadlock? Suppose that it requested both $S$ and $R.$