2. cnp3-ebook
3. protocols/ipv6
4. English
5. Zen

134 ../../protocols/ipv6.rst:429
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — If a router receives a packet that is too long to be forwarded, the packet is dropped and the router returns an ICMPv6 message to inform the sender of the problem. The sender can then either fragment the packet or perform Path MTU discovery. In IPv6, packet fragmentation is performed only by the source by using IPv6 options. 326/10000 · 326
135 ../../protocols/ipv6.rst:433
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — In IPv6, fragmentation is performed exclusively by the source host and relies on the fragmentation header. This 64 bits header is composed of six fields : 154/10000 · 154
136 ../../protocols/ipv6.rst:435
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — a `Next Header` field that indicates the type of the header that follows the fragmentation header 97/10000 · 97
137 ../../protocols/ipv6.rst:436
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — two `Reserved` fields set to `0`. 33/10000 · 33
138 ../../protocols/ipv6.rst:437
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — the `Fragment Offset` is a 13-bit unsigned integer that contains the offset, in 8 bytes units, of the data following this header, relative to the start of the original packet. 175/10000 · 175
139 ../../protocols/ipv6.rst:438
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — the `More` flag, which is set to `0` in the last fragment of a packet and to `1` in all other fragments. 104/10000 · 104
140 ../../protocols/ipv6.rst:439
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — the 32-bit `Identification` field indicates to which original packet a fragment belongs. When a host sends fragmented packets, it should ensure that it does not reuse the same `identification` field for packets sent to the same destination during a period of `MSL` seconds. This is easier with the 32 bits `identification` used in the IPv6 fragmentation header, than with the 16 bits `identification` field of the IPv4 header. 426/10000 · 426
141 ../../protocols/ipv6.rst:445
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Some IPv6 implementations send the fragments of a packet in increasing fragment offset order, starting from the first fragment. Others send the fragments in reverse order, starting from the last fragment. The latter solution can be advantageous for the host that needs to reassemble the fragments, as it can easily allocate the buffer required to reassemble all fragments of the packet upon reception of the last fragment. When a host receives the first fragment of an IPv6 packet, it cannot know a priori the length of the entire IPv6 packet. 543/10000 · 543
142 ../../protocols/ipv6.rst:447
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The figure below provides an example of a fragmented IPv6 packet containing a UDP segment. The `Next Header` type reserved for the IPv6 fragmentation option is 44. 163/10000 · 163
143 ../../protocols/ipv6.rst:453
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — IPv6 fragmentation example 26/10000 · 26
144 ../../protocols/ipv6.rst:455
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The following pseudo-code details the IPv6 fragmentation, assuming that the packet does not contain options. 108/10000 · 108
145 ../../protocols/ipv6.rst:490
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — In the above pseudocode, we maintain a single 32 bits counter that is incremented for each packet that needs to be fragmented. Other implementations to compute the packet identification are possible. :rfc:`2460` only requires that two fragmented packets that are sent within the MSL between the same pair of hosts have different identifications. 345/10000 · 345
146 ../../protocols/ipv6.rst:492
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The fragments of an IPv6 packet may arrive at the destination in any order, as each fragment is forwarded independently in the network and may follow different paths. Furthermore, some fragments may be lost and never reach the destination. 239/10000 · 239
147 ../../protocols/ipv6.rst:494
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The reassembly algorithm used by the destination host is roughly as follows. First, the destination can verify whether a received IPv6 packet is a fragment or not by checking whether it contains a fragment header. If so, all fragments with the some identification must be reassembled together. The reassembly algorithm relies on the `Identification` field of the received fragments to associate a fragment with the corresponding packet being reassembled. Furthermore, the `Fragment Offset` field indicates the position of the fragment payload in the original non-fragmented packet. Finally, the packet with the `M` flag reset allows the destination to determine the total length of the original non-fragmented packet. 717/10000 · 717
148 ../../protocols/ipv6.rst:496
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Note that the reassembly algorithm must deal with the unreliability of the IP network. This implies that a fragment may be duplicated or a fragment may never reach the destination. The destination can easily detect fragment duplication thanks to the `Fragment Offset`. To deal with fragment losses, the reassembly algorithm must bind the time during which the fragments of a packet are stored in its buffer while the packet is being reassembled. This can be implemented by starting a timer when the first fragment of a packet is received. If the packet has not been reassembled upon expiration of the timer, all fragments are discarded and the packet is considered to be lost. 676/10000 · 676
149 ../../protocols/ipv6.rst:499
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Header compression on low bandwidth links 41/10000 · 41
150 ../../protocols/ipv6.rst:501
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Given the size of the IPv6 header, it can cause huge overhead on low bandwidth links, especially when small packets are exchanged such as for Voice over IP applications. In such environments, several techniques can be used to reduce the overhead. A first solution is to use data compression in the datalink layer to compress all the information exchanged [Thomborson1992]_. These techniques are similar to the data compression algorithms used in tools such as :manpage:`compress(1)` or :manpage:`gzip(1)` :rfc:`1951`. They compress streams of bits without taking advantage of the fact that these streams contain IP packets with a known structure. A second solution is to compress the IP and TCP header. These header compression techniques, such as the one defined in :rfc:`5795` take advantage of the redundancy found in successive packets from the same flow to significantly reduce the size of the protocol headers. Another solution is to define a compressed encoding of the IPv6 header that matches the capabilities of the underlying datalink layer :rfc:`4944`. 1063/10000 · 1063
151 ../../protocols/ipv6.rst:503
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The last type of `IPv6 header extension` is the `Routing` header. The ``type 0`` routing header defined in :rfc:`2460` is an example of an IPv6 option that must be processed by some routers. This option is encoded as shown below. 229/10000 · 229
152 ../../protocols/ipv6.rst:509
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The Type 0 routing header (:rfc:`2460`) 39/10000 · 39
153 ../../protocols/ipv6.rst:512
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The type 0 routing option was intended to allow a host to indicate a loose source route that should be followed by a packet by specifying the addresses of some of the routers that must forward this packet. Unfortunately, further work with this routing header, including an entertaining demonstration with scapy_ [BE2007]_ , revealed severe security problems with this routing header. For this reason, loose source routing with the type 0 routing header has been removed from the IPv6 specification :rfc:`5095`. 510/10000 · 510