Message forwarding method of network layer supporting path conversion

Abstract

The invention provides a message forwarding method for a network layer to support path transformation, which comprises the following steps that: a sending end sends a data message to a network, and fields carried by the header of the data message comprise a receiving end identifier, a path transformation flag bit and a path transformation parameter; after receiving a data message, a network node with the path conversion capability detects a destination address of the message and a path conversion flag bit of a head, and for the data message of which the destination address is the address of the node and the flag bit indicates to use path conversion, a next-hop candidate node random selection algorithm is used to select the path conversion data message; and selecting a network node or a receiving end with path conversion capability as a next-hop node, modifying the destination address of the data message into the network address of the next-hop node, modifying the source address of the data message into the network address of the current node, and forwarding the message. The method has the advantages that the data routing cannot be predicted in advance through the random variable path, the data stealing difficulty of an attacker can be increased, and the anti-attack capability of the network is improved.

Description

Technical Field

[0001] The present application belongs to the field of information security technology in a network environment, and specifically relates to a message forwarding method supporting path transformation at the network layer. Background Art

[0002] While Internet technology brings abundant network resources, it also has prominent security issues. People may inadvertently leave their personal privacy when surfing the Internet, and various privacy leaks have caused serious consequences such as personal economic and property losses. Currently, the Internet adopts deterministic routing, which leads to many defects:

[0003] Fixed routing path: Deterministic routing selects a fixed routing path when transmitting data. However, this path selection method may become unreliable due to network congestion, failures, or attacks. Once a fixed routing path has problems, data transmission will be affected, and may even cause data loss or delay.

[0004] Lack of dynamic adaptability: Deterministic routing lacks dynamic adaptability to network conditions. When the network environment changes, such as network congestion, link failure, etc., the deterministic routing method cannot be dynamically adjusted according to the actual situation and cannot optimize the data transmission path.

[0005] Security issues: Deterministic routing may cause security issues. Since the data transmission path is fixed, attackers can more easily predict the data transmission path and launch attacks against the path, such as man-in-the-middle attacks and traffic analysis attacks. Data routing can be predicted or locked in advance, making it easy for attackers to intercept confidential information during the data routing process.

[0006] Difficulty in achieving load balancing: Deterministic routing methods are difficult to achieve load balancing and cannot effectively distribute data traffic to different paths, resulting in some paths being overloaded while other paths may be idle.

[0007] Traditionally, key protocols are used to encrypt data packets to protect data content. However, with the advent of supercomputers, password cracking has become possible, and technologies such as traditional end-to-end encryption can no longer meet higher communication needs.

[0008] Therefore, how to achieve efficient and secure data transmission is an urgent problem to be solved. It is of great significance for protecting user data and identity privacy and improving the anti-attack capability of network communications. Summary of the invention

[0009] The purpose of this application is to overcome the defect that the security of user data and identity information is difficult to ensure during existing network transmission.

[0010] In order to achieve the above-mentioned purpose, the present application proposes a message forwarding method supporting path transformation at the network layer, involving a network consisting of a sending end, a receiving end and a network node with path transformation capability;

[0011] The network adopts an architecture in which identification and address are separated, uses an identifier that is unrelated to the network address to uniquely identify the receiving end, and uses a resolution system to maintain a mapping relationship between the receiving end identifier and the receiving end network address;

[0012] The network nodes that carry message forwarding include: network routing switching nodes and network nodes with path transformation capabilities;

[0013] The method comprises:

[0014] The sending end sends a data message to the network, and the fields carried in the data message header include: a receiving end identifier, a path change flag bit and a path change parameter;

[0015] After receiving a data message, the network node with path transformation capability detects the destination address of the message and the path transformation flag in the header. For a data message whose destination address is the address of this node and whose flag indicates the use of path transformation, a next-hop candidate node random selection algorithm is used to select a network node or a receiving end with path transformation capability as the next-hop node, modify the destination address of the data message to the network address of the next-hop node, modify the source address to the network address of the current node, and forward the message.

[0016] As an improvement of the above method, the sending end sends a data message to the network, and when using the path transformation capability, specifies a network node with the path transformation capability as a network entry node.

[0017] As an improvement of the above method, the network node with path transformation capability supports the following functions:

[0018] Support network routing switching node function;

[0019] Supports the function of reading, filling and modifying some fields of the data message header; the said some fields include: destination address and path transformation parameters;

