RU2631144C1 - Method of routing traffic, having priority class in communication network, including two and more operators - Google Patents

Abstract

FIELD: information technology.

SUBSTANCE: setting the fragment of the communication network area, including N≥2 networks of operators, allocating trusted subscribers served on a given fragment of communication network connected to N≥2 networks of operators, and setting the stored multi-function subscriber terminals (MSTs) having stored IP addresses by the number of connected networks respectively, forming a set M = (m₁, m₂, … m_j, … m_M) traffic routes of traffic having a priority class of service for all subscribers through the established MSTs, determining the shortest route m_j from a plurality of possible ones, forming a network datagram with a sender S_A and recipient S_B address, encapsulating datagram in the "Data" field of new datagram with the address of receiver S_B and the address of output interface of the nearest MST of sender S_Vj on m_j route, repeating the encapsulation action until the datagram is formed with the sender address S_A and the address of input interface of the nearest receiver MST S₁, transmitting generated datagram to the communication channel which is received on MST with the address of input interface S₁ and output S₂, sending a network packet on.

EFFECT: improving network security.

6 dwg

Description

The invention relates to the field of information and telecommunications and can be used to create new, as well as improve existing communication networks with packet switching for efficient transmission with the required level of quality of service priority traffic.

The development of technological progress leads to an increase in the volume and diversity of information flows transmitted over information and telecommunication networks. It should be noted that if earlier a unified telecommunication network (ESE) was designed and built according to a single plan, which was laid down in a long-term program for the formation of a communication system of a country (regions), now a huge number of communication operators have entered the market, each of which is in the process of operating the network Communications modernizes and transforms the existing structure of the ESE in part regarding. At the same time, the networks of operators can be subdivided into sites on a regional basis, such as a district, city, region, or built on other principles.

As a result, a feature of modern infotelecommunication networks belonging to different telecom operators is the mutual intersection and overlapping of their topological structures (Fig. 1).

Under the topological structure we understand the relative position of the elements of the communication network on the ground (Topology-science, the doctrine of the localities. [Dictionary of foreign words that are part of the Russian language. - Chudinov AN, 1910]).

One of the requirements for modern infotelecommunication networks is “multi-operability”, which means the possibility of the participation of several operators in the process of providing a service, as well as ensuring the possibility of equipment operating in a “multi-operator” environment, i.e. an increase in the number of interfaces for connecting several telecom operators to the networks at once [Conceptual provisions for the construction of multiservice networks on the Interconnected Telecommunications Network of Russia, 2001].

Thus, it is possible to provide a certain number of terminal nodes and subscribers located in a given region with information and telecommunication services simultaneously by two or more telecom operators.

It is known that to ensure the information exchange of subscribers in the network, a communication route is selected from the set of possible routes. The structure of message packets is known, as is the principle of packet transmission in IP networks [RFC 791, Internet Protocol, 1981]. When packets pass through the SSOP, it is routed from the source to the recipient in accordance with the address information in the packet header [GOST R ISO / IEC 7498-1-99 “Information technology. Interconnection of open systems. The basic reference model. Part 1. The basic model ”, p. 13]. To choose a route for transmitting messages means to determine the sequence of transit nodes of the network through which messages must be transmitted in order to deliver them to the addressee [Olifer V.G., Olifer N.A. Computer networks. Principles, technologies, protocols, studies. for universities, 2-ed .; - St. Petersburg: Peter, 2003, p. 497]. QoS routing is a packet routing mechanism that takes into account the requirements of traffic flows for quality of service and selects a route depending on the availability of network resources.

However, a problem may arise when there are no routes, namely, when the telecom operator at the stage of admitting traffic for transmission detects a failure to choose a route caused by insufficient resources in the logical structure of the information direction, or when traffic transmission on all possible routes does not satisfy the requirements for a given QoS service quality.

