Calculation method for eliminating repeated routing

A computing method and routing technology, applied in transmission systems, electrical components, etc., can solve problems such as high complexity, low space efficiency, and long deduplication time, and achieve the effect of reducing algorithm complexity, saving time, and reducing energy consumption

Active Publication Date: 2022-07-22
HOHAI UNIV
View PDF11 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0005] The purpose of the present invention is to provide a calculation method for eliminating duplicate routes, which solves the shortcomings of the high complexity of most algorithms for judging route duplication in the prior art. The existing route deduplication method needs to combine a certain node in a certain route with All other nodes in all routes are compared one by one, and there are technical problems such as long deduplication time and low space efficiency

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Calculation method for eliminating repeated routing
  • Calculation method for eliminating repeated routing
  • Calculation method for eliminating repeated routing

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0032] The technical scheme of the present invention is described in further detail below in conjunction with the accompanying drawings:

[0033] First define the duplicate route, the route that passes through the same node and the total number of nodes is called the node duplicate route.

[0034] In this example, five routes are collected during work. As shown in Table 1, the route numbers are 1, 2, 3, 4, and 5, and route 1 passes through four nodes a, b, c, and d; No. 2 passes through four nodes a, c, b, and d; No. 3, No. 4, and No. 5 pass through two nodes. It can be found that No. 4 and No. 5 are two duplicate routes. In addition, for No. 1 and No. 2 routes, even if the arrangement order of the nodes is different, the total number of nodes and the nodes themselves are the same. Such two groups of routes are called node duplicate routes. Therefore, as long as the nodes between the two routes are the same (regardless of the order) and the total number of nodes is the same,...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

Abstract

The invention discloses a calculation method for eliminating repeated routing. The calculation method comprises the following steps: 1, establishing a routing data table; 2, creating a node temporary comparison table and an inter-route relationship temporary table; 3, the nodes in the node detail sorting table are sequentially iterated into the temporary node comparison table according to the sequence, and when the node identification of the newly-added node is consistent with the node identification of the current node column in the temporary comparison table, the relationship of the group where the same node is located is added into the temporary inter-group relationship table; step 4, finding out repeated routes; and step 5, creating a group sorting temporary table, comparing and judging the values of the routing IDs of the repeated routing, and deleting the routing data with the larger value of the routing IDs. According to the method for removing the repeated routes, reference is provided for a duplicate removal algorithm, the algorithm complexity is reduced, the operation efficiency is improved, and time is saved; the data volume capable of being accommodated in a unit storage space is increased to improve the storage space efficiency; equipment resources required for maintaining unit data volume are reduced; and corresponding energy consumption is reduced.

Description

technical field [0001] The invention belongs to the technical field of data analysis and preprocessing, and in particular relates to a calculation method for eliminating duplicate routes. Background technique [0002] The explosive growth of data volume has brought new challenges to the capacity, throughput performance, scalability, reliability, security, maintainability and energy management of existing storage systems, eliminating redundant information and optimizing storage. Space has become an important means to alleviate storage capacity bottlenecks. [0003] Existing main techniques for eliminating information redundancy include data compression and data deduplication. The deduplication technology is mainly the deduplication technology, and the duplicate data mainly includes the same data and similar data. Identical data deduplication technologies mainly include: identical file deduplication technology, fixed-length block-based data deduplication technology, content-...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
Patent Type & Authority Applications(China)
IPC IPC(8): H04L45/02H04L45/74
CPCH04L45/02H04L45/54H04L45/742
Inventor 徐鹏徐欣然沈俐庞小雅吴禹辰王光鑫刘志琴
Owner HOHAI UNIV
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products