2. cnp3-ebook
3. principles/network
4. English
5. Zen

65 ../../principles/network.rst:387
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Despite their popularity, `hierarchical addresses` have some drawbacks. Their first drawback is that a lookup in the forwarding table is more complex than when using `flat addresses`. For example, on the Internet, network nodes have to perform a longest-match to forward each packet. This is partially compensated by the reduction in the size of the forwarding tables, but the additional complexity of the lookup operation has been a difficulty to implement hardware support for packet forwarding. A second drawback of the utilization of hierarchical addresses is that when a host connects for the first time to a network, it must contact one router to determine its own address. This requires some packet exchanges between the host and some routers. Furthermore, if a host moves and is attached to another routers, its network address will change. This can be an issue with some mobile hosts. 893/10000 · 893
66 ../../principles/network.rst:390
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Dealing with heterogeneous datalink layers 42/10000 · 42
67 ../../principles/network.rst:392
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Sometimes, the network layer needs to deal with heterogeneous datalink layers. For example, two hosts connected to different datalink layers exchange packets via routers that are using other types of datalink layers. Thanks to the network layer, this exchange of packets is possible provided that each packet can be placed inside a datalink layer frame before being transmitted. If all datalink layers support the same frame size, this is simple. When a node receives a frame, it decapsulates the packet that it contains, checks the header and forwards it, encapsulated inside another frame, to the outgoing interface. Unfortunately, the encapsulation operation is not always possible. Each datalink layer is characterized by the maximum frame size that it supports. Datalink layers typically support frames containing up to a few hundreds or a few thousands of bytes. The maximum frame size that a given datalink layer supports depends on its underlying technology. Unfortunately, most datalink layers support a different maximum frame size. This implies that when a host sends a large packet inside a frame to its nexthop router, there is a risk that this packet will have to traverse a link that is not capable of forwarding the packet inside a single frame. In principle, there are three possibilities to solve this problem. To discuss them, we consider a simple scenario with two hosts connected to a router as shown in the figure below. 1442/10000 · 1442
68 ../../principles/network.rst:411
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Consider in the network above that host `A` wants to send a 900 bytes packet (870 bytes of payload and 30 bytes of header) to host `B` via router `R1`. Host `A` encapsulates this packet inside a single frame. The frame is received by router `R1` which extracts the packet. Router `R1` has three possible options to process this packet. 335/10000 · 335
69 ../../principles/network.rst:413
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The packet is too large and router `R1` cannot forward it to router `R2`. It rejects the packet and sends a control packet back to the source (host `A`) to indicate that it cannot forward packets longer than 500 bytes (minus the packet header). The source could react to this control packet by retransmitting the information in smaller packets. 344/10000 · 344
70 ../../principles/network.rst:415
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The network layer is able to fragment a packet. In our example, the router could fragment the packet in two parts. The first part contains the beginning of the payload and the second the end. There are two possible ways to perform this fragmentation. 250/10000 · 250
71 ../../principles/network.rst:418
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Router `R1` fragments the packet into two fragments before transmitting them to router `R2`. Router `R2` reassembles the two packet fragments in a larger packet before transmitting them on the link towards host `B`. 215/10000 · 215
72 ../../principles/network.rst:420
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Each of the packet fragments is a valid packet that contains a header with the source (host `A`) and destination (host `B`) addresses. When router `R2` receives a packet fragment, it treats this packet as a regular packet and forwards it to its final destination (host `B`). Host `B` reassembles the received fragments. 319/10000 · 319
73 ../../principles/network.rst:423
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — These three solutions have advantages and drawbacks. With the first solution, routers remain simple and do not need to perform any fragmentation operation. This is important when routers are implemented mainly in hardware. However, hosts must be complex since they need to store the packets that they produce if they need to pass through a link that does not support large packets. This increases the buffering required on the hosts. 433/10000 · 433
74 ../../principles/network.rst:425
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Furthermore, a single large packet may potentially need to be retransmitted several times. Consider for example a network similar to the one shown above but with four routers. Assume that the link `R1->R2` supports 1000 bytes packets, link `R2->R3` 800 bytes packets and link `R3->R4` 600 bytes packets. A host attached to `R1` that sends large packet will have to first try 1000 bytes, then 800 bytes and finally 600 bytes. Fortunately, this scenario does not occur very often in practice and this is the reason why this solution is used in real networks. 556/10000 · 556
75 ../../principles/network.rst:427
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Fragmenting packets on a per-link basis, as presented for the second solution, can minimize the transmission overhead since a packet is only fragmented on the links where fragmentation is required. Large packets can continue to be used downstream of a link that only accepts small packets. However, this reduction of the overhead comes with two drawbacks. First, fragmenting packets, potentially on all links, increases the processing time and the buffer requirements on the routers. Second, this solution leads to a longer end-to-end delay since the downstream router has to reassemble all the packet fragments before forwarding the packet. 641/10000 · 641
76 ../../principles/network.rst:429
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The last solution is a compromise between the two others. Routers need to perform fragmentation but they do not need to reassemble packet fragments. Only the hosts need to have buffers to reassemble the received fragments. This solution has a lower end-to-end delay and requires fewer processing time and memory on the routers. 327/10000 · 327
77 ../../principles/network.rst:431
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The first solution to the fragmentation problem presented above suggests the utilization of control packets to inform the source about the reception of a too long packet. This is only one of the functions that are performed by the control protocol in the network layer. Other functions include : 295/10000 · 295
78 ../../principles/network.rst:433
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — sending a control packet back to the source if a packet is received by a router that does not have a valid entry in its forwarding table 136/10000 · 136
79 ../../principles/network.rst:434
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — sending a control packet back to the source if a router detects that a packet is looping inside the network 107/10000 · 107
80 ../../principles/network.rst:435
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — verifying that packets can reach a given destination 52/10000 · 52
81 ../../principles/network.rst:437
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — We will discuss these functions in more details when we will describe the protocols that are used in the network layer of the TCP/IP protocol suite. 148/10000 · 148
82 ../../principles/network.rst:441
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Virtual circuit organization 28/10000 · 28
83 ../../principles/network.rst:444
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The second organization of the network layer, called `virtual circuits`, has been inspired by the organization of telephone networks. Telephone networks have been designed to carry phone calls that usually last a few minutes. Each phone is identified by a telephone number and is attached to a telephone switch. To initiate a phone call, a telephone first needs to send the destination's phone number to its local switch. The switch cooperates with the other switches in the network to create a bi-directional channel between the two telephones through the network. This channel will be used by the two telephones during the lifetime of the call and will be released at the end of the call. Until the 1960s, most of these channels were created manually, by telephone operators, upon request of the caller. Today's telephone networks use automated switches and allow several channels to be carried over the same physical link, but the principles roughly remain the same. 969/10000 · 969
84 ../../principles/network.rst:448
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — In a network using virtual circuits, all hosts are also identified with a network layer address. However, packet forwarding is not performed by looking at the destination address of each packet. With the `virtual circuit` organization, each data packet contains one label [#flabels]_. A label is an integer which is part of the packet header. Routers implement `label switching` to forward `labelled data packet`. Upon reception of a packet, a router consults its `label forwarding table` to find the outgoing interface for this packet. In contrast with the datagram mode, this lookup is very simple. The `label forwarding table` is an array stored in memory and the label of the incoming packet is the index to access this array. This implies that the lookup operation has an `O(1)` complexity in contrast with other packet forwarding techniques. To ensure that on each node the packet label is an index in the `label forwarding table`, each router that forwards a packet replaces the label of the forwarded packet with the label found in the `label forwarding table`. Each entry of the `label forwarding table` contains two pieces of information : 1150/10000 · 1150