With the development of modern telecommunication technologies, the growth of multimedia traffic (voice over the Internet (VoIP), facsimile services, teleconferencing, video conferencing, video on demand (VoD), etc.) transmitted over communication networks, taking into account the potential lack of communication system resources general use (SSOP), the issue of guaranteed quality of service in IP networks is becoming one of the most difficult. However, the delivery quality in traditional IP networks is based on the principle of "first-in, first-out" (first-in, first-out - FIFO). Obviously, this approach to service means that there are no differences between different types of traffic, there is no guarantee that the packages will be delivered in the correct order, and that it will be delivered at the right time or will be delivered at all. Difficulties arise with a high degree of congestion of the IP network, when the delay time increases exponentially with excessive aggregation of traffic in individual sections, which act as bottlenecks and limit the data transfer rate. In order to support voice, video, and application data traffic with different bandwidth requirements, IP network core systems should be able to differentiate and serve different types of network traffic depending on the requirements. To solve the problem described above, the concept of quality of service (QoS) in IP networks was introduced. Protocols and mechanisms to support the quality of service in IP networks are divided into two categories depending on the level of guarantees of the service provided [Quality of service in IP networks: Per. from English - M .: Publishing house "William", 2003. - pp. 21-22]:

The first category includes mechanisms for the provision of integrated services (Integrated Services - intserv) and involves the provision of guaranteed services by reserving network resources in order to meet specific service requirements from traffic flows. In accordance with the guaranteed service, preliminary reservation of network resources is carried out along the entire traffic promotion route. However, reserving resources along the entire route of individual traffic flows is difficult to implement on the scale of the Internet backbone, serving thousands of data flows at a particular time. In order to satisfy such requirements for guaranteed service, the network must have a certain reserve of resources.

The second category includes Differentiated Services (diffserv) mechanisms. Differentiated service involves the division of traffic into classes based on quality of service requirements. It should be noted that differentiated service in itself does not imply guaranteeing the services provided. In accordance with this scheme, traffic is divided into classes, each of which has its own priority. Data packets are marked for sending in accordance with the priority requested by the user, and transmit them in a special priority order, i.e. data packets marked as having high priority are transmitted preferably with respect to data packets marked as having low priority. However, in this case, data packets having the same high priority are still involved in transmission competition.

Thus, a contradiction arises between the requirement to provide guaranteed priority-class traffic service and existing methods of routing traffic in a communication network. To eliminate this contradiction, the claimed method is directed.

An analysis of the prior art has shown that there are currently a number of solutions designed to provide guaranteed data transfer with a quality of service QoS in IP networks.

The well-known "Method and system for promoting traffic flows with guaranteed quality of service (QoS) in a network operating with IP protocol" according to the patent of the Russian Federation No. 2271614, class. H04L 12/28, published on March 10, 2006. A well-known method is that the choice of a delivery route for packets in communication networks is performed by the delivery network resource managers at the level of the transmission channel control, similarly to the functions for services that require guaranteed quality of QoS service. To pass traffic flows according to the path designated by the resource manager in the delivery network, the border routers are monitored in accordance with the busy conditions of network resources. At the same time, the paths of the flows are assigned using the technology of a multi-level label stack.

The disadvantage of this method is the lack of guaranteed service priority-class traffic in conditions of insufficient network resources.

The known method of "Limiting traffic for a network with transmission with quality levels" according to the patent of the Russian Federation No. 2299516, class. H04L 12/56, published May 20, 2007. A known method is to restrict network traffic for efficiently transmitting at least one priority class of data packets with QoS quality of service, in which for a group of data packets transmitted over the network one priority class validation checks are carried out, validity checks include a validity check related to network entry and exit, transmission of a group of data packets with the required priority class is allowed only if Verki admissibility have a positive result and a negative result when the admissibility checks the data packet or group deflect perform transmission with a lower priority or without assigning priority.

