cnp3-ebook/exercises/ex-sharing

The translation has come to an end.

Exit Zen

13 ../../exercises/ex-sharing.rst:260

	English CSMA/CD does not use acknowledgments but instead assumes that each host can detect collisions by listening while transmitting. Consider a 2 kilometers long cable running at 10 Mbps. Show in the figure below the utilization of the communication channel and the collisions that would occur. For this exercise, do not attempt to retransmit the frames that have collided. 367/10000 · 367
14 ../../exercises/ex-sharing.rst:290

	English Consider again a network that uses CSMA/CD. This time, the bandwidth is set to 1 Gbps and the cable has a length of two kilometers. When a collision occurs, consider that the hosts B and C retransmit immediately while host A waits for the next slot. 249/10000 · 249
15 ../../exercises/ex-sharing.rst:316

	English An important part of the CSMA/CD algorithm is the exponential backoff. To illustrate the operation of this algorithm, let us consider a cable that has a length of one kilometer. The bandwidth of the network is set to 10 Mbps. Assume that when a collision occurs, host A always selects the highest possible random delay according to the exponential backoff algorithm while host B always selects the shortest one. In this network, the slot time is equal to the time required to transmit 100 bits. We further assume that a host can detect collision immediately (i.e. as soon as the other frame arrives). 600/10000 · 600
16 ../../exercises/ex-sharing.rst:343

	English Fairness and congestion control 31/10000 · 31
17 ../../exercises/ex-sharing.rst:345

	English Consider the network below. Compute the max-min fair allocation for the hosts in this network assuming that nodes `Sx` always send traffic towards node `Dx`. Furthermore, link `R1-R2` has a bandwidth of 10 Mbps while link `R2-R3` has a bandwidth of 20 Mbps. 257/10000 · 257
18 ../../exercises/ex-sharing.rst:382

	English To understand congestion control algorithms, it can also be useful to represent the exchange of packets by using a graphical representation. As a first example, let us consider a very simple network composed of two hosts interconnected through a switch. 253/10000 · 253
19 ../../exercises/ex-sharing.rst:399

	English Suppose now that host A uses a window of three segments and sends these three segments immediately. The segments will be queued in the router before being transmitted on the output link and delivered to their destination. The destination will reply with a short acknowledgment segment. A possible visualization of this exchange of packets is represented in the figure below. We assume for this figure that the router marks the packets to indicate congestion as soon as its buffer is non-empty when its receives a packet on its input link. In the figure, a `(c)` sign is added to each packet to indicate that it has been explicitly marked. 638/10000 · 638
20 ../../exercises/ex-sharing.rst:432

	English In practice, a router is connected to multiple input links. The figure below shows an example with two hosts. 109/10000 · 109
21 ../../exercises/ex-sharing.rst:491

	English In general, the links have a non-zero delay. This is illustrated in the figure below where a delay has been added on the link between `R` and `C`. 146/10000 · 146
22 ../../exercises/ex-sharing.rst:538 • ../../exercises/ex-sharing.rst:613

	English Consider the network depicted in the figure below. 50/10000 · 50
23 ../../exercises/ex-sharing.rst:558

	English In this network, compute the minimum round-trip-time between `A` (resp. `B`) and `D`. Perform the computation if the hosts send segments containing 1000 bits. 158/10000 · 158
24 ../../exercises/ex-sharing.rst:559

	English How is the maximum round-trip-time influenced if the buffers of router `R1` store 10 packets ? 94/10000 · 94
25 ../../exercises/ex-sharing.rst:560

	English If hosts `A` and `B` send to `D` 1000 bits segments and use a sending window of four segments, what is the maximum throughput that they can achieve ? 149/10000 · 149
26 ../../exercises/ex-sharing.rst:561

	English Assume now that `R1` is using round-robin scheduling instead of a FIFO buffer. One queue is used to store the packets sent by `A` and another for the packets sent by `B`. `A` sends one 1000 bits packet every second while `B` sends packets at 10 Mbps. What is the round-trip-time measured by each of these two hosts if each of the two queues of `R1` can store 5 packets ? 370/10000 · 370
27 ../../exercises/ex-sharing.rst:564

	English When analyzing the reaction of a network using round-robin schedulers, it is sometimes useful to consider that the packets sent by each source are equivalent to a fluid and that each scheduler acts as a tap. Using this analogy, consider the network below. In this network, all the links are 100 Mbps and host `B` is sending packets at 100 Mbps. If A sends at 1, 5, 10, 20, 30, 40, 50, 60, 80 and 100 Mbps, what is the throughput that destination `D` will receive from `A`. Use this data to plot a graph that shows the portion of the traffic sent by host `A` which is received by host `D`. 588/10000 · 588
28 ../../exercises/ex-sharing.rst:582

	English Compute the max-min fair bandwidth allocation in the network below. 67/10000 · 67
29 ../../exercises/ex-sharing.rst:588

	English Simple network topology 23/10000 · 23
30 ../../exercises/ex-sharing.rst:591

	English Consider the simple network depicted in the figure below. 57/10000 · 57
31 ../../exercises/ex-sharing.rst:609

	English In this network, a 250 Kbps link is used between the routers. The propagation delays in the network are negligible. Host `A` sends 1000 bits long segments so that it takes one msec to transmit one segment on the `A-R1` link. Neglecting the transmission delays for the acknowledgments, what is the minimum round-trip time measured on host `A` with such segments ? 362/10000 · 362
32 ../../exercises/ex-sharing.rst:610

	English If host `A` uses a window of two segments and needs to transmit five segments of data. How long does the entire transfer lasts ? 128/10000 · 128

Shortcut	Action
`?`	Open available keyboard shortcuts.
`Alt` + `Home`	Navigate to the first translation in the current search.
`Alt` + `End`	Navigate to the last translation in the current search.
`Alt` + `PageUp` or `Ctrl` + `↑` or `Alt` + `↑` or `Cmd` + `↑` or	Navigate to the previous translation in the current search.
`Alt` + `PageDown` or `Ctrl` + `↓` or `Alt` + `↓` or `Cmd` + `↓` or	Navigate to the next translation in the current search.
`Ctrl` + `Enter` or `Cmd` + `Enter`	Submit current form; this works the same as pressing Save and continue while editing translation.
`Ctrl` + `Shift` + `Enter` or `Cmd` + `Shift` +`Enter`	Unmark translation as Needing edit and submit it.
`Alt` + `Enter` or `Option` + `Enter`	Submit the string as a suggestion; this works the same as pressing Suggest while editing translation.
`Ctrl` + `E` or `Cmd` + `E`	Focus on translation editor.
`Ctrl` + `U` or `Cmd` + `U`	Focus on comment editor.
`Ctrl` + `M` or `Cmd` + `M`	Shows Automatic suggestions tab.
`Ctrl` + `1` to `Ctrl` + `9` or `Cmd` + `1` to `Cmd` + `9`	Copies placeable of a given number from source string.
`Ctrl` + `M` followed by `1` to `9` or `Cmd` + `M` followed by `1` to `9`	Copy the machine translation of a given number to current translation.
`Ctrl` + `I` followed by `1` to `9` or `Cmd` + `I` followed by `1` to `9`	Ignore one item in the list of failing checks.
`Ctrl` + `J` or `Cmd` + `J`	Shows the Nearby strings tab.
`Ctrl` + `S` or `Cmd` + `S`	Focus on search field.
`Ctrl` + `O` or `Cmd` + `O`	Copy the source string.
`Ctrl` + `Y` or `Cmd` + `Y`	Toggle the Needs editing checkbox.
`→`	Browse the next translation string.
`←`	Browse the previous translation string.