2. cnp3-ebook
3. English
4. Zen

121 ../../bibliography.rst:319
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Ramakrishnan, K. K. and Jain, R., `A binary feedback scheme for congestion avoidance in computer networks with a connectionless network layer <http://doi.acm.org/10.1145/205447.205461>`_. SIGCOMM Computer Communication Review 25, 1 (Jan. 1995), 138-156. 253/10000 · 253
121 ../../glossary.rst:298
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — A Non Broadcast Mode Multiple Access Network is a subnetwork that supports multiple hosts/routers but does not provide an efficient way of sending broadcast frames to all devices attached to the subnetwork. ATM subnetworks are an example of NBMA networks. 255/10000 · 255
121 ../../principles/network.rst:610
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — In this section, we discuss the main techniques that can be used to maintain the forwarding tables in a network. 112/10000 · 112
121 ../../principles/reliability.rst:452
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — `0` is encoded as `000` 23/10000 · 23
121 ../../principles/sharing.rst:756
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The IEEE 802.5 Token Ring technology is defined in [IEEE802.5]_. We use Token Ring as an example to explain the principles of the token-based MAC algorithms in ring-shaped networks. Other ring-shaped networks include the defunct FDDI [Ross1989]_ or Resilient Pack Ring [DYGU2004]_ . A good survey of the early token ring networks may be found in [Bux1989]_ . 358/10000 · 358
121 ../../principles/transport.rst:735
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The remote entity considers the transport connection to be established after having received the segment that acknowledges its `CA` segment. The numbering of the data segments sent by the remote entity starts at sequence number `y`. 232/10000 · 232
121 ../../protocols/bgp.rst:432
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The topology composed of all the directed `customer->provider` peering links is a graph that does not contain any cycle 119/10000 · 119
121 ../../protocols/email.rst:250
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — 60 2/10000 · 2
121 ../../protocols/ipv6.rst:405
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — 2272 bytes 10/10000 · 10
121 ../../protocols/ethernet.rst:391
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Assume that `Switch4` is the first to boot. It sends its own `BPDU = <4,0,4,1>` (resp. `BPDU = <4,0,4,2>`) on port 1 (resp. port 2). When `Switch1` boots, it sends `BPDU = <1,0,1,1>`. This `BPDU` is received by `Switch4`, which updates its `BPDU` and root priority vector tables and computes a new `BPDU = <1,3,4,1>` (resp. `BPDU = <1,3,4,2>`) on port 1 (resp. port 2). Indeed, there is only one root priority vector and hence, it is the best one. Port 1 of `Switch4` becomes the `Root` port while its second port is still in the `Designated` state. 549/10000 · 549
121 ../../protocols/tcp.rst:347
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — 8590 Gbps 9/10000 · 9
122 ../../glossary.rst:284
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — network-byte order 18/10000 · 18
122 ../../principles/dv.rst:7
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Distance vector routing 23/10000 · 23
122 ../../principles/reliability.rst:454
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — For example, consider a sender that sends `111`. If there is one bit in error, the receiver could receive `011` or `101` or `110`. In these three cases, the receiver will decode the received bit pattern as a `1` since it contains a majority of bits set to `1`. If there are two bits in error, the receiver will not be able anymore to recover from the transmission error. 370/10000 · 370
122 ../../principles/sharing.rst:759
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — A Token Ring network is composed of a set of stations that are attached to a unidirectional ring. The basic principle of the Token Ring MAC algorithm is that two types of frames travel on the ring : tokens and data frames. When the Token Ring starts, one of the stations sends the token. The token is a small frame that represents the authorization to transmit data frames on the ring. To transmit a data frame on the ring, a station must first capture the token by removing it from the ring. As only one station can capture the token at a time, the station that owns the token can safely transmit a data frame on the ring without risking collisions. After having transmitted its frame, the station must remove it from the ring and resend the token so that other stations can transmit their own frames. 802/10000 · 802
122 ../../principles/transport.rst:737
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The three way handshake is illustrated in the figure below. 59/10000 · 59
122 ../../protocols/bgp.rst:433
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — An AS always prefers a route received from a `customer` over a route received from a `shared-cost` peer or a `provider`. 120/10000 · 120
122 ../../protocols/email.rst:252
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — 10 2/10000 · 2
122 ../../protocols/ipv6.rst:406
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ATM (AAL5) 10/10000 · 10
122 ../../protocols/ethernet.rst:393
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Assume now that `Switch9` boots and immediately receives `Switch1` 's `BPDU` on port 1. `Switch9` computes its own `BPDU = <1,1,9,1>` (resp. `BPDU = <1,1,9,2>`) on port 1 (resp. port 2) and port 1 becomes the `Root` port of this switch. The `BPDU` is sent on port 2 of `Switch9` and reaches `Switch4`. `Switch4` compares the priority vectors. It notices that the last computed vector (i.e., `V[2] = <1,2,9,2,2>`) is better than `V[1] = <1,3,1,1,1>`. Thus, `Switch4`'s `BPDU` is recomputed and port 2 becomes the `Root` port of `Switch4`. `Switch4` compares its new `BPDU = <1,2,4,p>` with the last `BPDU` received on each port (except for the `Root` port). Port 1 becomes a `Blocked` port on `Switch4` because the `BPDU=<1,0,1,1>` received on this port is better. 763/10000 · 763