The disadvantage of this method is the lack of the possibility of guaranteed promotion of priority traffic with the required level of quality of service QoS.

Closest in its technical essence to the declared one is “A method of sending traffic having a predefined category of data transmission service to a connectionless network”, RF patent No. 2358398, cl. H04L 12/56 published on June 10, 2009

The essence of the prototype method is that the method comprises the steps of designating a main route for traffic, while the main route quickly connects the source location to the destination location, while the main route is determined among the many possible traffic routes, based on the fact that the transmission traffic from the source location to the location of the destination does not exceed the specified maximum delay for data transmission, and an alternative route for traffic is assigned, while alternative an explicit route is chosen based on the fact that an alternative route does not exceed a specified maximum delay and is used when the main route is not available to him.

The disadvantage of the prototype method is the lack of guaranteed service priority-class traffic with the required level of QoS quality of service in conditions of insufficient network resources.

The technical result of the claimed invention is the provision of guaranteed priority traffic service in a communication network with packet switching comprising two or more operators by increasing network connectivity.

The technical result is achieved by the fact that in the known method of routing traffic having a priority class in a communication network including two or more operators, it consists in determining a plurality of possible routes for traffic, based on the fact that traffic is transmitted from the original location to the location destination does not exceed the specified maximum delay for data transfer, determine the shortest route from the source location to the location of the destination from the set of possible march ut, assign the shortest route as the main route for traffic transfer, allow the traffic flow to move along the main route, while the admission stage includes confirmation that sufficient network resource is available on the main route to forward the traffic stream along with it, the initial data, the area of a fragment of the communication network, the composition of the communication network, including N≥2 networks of telecom operators, QoS quality of service parameters, information about the subscribers served, form the structural and topological th scheme of a given fragment of the communication network, select trusted subscribers served on a given fragment of the communication network, connected to N≥2 networks of operators, remember which of the N networks allocated dedicated trusted subscribers are connected to, and install multifunctional subscriber terminals in the stored trusted subscribers (MAT ) having the IP address by the number of connected networks, respectively, form a list of addresses S _1, S _2, S ₃ ... MAT trusted subscribers generating a plurality of M = (m _1, m _{2, ... m j, ... m M} ) about alternative routes Vision traffic having a priority class of service for all data lines between the served subscribers through set MAT trusted subscribers performing transit functions for prioritizing traffic in a sequence of addresses MAT trusted subscribers transmission path network datagram m _j = (S _1, S _2, ... S _k , ... S _Vj ), where V _j is the number of the MAT output interface of the last trusted subscriber on the j-th transmission route. The generated alternative routes are stored in the array of routes M. They receive a request from a subscriber for a service that requires a guaranteed quality of QoS service to transmit priority traffic and determine the addresses of subscribers of the sender S _A and recipient S _B , as well as the parameters of the requested QoS service. Check the routes for the information direction between subscribers S _A and S _B from the set M = (m ₁ , m ₂ , ... m _j , ... m _M ), based on the fact that the transmission of traffic along these routes meets the requirements for QoS quality of service, when the communication operator at the stage of admitting traffic for transmission detects a failure to select the main route caused by insufficient resources in the logical structure of the information direction, or when the transmission of traffic on all possible routes does not satisfy the requirements for the specified quality of QoS service. The shortest alternative route m _{j is} determined, where j = 1, 2, 3, ..., is the route number from the set M, and the shortest route is defined as the route with the least number of transit MATs located between the priority subscribers S _A and S _B. A network datagram D _{i is formed} , where i = 1, 2, ..., at the initial stage in the header of which the addresses of the sender S _A and recipient S _B are indicated; for this, the original datagram is encapsulated in the Data field of the new datagram with the address of the recipient in the header S _B and the address of the output interface of the sender S _Vj nearest to it on the m _j route of traffic movement. The steps to encapsulate the received datagram in the “Data” field of the new datagram are repeated until the sender address S _A and the address of the input interface of the closest MAT receiver S ₁ along the m _j traffic advance route are in the header of the generated datagram D _i . In the “Options” field of datagram D _{i the} address of the sender S _A , the address of the recipient S _B and the number of the selected j-th alternative traffic route are written down and the generated datagram D _i is transmitted to the communication channel, which is received at the nearest MAT having network addresses of the input interface S ₁ and S ₂ output interface. The address of the sender S _A , the address of the receiver S _B and the number of the j-th traffic route are read from the “Options” field of the received datagram. Compare by comparing the values of the "Options" field of the received datagram D _i with the values available in the route array M, if no match with the data of the route-address table is found, then the packet is transmitted for processing as it arrived at the destination, if a match is found, then send the network packet to decapsulation to obtain encapsulated data. The header of the embedded IP datagram is read with the sender address S _{2 of the} output interface MAT and the recipient address S _{k of the} input interface following MAT along the transmission path m _j and the datagram D _i with a new header is transmitted to the communication channel from the output interface of the MAT with the network address S ₂ to the next Trusted Subscriber MAT on the m _j traffic promotion route. The steps of receiving, transmitting, decapsulating the datagram D _i on each of the MAT trusted subscribers are repeated in accordance with the generated alternative m _j traffic promotion route until the traffic reaches the destination node on which the network datagram D _{i is} received with the recipient address S _B and sender address _{V Vj} . Decapsulation is performed and a datagram is received with the address of the sender S _A and the address of the recipient S _B , after which the packet is transmitted for processing as it arrived at the addressee.

