2. cnp3-ebook
3. English
4. Zen

106 ../../principles/transport.rst:640
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Like the connectionless service, the connection-oriented service allows several applications running on a given host to exchange data with other hosts. The port numbers described above for the connectionless service are also used by the connection-oriented service to multiplex several applications. Similarly, connection-oriented protocols use checksums/CRCs to detect transmission errors and discard segments containing an invalid checksum/CRC. 446/10000 · 446
107 ../../glossary.rst:264
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — A MIME document is a document, encoded by using the :term:`MIME` format. 72/10000 · 72
107 ../../principles/reliability.rst:428
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Frames can be corrupted by transmission errors 46/10000 · 46
107 ../../principles/sharing.rst:668
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Operation of a CSMA/CA device 29/10000 · 29
107 ../../principles/transport.rst:642
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — An important difference between the connectionless service and the connection-oriented one is that the transport entities in the latter maintain some state during lifetime of the connection. This state is created when a connection is established and is removed when it is released. 281/10000 · 281
107 ../../principles/security.rst:1016
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The wikipedia page on passwords provides many of these references : https://en.wikipedia.org/wiki/Password_strength 115/10000 · 115
107 ../../protocols/bgp.rst:410
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The bad gadget internetwork 27/10000 · 27
107 ../../protocols/email.rst:246
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — 58 2/10000 · 2
107 ../../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
107 ../../protocols/ipv6.rst:378
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — In this optional header, the `Next Header` field is used to support the chain of headers. It indicates the type of the next header in the chain. IPv6 headers have different lengths. The `Hdr Ext Len` field indicates the total length of the option header in bytes. The `Opt. Type` field indicates the type of option. These types are encoded such that their high order bits specify how the header needs to be handled by nodes that do not recognize it. The following values are defined for the two high order bits : 512/10000 · 512
107 ../../protocols/ethernet.rst:366
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Otherwise, the switch chooses the best priority vector from its table, `bv = <R,c+cost[q'],T,p,q'>`. The port `q'`, over which this best root priority vector was learned, is the switch port that is closest to the `root` switch. This port becomes the `Root` port of the switch. There is only one `Root` port per switch (except for the `Root` switches whose ports are all `Designated`). The switch can then compute its own `BPDU` as `BPDU = <R,c',S,p>` , where `R` is the `root identifier`, `c'` the cost of the best root priority vector, `S` the identifier of the switch and `p` will be replaced by the number of the port over which the `BPDU` will be sent. 656/10000 · 656
107 ../../protocols/tcp.rst:322
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — TCP windows 11/10000 · 11
107 ../../principles/network.rst:509
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — R2's label forwarding table 27/10000 · 27
107 ../../bibliography.rst:142
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Mogul, J. , `The case for persistent-connection HTTP <http://doi.acm.org/10.1145/217382.217465>`_. In Proceedings of the Conference on Applications, Technologies, Architectures, and Protocols For Computer Communication (Cambridge, Massachusetts, United States, August 28 - September 01, 1995). D. Oran, Ed. SIGCOMM '95. ACM, New York, NY, 299-313. 347/10000 · 347
108 ../../glossary.rst:259
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — minicomputer 12/10000 · 12
108 ../../principles/network.rst:518
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Two virtual circuits pass through `R3`. They both need to be forwarded to `R4`, but `R4` expects `label=1` for packets belonging to the virtual circuit originated by `R2` and `label=0` for packets belonging to the other virtual circuit. `R3` could choose to leave the labels unchanged. 285/10000 · 285
108 ../../principles/reliability.rst:429
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Frames can be lost or unexpected frames can appear 50/10000 · 50
108 ../../principles/sharing.rst:674
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The main difficulty with CSMA/CA is when two or more devices transmit at the same time and cause collisions. This is illustrated in the figure below, assuming a fixed timeout after the transmission of a data frame. With CSMA/CA, the timeout after the transmission of a data frame is very small, since it corresponds to the SIFS plus the time required to transmit the acknowledgment frame. 388/10000 · 388
108 ../../principles/security.rst:1019
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — A detailed explanation of the operation of the RSA algorithm is outside the scope of this e-book. Various tutorials such as the `RSA page <https://en.wikipedia.org/wiki/RSA_(cryptosystem)>`_ on wikipedia provide examples and tutorial information. 246/10000 · 246
108 ../../protocols/bgp.rst:413
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — In this internetwork, there are four ASes. `AS0` advertises one route towards one prefix and we only analyze the routes towards this prefix. The routing preferences of `AS1`, `AS3` and `AS4` are the following : 210/10000 · 210