[0020] Supports maintenance of next-hop node candidate set and selection of next-hop forwarding node;

[0021] Support sending registration, deregistration and resolution requests to the resolution system;

[0022] Supports independent networking and mixed networking with network routing and switching nodes.

[0023] As an improvement of the above method, the resolution system provides registration, deregistration and resolution services for identifier-to-network address mapping records.

[0024] As an improvement of the above method, the next hop node candidate set includes a neighborhood network node set and a receiving end;

[0025] The neighborhood network node set is selected from network nodes having path transformation capability using a screening method;

[0026] The screening methods include: random selection and service level selection based on the resolution system;

[0027] The network node with path transformation capability locally maintains the network address of the network node in the neighborhood network node set;

[0028] The receiving end network address uses the receiving end identifier in the data message header and is resolved using a resolution system.

[0029] As an improvement of the above method, the next hop candidate node random selection algorithm guides each data message to randomly select a node from the next hop candidate node set as the next hop node on the basis of ensuring that the transmission between the sending end and the receiving end is reachable;

[0030] The random selection algorithm for the next-hop candidate node includes: an equal-probability random algorithm, an unequal-probability random algorithm, or a random walk algorithm with a maximum hop number limit.

[0031] As an improvement of the above method, the path change flag is used to identify whether to use the path change service.

[0032] As an improvement of the above method, the path transformation parameter is a parameter required by the next-hop candidate node random selection algorithm to assist in the selection of the next-hop node;

[0033] The path change parameters include: the number of remaining hops of random walk TTL and the random number seed used for the random algorithm;

[0034] The path transformation parameters are filled in, read and modified by the network nodes.

[0035] As an improvement of the above method, the process of forwarding a message by the network node having the path transformation capability includes:

[0036] Step 1: After receiving the data packet, match the destination address and the path change flag to determine whether to use the path change service; if the match is successful, go to step 2; otherwise, do not process and forward the data packet until the receiving end receives the data packet, and the process ends;

[0037] Step 2: Based on the next-hop candidate node random selection algorithm, select the next-hop node from the next-hop node candidate set. If the next-hop node is a network node, go to step 3; otherwise, the next-hop node is a receiving end, go to step 4;

[0038] Step 3: Modify the destination address of the data message header to the network address of the selected network node, modify the source address to the network address of the current network node, forward the data packet, and go to step 1;

[0039] Step 4: Obtain the network address based on the receiving end identifier resolution, modify the destination address in the data message header to the receiving end network address, modify the source address to the network address of the current node, set the path change flag to disable the service, and forward the data packet until the receiving end receives the data packet, and the process ends.

[0040] Compared with the prior art, the advantages of this application are:

[0041] The present application provides a message forwarding method that supports path change at the network layer. By randomly changing the path, data routing cannot be predicted in advance, which can increase the difficulty for attackers to steal data and improve the network's anti-attack capability. BRIEF DESCRIPTION OF THE DRAWINGS

[0042] Figure 1 The figure shows a flow chart of a message forwarding method supporting path transformation at the network layer;

[0043] Figure 2 The figure shows a schematic diagram of the network structure of the path transformation embodiment;

[0044] Figure 3 Shown is a communication flow chart of a path change embodiment;

[0045] Figure 4 The figure shows a schematic diagram of the algorithm based on the random walk / maximum hop number limitation method. DETAILED DESCRIPTION

[0046] The technical solution of the present application is described in detail below with reference to the accompanying drawings.

[0047] In order to ensure the security of user data in network communications, in addition to encrypting data, transmitting data by path change is also an important way to improve security. By randomly changing the next hop path of the data packet, the data route cannot be predicted in advance, which can increase the difficulty for attackers to steal data and improve the network's anti-attack ability.

[0048] In order to overcome the problem that the security of user data and identity information is difficult to ensure during existing network transmission, this application proposes a message forwarding method that supports path transformation at the network layer. Through the path transformation method, the next hop node of each data packet is randomly selected at each path transformation network node, and the network address information in the data packet is modified, so that the data route cannot be predicted in advance, and the relevance of the communication end is hidden. It can increase the difficulty for attackers to steal data and improve the network's anti-attack ability.

[0049] The network layer provided in the present application supports a message forwarding method for path transformation, which involves a network consisting of a data sending end, a receiving end, and network nodes with path transformation capabilities.