The analysis of the prior art made it possible to establish that analogues that are characterized by a combination of features identical to all the features of the claimed method are absent, which indicates the compliance of the claimed method with the condition of patentability "novelty". Search results for known solutions in this and related fields of technology in order to identify features that match the distinctive features of the claimed object from the prototype showed that they do not follow explicitly from the prior art.

The prior art also did not reveal the popularity of the impact provided by the essential features of the claimed invention, the transformations on the achievement of the specified technical result. Therefore, the claimed invention meets the condition of patentability "inventive step".

The claimed method is illustrated by drawings, which show:

in FIG. 1 - options for the topological placement of communication networks belonging to various telecom operators;

in FIG. 2 is a diagram explaining the construction of the considered telecommunication network;

in FIG. 3 is an algorithm of a method for routing traffic having a priority class in a communication network including two or more operators;

in FIG. 4 is an example of a record in the route-address table;

in FIG. 5 is a diagram explaining a procedure for generating a header of a network datagram;

in FIG. 6 is a diagram explaining a routing order of priority traffic in a network.

The implementation of the claimed method can be illustrated by the example of a fragment of the construction of the IP network shown in FIG. 2.

As an IP network, a fragment of a public communication network 1 is considered, consisting of the networks of telecommunication operators 3.1-3.7, a trunk network 2, including transit 2.1 ₁ -2.1 ₇ and trunk 2.2 ₁ -2.2 ₁₄ routers. Operator networks include routers 3.1.2 ₁ -3.7.2 ₃ . All listed network elements are connected by physical communication lines. Through access networks, subscriber telecommunication terminals 4.1-4.3 are connected to border routers 3.1.1, 3.3.1, 3.5.1 of the networks of operators 3.1, 3.3 and 3.5, which provide information and telecommunication services. Each network element has an identifier in the form of a network IP address.

In FIG. 3 is a flowchart illustrating an algorithm for a traffic routing method having a priority class in a communication network including two or more operators.

The proposed algorithm is implemented as follows:

Initially, the initial data is set: the area of the communication network fragment, the composition of the communication network including two or more networks of communication operators, QoS quality of service parameters, information about the subscribers served on a given fragment of the communication network, including the following data: IP addresses of terminal subscriber terminals, as well as which operator’s communication networks are connected (bl. 1).

