# Customer-Oriented Quality of Service Management Method for the Future Intent-Based Networking
## 3 A Description of the Proposed Customer-Oriented Quality of Service Management Method for IBN
### Flow Routing Techniques with Load Balancing for Future IBN  
As mentioned earlier, the routing table contains several routes to each network, of course, if any. The purpose of this is to improve the process of servicing the network. To date, almost all networks are multiservice. Each type of service has its own dimensions and indicators of \"quality\" perception of network service. First of all, network traffic is divided into two types: Sensitive and Insensitive to delays. Accordingly, at the transport OSI models' level, they are provided with appropriate protocols. Services that require real-time service are typically served by a UDP. Services requiring guaranteed packet delivery are served by a TCP (Transmission Control Protocol). UDP (User Datagram Protocol) is one of the protocols in the TCP/IP stack. From the TCP protocol, it differs in that it works without establishing a connection. UDP is one of the easiest transport layer protocols in the OSI model that executes messaging (datagrams) without confirmation and delivery guarantee. When using the UDP protocol, the responsibility for processing errors and retransmission is based on the protocol level above. However, despite all the disadvantages, the UDP protocol is effective for servers that send small responses to a large number of customers. For services serviced by UDP, lost packets will not be re-sent. For example, when watching a video in real-time (different streaming), if several packets are lost for the customer, it will not be interesting to display them later. In this case, they will only interfere. When using TCP, the situation looks the opposite. It is important for customers when they, for example, want to download an image from a remote server that it is identical. Therefore, in this case, when a certain number of packets are lost, their re-transmission will take place. Based on these data, it is proposed to divide the network traffic service according to the used transport protocol. For example, when there are several routes from Network A to Network B, real-time traffic is transmitted by a path that provides the least delay; traffic that requires guaranteed shipping and is less prone to delays--the least downloaded route. An example of route selection is shown in Figure 15.  
It is also proposed to implement the essence of the balancer, which would split the load of one port to the entire network. The algorithm of the balancer is shown in Figure 16.  
When packet routing, we take into account the route loading, which changes when adding new packets. When the change is made, for example, 20% of the initial load (may be displayed with the selection of the best value), switches to another route (if any), and therefore, cyclically, when the load deltas are reached on each route. Figure 14: Decision-making algorithm for a new request. Working Principle of the New Customer-Oriented Quality Management Method in Traditional and IBN Networks  
When packets are transmitted by the network in the case of network overload, the packets will be immediately served as soon as they arrive. Queues for waiting services will be formed only with the increase in the intensity of sending, or the increase in customers. In the first case, it makes no sense to upgrade, since all packets will be served without delays. The proposed method will be effective in queuing maintenance. It is suggested to wait some time for packets to form a queue. If the queue was based on the number of packets, there could be an option that the new packets, with a free network, will wait a long time, which will lead to fatal delays. Figure 16: The network load balancing technique. Figure 15: Packet routing decision-making according to the used transport protocol. In the case of waiting for a certain time, this problem disappears. The main point is that with a large queue, waiting time for a queue set will be less than the processing time of all packets. The basic idea is to sort the packets in the queue for servicing on certain parameters.