[0050] The network adopts an architecture that separates identification from address, uses an identifier that is unrelated to the network address to uniquely identify the receiving end, and uses a resolution system to maintain the mapping relationship between the receiving end identifier and the receiving end network address;

[0051] The network nodes that carry out message forwarding include: IP network routing switching nodes and network nodes with path transformation capabilities.

[0052] The resolution system is a system that maintains the mapping relationship between network addresses and identifiers and can provide registration, deregistration and resolution services for identifier-to-network address mapping records.

[0053] like Figure 1 As shown, the process of the message forwarding method in which the network layer supports path transformation includes:

[0054] Step 1: The sender sends a data message. The data sender sends a data message to the network. The fields carried in the data message header include: a receiver identifier, a path change flag, and a path change parameter.

[0055] When the data sender sends a data message to the network, if the path transformation capability is used, a network node with path transformation capability must be designated as the network access node.

[0056] Step 2: The network node forwards the data message; after receiving the data message, the network node with path transformation capability detects the destination address of the message and the path transformation flag in the header; for the data message whose destination address is the address of this node and the flag indicates the use of path transformation, the next-hop candidate node random selection algorithm is used to select a network node or receiving end with path transformation capability as the next-hop node, and the destination address of the data message is modified to the network address of the next-hop node, the source address is modified to the network address of the current node, and the message is forwarded.

[0057] The path change flag indicates whether to use the path change service. A value of 1 indicates that path change is used, and a value of 0 indicates that path change is not used.

[0058] A network node with path transformation capability has the following functions:

[0059] 1. Possess the function of IP network routing switching node;

[0060] 2. Ability to read, fill in and modify some fields in the data message header, including destination address and path transformation parameters;

[0061] Path transformation parameters are related parameters required by the next-hop candidate node random selection algorithm to assist in the selection of the next-hop node; path transformation parameters include: random walk remaining hop number TTL, and random number seed used for the random algorithm; path transformation parameters are filled in, read and modified by network nodes.

[0062] 3. Support the maintenance of the next-hop node candidate set and the selection of the next-hop forwarding node;

[0063] The next hop node candidate set is composed of a neighborhood network node set and a receiving end; the neighborhood network node set is selected from network nodes with path transformation capabilities using a screening method; the screening methods include: random selection and service level selection based on a resolution system; the network node locally needs to maintain the network addresses of the nodes in the neighborhood network node set; the receiving end network address uses the receiving end identifier in the data message header, which is resolved using a resolution system.

[0064] 4. Support sending registration, deregistration and resolution requests to the resolution system;

[0065] 5. Supports independent networking and mixed networking with IP network routing and switching nodes.

[0066] The process of forwarding data packets in a network that supports path switching includes the following steps:

[0067] Step 1: The data sender sends a data message to the network. The message header includes a receiver identifier, a path change flag, and a path change parameter.

[0068] Step 2: After receiving the data packet, the network node with path change capability matches the destination address and the path change flag to determine whether to use the path change service. If the match is successful, go to step 3; otherwise, do not process and forward the data packet until the receiving end receives the data packet, and the process ends;

[0069] Step 3: The network node selects a next hop node from the next hop node candidate set based on the next hop candidate node random selection algorithm. If the next hop node is a network node, go to step 4; otherwise, the next hop node is a receiving end, go to step 5;

[0070] Step 4: Modify the destination address of the data message header to the network address of the selected network node, modify the source address to the network address of the current network node, forward the data packet, and go to step 2;

[0071] Step 5: Obtain the network address based on the receiving end identifier resolution, modify the destination address in the data message header to the receiving end network address, modify the source address to the network address of the current node, set the path change flag to disable the service, and forward the data packet until the receiving end receives the data packet. The process ends.

[0072] In order to make the technical solution of the present application clearer, the present application is further described in detail below in conjunction with the accompanying drawings. It should be understood that the specific examples described here are only used to explain the present application and are not limited to the present application.

[0073] The technical solution of the present application is to randomly select the next hop node of each data packet on each network node with path transformation capability, modify the network address information in the data packet, make the data routing unpredictable in advance, and hide the association of the communication end.

