CN112688880A - Method for reducing redundant data packet transmission in named data network - Google Patents
Method for reducing redundant data packet transmission in named data network Download PDFInfo
- Publication number
- CN112688880A CN112688880A CN202011569719.9A CN202011569719A CN112688880A CN 112688880 A CN112688880 A CN 112688880A CN 202011569719 A CN202011569719 A CN 202011569719A CN 112688880 A CN112688880 A CN 112688880A
- Authority
- CN
- China
- Prior art keywords
- interest
- packet
- request
- data
- consumer
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Images
Classifications
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/50—Reducing energy consumption in communication networks in wire-line communication networks, e.g. low power modes or reduced link rate
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses a method for reducing transmission of redundant data packets in a named data network, which is realized by obtaining the name of a backtracked data packet and generating and sending a special interest packet to block backtracking of the redundant data packets in the network by using the name after a consumer node obtains the first backtracked data packet. In the named data network, when a consumer node acquires interest request data under a multicast forwarding strategy, the consumer node blocks the backtracking of other paths about the interest request redundant data packet by generating and forwarding a special interest packet after receiving a first backtracked data packet. By increasing the number of interest packets that occupy a smaller flow, the number of data packets that occupy a larger flow is reduced. Therefore, the transmission of redundant data packets in the network is reduced, the network flow is saved, and the overall performance of the NDN network is improved.
Description
Technical Field
The invention relates to a transmission method for reducing redundant data packets, and belongs to the technical field of internet transmission.
Background
In recent years, optical fibers are widely used, network bandwidth is greatly improved, and with the appearance of high-definition video and audio, virtual reality and the like, inherent problems and defects are gradually exposed in a TCP/IP network originally designed for meeting single data communication. In the aspect of expandability, the number of internet users is increased sharply, and problems such as insufficient addresses of IPv4 and the like are caused. In the aspect of manageability, the internet adopts a distributed architecture at present, and cannot well implement global control and management on network resources. In the aspect of security, the existing network has more security holes, and the security problem is solved by continuously patching, which also leads to the fact that the network is more and more bloated. In terms of mobility, with the advent and application of a large number of mobility devices, conventional TCP/IP networks have not been well supported, such network upper layer mobility applications. For the above problems of the conventional TCP/IP network, the current main solution is to adopt an incremental deployment mode, and not to add an overlay network and a network patch continuously, but this does not completely change the existing internet architecture. For solving the defects of the existing Internet system structure, the current scheme summarized at home and abroad mainly has two routes of 'improvement' and 'revolution'. The improvement is the deficiency of continuously improving the existing internet system, however, the method cannot essentially solve the deficiencies, and the requirement of future network development is difficult to meet. The revolution is to redesign the information-centric network as the internet architecture, and thoroughly change the defects of the existing internet architecture in the aspects of expandability, security, mobility and the like, so as to meet the requirements of future social development. Named Data Networks (NDN) are a network architecture that is currently well researched and developed.
The NDN turns the current communication mode's attention to data location to the data content itself. The communication mode is completely different from the mode of identifying the information position by the IP address used at present, and the NDN names the data, so that the data becomes the direct target of communication. One or more routing nodes exist between a producer and a consumer in the NDN network, and the routing nodes are responsible for forwarding of Interest packets, backtracking of Data packets and Data caching. Each routing node includes three tables, namely a Forwarding Interest Table (PIT), a Forwarding Information Table (FIB), and a Content Store (CS). The PIT records uplink information sent by all Interest packets, the PIT table is checked when the Interest packets reach the routing node, the Interest source port is recorded if the Interest information exists in the PIT table, the Interest table entry is created if the Interest information does not exist, the Data packets are correctly traced back according to the PIT table information, and the PIT table entry matched with the Data is deleted after the Data packets are traced back from the corresponding ports. FIB stores < prefix, interface list > primitive ancestor, and transmits an Interest packet from a potential required Data port by adopting longest match query of Interest name attribute values. The CS, like a memory cache in the IP router, caches data traced back to the routing node.
Mobility is a big advantage of NDN over traditional TCP/IP networks, however in a mobile network, its network topology changes randomly. In a randomly-changed network topology, the reliability of communication cannot be guaranteed because the optimal path route is adopted to forward the interest packet to obtain the request data. In order to better ensure the reliability of the consumer node acquiring the request data in the mobile network, the NDN provides a Multicast forwarding policy (MS), which is to forward an interest packet from a plurality of available ports after the routing node receives the interest packet, so that the low time-delay performance of the consumer node acquiring the data packet can be ensured, and meanwhile, the problem of the end-to-end transmission due to the change of the network topology structure or the link failure in the transmission process of a single path and the like can be avoided.
The multicast forwarding strategy is adopted in the NDN, so that the low time delay of the consumer node for acquiring the data packet can be guaranteed, and the problems of end-to-end transmission and the like caused by the change of a network topological structure or link failure and the like in the transmission process of a single path are avoided. However, the biggest disadvantage of this multicast forwarding strategy is that after the consumer node sends the interest request, only the first backtracking data packet in the network is needed by the consumer, and the backtracking data packets are all redundant data packets. A large number of redundant data packets are transmitted in the network, thereby greatly occupying large network bandwidth resources. The method for reducing delay and ensuring the reliability of data transmission by increasing the network bandwidth can obtain good effect when the network is in an idle state, but the network is easy to cause congestion under the condition that the network flow is large, so that the overall performance of the network is reduced.
The NDN is greatly different from the traditional TCP/IP network in transmission, data packets and interest packets in the NDN are a one-to-one flow balance mechanism, and one interest packet returns one data packet at most, so that the transmission quantity of the data packets can be changed by controlling the transmission quantity of the interest packet, thereby reducing the transmission of redundant data packets in the network, reducing the use of network bandwidth resources, reducing the network delay and improving the overall performance of the NDN network. The method aims at an NDN multicast forwarding strategy, and is easy to cause the transmission of a large number of redundant data packets in the network and research and analyze the reason of occupying the network bandwidth. The design realizes a transmission control strategy, reduces the transmission of redundant data packets in the NDN network, thereby saving network bandwidth resources, reducing network delay and improving the overall performance of the NDN network.
The modern internet is a worldwide communications network that has become an important infrastructure for carrying global communications. However, the current internet architecture has certain defects, and related researchers research and design the NDN network in order to solve the defects and design the network which is more in line with the development requirements of the era. The NDN adopts a multicast forwarding strategy, which has certain disadvantages, after a consumer node sends an interest request, only the first backtracking data packet in the network is needed by the consumer, and the backtracking data packets are all redundant data packets. The transmission of a large number of redundant data packets in a network can greatly occupy large network bandwidth resources. This patent design realizes a transmission control strategy, obtains the data package back that the first backtracking was come when the consumer node, through obtaining the data package name that the backtracking was come, utilizes this name to generate and send the backtracking of redundant data package in the special interest package interdiction network. Therefore, network bandwidth resources are saved, network delay is reduced, and the overall performance of the NDN network is improved.
Disclosure of Invention
The method aims at the reason that in the NDN network, a multicast forwarding strategy easily causes a large number of redundant data packets to be transmitted in the network to occupy the network bandwidth, and is researched and analyzed. The design realizes a transmission control strategy, reduces the transmission of redundant data packets in the NDN network, thereby saving network bandwidth resources, reducing network delay and improving the overall performance of the NDN network. The strategy for reducing Redundant Packet Transmission (RRPPT) realized by the patent design is realized by acquiring the name of a backtracked data Packet and generating and sending a special interest Packet to block backtracking of Redundant data packets in a network by utilizing the name after a consumer node acquires the first backtracked data Packet.
The invention designs a strategy for reducing the transmission of redundant data packets, and the main idea is to increase the transmission quantity of interest packets instead of reducing the transmission of the data packets with the same quantity. The strategy is realized by obtaining the name of a backtracked data packet and generating and sending a special interest packet to block backtracking of redundant data packets in a network by obtaining the name of the backtracked data packet after a consumer node obtains a first backtracked data packet.
S1, the consumer generates the request data packet, then uses the multicast transmission mechanism to transmit the request interest packet by multi-path transmission, and waits for the data packet to trace back.
S2 the consumer sends a special interest package with the same name as the interest request when receiving the first data package traced back.
S3 uses the special interest packet to delete the information about the interest request recorded by the routing node PIT in the upstream redundant link.
S4, when the redundant data packet is backtracked, the information of the relevant forwarding port is not found, and the redundant data packet is not backtracked.
Data packets and interest packets in the NDN network are one-to-one flow balancing mechanisms. An interest packet is forwarded from a plurality of available ports of a routing node, and then a plurality of data packets carrying the same data are traced back to the routing node, so that only the first traced data packet is useful for a consumer, and the traced data packets are redundant. A large amount of redundant data packets are transmitted in the network, which increases the load of network links and easily causes network congestion. As shown in fig. 1-1, the process of requesting data by a consumer node under the NDN multipath transmission mechanism is simulated. The consumer node S sends an interest package request data, with requests in the network that S can be filled with data sources D1, D2, and D3. If the time taken by the interest packet and the data packet to pass through each routing node is equal, the network topology relationship in the graph shows that the data packet which firstly reaches the R1 routing node is traced back from the data source D1, and the data packets which are traced back from the data sources D2 and D3 are redundant, the transmission of the redundant data packets in the network occupies the network bandwidth, and if the transmission burden of the network transmission is increased, the overall performance of the NDN network can be improved if the transmission of the redundant data packets can be reduced.
The data such as the name of the requested resource contained in the interest packet in the NDN has the size far smaller than the size of the resource data such as audio, video, pictures and the like contained in the data packet, and the network flow can be reduced by reducing the transmission quantity of the data packet. The PIT table entry in the NDN records the interest request and the source port number of the consumer, and the data packet can be traced back according to the record of the PIT table entry after arriving at the routing node. If the consumer interest entry recorded by the PIT can be deleted before the redundant data packet returns to the routing node, the backtracking of the redundant data packet can be blocked.
The main idea of the strategy for reducing the transmission of the redundant data packets designed by the method is to increase the transmission quantity of the interest packets instead of reducing the transmission of the data packets with the same quantity. Because the consumed flow resource is far larger than the interest packet when the data packet is transmitted, the network flow can be effectively reduced by the strategy. Under the NDN multi-path transmission mechanism, when a consumer node receives a backtraced first data packet, the interest request is already completed for the consumer. In order to block the backtracking of redundant data packets of other links, the consumer node may cancel the information about the interest request recorded by the routing node PIT in the upstream redundant link by sending a special interest packet with the same name as the interest request. As shown in fig. 1-2, the process of a consumer node requesting data under a reduced redundant packet transmission strategy is shown. The consumer node S sends an interest package request data, with requests in the network that S can be filled with data sources D1, D2, and D3. If the time taken for each packet of interest and each packet of data to pass through a routing node is equal, then the data packet that first reaches the routing node R1 is traced back from the data source D1, and the data that is then traced back from the data sources D2 and D3 are redundant, as can be seen from the network topology in the figure. When the R1 routing node receives data back from the data source D1, it immediately sends special interest packets to block redundant data packets back from the data sources D2 and D3. As can be seen from the figure, the special interest packets can block the backtracking redundant data of the data sources D2 and D3 to the routing nodes R7 and R4, so that the data packets transmitted by the original R7-R2-R1 and R4-R1 paths are converted into the special interest packets transmitted by the reverse paths. By the method, the network flow can be effectively reduced, so that the effect of improving the overall performance of the NDN network can be achieved.
Different consumers in an NDN network may send the same interest request within a certain time frame. The most recent data sources that obtain the same interest request may be different for different consumers. When some consumers with the same interest request in the network obtain the request data and send special interest packets to block redundant data transmission, the acquisition of the same request data by other consumer nodes cannot be influenced. Aiming at the problems, a data structure needs to be designed, and different consumer identity information of the same source port under the same interest request is recorded respectively. Therefore, when the routing node receives the special interest packet, only the information related to the consumer in the PIT list item is deleted. When other consumer information still exists in the PIT list item, the data packet is still forwarded out from the corresponding port of the PIT record after being traced back to the routing node. This strategy requires the addition of a set structure. Both add a list < ConsumerRecord > set below the PIT interest entry port list for each port for recording consumer identity information. And the data recorded by the ConsumerRecord is obtained from the request interest packet received by the routing node, so a field is also required to be added in the interest packet to represent the identity information of the current consumer.
After the routing node receives the special interest packet, the consumer identity information about the interest request recorded in the PIT table entry needs to be deleted, so that the backtracking of the redundant data packet about the interest request is blocked. As shown in fig. 2-1, indicating a change in PIT before and after receiving a special interest packet. The PIT is shown to record 2 interest entries Intrest1 and Intrest 2. Intrest1 records 6 different consumers, originating from 3 different ports, requesting the same data. At a certain time, after the routing node receives a special interest packet about Intrest1 transmitted from Port2, it needs to obtain ConsumerRecord4 data representing customer identity information carried in the special interest packet, then searches a list < ConsumerRecord > set, and deletes ConsumerRecord4 data in the set when ConsumerRecord4 data exists in the set. When the list < ConsumerRecord > set under Port2 is empty after deleting the ConsumerRecord4 data, it indicates that there is no need to trace back packets from the Port2 Port regarding the interest request, so Port2 is deleted from the Port set. If the list < ConsumerRecord > set is not empty, the Port2 Port continues to be reserved. For example, the Port3 Port, when the ConsumerRecord5 data in the set is deleted, and the ConsumerRecord6 data in the Port3 Port set still exists (it indicates that the list < ConsumerRecord > set under the Port is not empty), so the set data under the Port3 Port continues to be reserved, and waits for the packet related to the interest request to trace back to the local routing node and be forwarded from the Port3 Port. Intrest2 records interest requests forwarded from a Port2 by a consumer node. If the consumer node has acquired data about the Intrest2 request from other more recent data sources. And sending a special interest packet to the routing node, and deleting ConsumerRecord4 data in the collection after the routing node receives the special interest packet and matches the ConsumerRecord4 data in the list < ConsumerRecord > collection under the Port 2. However, since the list < ConsumerRecord > set under Port2 is empty after data deletion, Port2 Port in the Port set also needs to be deleted, and when the Port set associated with Interest2 is empty, it means that a packet related to the request of the Intrest2 does not need to be forwarded back to any Port, so that the item of Intrest2 also needs to be deleted.
The design implementation of the algorithm needs two different types of interest packages, one is a request interest package which is used for requesting to acquire data required by a consumer; the other type is a special interest packet which is used for sending the special interest packet to block the backtracking of the redundant data packet after the consumer receives the request data packet. Both interest packages also need to carry consumer identity information. So this algorithm needs to add 2 fields in the interest package: a field for distinguishing two different types of interest packages; and the other field is used for recording the identity information of the consumer. The structure of the interest package is designed as shown in fig. 2-2, wherein the Flag field is used to distinguish two different types of interest packages, when the Flag value is 0, the interest package is a request interest package, and when the Flag value is 1, the interest package is a special interest package. The ConsumerRecord field is used to record consumer identity information, where the field value can be used to generate a globally unique identification number using the CoCreatGuid function to represent the consumer unique identity information.
The main processes of the algorithm are divided into a consumer node interest request process, a routing node interest packet receiving and processing process (including receiving and processing a request interest packet and a special interest packet) and a routing node data packet receiving and processing process. The flow of receiving and processing the data packet by the routing node is the same as the default mechanism of the NDN, and is not described herein again. Mainly described below, the consumer node interest request flow and the routing node receiving and processing interest packet flow.
As shown in fig. 3-1, a flow is requested for consumer node interest. The process is divided into a step A and a step B: step A, a consumer generates a request interest packet and acquires a request data packet flow; step B is a process of generating a special interest package by the consumer. And step A, the consumer produces an interest package, sets the Flag field value to be 0 to indicate that the interest package is a request interest package, generates a consumer unique identity information value, and sets the value to a Consumerrecord field to indicate the current consumer identity information. And (4) generating a complete request interest package through the step A. And then, a multicast forwarding mechanism is adopted to perform multipath forwarding and transmit the request interest packet, and the backtracking of the data packet is waited. Step B is performed when the first packet associated with the interest request is traced back to the consumer node. And B, acquiring the name of the backtracked data packet, generating an interest packet according to the name, setting a Flag value to be 1 to indicate that the interest packet is a special interest packet, and setting the unique information of the consumer produced in the step A to a Consumerrecord field to indicate the identity information of the consumer. And then, a multicast forwarding mechanism is also adopted to carry out multi-path forwarding transmission on the special interest packet, so as to block the backtracking of redundant data packets related to the interest request in the network.
As shown in fig. 3-2, the interest packet processing flow is received for the routing node. After receiving the interest packet, the routing node in the NDN first checks a Flag field value carried in the interest packet. The flow is divided into a part A and a part B according to the Flag field value, wherein the part A is executed when the Flag field value is 0, and the part B is executed when the Flag field value is 1. The part A is a flow that the routing node processes the request interest packet; the flow of the part B is the flow of the routing node processing the special interest packet.
Part A: when the Flag value is 0, it is first checked whether data about the interest request exists in the routing node CS. If the data packet exists, returning the data packet of the hit data and ending the process, if the data packet does not exist, continuously checking whether an item related to the interest request exists in the PIT. If the interest item does not exist, a PIT item related to the interest request is created, the port number of the source of the interest request is recorded, meanwhile, a ConsumerRecord value which is obtained from a request interest packet and represents the identity information of the consumer is added to a set under the source port, and the flow is ended. If the PIT has the list item related to the interest request, the PIT continues to check whether the interest source port exists in the interest item port set. And if the current value does not exist, adding the interest source port in the port set, and simultaneously adding the ConsumerRecord value which is obtained from the request interest packet and represents the identity information of the consumer in the set below the source port and ending the process. If the source of interest port exists, then continue to see if a ConsumerRecord value exists in the set under that port that represents the consumer identity information. If so, the request interest packet is discarded and the process ends. If not, adding the ConsumerRecord value of the identity information representing the consumer obtained from the request interest packet to the set under the port and ending the process.
And part B: when the Flag value is not 0, i.e., the Flag value is 1. Check if there is an entry in the PIT for the interest request. If not, the special interest packet is discarded and the process ends. If the PIT has the list item related to the interest request, the PIT continues to check whether the interest source port exists in the interest item port set. If not, the special interest packet is discarded and the process ends. If so, continue to see if a ConsumerRecord value exists in the port lower set that represents the consumer identity information. If not, discarding the special interest packet and ending the process. If so, deleting the ConsumerRecord value in the port lower set representing the customer identity information. After deleting the ConsumerRecord value, see if there are any more ConsumerRecord values in the collection that represent other consumer identity information. If so, the flow ends. If not, deleting the port in the interest item port set, and continuously checking whether the port set under the interest item records other ports. If yes, the flow ends, and if not, the list item of the interest request in the PIT is deleted.
Compared with the prior art, the method is characterized in that in the named data network, when a consumer node acquires interest request data under a multicast forwarding strategy, after the consumer node receives a first backtracking data packet, backtracking of other paths about the interest request redundant data packet is blocked by generating and forwarding a special interest packet. By increasing the number of interest packets that occupy a smaller flow, the number of data packets that occupy a larger flow is reduced. Therefore, the transmission of redundant data packets in the network is reduced, the network flow is saved, and the overall performance of the NDN network is improved.
Drawings
Fig. 1-1 is a diagram illustrating an NDN multipath transmission scheme.
Fig. 1-2 are schematic diagrams of reduced redundancy packet transmission strategies.
FIG. 2-1 is a schematic diagram of a PIT table entry change for receiving a special interest packet.
FIG. 2-2 is a schematic diagram of the structure design of interest package.
FIG. 3-1 is a schematic diagram of a consumer interest request.
Fig. 3-2 is a schematic diagram of a routing node receiving and processing an interest packet.
Fig. 4-1 is a schematic diagram of an experimental network topology.
Fig. 4-2 is a schematic diagram of network traffic comparative analysis.
Detailed Description
The designed reduced Redundant Packet Transmission (RRPPT) algorithm performs simulation experiments. In the experiment, the NDN network adopting the RRPT algorithm and the NDN network not adopting the RRPT algorithm are subjected to experimental comparison analysis under a Multicast forwarding Mechanism (MS) which is defaulted by the NDN, the redundant data packet transmission congestion prevention algorithm is verified and reduced by comparing the transmission flow in the network, the transmission of the redundant data packets in the network can be effectively reduced, the network flow is reduced, the generation of congestion in the network is actively prevented, and the overall performance of the NDN network is improved.
The experiment is completed under a Linux system, the version of the system is Ubuntu16.04, and the version of 2.2 is used by an ndnSIM simulation platform. A network topology with 150 nodes was randomly generated in the experiment as shown in fig. 4-1. In the topological network, one node is randomly selected as a consumer, and twenty nodes are randomly selected as producers. The upper limit of the transmission bandwidth between the routing nodes is 10Mbps, the network delay is 1ms, and the size of the cache space of the routing nodes is set to be 100. The consumer sends 300 interest packets per second to the producer for data request and forwards the interest packets by adopting a multicast mechanism, and the producer produces data with the size of 1024 KB.
The network flow reflects the load condition of the network, and when the same amount of data requests occur under the same condition, the larger the flow in the network is, the higher the probability of congestion of the network is. The test uses the selected network flow as an NDN network performance evaluation index, verifies that the network adopting the RRPT algorithm under the NDN default multicast forwarding mechanism can reduce the transmission of redundant data packets in the NDN network, reduce the network flow, and actively prevent the generation of congestion in the NDN network compared with the network not adopting the RRPT algorithm, thereby improving the overall performance of the NDN network. In the data file traced by using the L3RateTracer in the experiment, lnterest and outterest in the Type column represent the metrics of the incoming interest packet and the outgoing interest packet, respectively, and InData and OutData represent the metrics of the incoming data packet and the outgoing data packet. Packets in the data file indicates the number change in the network within the average period, and Kilobytes indicates the change in the flow in the network within the average period. The experiment mainly measures the transmission flow of the NDN network under two different algorithms, so statistical analysis is selected, and when the RRPT algorithm is adopted or not adopted, the sum of the flow of an outgoing interest packet, the flow of an outgoing data packet and the flow of the outgoing interest packet in the network is used as a performance evaluation standard.
In the present experiment, two data files are generated in total for tracking the flow data, and the statistical analysis results are performed on the data according to the performance evaluation indexes provided above, as shown in fig. 4-2.
It can be seen from fig. 4-2 that under the NDN default multicast forwarding mechanism, the transmission of the outgoing interest packet traffic in the NDN network adopting the RRPT algorithm is greater than that in the NDN network not adopting the RRPT algorithm. This is because networks employing the RRPT algorithm send special interest packets, which increases the transmission of interest packet traffic in the network. However, in terms of outgoing packet traffic, the NDN network using the RRPT algorithm has a smaller outgoing packet traffic than the NDN network not using the RRPT algorithm. This means that forwarding of packets of particular interest can block back-tracking transmission of a portion of redundant data packets in the network. The sum of the data packet flow and the interest packet flow represents the total flow transmitted in the network, and the statistical experimental data in the graph shows that the total flow transmitted by the network adopting the RRPT algorithm is smaller than that of the network not adopting the RRPT algorithm. This shows that, under the multi-path forwarding mechanism of the interest packet, the RRPT algorithm is adopted, which can reduce the transmission of redundant data packets in the network, thereby effectively reducing the use of the traffic in the network and further improving the overall performance of the NDN network.
Claims (9)
1. A method for reducing redundant data packet transmission in a named data network is characterized in that: the designed transmission strategy for reducing the redundant data packets is used for increasing the transmission quantity of the interest packets in exchange for reducing the transmission of the data packets with the same quantity; the transmission strategy is realized by obtaining the name of a backtracked data packet and generating and sending a special interest packet to block backtracking of a redundant data packet in a network by obtaining the name of the backtracked data packet after a consumer node obtains a first backtracked data packet; the method specifically comprises the following steps of,
s1, the consumer generates a request data packet, then adopts a multicast forwarding mechanism to perform multi-path forwarding and transmit the request interest packet, and waits for the data packet to backtrack;
s2 the consumer sends a special interest package with the same name as the interest request when receiving the first data package;
s3, deleting the information about the interest request recorded by the routing node PIT in the upstream redundant link by using the special interest packet;
s4, when the redundant data packet is backtracked, the information of the relevant forwarding port is not found, and the redundant data packet is not backtracked.
2. The method of claim 1 for reducing transmission of redundant data packets in a named data network, wherein: the data packet and the interest packet in the NDN network are a one-to-one flow balancing mechanism; an interest packet is forwarded from a plurality of available ports of a routing node, then a plurality of data packets carrying the same data are traced back to the routing node, a consumer node S sends interest packet request data, and a request that S can be filled with data sources D1, D2 and D3 is made in a network; if the time taken by the interest packet and the data packet to pass through each routing node is equal, the data packet which firstly reaches the routing node R1 is traced back from the data source D1, and then the data packets traced back from the data sources D2 and D3 are redundant, as can be seen from the network topology in the figure.
3. The method of claim 2 for reducing transmission of redundant data packets in a named data network, wherein: the name data of the request resource contained in the interest packet in the NDN network is smaller than the size of audio, video and picture resource data contained in the data packet, the transmission quantity of the data packet is reduced, and the network flow is reduced; PIT entries in the NDN record interest requests and source port numbers of consumers, and data packets can be traced back according to the records of the PIT entries after arriving at the routing node; if the consumer interest entry recorded by the PIT can be deleted before the redundant data packet returns to the routing node, the backtracking of the redundant data packet can be blocked.
4. The method of claim 1 for reducing transmission of redundant data packets in a named data network, wherein: designing a strategy for reducing the transmission of redundant data packets to increase the transmission quantity of interest packets instead of reducing the transmission of the data packets with the same quantity; under an NDN multi-path transmission mechanism, when a consumer node receives a backtraced first data packet, the interest request of the consumer is already completed; the consumer node sends a special interest packet with the same name as the interest request to cancel the information about the interest request recorded by the routing node PIT in the upstream redundant link.
5. The method of claim 1 for reducing transmission of redundant data packets in a named data network, wherein: different consumers in the NDN network may send the same interest request within a certain time range; the closest data sources that satisfy the same interest request may be different for different consumers; when some consumers with the same interest request in the network obtain the request data and send a special interest packet to block redundant data transmission, the acquisition of the same request data by other consumer nodes cannot be influenced; after the routing node receives the special interest packet, the consumer identity information about the interest request recorded in the PIT table entry needs to be deleted, so that the backtracking of the redundant data packet about the interest request is blocked.
6. The method of claim 5 for reducing transmission of redundant data packets in a named data network, wherein: two different types of interest packages are needed, one is a request interest package which is used for requesting to acquire data required by a consumer; the other is a special interest packet which is used for sending the special interest packet to block the backtracking of the redundant data packet after the consumer receives the request data packet; the two interest packages also need to carry consumer identity information; add 2 fields to the interest package: a field for distinguishing two different types of interest packages; another field for recording consumer identity information; in the structural design of the interest package, a Flag field is used for distinguishing two interest packages of different types, when a Flag value is 0, the interest package is represented as a request interest package, and when the Flag value is 1, the interest package is represented as a special interest package; the ConsumerRecord field is used to record consumer identity information, where the field value can be used to generate a globally unique identification number using the CoCreatGuid function to represent the consumer unique identity information.
7. The method of claim 1 for reducing transmission of redundant data packets in a named data network, wherein: the flow comprises a consumer node interest request flow, a routing node interest packet receiving and processing flow and a routing node data packet receiving and processing flow; the interest packet processing flow comprises receiving a processing request interest packet and a special interest packet; the flow of receiving and processing the data packet by the routing node is the same as the NDN default mechanism, and the flow of requesting the interest of the consumer node and the flow of receiving and processing the interest packet by the routing node are the same;
consumer node interest request flow; the method comprises the following steps: step A, a consumer generates a request interest packet and acquires a request data packet flow; step B, a consumer generates a special interest package flow; step A, a consumer produces an interest package, sets the value of a Flag field to be 0 to indicate that the interest package is a request interest package, generates a value of unique identity information of the consumer, and sets the value to a Consumerrecord field to indicate the identity information of the current consumer; a, generating a complete request interest package through the step A; then, a multicast forwarding mechanism is adopted to perform multi-path forwarding and transmit the request interest packet, and wait for the backtracking of the data packet; step B is executed when the first data packet related to the interest request is traced back to the consumer node; b, obtaining the name of the backtracked data packet, generating an interest packet according to the name, setting a Flag value to be 1 to indicate that the interest packet is a special interest packet, and setting the unique information of the consumer produced in the step A to a Consumerrecord field to indicate the identity information of the consumer; then, a multicast forwarding mechanism is also adopted to perform multi-path forwarding transmission on the special interest packet, so as to block the backtracking of redundant data packets related to the interest request in the network;
after receiving an interest packet, a routing node in the NDN firstly checks a Flag field value carried in the interest packet; dividing the Flag field value into an A part and a B part, executing the A part when the Flag field value is 0, and executing the B part when the Flag field value is 1; the part A is a flow that the routing node processes the request interest packet; the flow of the part B is the flow of the routing node processing the special interest packet.
8. The method of claim 7 for reducing transmission of redundant data packets in a named data network, wherein: part A: when the Flag value is 0, firstly, whether data about the interest request exists in the routing node CS is searched; if the data packet exists, returning the data packet of the hit data and ending the process, if the data packet does not exist, continuously checking whether the table entry related to the interest request exists in the PIT; if the interest table entry does not exist, creating a PIT table entry related to the interest request, recording a source port number of the interest request, adding a ConsumerRecord value which is obtained from a request interest packet and represents the identity information of the consumer in a set under the source port, and ending the flow; if the PIT has the list item related to the interest request, continuously checking whether the interest source port exists in the interest item port set or not; if not, adding the interest source port in the port set, and simultaneously adding a ConsumerRecord value which is obtained from the request interest packet and represents the identity information of the consumer in the set under the source port, and ending the process; if the interest source port exists, continuing to check whether a ConsumerRecord value representing the identity information of the consumer exists in the set under the interest source port; if yes, discarding the request interest packet and ending the process; if not, adding the ConsumerRecord value of the identity information representing the consumer obtained from the request interest packet to the set under the port and ending the process.
9. The method of claim 7 for reducing transmission of redundant data packets in a named data network, wherein: and part B: when the Flag value is not 0, i.e., the Flag value is 1; checking whether the item of the interest request is related to the PIT; if not, discarding the special interest packet and ending the process; if the PIT has the list item related to the interest request, continuously checking whether the interest source port exists in the interest item port set or not; if not, discarding the special interest packet and ending the process; if yes, continuing to check whether a ConsumerRecord value representing the identity information of the consumer exists in the port lower set; if not, discarding the special interest packet and ending the process; if yes, deleting the ConsumerRecord value representing the identity information of the consumer in the port lower set; after deleting the Consumerrecord value, checking whether the Consumerrecord value in the set exists and represents other consumer identity information; if yes, ending the flow; if not, deleting the port in the interest item port set, and continuously checking whether the port set under the interest item records other ports; if yes, the flow ends, and if not, the list item of the interest request in the PIT is deleted.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011569719.9A CN112688880B (en) | 2020-12-26 | 2020-12-26 | Method for reducing redundant data packet transmission in named data network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011569719.9A CN112688880B (en) | 2020-12-26 | 2020-12-26 | Method for reducing redundant data packet transmission in named data network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN112688880A true CN112688880A (en) | 2021-04-20 |
| CN112688880B CN112688880B (en) | 2022-08-16 |
Family
ID=75452241
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202011569719.9A Active CN112688880B (en) | 2020-12-26 | 2020-12-26 | Method for reducing redundant data packet transmission in named data network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112688880B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114039932A (en) * | 2021-11-08 | 2022-02-11 | 北京工业大学 | Method for reducing redundant data packet transmission in named data MANET network |
Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20130275618A1 (en) * | 2012-04-17 | 2013-10-17 | Alcatel-Lucent Bell Labs France | Method and apparatus for reducing content redundancy in content-centric networking |
| CN104901980A (en) * | 2014-03-05 | 2015-09-09 | 北京工业大学 | Popularity-based equilibrium distribution caching method for named data networking |
| CN105682046A (en) * | 2016-03-10 | 2016-06-15 | 重庆邮电大学 | Interest packet forwarding method based on data attributes in vehicle-mounted named data networking |
| US20160182680A1 (en) * | 2014-12-17 | 2016-06-23 | Cisco Technology, Inc. | Interest acknowledgements for information centric networking |
| CN108092899A (en) * | 2018-01-05 | 2018-05-29 | 北京工业大学 | Routing policy update method based on name data network under MANET environment |
| CN108710629A (en) * | 2018-03-30 | 2018-10-26 | 湖南科技大学 | Top-k query method and system based on name data network |
| CN110417662A (en) * | 2019-07-04 | 2019-11-05 | 东南大学 | A kind of name data network transmission method towards wisdom building |
| CN110752997A (en) * | 2019-09-26 | 2020-02-04 | 中国人民解放军陆军装甲兵学院 | Named data network forwarding method for data packet active path finding |
| CN111262785A (en) * | 2020-01-16 | 2020-06-09 | 北京工业大学 | Multi-attribute probability caching method in named data network |
| CN112039781A (en) * | 2020-09-09 | 2020-12-04 | 北京同创神州航天科技有限公司 | Named data network forwarding method based on flow control |
-
2020
- 2020-12-26 CN CN202011569719.9A patent/CN112688880B/en active Active
Patent Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20130275618A1 (en) * | 2012-04-17 | 2013-10-17 | Alcatel-Lucent Bell Labs France | Method and apparatus for reducing content redundancy in content-centric networking |
| CN104901980A (en) * | 2014-03-05 | 2015-09-09 | 北京工业大学 | Popularity-based equilibrium distribution caching method for named data networking |
| US20160182680A1 (en) * | 2014-12-17 | 2016-06-23 | Cisco Technology, Inc. | Interest acknowledgements for information centric networking |
| CN105682046A (en) * | 2016-03-10 | 2016-06-15 | 重庆邮电大学 | Interest packet forwarding method based on data attributes in vehicle-mounted named data networking |
| CN108092899A (en) * | 2018-01-05 | 2018-05-29 | 北京工业大学 | Routing policy update method based on name data network under MANET environment |
| CN108710629A (en) * | 2018-03-30 | 2018-10-26 | 湖南科技大学 | Top-k query method and system based on name data network |
| CN110417662A (en) * | 2019-07-04 | 2019-11-05 | 东南大学 | A kind of name data network transmission method towards wisdom building |
| CN110752997A (en) * | 2019-09-26 | 2020-02-04 | 中国人民解放军陆军装甲兵学院 | Named data network forwarding method for data packet active path finding |
| CN111262785A (en) * | 2020-01-16 | 2020-06-09 | 北京工业大学 | Multi-attribute probability caching method in named data network |
| CN112039781A (en) * | 2020-09-09 | 2020-12-04 | 北京同创神州航天科技有限公司 | Named data network forwarding method based on flow control |
Non-Patent Citations (3)
| Title |
|---|
| HUSSEIN AL-OMAISI，ETC: "Towards VANET-NDN: A Framework for an Efficient Data Dissemination Design Scheme", 《IEEE》 * |
| 姜一鸣等: "命名数据网络中的一种冗余控制策略", 《计算机应用研究》 * |
| 张丽等: "官渡:一种用于命名数据MANET网络的缓存策略", 《北京工业大学学报》 * |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114039932A (en) * | 2021-11-08 | 2022-02-11 | 北京工业大学 | Method for reducing redundant data packet transmission in named data MANET network |
Also Published As
| Publication number | Publication date |
|---|---|
| CN112688880B (en) | 2022-08-16 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103118013B (en) | The method of packet incidentally reverse interest bag in content center network | |
| CN107395500B (en) | Intelligent network architecture integrating perception, calculation and storage and implementation method | |
| US20130041982A1 (en) | Method and node for acquiring content and content network | |
| US10587513B2 (en) | Method, apparatus and system for determining content acquisition path and processing request | |
| US20130107885A1 (en) | Server-Side Load Balancing Using Parent-Child Link Aggregation Groups | |
| CN109347983B (en) | Multi-path forwarding method in named data network based on network coding | |
| CN108293023B (en) | System and method for supporting context-aware content requests in information-centric networks | |
| KR20140067881A (en) | Method for transmitting packet of node and content owner in content centric network | |
| US8539041B2 (en) | Method, apparatus, and network system for acquiring content | |
| CN109525304B (en) | Space intelligent network architecture integrating perception, calculation and storage | |
| CN109639758B (en) | Method and device for protecting user behavior privacy in content-centric network | |
| US11502956B2 (en) | Method for content caching in information-centric network virtualization | |
| CN113556413A (en) | Message processing method and device | |
| CN109905482B (en) | Caching method based on video live broadcast system in named data network | |
| CN110072196B (en) | Communication method and system for providing block chain oriented application for named data network | |
| CN112688880B (en) | Method for reducing redundant data packet transmission in named data network | |
| Nguyen et al. | Adaptive caching for beneficial content distribution in information-centric networking | |
| CN103546375A (en) | Content routing method and device | |
| JP5784234B2 (en) | Generalized dual-mode data transfer plane for information-centric networks | |
| CN109818855B (en) | Method for obtaining content by supporting pipeline mode in NDN (named data networking) | |
| CN111262785B (en) | Multi-attribute probability caching method in named data network | |
| CN113037635A (en) | Multi-source assembling method and device for data block in ICN router | |
| CN114257654B (en) | Named data network sequential caching method based on hierarchical idea | |
| CN114745440B (en) | CCN cache replacement method and device | |
| CN114363240B (en) | Network forwarding device and data forwarding method |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |