2. cnp3-ebook
3. English
4. Zen

17 ../../protocols/transport-service.rst:53
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — `fe80:0:0:0:219:e3ff:fed7:1204` 31/10000 · 31
17 ../../protocols/udp.rst:61
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — the ephemeral port numbers ( officially [#fephemeral]_ 49152 <= port <= 65535 ) 79/10000 · 79
17 ../../protocols/wifi.rst:23
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — 5 GHz 5/10000 · 5
17 ../../exercises/network.rst:114
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — In the five nodes network shown below, can you configure the link metrics so that the packets sent by router `R5` to router `R1` use link `R3->R1` while the packets sent by router `R3` use links `R3->R2` and `R2->R1`? 217/10000 · 217
17 ../../exercises/reliability.rst:35
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Consider a go-back-n sender and a go-back receiver that are directly connected with a 10 Mbps link that has a propagation delay of 100 milliseconds. Assume that the retransmission timer is set to three seconds. If the window has a length of 4 frames, draw a time-sequence diagram showing the transmission consisting of 10 data frames (each frame contains 10000 bits): 367/10000 · 367
17 ../../exercises/sockets.rst:139
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Operating systems allow assigning an address to a socket using the ``bind`` system call. This is useful when you want to receive messages from another program to which you announced your socket address. Once the address is assigned to the socket, the program can receive data from others using system calls such as ``recv`` and ``read``. Note that we can use the ``read`` system call as the operating system provides a socket as a file descriptor. 447/10000 · 447
17 ../../bibliography.rst:24
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Biondi, P. and A. Ebalard, `IPv6 Routing Header Security <http://www.secdev.org/conf/IPv6_RH_security-csw07.pdf>`_, CanSecWest Security Conference 2007, April 2007. 165/10000 · 165
17 ../../principles/sharing.rst:157
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Sharing bandwidth among the hosts directly attached to a link is not the only sharing problem that occurs in computer networks. To understand the general problem, let us consider a very simple network which contains only point-to-point links. This network contains three hosts and two routers. All the links inside the network have the same capacity. For example, let us assume that all links have a bandwidth of 1000 bits per second and that the hosts send packets containing exactly one thousand bits. 503/10000 · 503
18 ../../exercises/ex-sharing.rst:382
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — 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
18 ../../exercises/sockets.rst:142
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The following program binds its socket to a given socket address and then waits for receiving new bytes, using the already created socket ``sock``. 147/10000 · 147
18 ../../principles/naming.rst:111
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — the address of any host residing directly inside domain `dom` (e.g. `h2.dom` in the figure above) 97/10000 · 97
18 ../../principles/network.rst:99
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The first and most popular organization of the network layer is the datagram organization. This organization is inspired by the organization of the postal service. Each host is identified by a `network layer address`. To send information to a remote host, a host creates a packet that contains: 294/10000 · 294
18 ../../principles/reliability.rst:53
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — :math:`10^9` 12/10000 · 12
18 ../../bibliography.rst:25
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Bonomi, F. and Fendick, K.W., `The rate-based flow control framework for the available bit rate ATM service <https://dx.doi.org/10.1109/65.372653>`_, IEEE Network, Mar/Apr 1995, Volume: 9, Issue: 2, pages : 25-39 214/10000 · 214
18 ../../exercises/reliability.rst:37
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — when there are no losses 24/10000 · 24
18 ../../glossary.rst:214
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ATM 3/10000 · 3
18 ../../exercises/transport.rst:143
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — In the transport layer, the receive window advertised by a receiver can vary during the lifetime of the connection. What are the causes for these variations ? 158/10000 · 158
18 ../../principles/sharing.rst:178
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — In the network above, consider the case where host `A` is transmitting packets to destination `C`. `A` can send one packet per second and its packets will be delivered to `C`. Now, let us explore what happens when host `B` also starts to transmit a packet. Node `R1` will receive two packets that must be forwarded to `R2`. Unfortunately, due to the limited bandwidth on the `R1-R2` link, only one of these two packets can be transmitted. The outcome of the second packet will depend on the available buffers on `R1`. If `R1` has one available buffer, it could store the packet that has not been transmitted on the `R1-R2` link until the link becomes available. If `R1` does not have available buffers, then the packet needs to be discarded. 741/10000 · 741
18 ../../principles/transport.rst:62
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — If Alice wants to enter the meeting room but does not know the password, her conversation could be as follows : 111/10000 · 111
18 ../../protocols/dns.rst:62
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — This answer contains several pieces of information. First, the name `www.ietf.org` is associated to IP address `2001:1890:123a::1:1e`. Second, the `ietf.org` domain is managed by six different nameservers. Five of these nameservers are reachable via IPv4 and IPv6. 264/10000 · 264