At the beginning of the work, a structural-topological diagram of a given fragment of the communication network is formed (bl. 2). Allocate trusted subscribers served on a given fragment of the communication network, connected to two or more networks of operators (bl. 3) and remember which of the N networks are allocated dedicated trusted subscribers (bl. 4). Trusted subscribers install multifunctional subscriber terminals (MAT) with IP addresses according to the number of connected networks, respectively (bl. 5).

A multifunctional subscriber terminal (MAT) is a computer gateway that has several network interfaces connected to communication networks of different operators, which receives, transmits and processes information, and is also configured to perform routing functions.

Form a list of IP addresses S ₁ , S ₂ , S ₃ ... MAT trusted subscribers.

A set of M = (m ₁ , m ₂ , ... m _j , ... m _M ) alternative routes of traffic promotion having a priority service class for all information directions between served subscribers is formed, through trusted subscribers performing MAT functions for priority traffic established by MAT, in the form the sequence of IP addresses of MAT trusted subscribers on the transmission path of the network datagram m _j = (S ₁ , S ₂ , ... S _k , ... S _Vj ), where V _j is the number of the MAT output interface of the last trusted subscriber on the j-th transmission route (bl. 6) who remember ayut in array M Route (bl. 7). The array of routes M has the form of a route-address table available on each MAT, in which a pair of served subscribers indicate available alternative routes and their numbers. In FIG. Figure 4 shows an example of a route-address table that has a record of all generated alternative transmission routes for network datagrams for a pair of subscribers with IP addresses S _A and S _B.

Receive from the subscriber a request for a service that requires a guaranteed quality of QoS service for the transmission of priority traffic (bloc 8) and determine the IP addresses of the subscribers of the sender S _A and recipient S _B , as well as the parameters of the requested QoS service (bloc 9).

The set of possible routes for traffic from the sender to the recipient is determined (bl. 10), based on the fact that the transmission of traffic meets the QoS quality of service requirements, and then the shortest route is determined from the set of possible, while the shortest route is determined as a route with the smallest number of transit routing nodes located between the source location and the destination location. Assign the shortest route main.

Allow traffic flow to move along the main route.

In block 11, it is checked that the conditions for admitting the traffic flow to advance along the main route are fulfilled, and the admission step includes confirmation that sufficient network resource is available on the main route to forward the traffic flow through it.

If the condition is not met, then go to block 13. In block 13, the traffic flow is advanced to the next routing node and then in accordance with the generated route until the traffic reaches the destination subscriber terminal. If there are no routes, namely, when the telecom operator at the stage of admitting traffic for transmission detects a failure in route selection caused by insufficient resources in the logical structure of the information direction, or when traffic transmission on all possible routes does not satisfy the requirements for the specified quality of QoS service, then to block 12.

Check the routes for the information direction between subscribers with IP addresses S _A and S _B from the set M = (m ₁ , m ₂ , ... m _j , ... m _M ) (bl. 12), based on the fact that traffic is transmitted on these routes meets QoS quality of service requirements. The shortest alternative route m _{j is} determined, where j = 1, 2, 3, ..., is the route number from the set M (Bl. 14), while the shortest route is defined as the route with the least number of transit MATs between subscribers with IP addresses S _A and S _B.

Depending on the number of transit MATs of trusted subscribers, a network datagram D _{i is} formed on the priority traffic route, where i = 1, 2, ..., using the well-known IP-in-IP encapsulation method. [RFC 2003 IP Encapsulation within IP]. Using this method, an IP datagram can be encapsulated (transmitted as data) in another IP datagram. Encapsulation is proposed as a way to change the usual IP routing for datagrams by delivering them to an intermediate host, which otherwise cannot be selected based on the (network part) recipient address in the original IP header.