[0074] like Figure 2 As shown, this is an embodiment of the present application. A user front-end node is added on the user side for assistance. The network that carries the path transformation includes N network nodes with path transformation capabilities and M user front-end nodes. The network node is mainly responsible for processing data packets from user front-end nodes or other network nodes. In addition to the basic routing forwarding function, it also has the following functions: reading, filling and modifying some fields in the header of the data message, maintaining the candidate set of the next hop node, selecting the next hop node, and sending registration, deregistration and resolution requests to the resolution system. Network nodes are identified by alphabetical numbers: (n 1 ,n 2 ,…,n i ,…,n N ). The user front-end node is mainly responsible for processing data packets from users. In addition to basic routing and forwarding functions, it also has the following functions: path transformation data packet encapsulation and network node selection. User front-end nodes are identified by alphabetical numbers: (m 1 ,m 2 ,…,m i ,…,m M ).

[0075] According to the different time sequences of nodes processing single data packets, the path transformation nodes are logically classified into: entry node, forwarding node and exit node. Among them, the entry node is the first hop node selected by the user's front node; the forwarding node is the next hop node selected by the entry node or other forwarding nodes according to the next hop candidate node random selection algorithm; whether the current node is an exit node is determined by the next hop candidate node random selection algorithm.

[0076] A data packet is the basic unit of transmission in a network. The information that should be carried in the header of a data packet using the path change service includes: a receiver identifier, a destination address, a path change flag, and path change related parameter bits. Among them: the path change flag is used to identify the path change service level. The receiver identifier and path change related parameters are used to assist in the selection of the next hop node and the modification of the destination address in the packet header.

[0077] The path transformation network initialization process includes: user front node initialization, path transformation node initialization, user access network, and next hop node candidate set initialization. The specific initialization implementation example is as follows:

[0078] Step 1) When the user front-end node first accesses the network, the mapping relationship between its network address NA and identifier ID<NA,ID> Register to the resolution system. The registration method includes registering by TAG, which indicates that the current registration entry is the user's previous node information by carrying the TAG attribute parameter.

[0079] Step 2) When a network node first accesses the network, the mapping relationship between its network address NA and identifier ID is<NA,ID> Register to the resolution system. The registration method includes registering by TAG, and carrying the TAG attribute parameter to indicate that the current registration entry is path transformation node information.

[0080] Step 3) When a user first accesses the network, the mapping relationship between the network address NA and the identifier ID is<NA,ID> Register to the resolution system. Registration methods include registering by TAG. Carrying the TAG attribute parameter indicates that the current registration entry is a common user.

[0081] Step 4) The user front-end node and the network node periodically parse the network available node set to the parsing system. The parsing method includes parsing by TAG, and carrying the TAG attribute parameter indicates that the entry currently parsed and obtained is network node information.

[0082] Step 5) The user front node and the network node generate a next hop candidate node set based on the acquired network available node set.

[0083] The next hop candidate node set consists of an optional set of neighboring network nodes with path change capabilities and a receiving end; the range of optional neighboring network nodes of the user front node includes: neighboring nodes with path change capabilities; the range of optional neighboring network nodes of the path change node includes: all network nodes; the setting method of the optional neighboring network nodes is based on the resolution system level setting; the network node only needs to maintain the network addresses of all optional neighboring network nodes locally; the receiving end address can be obtained through resolution of the resolution system based on the receiving end identifier carried in the data packet header.

[0084] The resolution system can provide registration, deregistration and resolution services for identifier to network address mapping records.

[0085] Figure 3 This is a flow chart of path transformation. The specific communication process is as follows:

[0086] Step 1) The sender sends data to the user front-end node and indicates to use the path transformation service;

[0087] Step 2) After receiving the data, the user front-end node determines whether it uses the path change service. If it does, it executes step 3) otherwise it executes step 12);

[0088] Step 3) The user front-end node constructs a path change data packet according to the received data packet: the destination ID is the receiving end identifier ID, and carries the path change flag bit and parameters;

[0089] Step 4) The user front node randomly selects a next-hop neighborhood network node as the entry node from the next-hop candidate node set based on the next-hop candidate node random selection algorithm in units of data packets, rewrites the source address of the message to the current node network address, and modifies the destination address to the selected entry node network address;

[0090] Step 5) The user front-end node sends the data packet to the selected entry node;

[0091] Step 6) The ingress node receives the data packet. If the destination address in the data packet is the network address of the local node, and the path change flag indicates that the path change service is enabled, then execute step 7). Otherwise, execute step 12);

