Recent questions tagged peterson-davie / GATE Overflow for GATE CSE

0 votes

0 answers

31

Peterson Davie 2.42a
Suppose the round-trip propagation delay for Ethernet is $46.4 \mu s$. This yields a minimum packet size of $512$ bits ($464$ bits corresponding to propagation delay $+\;48$ bits of jam signal). (a) What happens to the minimum packet size if the delay time is held constant, and the signalling rate rises to $100$ Mbps?

Suppose the round-trip propagation delay for Ethernet is $46.4 \mu s$. This yields a minimum packet size of $512$ bits ($464$ bits corresponding to propagation delay $+\;...

makhdoom ghaya

269 views

makhdoom ghaya asked Apr 23, 2016

0 votes

0 answers

32

Peterson Davie 2.41
Coaxial cable Ethernet was limited to a maximum of $500$m between repeaters, which regenerate the signal to $100$% of its original amplitude. Along one $500$-m segment, the signal could decay to no less than $14$% of its original value $(8.5 dB)$ ... %. Such a signal, even along $2500$ m, is still strong enough to be read; why then are repeaters required every $500$ m?

Coaxial cable Ethernet was limited to a maximum of $500$m between repeaters, which regenerate the signal to $100$% of its original amplitude. Along one $500$-m segment, t...

makhdoom ghaya

379 views

makhdoom ghaya asked Apr 23, 2016

0 votes

0 answers

33

Peterson Davie 2.40
The $1982$ Ethernet specification allowed between any two stations up to $1500$mof coaxial cable, $1000$mof other point-to-point link cable, and two repeaters. Each station or repeater connects to the coaxial cable via up to $50$mof “drop cable. ... , due to the sources listed? (This list is not complete; other sources of delay include sense time and signal rise time.)

The $1982$ Ethernet specification allowed between any two stations up to $1500$mof coaxial cable, $1000$mof other point-to-point link cable, and two repeaters. Each stati...

makhdoom ghaya

630 views

makhdoom ghaya asked Apr 23, 2016

0 votes

1 answer

34

Peterson Davie 2.39
What kind of problems can arise when two hosts on the same Ethernet share the same hardware address? Describe what happens and why that behavior is a problem.

What kind of problems can arise when two hosts on the same Ethernet share the same hardware address? Describe what happens and why that behavior is a problem.

makhdoom ghaya

2.6k views

makhdoom ghaya asked Apr 23, 2016

1 votes

0 answers

35

Peterson Davie 2.38
Consider the situation in the previous exercise, except this time assume that the router has a queue size of $1$; that is, it can hold one packet in addition to the one it is sending (in each direction). Let $A's$ timeout be $5$ seconds, ... $4$. Show what happens at each second from Time = $0$ until all four packets from the first window-full are successfully delivered.

Consider the situation in the previous exercise, except this time assume that the router has a queue size of $1$; that is, it can hold one packet in addition to the one i...

makhdoom ghaya

275 views

makhdoom ghaya asked Apr 23, 2016

1 votes

1 answer

36

Peterson Davie 2.37
Suppose $A$ is connected to $B$ via an intermediate router $R$, as in the previous problem. The $A - R$ link is instantaneous, but the $R - B$ link transmits only one packet each second, one at a time (so two packets take $2$ seconds). Assume $A$ sends to $B$ ... Time = $0,1,2,3,4$, state what packets arrive at and are sent from A and B. How large does the queue at $R$ grow?

Suppose $A$ is connected to $B$ via an intermediate router $R$, as in the previous problem. The $A - R$ link is instantaneous, but the $R - B$ link transmits only one pac...

makhdoom ghaya

559 views

makhdoom ghaya asked Apr 23, 2016

0 votes

0 answers

37

Peterson Davie 2.36b
Suppose $A$ is connected to $B$ via an intermediate router $R$, as shown in Figure 2.37. The $A - R$ and $R - B$ links each accept and transmit only one packet per second in each direction (so two packets take $2$ seconds), and the two directions ... of $1.0$ second, but accept immediately as many packets as are offered (i.e., latency = $1$ second but bandwidth is infinite)?

Suppose $A$ is connected to $B$ via an intermediate router $R$, as shown in Figure 2.37. The $A - R$ and $R - B$ links each accept and transmit only one packet per second...

makhdoom ghaya

266 views

makhdoom ghaya asked Apr 23, 2016

0 votes

1 answer

38

Peterson Davie 2.36a
(Figure 2.37) Suppose $A$ is connected to $B$ via an intermediate router $R$, as shown in Figure 2.37. The $A - R$ and $R - B$ links each accept and transmit only one packet per second in each direction (so two packets take $2$ seconds), and the two directions ... $0,1,2,3,4,5$, state what packets arrive at and leave each node, or label them on a timeline.

(Figure 2.37)Suppose $A$ is connected to $B$ via an intermediate router $R$, as shown in Figure 2.37. The $A - R$ and $R - B$ links each accept and transmit only one pack...

makhdoom ghaya

580 views

makhdoom ghaya asked Apr 23, 2016

0 votes

1 answer

39

Peterson Davie 2.35c
Suppose that we run the sliding window algorithm with $SWS = 5$ and $RWS = 3$, and no out-of-order arrivals. (c) State a general rule for the minimum MaxSeqNum in terms of $SWS$ and $RWS$.

Suppose that we run the sliding window algorithm with $SWS = 5$ and $RWS = 3$, and no out-of-order arrivals.(c) State a general rule for the minimum MaxSeqNum in terms of...

makhdoom ghaya

320 views

makhdoom ghaya asked Apr 22, 2016

0 votes

1 answer

40

Peterson Davie 2.35b
Suppose that we run the sliding window algorithm with $SWS = 5$ and $RWS = 3$, and no out-of-order arrivals. (b) Give an example showing that MaxSeqNum -$1$ is not sufficient.

Suppose that we run the sliding window algorithm with $SWS = 5$ and $RWS = 3$, and no out-of-order arrivals.(b) Give an example showing that MaxSeqNum -$1$ is not suffici...

makhdoom ghaya

366 views

makhdoom ghaya asked Apr 22, 2016

0 votes

1 answer

41

Peterson Davie 2.35a
Suppose that we run the sliding window algorithm with $SWS = 5$ and $RWS = 3$, and no out-of-order arrivals. (a) Find the smallest value for MaxSeqNum. You may assume that it suffices to find the smallest MaxSeqNum such that if DATA[MaxSeqNum] is in the receive window, then $DATA[0]$ can no longer arrive.

Suppose that we run the sliding window algorithm with $SWS = 5$ and $RWS = 3$, and no out-of-order arrivals.(a) Find the smallest value for MaxSeqNum. You may assume that...

makhdoom ghaya

798 views

makhdoom ghaya asked Apr 22, 2016

0 votes

0 answers

42

Peterson Davie 2.34b
Consider the sliding window algorithm with $SWS = RWS = 3$, with no out-of-order arrivals and with infinite-precision sequence numbers. (b) Show that if $ACK[6]$ may be sent (or, more literally, that $DATA[5]$ ... $ACK[0]$ and $ACK[5]$.

Consider the sliding window algorithm with $SWS = RWS = 3$, with no out-of-order arrivals and with infinite-precision sequence numbers.(b) Show that if $ACK[6]$ may be se...

makhdoom ghaya

181 views

makhdoom ghaya asked Apr 22, 2016

0 votes

0 answers

43

Peterson Davie 2.34
Consider the sliding window algorithm with $SWS = RWS = 3$, with no out-of-order arrivals and with infinite-precision sequence numbers (a) Show that if $DATA[6]$ is in the receive window, then $DATA[0]$ (or in general any older data) cannot arrive ... $ACK[0]$ and $ACK[5]$.

Consider the sliding window algorithm with $SWS = RWS = 3$, with no out-of-order arrivals and with infinite-precision sequence numbers(a) Show that if $DATA[6]$ is in the...

makhdoom ghaya

204 views

makhdoom ghaya asked Apr 22, 2016

1 votes

0 answers

44

Peterson Davie 2.33
Suppose that we attempt to run the sliding window algorithm with $SWS = RWS = 3$ and with MaxSeqNum = $5$. The $N$th packet $DATA[N]$ thus actually contains $N$ $\mod 5$ in its sequence number field. Give an example in which the algorithm becomes ... - in its stead. No packets may arrive out of order. Note that this implies MaxSeqNum $\geq 6$ is necessary as well as sufficient.

Suppose that we attempt to run the sliding window algorithm with $SWS = RWS = 3$ and with MaxSeqNum = $5$. The $N$th packet $DATA[N]$ thus actually contains $N$ $\mod 5$ ...

makhdoom ghaya

214 views

makhdoom ghaya asked Apr 22, 2016

1 votes

0 answers

45

Peterson Davie 2.32b
Draw a timeline diagram for the sliding window algorithm with $SWS = RWS = 4$ frames in the following two situations. Assume the receiver sends a duplicate acknowledgment if it does not receive the expected frame. For example, it sends DUPACK[2] ... transaction time? (Note that some end-to-end protocols, such as variants of TCP, use similar schemes for fast retransmission.)

Draw a timeline diagram for the sliding window algorithm with $SWS = RWS = 4$ frames in the following two situations. Assume the receiver sends a duplicate acknowledgment...

makhdoom ghaya

242 views

makhdoom ghaya asked Apr 22, 2016

0 votes

0 answers

46

Peterson Davie 2.32a
Draw a timeline diagram for the sliding window algorithm with $SWS = RWS = 4$ frames in the following two situations. Assume the receiver sends a duplicate acknowledgment if it does not receive the expected frame. For example, it sends DUPACK[2] when it expects to ... interval of about $2 \times RTT$. (a) Frame $2$ is lost. Retransmission takes place upon timeout (as usual).

Draw a timeline diagram for the sliding window algorithm with $SWS = RWS = 4$ frames in the following two situations. Assume the receiver sends a duplicate acknowledgment...

makhdoom ghaya

171 views

makhdoom ghaya asked Apr 22, 2016

0 votes

0 answers

47

Peterson Davie 2.31b
Draw a timeline diagram for the sliding window algorithm with $SWS = RWS = 3$ frames, for the following two situations. Use a timeout interval of about $2 \times RTT$ (b) Frames $4$ to $6$ are lost.

Draw a timeline diagram for the sliding window algorithm with $SWS = RWS = 3$ frames, for the following two situations. Use a timeout interval of about $2 \times RTT$(b) ...

makhdoom ghaya

172 views

makhdoom ghaya asked Apr 22, 2016

0 votes

0 answers

48

Peterson Davie 2.31a
Draw a timeline diagram for the sliding window algorithm with $SWS = RWS = 3$ frames, for the following two situations. Use a timeout interval of about $2 \times RTT$. (a) Frame $4$ is lost.

Draw a timeline diagram for the sliding window algorithm with $SWS = RWS = 3$ frames, for the following two situations. Use a timeout interval of about $2 \times RTT$.(a)...

makhdoom ghaya

174 views

makhdoom ghaya asked Apr 22, 2016

0 votes

0 answers

49

Peterson Davie 2.30
Describe a protocol combining the sliding window algorithm with selective $ACK$s. Your protocol should retransmit promptly, but not if a frame simply arrives one or two positions out of order. Your protocol should also make explicit what happens if several consecutive frames are lost.

Describe a protocol combining the sliding window algorithm with selective $ACK$s. Your protocol should retransmit promptly, but not if a frame simply arrives one or two p...

makhdoom ghaya

299 views

makhdoom ghaya asked Apr 22, 2016

0 votes

0 answers

50

Peterson Davie 2.29
Give some details of how you might augment the sliding window protocol with flow control by having $ACK$s carry additional information that reduces the $SWS$ as the receiver runs out of buffer space. Illustrate your protocol with a timeline for a transmission; assume the initial $SWS$ ... the receiver is the bottleneck). Show what happens at $T = 0,T = 1,......, T = 4$ seconds.

Give some details of how you might augment the sliding window protocol with flow control by having $ACK$s carry additional information that reduces the $SWS$ as the recei...

makhdoom ghaya

267 views

makhdoom ghaya asked Apr 22, 2016

0 votes

0 answers

51

Peterson Davie 2.28b
In stop-and-wait transmission, suppose that both sender and receiver retransmit their last frame immediately on receipt of a duplicate $ACK$ or data frame; such a strategy is superficially reasonable because receipt of such a duplicate is most ... that both sides use the same timeout interval. Identify a reasonably likely scenario for triggering the Sorcerer's Apprentice bug.

In stop-and-wait transmission, suppose that both sender and receiver retransmit their last frame immediately on receipt of a duplicate $ACK$ or data frame; such a strateg...

makhdoom ghaya

314 views

makhdoom ghaya asked Apr 22, 2016

0 votes

0 answers

52

Peterson Davie 2.28a
In stop-and-wait transmission, suppose that both sender and receiver retransmit their last frame immediately on receipt of a duplicate $ACK$ or data frame; such a strategy is superficially reasonable because receipt of such a duplicate is most likely to mean ... no frame is lost. How long will the duplications continue? This situation is known as the Sorcerer's Apprentice bug.

In stop-and-wait transmission, suppose that both sender and receiver retransmit their last frame immediately on receipt of a duplicate $ACK$ or data frame; such a strateg...

makhdoom ghaya

514 views

makhdoom ghaya asked Apr 22, 2016

0 votes

0 answers

53

Peterson Davie 2.27
Implicit in the stop-and-wait scenarios of Figure $2.17$ is the notion that the receiver will retransmit its $ACK$ immediately on receipt of the duplicate data frame. Suppose instead that the receiver keeps its own timer and retransmits its $ACK$ only ... the sender’s. Also redraw $(c)$ assuming the receiver’s timeout value is half the sender’s.

Implicit in the stop-and-wait scenarios of Figure $2.17$ is the notion that the receiver will retransmit its $ACK$ immediately on receipt of the duplicate data frame. Sup...

makhdoom ghaya

640 views

makhdoom ghaya asked Apr 22, 2016

0 votes

0 answers

54

Peterson Davie 2.26
The text suggests that the sliding window protocol can be used to implement flow control. We can imagine doing this by having the receiver delay $ACK$s, that is, not send the $ACK$ until there is free buffer space to hold the next frame. In doing ... is now free buffer space available to hold the next frame. Explain why implementing flow control in this way is not a good idea.

The text suggests that the sliding window protocol can be used to implement flow control. We can imagine doing this by having the receiver delay $ACK$s, that is, not send...

makhdoom ghaya

194 views

makhdoom ghaya asked Apr 22, 2016

0 votes

1 answer

55

Peterson Davie 2.25b
Suppose you are designing a sliding window protocol for a $1$-Mbps point-to-point link to the stationary satellite revolving around the Earth at an altitude of $3 \times 104$ km. Assuming that each frame carries $1$ KB of data, what is the minimum number of bits you ... the sequence number in the following cases? Assume the speed of light is $3 \times 108$ m/s. (b) $RWS = SWS$

Suppose you are designing a sliding window protocol for a $1$-Mbps point-to-point link to the stationary satellite revolving around the Earth at an altitude of $3 \times ...

makhdoom ghaya

227 views

makhdoom ghaya asked Apr 22, 2016

0 votes

1 answer

56

Peterson Davie 2.25a
Suppose you are designing a sliding window protocol for a $1$-Mbps point-to-point link to the stationary satellite revolving around the Earth at an altitude of $3 \times 104$ km. Assuming that each frame carries $1$ KB of data, what is the minimum number of bits you need for the sequence number in the following cases? Assume the speed of light is $3 \times 108$ m/s. (a) $RWS=1$

Suppose you are designing a sliding window protocol for a $1$-Mbps point-to-point link to the stationary satellite revolving around the Earth at an altitude of $3 \times ...

makhdoom ghaya

302 views

makhdoom ghaya asked Apr 22, 2016

0 votes

2 answers

57

Peterson Davie 2.24
Suppose you are designing a sliding window protocol for a $1$-Mbps point-to-point link to the moon, which has a one-way latency of $1.25$ seconds. Assuming that each frame carries $1$ KB of data, what is the minimum number of bits you need for the sequence number?

Suppose you are designing a sliding window protocol for a $1$-Mbps point-to-point link to the moon, which has a one-way latency of $1.25$ seconds. Assuming that each fram...

makhdoom ghaya

529 views

makhdoom ghaya asked Apr 22, 2016

0 votes

0 answers

58

Peterson Davie 2.23c
Consider an $ARQ$ algorithm running over a $40$-km point-to-point fiber link. (c) Why might it still be possible for the ARQ algorithm to time out and retransmit a frame, given this timeout value?

Consider an $ARQ$ algorithm running over a $40$-km point-to-point fiber link.(c) Why might it still be possible for the ARQ algorithm to time out and retransmit a frame, ...

makhdoom ghaya

253 views

makhdoom ghaya asked Apr 22, 2016

0 votes

1 answer

59

Peterson Davie 2.23b
Consider an $ARQ$ algorithm running over a $40$-km point-to-point fiber link. (b) Suggest a suitable timeout value for the ARQ algorithm to use.

Consider an $ARQ$ algorithm running over a $40$-km point-to-point fiber link.(b) Suggest a suitable timeout value for the ARQ algorithm to use.

makhdoom ghaya

334 views

makhdoom ghaya asked Apr 22, 2016

0 votes

2 answers

60

Peterson Davie 2.23a
Consider an $ARQ$ algorithm running over a $40$-km point-to-point fiber link. (a) Compute the one-way propagation delay for this link, assuming that the speed of light is $2 \times 108$ m/s in the fiber.

Consider an $ARQ$ algorithm running over a $40$-km point-to-point fiber link.(a) Compute the one-way propagation delay for this link, assuming that the speed of light is ...

makhdoom ghaya

1.4k views

makhdoom ghaya asked Apr 22, 2016

tags	tag:apple
author	user:martin
title	title:apple
content	content:apple
exclude	-tag:apple
force match	+apple
views	views:100
score	score:10
answers	answers:2
is accepted	isaccepted:true
is closed	isclosed:true