2. cnp3-ebook
3. English
4. Zen

190 ../../protocols/tcp.rst:638
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The full list of all TCP options may be found at http://www.iana.org/assignments/tcp-parameters/ 96/10000 · 96
190 ../../glossary.rst:277
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — VNC 3/10000 · 3
191 ../../glossary.rst:278
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — vnc 3/10000 · 3
191 ../../principles/reliability.rst:973
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Selective repeat : example 26/10000 · 26
191 ../../principles/linkstate.rst:241
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — As link state packets are flooded regularly, routers are able to measure the quality (e.g. delay or load) of their links and adjust the metric of each link according to its current quality. Such dynamic adjustments were included in the ARPANET routing protocol [MRR1979]_ . However, experience showed that it was difficult to tune the dynamic adjustments and ensure that no forwarding loops occur in the network [KZ1989]_. Today's link state routing protocols use metrics that are manually configured on the routers and are only changed by the network operators or network management tools [FRT2002]_. 601/10000 · 601
191 ../../protocols/email.rst:342
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The Simple Mail Transfer Protocol 33/10000 · 33
191 ../../protocols/ipv6.rst:675
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Appendix A of :rfc:`4291` provides the algorithm used to convert a 48 bits MAC address into a 64 bits host identifier. This algorithm builds upon the structure of the MAC addresses. A MAC address is represented as shown in the figure below. 240/10000 · 240
191 ../../protocols/tcp.rst:640
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — In practice, only the `SYN` segment do not have their `ACK` flag set. 69/10000 · 69
192 ../../glossary.rst:280
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — A networked application that allows to remotely access a computer's Graphical User Interface. See https://en.wikipedia.org/wiki/Virtual_Network_Computing 153/10000 · 153
192 ../../principles/reliability.rst:977
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Pure cumulative acknowledgments work well with the `go-back-n` strategy. However, with only cumulative acknowledgments a `selective repeat` sender cannot easily determine which frames have been correctly received after a data frame has been lost. For example, in the figure above, the second `C(OK,0)` does not inform explicitly the sender of the reception of `D(2,c)` and the sender could retransmit this frame although it has already been received. A possible solution to improve the performance of `selective repeat` is to provide additional information about the received frames in the acknowledgments that are returned by the receiver. For example, the receiver could add in the returned acknowledgment the list of the sequence numbers of all frames that have already been received. Such acknowledgments are sometimes called `selective acknowledgments`. This is illustrated in the figure above. 899/10000 · 899
192 ../../principles/linkstate.rst:245
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — When a link fails, the two routers attached to the link detect the failure by the absence of HELLO messages received during the last :math:`k \times N` seconds. Once a router has detected the failure of one of its local links, it generates and floods a new LSP that no longer contains the failed link. This new LSP replaces the previous LSP in the network. In practice, the two routers attached to a link do not detect this failure exactly at the same time. During this period, some links may be announced in only one direction. This is illustrated in the figure below. Router `E` has detected the failure of link `E-B` and flooded a new LSP, but router `B` has not yet detected this failure. 692/10000 · 692
192 ../../protocols/email.rst:344
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The Simple Mail Transfer Protocol (:term:`SMTP`) defined in :rfc:`5321` is a client-server protocol. The SMTP specification distinguishes between five types of processes involved in the delivery of email messages. Email messages are composed on a Mail User Agent (MUA). The MUA is usually either an email client or a webmail. The MUA sends the email message to a Mail Submission Agent (MSA). The MSA processes the received email and forwards it to the Mail Transmission Agent (MTA). The MTA is responsible for the transmission of the email, directly or via intermediate MTAs to the MTA of the destination domain. This destination MTA will then forward the message to the Mail Delivery Agent (MDA) where it will be accessed by the recipient's MUA. SMTP is used for the interactions between MUA and MSA [#fsmtpauth]_, MSA-MTA and MTA-MTA. 836/10000 · 836
192 ../../protocols/ipv6.rst:680
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — A MAC address 13/10000 · 13
192 ../../protocols/tcp.rst:642
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — A complete TCP implementation contains additional information in its TCB, notably to support the `urgent` pointer. However, this part of TCP is not discussed in this book. Refer to :rfc:`793` and :rfc:`2140` for more details about the TCB. 239/10000 · 239
193 ../../glossary.rst:45
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — W3C 3/10000 · 3
193 ../../principles/reliability.rst:986
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — In the figure above, when the sender receives `C(OK,0,[2])`, it knows that all frames up to and including `D(0,...)` have been correctly received. It also knows that frame `D(2,...)` has been received and can cancel the retransmission timer associated to this frame. However, this frame should not be removed from the sending buffer before the reception of a cumulative acknowledgment (`C(OK,2)` in the figure above) that covers this frame. 440/10000 · 440
193 ../../protocols/email.rst:346
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — SMTP is a text-based protocol like many other application-layer protocols on the Internet. It relies on the byte-stream service. Servers listen on port `25`. Clients send commands that are each composed of one line of ASCII text terminated by `CR+LF`. Servers reply by sending ASCII lines that contain a three digit numerical error/success code and optional comments. 367/10000 · 367
193 ../../protocols/ipv6.rst:682
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — MAC addresses are allocated in blocks of :math:`2^{20}`. When a company registers for a block of MAC addresses, it receives an identifier. company identifier is then used to populated the `c` bits of the MAC addresses. The company can allocate all addresses in starting with this prefix and manages the `m` bits as it wishes. 325/10000 · 325
193 ../../protocols/tcp.rst:646
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — This TCP segment is then placed in an IP header. We describe IPv6 in the next chapter. The minimum size of the IPv6 (resp. IPv4) header is 40 bytes (resp. 20 bytes). 165/10000 · 165
193 ../../principles/linkstate.rst:334
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — When a link is reported in the LSP of only one of the attached routers, routers consider the link as having failed and they remove it from the directed graph that they compute from their LSDB. This is called the `two-way connectivity check`. This check allows link failures to be quickly flooded as a single LSP is sufficient to announce such bad news. However, when a link comes up, it can only be used once the two attached routers have sent their LSPs. The `two-way connectivity check` also allows for dealing with router failures. When a router fails, all its links fail by definition. These failures are reported in the LSPs sent by the neighbors of the failed router. The failed router does not, of course, send a new LSP to announce its failure. However, in the graph that represents the network, this failed router appears as a node that only has outgoing edges. Thanks to the `two-way connectivity check`, this failed router cannot be considered as a transit router to reach any destination since no outgoing edge is attached to it. 1041/10000 · 1041