2. cnp3-ebook
3. English
4. Zen

131 ../../principles/dv.rst:56
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — the cost of the new route is smaller than the cost of the already known route `((V[d].cost + l.cost) < R[d].cost)` 114/10000 · 114
131 ../../bibliography.rst:331
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Shoch, J. F. and Hupp, J. A., `Measured performance of an Ethernet local network <http://doi.acm.org/10.1145/359038.359044>`_. Communications ACM 23, 12 (Dec. 1980), 711-721. 174/10000 · 174
132 ../../glossary.rst:54
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — packet 6/10000 · 6
132 ../../principles/reliability.rst:466 • ../../principles/reliability.rst:483
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — 001 3/10000 · 3
132 ../../principles/transport.rst:776
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Now that the transport connection has been established, it can be used to transfer data. To ensure a reliable delivery of the data, the transport protocol will include sliding windows, retransmission timers and `go-back-n` or `selective repeat`. However, we cannot simply reuse the techniques from the datalink because a transport protocol needs to deal with more types of errors than a reliable protocol in datalink layer. The first difference between the two layers is the transport layer must face with more variable delays. In the datalink layer, when two hosts are connected by a link, the transmission delay or the round-trip-time over the link is almost fixed. In a network that can span the globe, the delays and the round-trip-times can vary significantly on a per packet basis. This variability can be caused by two factors. First, packets sent through a network do not necessarily follow the same path to reach their destination. Second, some packets may be queued in the buffers of routers when the load is high and these queuing delays can lead to increased end-to-end delays. A second difference between the datalink layer and the transport layer is that a network does not always deliver packets in sequence. This implies that packets may be reordered by the network. Furthermore, the network may sometimes duplicate packets. The last issue that needs to be dealt with in the transport layer is the transmission of large SDUs. In the datalink layer, reliable protocols transmit small frames. Applications could generate SDUs that are much larger than the maximum size of a packet in the network layer. The transport layer needs to include mechanisms to fragment and reassemble these large SDUs. 1709/10000 · 1709
132 ../../principles/sharing.rst:807
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — To capture a token, a station must operate in `Listen` mode. In this mode, the station receives bits from its upstream neighbor. If the bits correspond to a data frame, they must be forwarded to the downstream neighbor. If they correspond to a token, the station can capture it and transmit its data frame. Both the data frame and the token are encoded as a bit string beginning with the `Starting Delimiter` followed by the `Access Control` field. When the station receives the first bit of a `Starting Delimiter`, it cannot know whether this is a data frame or a token and must forward the entire delimiter to its downstream neighbor. It is only when it receives the fourth bit of the `Access Control` field (i.e. the `Token` bit) that the station knows whether the frame is a data frame or a token. If the `Token` bit is reset, it indicates a data frame and the remaining bits of the data frame must be forwarded to the downstream station. Otherwise (`Token` bit is set), this is a token and the station can capture it by resetting the bit that is currently in its buffer. Thanks to this modification, the beginning of the token is now the beginning of a data frame and the station can switch to `Transmit` mode and send its data frame starting at the fifth bit of the `Access Control` field. Thus, the one-bit delay introduced by each Token Ring station plays a key role in enabling the stations to efficiently capture the token. 1433/10000 · 1433
132 ../../protocols/bgp.rst:471
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — An analysis of the evolution of the number of domains on the global Internet during the last ten years may be found in http://www.potaroo.net/tools/asn32/. 155/10000 · 155
132 ../../protocols/email.rst:254
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — c 1/10000 · 1
132 ../../protocols/ipv6.rst:422
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — To solve these problems, IPv6 includes a packet fragmentation and reassembly mechanism. In IPv4, fragmentation was performed by both the hosts and the intermediate routers. However, experience with IPv4 has shown that fragmenting packets in routers was costly [KM1995]_. For this reason, the developers of IPv6 have decided that routers would not fragment packets anymore. In IPv6, fragmentation is only performed by the source host. If a source has to send a packet which is larger than the MTU of the outgoing interface, the packet needs to be fragmented before being transmitted. In IPv6, each packet fragment is an IPv6 packet that includes the `Fragmentation` header. This header is included by the source in each packet fragment. The receiver uses them to reassemble the received fragments. 797/10000 · 797
132 ../../protocols/wifi.rst:5
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — 802.11 wireless networks 24/10000 · 24
132 ../../protocols/tcp.rst:388
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — However, when a data segment is lost, as illustrated in the bottom part of the figure, the measurement is ambiguous as the sender cannot determine whether the received acknowledgment was triggered by the first transmission of segment `123` or its retransmission. Using incorrect round-trip-time estimations could lead to incorrect values of the retransmission timeout. For this reason, Phil Karn and Craig Partridge proposed, in [KP91]_, to ignore the round-trip-time measurements performed during retransmissions. 514/10000 · 514
132 ../../principles/dv.rst:57
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — the new route was learned over the same link as the current best route towards this destination `(R[d].link == l)` 114/10000 · 114
132 ../../bibliography.rst:332
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Senapathi, S., Hernandez, R., `Introduction to TCP Offload Engines <http://www.dell.com/downloads/global/power/1q04-her.pdf>`_, March 2004 138/10000 · 138
133 ../../bibliography.rst:334
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Semke, J., Mahdavi, J., and Mathis, M., `Automatic TCP buffer tuning <http://doi.acm.org/10.1145/285243.285292>`_. SIGCOMM Computer Communication Review 28, 4 (Oct. 1998), 315-323. 180/10000 · 180
133 ../../glossary.rst:56
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — a packet is the unit of information transfer in the network layer 65/10000 · 65
133 ../../principles/dv.rst:59
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The first condition ensures that the router discovers the shortest path towards each destination. The second condition is used to take into account the changes of routes that may occur after a link failure or a change of the metric associated to a link. 253/10000 · 253
133 ../../principles/reliability.rst:467 • ../../principles/reliability.rst:484
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — 010 3/10000 · 3
133 ../../principles/transport.rst:778
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — To deal with all these characteristics of the network layer, we need to adapt the techniques that we have introduced in the datalink layer. 139/10000 · 139
133 ../../principles/sharing.rst:809
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — After having transmitted its data frame, the station must remain in `Transmit` mode until it has received the last bit of its own data frame. This ensures that the bits sent by a station do not remain in the network forever. A data frame sent by a station in a Token Ring network passes in front of all stations attached to the network. Each station can detect the data frame and analyze the destination address to possibly capture the frame. 442/10000 · 442
133 ../../protocols/bgp.rst:473
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Several web sites collect and analyze data about the evolution of BGP in the global Internet. http://bgp.potaroo.net provides lots of statistics and analyzes that are updated daily. 181/10000 · 181