[0092] Step 7) The ingress node randomly selects a next-hop neighboring network node as a forwarding node from the candidate node set based on a next-hop candidate node random selection algorithm in units of data packets, modifies the source address to the current node network address, modifies the destination address to the selected forwarding node network address, and forwards the data packet;

[0093] Step 8) The forwarding node receives the data packet. If the destination address in the data packet is the network address of the local node and the path change flag indicates that the path change service is enabled, then execute step 9) otherwise execute step 12);

[0094] Step 9) The forwarding node determines whether the next hop node is a receiving end based on the path transformation in units of data packets, that is, whether the current node is an egress node. If yes, execute step 11) otherwise execute step 10);

[0095] Step 10) The forwarding node randomly selects a next-hop neighboring network node from the candidate node set as the next-hop forwarding node, modifies the source address to the current node network address, modifies the destination address to the selected forwarding node network address, forwards the data packet, and executes step 8);

[0096] Step 11) When the forwarding node determines that this node is the egress node, it obtains the receiving end network address through the resolution system based on the destination ID, rewrites the source address in the message to the current node network address, and the destination address to the receiving end network address, forwards the data packet to the receiving end, and the process ends.

[0097] Step 12) The node does not process the data packet and directly forwards it, and the process ends.

[0098] The next-hop candidate node random selection algorithm is used to guide each data packet to randomly select the next-hop node from the next-hop candidate node set on the basis of ensuring that the transmission between the sender and the receiver is reachable. The available algorithm forms include: random walk and random walk with hop limit.

[0099] like Figure 4 The figure shows a schematic diagram of a random walk algorithm and a random walk algorithm with hop limit, where the random walk algorithm specifically includes:

[0100] Step 1) When a network node receives a data packet, it generates Rand1 and random number Rand2 through a random number generation module;

[0101] Step 2) Use the random number Rand1 to determine whether the current node is an egress node. If Rand1 satisfies the forwarding probability P f , execute step 3), if Rand1 satisfies probability 1-P f , execute step 4);

[0102] Step 3) Select a network node from the candidate node set as the next hop node using Rand2 as the index;

[0103] Step 4) The current node processes and forwards the data packet as an egress node.

[0104] The random walk algorithm with hop limit specifically includes:

[0105] Step 1) When the path change node receives a data packet, it determines the number of hops of the data packet. If it is less than the maximum hop limit, it executes step 2), otherwise it executes step 3);

[0106] Step 2) Randomly select a node from the candidate node set as the next hop node.

[0107] Step 3) The current node processes and forwards the data packet as an egress node.

[0108] The random number generation module generates two random numbers: Rand1 determines whether to wander, and Rand2 is used as the index value to select the next hop node from the candidate set. f =5 / 8 as an example, the specific generation methods include:

[0109] Step 1) Each network node sets a Seed value (0-255), and each time a packet is processed, Seed+1;

[0110] Step 2) Add the TTL, destination ID, first four bytes of the transport layer, and the Seed value of the node in the data packet to obtain the value x;

[0111]

[0112] Step 3) Generate random numbers Rand1 and Rand2.

[0113] Rand2 = x & mask1; (where mask1 = 0x1f)

[0114] Rand1 = Rand2 & mask2; (where mask2 = 0x07)

[0115] Two Rand random numbers are obtained by bitwise AND calculation. Rand1 determines whether to wander, and Rand2 is used as the index value to select the next hop node from the candidate set.

[0116] If Rand1<5, it means that the forwarding probability p is satisfied. f =5 / 8, otherwise it satisfies 1-p f =3 / 8.

[0117] When the user front node, network node, or user exits the network, a logout request needs to be sent to the resolution system to log out the mapping relationship between its network address NA and identifier ID.<NA,ID> . The parsing system deletes the corresponding entry.

[0118] The present application proposes a message forwarding method that supports path change at the network layer. By randomly changing the path, data routing cannot be predicted in advance, which can increase the difficulty for attackers to steal data and improve the network's anti-attack capability.

[0119] Finally, it should be noted that the above embodiments are only used to illustrate the technical solution of the present application and are not intended to limit it. Although the present application is described in detail with reference to the embodiments, a person skilled in the art should understand that any modification or equivalent replacement of the technical solution of the present application does not depart from the spirit and scope of the technical solution of the present application and should be included in the scope of the claims of the present application.