In FIG. 5, the procedure for generating a network datagram when transmitting on a route m _j including two trusted MAT 4.2 and 4.3 is explained. The actions to form a network datagram are performed on the sender node. The first packet P1 is starting, the title of which 4 are indicated IP address of the sender and the recipient S _A S _B (bl. 15). At the first stage, when forming a network datagram (second packet P2), the datagram (A1) is encapsulated in the "Data" field of the new datagram with the header 3, the IP address of the recipient S _B and the IP address of the sender S ₄ - in this example, which is IP the address of the output interface of the nearest trusted subscriber MAT 4.3 along the route m ₁ traffic promotion (bl. 16).

At the second stage, during the formation of the network datagram (third packet P3), the received datagram (P2) is encapsulated in the Data field of the new datagram with header 2 including the recipient IP address S ₃ (input interface MAT 4.3) and the sender IP address S ₂ ( output interface MAT 4.2). At the last stage, during the formation of the network datagram (fourth packet P4), the received datagram P3 is encapsulated in the Data field of the new datagram with heading 1, including the IP address of the receiver S ₁ (input interface MAT 4.2) and the IP address of the sender S _A (bl. 17, 18).

In addition, in block 19, the sender IP address S _A , recipient IP address S _B and the number of the selected j-th alternative traffic route are recorded in the “Options” field of the network datagram D _i . The Options field is optional and has a variable length. Option support should be implemented in all IP modules (nodes and routers) [RFC 791, Internet Protocol, 1981]. The procedure for transmitting a network datagram from a subscriber with an IP address S _A to a subscriber with an IP address S _B in the claimed method is illustrated in FIG. 6.

In block 20, the generated datagram D _i is transmitted to the communication channel to the nearest MAT 4.2 of the trusted subscriber along the transmission route m _j . They accept a network datagram on the input interface of the nearest MAT 4.2, while its input interface will be the interface with IP address S ₁ , and the output interface with IP address S ₂ .

Upon receipt of a network datagram on a trusted MAT 4.2 at the recipient address S _1, the sender IP address S _A , the recipient IP address S _B and the number of the j-th traffic route (block 21) are read from the Options field and compared by comparing the value of the field “ Options ”of the received datagram D _i with the values available in the array of routes M (bl. 22). If no record for this packet is found in the routing-address table, then the packet is sent for processing as it has arrived to the addressee and go to block 27. If the packet matches, the network packet is sent for decapsulation to obtain encapsulated data (block 23). The header of the attached datagram is read with the IP address of the sender S ₂ and the recipient IP address S _{3 of the} input interface following MAT 4.3 along the transmission route m _j (bl. 24) and the datagram D _i with a new header is transmitted to the communication channel from the output interface of MAT 4.2 s IP address S ₂ to the next MAT 4.3 trusted subscriber via m _j traffic promotion route.

The network datagram is promoted in accordance with route m _j , repeating the actions of receiving, transmitting, decapsulating the datagram D _i on each of the MAT trusted subscribers until the traffic reaches the destination node.

At the destination node, along the route of advancement of the datagram, a network datagram D _{i is} received with the IP address of the recipient S _B and the IP address of the sender S _Vj (in this case, S ₄ ) (block 25). Decapsulation is performed and a datagram is received with the IP address of the sender S _A and the IP address of the recipient S _B (bl. 26), after which the packet is transmitted for processing as it came to the addressee (bl. 27).

Thus, in the proposed method in the conditions of insufficient network resources due to the formation of new routes for traffic transmission and bypassing bottlenecks in the network through the established MAT of trusted subscribers, guaranteed priority traffic is provided in the telecommunication network, including two or more operators.

Claims (1)

