2. cnp3-ebook
3. English
4. Zen

185 ../../principles/reliability.rst:953
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — A `selective repeat` receiver maintains a sliding window of `W` frames and stores in a buffer the out-of-sequence frames that it receives. The figure below shows a five-frame receive window on a receiver that has already received frames `7` and `9`. 249/10000 · 249
185 ../../principles/linkstate.rst:90
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Current link state routing protocols usually use 32 bits sequence numbers and include a special mechanism in the unlikely case that a sequence number reaches the maximum value (with a 32 bits sequence number space, it takes 136 years to cycle the sequence numbers if a link state packet is generated every second). 314/10000 · 314
185 ../../protocols/email.rst:303
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — 0x14b9 6/10000 · 6
185 ../../protocols/ipv6.rst:643
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — LANs also provide a broadcast and a multicast service. The broadcast service enables a device to send a single frame to all the devices attached to the same LAN. This is done by reserving a special broadcast MAC address (typically all bits of the address are set to one). To broadcast a frame, a device simply needs to send a frame whose destination is the broadcast address. All devices attached to the datalink network will receive the frame. 445/10000 · 445
185 ../../protocols/wifi.rst:158
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The 802.11 working group defined the `basic service set (BSS)` as a group of devices that communicate with each other. We continue to use `network` when referring to a set of devices that communicate. 200/10000 · 200
185 ../../protocols/tcp.rst:623
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Several researchers have analyzed the utilization of TCP and UDP in the global Internet. Most of these studies have been performed by collecting all the packets transmitted over a given link during a period of a few hours or days and then analyzing their headers to infer the transport protocol used, the type of application, ... Recent studies include http://www.caida.org/research/traffic-analysis/tcpudpratio/, https://research.sprintlabs.com/packstat/packetoverview.php or http://www.nanog.org/meetings/nanog43/presentations/Labovitz_internetstats_N43.pdf 559/10000 · 559
186 ../../glossary.rst:87
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — UDP 3/10000 · 3
186 ../../principles/reliability.rst:959
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The receiving window with selective repeat 42/10000 · 42
186 ../../principles/linkstate.rst:92
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — To deal with the memory corruption problem, link state packets contain a checksum or CRC. This checksum is computed by the router that generates the LSP. Each router must verify the checksum when it receives or floods an LSP. Furthermore, each router must periodically verify the checksums of the LSPs stored in its LSDB. This enables them to cope with memory errors that could corrupt the LSDB as the one that occurred in the ARPANET. 435/10000 · 435
186 ../../principles/sharing.rst:1526
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — In this section, we focus on congestion control mechanisms that regulate the transmission rate of the hosts. Other types of mechanisms have been proposed in the literature. For example, `credit-based` flow-control has been proposed to avoid congestion in ATM networks [KR1995]_. With a credit-based mechanism, hosts can only send packets once they have received credits from the routers and the credits depend on the occupancy of the router's buffers. 451/10000 · 451
186 ../../protocols/email.rst:305
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — 00010100 11111011 18/10000 · 18
186 ../../protocols/ipv6.rst:645
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The broadcast service allows easily reaching all devices attached to a datalink layer network. It has been widely used to support IP version 4. A drawback of using the broadcast service to support a network layer protocol is that a broadcast frame that contains a network layer packet is always delivered to all devices attached to the datalink network, even if some of these devices do not support the network layer protocol. The multicast service is a useful alternative to the broadcast service. To understand its operation, it is important to understand how a datalink layer interface operates. In shared media LANs, all devices are attached to the same physical medium and all frames are delivered to all devices. When such a frame is received by a datalink layer interface, it compares the destination address with the MAC address of the device. If the two addresses match, or the destination address is the broadcast address, the frame is destined to the device and its payload is delivered to the network layer protocol. The multicast service exploits this principle. A multicast address is a logical address. To receive frames destined to a multicast address in a shared media LAN, a device captures all frames having this multicast address as their destination. All IPv6 nodes are capable of capturing datalink layer frames destined to different multicast addresses. 1376/10000 · 1376
186 ../../protocols/wifi.rst:160
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — In fact, the [IEEE802.11]_ frame format contains a fourth optional address field. This fourth address is only used when an 802.11 wireless network is used to interconnect bridges attached to two classical LAN networks. 218/10000 · 218
186 ../../protocols/tcp.rst:625
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — This 32 bits counter was specified in :rfc:`793`. A 32 bits counter that is incremented every 4 microseconds wraps in about 4.5 hours. This period is much larger than the Maximum Segment Lifetime that is fixed at 2 minutes in the Internet (:rfc:`791`, :rfc:`1122`). 265/10000 · 265
187 ../../glossary.rst:89
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — User Datagram Protocol is a protocol of the transport layer in the TCP/IP protocol suite that provides an unreliable connectionless service that includes a mechanism to detect corruption 186/10000 · 186
187 ../../principles/reliability.rst:961
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — A `selective repeat` receiver discards all frames having an invalid CRC, and maintains the variable `lastack` as the sequence number of the last in-sequence frame that it has received. The receiver always includes the value of `lastack` in the acknowledgments that it sends. Some protocols also allow the `selective repeat` receiver to acknowledge the out-of-sequence frames that it has received. This can be done for example by placing the list of the correctly received, but out-of-sequence frames in the acknowledgments together with the `lastack` value. 557/10000 · 557
187 ../../principles/linkstate.rst:94
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Flooding is illustrated in the figure below. By exchanging HELLO messages, each router learns its direct neighbors. For example, router `E` learns that it is directly connected to routers `D`, `B` and `C`. Its first LSP has sequence number `0` and contains the directed links `E->D`, `E->B` and `E->C`. Router `E` sends its LSP on all its links and routers `D`, `B` and `C` insert the LSP in their LSDB and forward it over their other links. 441/10000 · 441
187 ../../principles/sharing.rst:1528
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — For example, the measurements performed in the Sprint network in 2004 reported more than 10k active TCP connections on a link, see https://research.sprintlabs.com/packstat/packetoverview.php. More recent information about backbone links may be obtained from caida_ 's real-time measurements, see e.g. http://www.caida.org/data/realtime/passive/ 345/10000 · 345
187 ../../protocols/email.rst:307
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — 000101 001111 101100 20/10000 · 20
187 ../../protocols/ipv6.rst:649
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Interactions between IPv6 and the datalink layer 48/10000 · 48