Claims

1. A message forwarding method supporting path transformation at the network layer, involving a network including a sending end, a receiving end and a network node having path transformation capability; The network adopts an architecture in which identification and address are separated, uses an identifier that is unrelated to the network address to uniquely identify the receiving end, and uses a resolution system to maintain a mapping relationship between the receiving end identifier and the receiving end network address; The network nodes that carry out message forwarding include: Network routing switching nodes and network nodes with path transformation capabilities; The method comprises: The sending end sends a data message to the network, and the fields carried in the data message header include: a receiving end identifier, a path change flag bit and a path change parameter; After receiving a data message, the network node with path transformation capability detects the destination address of the message and the path transformation flag in the header. For a data message whose destination address is the address of this node and whose flag indicates the use of path transformation, a next-hop candidate node random selection algorithm is used to select a network node or a receiving end with path transformation capability as the next-hop node, modify the destination address of the data message to the network address of the next-hop node, modify the source address to the network address of the current node, and forward the message.

2. The method for forwarding a message with support for path transformation at the network layer according to claim 1, It is characterized in that The sending end sends a data message to the network and specifies a network node with the path transformation capability as a network entry node when using the path transformation capability.

3. The message forwarding method supporting path transformation at the network layer according to claim 1, It is characterized in that The network node with path conversion capability supports the following functions: Support network routing switching node function; Supports the function of reading, filling and modifying some fields of the data message header; the said some fields include: destination address and path transformation parameters; Supports maintenance of next-hop node candidate set and selection of next-hop forwarding node; Support sending registration, deregistration and resolution requests to the resolution system; Supports independent networking and mixed networking with network routing and switching nodes.

4. The message forwarding method supporting path transformation at the network layer according to claim 1 or 3, It is characterized in that The resolution system provides registration, deregistration and resolution services for identifier-to-network address mapping records.

5. The message forwarding method supporting path transformation at the network layer according to claim 3, It is characterized in that The next hop node candidate set includes a neighborhood network node set and a receiving end; The neighborhood network node set is selected from network nodes having path transformation capability using a screening method; The screening methods include: random selection and service level selection based on the resolution system; The network node with path transformation capability locally maintains the network address of the network node in the neighborhood network node set; The receiving end network address uses the receiving end identifier in the data message header and is resolved using a resolution system.

6. The message forwarding method supporting path transformation at the network layer according to claim 1, It is characterized in that The next hop candidate node random selection algorithm is a method for guiding each data message to randomly select a node from the next hop candidate node set as the next hop node on the basis of ensuring that the transmission between the sending end and the receiving end is reachable; The random selection algorithm for the next-hop candidate node includes: an equal-probability random algorithm, an unequal-probability random algorithm, or a random walk algorithm with a maximum hop number limit.

7. The method for forwarding a message with support for path conversion at the network layer according to claim 1, It is characterized in that The path change flag is used to identify whether to use the path change service.

8. The method for forwarding a message with support for path conversion at the network layer according to claim 1, It is characterized in that The path transformation parameters are parameters required by the next-hop candidate node random selection algorithm to assist in the selection of the next-hop node; The path change parameters include: the number of remaining hops of random walk TTL and the random number seed used for the random algorithm; The path transformation parameters are filled in, read and modified by the network nodes.

9. The method for forwarding a message with support for path conversion at the network layer according to claim 1, It is characterized in that The process of forwarding a message by the network node having the path transformation capability includes: Step 1: After receiving the data packet, match the destination address and the path change flag to determine whether to use the path change service; if the match is successful, go to step 2; otherwise, do not process and forward the data packet until the receiving end receives the data packet, and the process ends; Step 2: Based on the next-hop candidate node random selection algorithm, select the next-hop node from the next-hop node candidate set. If the next-hop node is a network node, go to step 3; otherwise, the next-hop node is a receiving end, go to step 4; Step 3: Modify the destination address of the data message header to the network address of the selected network node, modify the source address to the network address of the current network node, forward the data packet, and go to step 1; Step 4: Obtain the network address based on the receiving end identifier resolution, modify the destination address in the data message header to the receiving end network address, modify the source address to the network address of the current node, set the path change flag to disable the service, and forward the data packet until the receiving end receives the data packet, and the process ends.

Images