A method of routing traffic having a priority class in a communication network including two or more operators, which consists in determining the set of possible routes for traffic, based on the fact that the transmission of traffic from the source location to the destination location does not exceed a specified maximum delay for transmission data, determine the shortest route from the source location to the destination location from the set of possible routes, designate the main route for transmitting traffic with The shortest route allows traffic flow to advance along the main route, while the admission stage includes confirmation that sufficient network resource is available on the main route to forward a traffic stream along it, characterized in that the initial data and the fragment area are additionally specified communication network, the composition of the communication network, including N≥2 networks of telecom operators, QoS quality of service parameters, information about the subscribers served, form the structural and topological diagram of a given fragment of the network ides, select trusted subscribers served on a given fragment of the communication network, connected to N≥2 networks of operators, remember which of the N networks the dedicated trusted subscribers are connected to at the same time, install multifunctional subscriber terminals (MAT) with trusted IP addresses in number connected networks, respectively, form a list of addresses S _1, S _2, S ₃ ... MAT trusted subscribers generating a plurality of M = (m _1, m _{2, ... m j, ... m M} ) of alternative routes traffic promotion having the priority class obsl zhivaniya for all data lines between the served subscribers through set MAT trusted subscribers performing transit functions as a series of addresses MAT trusted subscriber to the transfer of network datagram m _j = (S _1, S _{2, ... S k, ... S Vj} ), where V _j is the number of the output interface of the MAT of the last trusted subscriber on the j-th transmission route, remember the generated alternative routes in the array of routes M, receive from the subscriber a request for a service that requires a guaranteed quality of QoS service for transmission after the priority traffic, determine the addresses of the subscribers of the sender S _A and the recipient S _B , as well as the parameters of the requested QoS service, check the routes for the information direction between subscribers S _A and S _B from the set M = (m ₁ , m ₂ , ... m _j , ... m _m), based on the fact that the transfer of traffic on these routes meets the requirements for QoS quality of service, when the operator at the stage of admission for traffic transmission detects a failure in the selection of the main route, caused by the lack of resources in the logical topology information guide Niya, or when traffic transmission on all possible routes do not meet the requirements for a given quality of service QoS, determine the shortest m _j alternate route, where j = 1, 2, 3, ..., - the route number of the set M, with the shortest the route is defined as the route with the smallest number of transit MATs between subscribers S _A and S _B , form a network datagram D _i , where i = 1, 2, ..., at the initial stage the header of which indicates the addresses of the sender S _A and recipient S _B , perform encapsulation of the original datagram in the field "D data ”of the new datagram, indicating in the header the address of the recipient S _B and the address of the output interface of the sender S _Vj closest to it along the m _j traffic advancement route, repeat the steps to encapsulate the received datagram in the“ Data ”field of the new datagram until the header formed datagram D _i will S _a sender address and the address input interface nearest thereto MAT recipient S ₁ through m _j route traffic promotion is recorded in the "Options" datagram D _i S _a sender's address, destination address, and S _B SELECT number nnogo j-WASTE alternative route traffic progress, transmitting the generated datagram D _i to the communication channel that is received at the nearest MAbs having network addresses S _1, the input interface and output interface S ₂ is read from the field "Option" received datagram address of the sender S _{A, The} recipient's address S and the number of j-route traffic promotion are compared by comparing the value of the field "Options" datagrams received D _i with the values available in an array of routes M if the data matches with route-address table not found o, then the packet is transmitted to the processing as coming sent if a match found, then send a network packet on the decapsulation to obtain the encapsulated data is read header nested datagram IP address of the sender S ₂ output interface AIT and destination address S _k input interface, the following Mabs by route of transmission m _j, D _i is transmitted datagram header with a new communication channel with a MAT output interface with the network address ₂ to the next S MAT trusted subscriber by m _j route traffic promotion repeated dis Via reception, transmission, decapsulation datagram D _i for each of the MAbs trusted subscribers in accordance with the generated alternative m _j route traffic promotion up until the traffic reaches destination node, receiving network datagram D _i with the destination address S _B and the location of the sender S _Vj at the destination node, they perform decapsulation and receive a datagram with the address of the sender S _A and the address of the recipient S _B , after which the packet is transmitted for processing as it arrived at the destination.

Images