IPv6 routing information base management method based on geographic position and related equipment

Abstract

The invention provides an IPv6 (Internet Protocol Version 6) routing information base management method based on a geographic position and related equipment. The method comprises the following steps: converting prefix parts of all routing information into integer prefix intervals to obtain an initial routing information base; forming initialized aggregated data based on the initial routing information base, the distance information matrix and the current non-aggregated interval set; performing iterative aggregation on the prefix interval of the initial routing information base based on the distance information matrix to obtain an aggregation prefix interval and a corresponding aggregation position; updating the current non-aggregation interval set and the distance information matrix based on the aggregation prefix interval and the corresponding aggregation position; detecting whether a conflict interval exists in the current non-aggregation interval set or not; and in response to the situation that the current non-aggregation interval set does not have the conflict interval or has a single conflict interval but the conflict interval is different from the prefix interval in the current non-aggregation interval set, updating the initial routing information base based on the aggregation prefix interval and the corresponding aggregation position to obtain an aggregation routing information base.

Description

TECHNICAL FIELD

[0001] The present disclosure relates to the technical field of communication, and in particular, to a geographic location-based IPv6 routing information base management method and related equipment. BACKGROUND

[0002] With the gradual deployment of IPv6, the global IPv6 routing table size grows rapidly, which brings significant challenges in resource-constrained space-ground communication scenarios. On the one hand, frequent routing updates significantly increase signaling overhead; on the other hand, the IPv6 address length of 128 bits puts higher requirements on limited storage and computing resources in space-ground communication. SUMMARY

[0003] The present disclosure proposes a geographic location-based IPv6 routing information base management method and related equipment, which at least partially solves the technical problems of related technologies.

[0004] In a first aspect, the present disclosure provides a geographic location-based IPv6 routing information base management method, comprising:

[0005] Converting the prefix part of all routing information into a prefix interval of an integer to obtain an initial routing information base;

[0006] Based on the initial routing information base, a distance information matrix, and a current non-aggregated interval set, an initialization aggregation data is formed; the distance information matrix is obtained based on the distances between the geographic locations indicated by all the prefix intervals; the current non-aggregated interval set includes the current prefix interval and the corresponding geographic location;

[0007] Based on the distance information matrix, the prefix intervals of the initial routing information base are iteratively aggregated to obtain aggregated prefix intervals and corresponding aggregated locations;

[0008] Based on the aggregated prefix intervals and the corresponding aggregated locations, the current non-aggregated interval set and the distance information matrix are updated;

[0009] Detecting whether there is a conflict interval in the current non-aggregated interval set;

[0010] In response to the current non-aggregated interval set not having a conflict interval, or having a single conflict interval but the conflict interval being different from the prefix interval in the current non-aggregated interval set, updating the initial routing information base based on the aggregated prefix intervals and the corresponding aggregated locations to obtain an aggregated routing information base.

[0011] In a second aspect, the present disclosure provides a geographic location-based IPv6 routing information base management device, comprising:

[0012] an interval conversion module, configured to convert prefix parts of all the routing information into integer prefix intervals to obtain an initial routing information base;

[0013] an initialization module, configured to form initialization aggregation data based on the initial routing information base, a distance information matrix, and a current non-aggregated interval set; the distance information matrix is obtained based on distances between geographic locations indicated by all the prefix intervals; the current non-aggregated interval set includes a current prefix interval and a corresponding geographic location;

[0014] an aggregation module, configured to iteratively aggregate the prefix intervals of the initial routing information base based on the distance information matrix to obtain aggregated prefix intervals and corresponding aggregated locations;

[0015] an updating module, configured to update the current non-aggregated interval set and the distance information matrix based on the aggregated prefix intervals and the corresponding aggregated locations;

[0016] a conflict detection module, configured to detect whether the current non-aggregated interval set has a conflict interval;

[0017] a routing information base updating module, configured to update the initial routing information base based on the aggregated prefix intervals and the corresponding aggregated locations to obtain an aggregated routing information base, in response to the current non-aggregated interval set having no conflict interval, or having a single conflict interval but the conflict interval being different from a prefix interval in the current non-aggregated interval set.

[0018] In a third aspect, the present disclosure provides an electronic device, including a memory, a processor, and a computer program stored in the memory and capable of running on the processor, and the processor implements the method according to the first aspect when executing the computer program.

[0019] In a fourth aspect, the present disclosure provides a non-transitory computer readable storage medium, which stores computer instructions for causing a computer to execute the method according to the first aspect.

[0020] In a fifth aspect, the present disclosure provides a computer program product, which includes computer program instructions for causing a computer to execute the method according to the first aspect when the computer program instructions run on the computer.

[0021] As can be seen from the above, the method and related device for managing a geographic location-based IPv6 routing information base provided by the present disclosure can convert network prefixes into integer intervals, and implement efficient aggregation by using interval merging, error detection and correction, and the like. This method can not only significantly compress the routing table size, but also effectively reduce the consumption of storage and computing resources, and is particularly suitable for resource-limited power grid devices. BRIEF DESCRIPTION OF DRAWINGS

[0022] In order to more clearly illustrate the technical solutions in the present disclosure or the related art, the drawings needed to be used in the embodiments or the related art description will be briefly introduced. Obviously, the drawings in the following description are only embodiments of the present disclosure, and other drawings can be obtained by those skilled in the art without any creative effort on the basis of these drawings.

[0023] Figure 1 The schematic diagram of the geographic location-based IPv6 routing information base management architecture of the embodiments of the present disclosure.

[0024] Figure 2 The schematic diagram of the hardware structure of the exemplary electronic device of the embodiments of the present disclosure.

[0025] Figure 3 The flowchart of the geographic location-based IPv6 routing information base management method of the embodiments of the present disclosure.

[0026] Figure 4 The principle schematic diagram of the prefix aggregation of the geographic location-based IPv6 routing information base of the embodiments of the present disclosure.

[0027] Figure 5 The principle schematic diagram of the prefix change of the geographic location-based IPv6 routing information base of the embodiments of the present disclosure.

[0028] Figure 6 The example of the geographic location-based IPv6 routing information base management method of the embodiments of the present disclosure.

[0029] Figure 7 The schematic diagram of the geographic location-based IPv6 routing information base management apparatus of the embodiments of the present disclosure. DETAILED DESCRIPTION

[0030] In order to make the purposes, technical solutions and advantages of the present disclosure clearer, the present disclosure will be further described in detail below with reference to specific embodiments and drawings.

[0031] It should be noted that, unless otherwise defined, technical terms or scientific terms used in the embodiments of the present disclosure shall be understood as their common meanings to those skilled in the art to which the embodiments of the present disclosure belong. The terms "first", "second" and similar terms used in the embodiments of the present disclosure do not denote any order, quantity or importance, but are only used to distinguish different components. The terms "include", "contain" and similar terms mean that the elements or objects before the terms encompass the elements or objects listed after the terms and their equivalents, and do not exclude other elements or objects. The terms "connect" or "connected" and similar terms are not limited to physical or mechanical connections, but can include electrical connections, whether direct or indirect. The terms "upper", "lower", "left", "right" and the like are only used to represent relative positional relationships, and when the absolute positions of the described objects change, the relative positional relationships may also change accordingly.

[0032] It can be understood that, before using the technical solutions disclosed in the embodiments of the present disclosure, the type, use range, use scenario and the like of the personal information involved in the present disclosure should be informed to the user and the authorization of the user should be obtained in a proper manner according to relevant laws and regulations. For example, when responding to the active request of the user, a prompt information is sent to the user to explicitly prompt the user that the operation requested to be executed will need to obtain and use the personal information of the user. Thus, the user can voluntarily choose whether to provide the personal information to the electronic device, application program, server or storage medium and the like software or hardware that execute the operation of the technical solutions of the present disclosure according to the prompt information.

[0033] It can be understood that the above notification and user authorization process is only illustrative, and does not limit the implementation of the present disclosure, and other ways that meet the relevant laws and regulations can also be applied to the implementation of the present disclosure.

[0034] Figure 1 A schematic diagram of a geographic location-based IPv6 routing information base management architecture of an embodiment of the present disclosure is shown. Referring to Figure 1 The geographic location-based IPv6 routing information base management architecture 100 can include a server 110, a terminal 120 and a network 130 providing a communication link. The server 110 and the terminal 120 can be connected through the wired or wireless network 130. The server 110 can be a stand-alone physical server, or a server cluster or distributed system composed of multiple physical servers, or a cloud server providing cloud services, cloud databases, cloud computing, cloud functions, cloud storage, network services, cloud communication, middleware services, security services, CDN and other basic cloud computing services.

[0035] The terminal 120 can be implemented in hardware or software. For example, when the terminal 120 is implemented in hardware, the terminal 120 can be various electronic devices having a display screen and supporting page display, including but not limited to a smart phone, a tablet computer, an electronic book reader, a laptop computer, a desktop computer, and the like. When the terminal 120 is implemented in software, the terminal 120 can be installed in the above-listed electronic devices; the terminal 120 can be implemented as a plurality of software or software modules (for example, software or software modules for providing a distributed service) or as a single software or software module, which is not specifically limited herein.

[0036] It should be noted that the method for managing the IPv6 routing information base based on the geographic position provided in the embodiments of the present disclosure can be executed by the terminal 120, can be executed by the server 110, or can be executed by the terminal 120 and the server 110 together. It should be understood that, Figure 1 The number of terminals, networks, and servers in the above description is only illustrative and is not intended to limit the same. According to the implementation needs, there can be any number of terminals, networks, and servers.

[0037] Figure 2 A hardware structure schematic diagram of an exemplary electronic device 200 provided by the embodiments of the present disclosure is shown. As shown in Figure 2 The electronic device 200 can include a processor 202, a memory 204, a network module 206, a peripheral interface 208, and a bus 210. The processor 202, the memory 204, the network module 206, and the peripheral interface 208 are communicatively connected to each other within the electronic device 200 through the bus 210.

[0038] The processor 202 can be a central processing unit (CPU), a neural network processor (NPU), a microcontroller unit (MCU), a programmable logic device, a digital signal processor (DSP), an application specific integrated circuit (ASIC), or one or more integrated circuits. The processor 202 can be used to perform functions related to the technologies described in the present disclosure. In some embodiments, the processor 202 can also include multiple processors integrated as a single logical component. For example, as shown in Figure 2 The processor 202 can include multiple processors 202a, 202b, and 202c.

[0039] The memory 204 can be configured to store data (for example, instructions, computer code, and the like). As Figure 2As shown, the data stored by the memory 204 can include program instructions (e.g., program instructions for implementing the geographic location-based IPv6 routing information base management method of embodiments of the present disclosure) and data to be processed (e.g., the memory can store configuration files of other modules, etc.). The processor 202 can also access the program instructions and data stored by the memory 204 and execute the program instructions to operate on the data to be processed. The memory 204 can include volatile storage or non-volatile storage. In some embodiments, the memory 204 can include random access memory (RAM), read only memory (ROM), optical disk, magnetic disk, hard disk, solid state disk (SSD), flash memory, memory stick, etc.

[0040] The network module 206 can be configured to provide communication with other external devices to the electronic device 200 via a network. The network can be any wired or wireless network capable of transmitting and receiving data. For example, the network can be a wired network, a local wireless network (e.g., Bluetooth, WiFi, near field communication (NFC), etc.), a cellular network, the Internet, or a combination thereof. It can be understood that the type of network is not limited to the specific examples described above. In some embodiments, the network module 206 can include any combination of any number of network interface controllers (NICs), radio frequency modules, transceivers, modems, routers, gateways, adapters, cellular network chips, etc.

[0041] The peripheral interface 208 can be configured to connect the electronic device 200 with one or more peripheral devices to enable information input and output. For example, the peripheral devices can include input devices such as keyboards, mice, touchpads, touchscreens, microphones, various sensors, etc. and output devices such as displays, speakers, vibrators, indicator lights, etc.

[0042] The bus 210 can be configured to transmit information between various components (e.g., the processor 202, the memory 204, the network module 206, and the peripheral interface 208) of the electronic device 200, such as internal buses (e.g., processor-memory buses), external buses (USB ports, PCI-E buses), etc.

[0043] It should be noted that although the architecture of the electronic device 200 described above only shows the processor 202, the memory 204, the network module 206, the peripheral interface 208, and the bus 210, in the specific implementation process, the architecture of the electronic device 200 can also include other components necessary for normal execution. In addition, those skilled in the art can understand that the architecture of the electronic device 200 described above can also only include components necessary for implementing the embodiments of the present disclosure, and does not necessarily include all the components shown in the figure.

[0044] With the deepening of the digital transformation of the power grid, smart grid has gradually become an important direction of the development of the power system. Through technologies such as the Internet of Things, cloud computing, and big data, smart grid realizes the interconnection and efficient management of power grid equipment. In this process, a large number of terminal devices (such as smart meters, sensors, controllers, etc.) need to be assigned unique IP addresses to support communication and data transmission between devices. IPv6, with its huge address space advantage, has become the preferred protocol for power grid communication networks. The geographical distribution of power grid equipment is significantly dispersed, especially in areas with poor signal coverage such as mountainous areas and remote areas, where power grid equipment often cannot achieve efficient communication through traditional 4G or 5G networks. In this case, it is often necessary to rely on integrated satellite communication networks to achieve the interconnection and interconnection of ground equipment and control centers through satellite links. However, the bandwidth resources of satellite-ground communication are limited, and frequent route updates and large route table sizes can significantly increase signaling overhead, putting a great pressure on network resources. Although the route prefix compression method for IPv4 can alleviate the problem of route table size growth to some extent, it has obvious limitations when directly applied to IPv6 in the power grid scenario. IPv4 and IPv6 have significant differences in address length, structure, and route prefix characteristics, and existing methods are difficult to effectively handle IPv6's 128-bit address. In addition, the geographical location characteristics of the route prefix in the power grid communication network are not fully considered, which limits the compression efficiency and route reachability. At the same time, existing methods lack efficient support for dynamic updates of the route table, making it difficult to meet the frequent route update requirements in the power grid communication network.

[0045] Therefore, how to optimize the IPv6 route table in the power grid scenario to reduce signaling overhead and the occupation of storage resources and computing resources has become a technical problem that needs to be solved.

[0046] In view of this, the embodiments of the present disclosure provide a geographic location-based IPv6 routing information base management method and related equipment. By converting network prefixes into integer intervals, efficient aggregation is achieved using interval merging, error detection and correction, etc. This method not only can significantly compress the route table size, but also can effectively reduce the consumption of storage and computing resources, especially suitable for resource-constrained power grid equipment. Taking IPv6 as an example, addresses with 64-bit network prefixes account for the majority of the distribution of the number of IPv6 prefixes. Therefore, the present disclosure regards the first 64 bits of an IPv6 address as a network prefix and the last 64 bits as an interface identifier, and only aggregates the first 64 bits to reduce the amount of data to be processed.

[0047] Referring to Figure 3 , Figure 3A schematic flow chart of a geographic location based IPv6 routing information base management method according to an embodiment of the present disclosure is shown. The geographic location based IPv6 routing information base management method according to an embodiment of the present disclosure can be deployed on a server side or a terminal. Figure 3 In some embodiments, the geographic location based IPv6 routing information base management method 300 can further include the following steps.

[0048] In step S310, the prefix part of all routing information is converted into a prefix interval of an integer, to obtain an initial routing information base.

[0049] The routing information can refer to an IPv6 address. The first 64 bits of the IPv6 address can be regarded as a network prefix, and the last 64 bits can be regarded as an interface identifier. Then, the network prefix part is extracted and converted into an interval representation (a start address and an end address) of an integer; a special prefix is processed, and for a / 64 prefix, it is converted into an interval with the same start address and end address, so as to be uniformly processed with other intervals.

[0050] In some embodiments, converting the prefix part of all routing information into a prefix interval of an integer includes:

[0051] The routing address is converted into a 128-bit binary, and the prefix part is extracted;

[0052] In response to the prefix part being less than 64 bits, the end of the prefix part is increased by 0 to obtain an interval start address of a 64-bit binary, and the end of the prefix part is increased by 1 to obtain an interval end address of a 64-bit binary; and in response to the prefix part being equal to 64 bits, the prefix part is taken as the interval start address and the interval end address;

[0053] The start address and the end address are converted into decimals to obtain the prefix interval.

[0054] Specifically, taking 2001:0db8:0001:0010:: / 62 as an example, a prefix length of 62 can be extracted. The IPv6 address is converted into a 128-bit binary:

[0055] 00100000000000010000110110111000000000000000000100000000000100000000000000000000000000000000000000000000000000000000000000000000.

[0056] The network prefix of the first 62 bits is intercepted:

[0057] 00100000000000010000110110111000000000000000000100000000000100.

[0058] Calculate the length of the suffix: 64-2=2. The start interval is the network prefix of the first 62 bits plus 2 00, its binary: 0010000000000001000011011011100000000000000000010000000000010000.

[0059] The end interval is the network prefix of the first 62 bits plus 2 11, its binary:

[0060] 0010000000000001000011011011100000000000000000010000000000010011.

[0061] Convert the start interval to decimal: 2306139568115613712, and the end interval to decimal: 2306139568115613715.

[0062] Get the integer interval: [2306139568115613712, 2306139568115613715].

[0063] Process the special prefix 2001:0db8:0001:0010:: / 64, convert it to an interval [2306139568115613712, 2306139568115613712] with the same start and end address, so as to be uniformly processed with other intervals. Other by analogy, form the initial routing information base (since the converted integer is too large and the first 14 are the same, so the integer interval only takes the last five digits, which does not affect the subsequent aggregation effect), as shown in Table 1.

[0064]

[0065]

[0066] Table 1

[0067] In step S320, based on the initial routing information base, the distance information matrix and the current non-aggregated interval set, the initial aggregation data is formed; the distance information matrix is obtained based on the distance between the geographical positions indicated by all the prefix intervals; the current non-aggregated interval set includes the current prefix interval and the corresponding geographical position.

[0068] The initialization of the aggregated data can include an initial routing information base, a distance information matrix, a non-aggregated interval set, and an initial non-aggregated interval set. The routing information base can store initial IPv6 prefix interval information, and the prefix length is 64 bits. The distance information matrix can be used to store the distances between intervals. The non-aggregated interval set can refer to the storage of the intervals that are not aggregated at present. The initial non-aggregated interval set can refer to the storage of the intervals that are not aggregated in the initial state. As shown in Table 2, Figure 4 Figure 4 A principle diagram of prefix aggregation of a routing information base based on geographical position is shown according to an embodiment of the present disclosure.

[0069] Specifically, the routing information base can include storage of initial IPv6 prefix interval information, as shown in Table 2.

[0070] Geographical position Integer interval A [13712，13712] B [13712，13715] C [21888，21903] D [13696，79231]

[0071] Table 2

[0072] The distance information matrix can store the distances (unit: km) between intervals, as shown in Table 3.

[0073] A B C D A 0 500 1500 4000 B 500 0 1000 3500 C 1500 1000 0 2500 D 4000 3500 2500 0

[0074] Table 3

[0075] The non-aggregated interval set: {[13712, 13712], [13712, 13715], [21888, 21903], [13696, 79231]}; and the initial non-aggregated interval set: {[13712, 13712], [13712, 13715], [21888, 21903], [13696, 79231]}.

[0076] In step S330, the prefix intervals of the initial routing information base are iteratively aggregated based on the distance information matrix, to obtain aggregated prefix intervals and corresponding aggregated positions.

[0077] The prefix intervals of the initial routing information base are iteratively aggregated based on the distance information matrix, to obtain aggregated prefix intervals and corresponding aggregated positions. This process is to analyze the geographical distance relationship between the prefix intervals, and to combine the prefix intervals with similar distances, so as to reduce the size of the routing table and improve the routing efficiency. Specifically, the iterative aggregation process will gradually combine adjacent or similar prefix intervals to form larger aggregated prefix intervals, and record the geographical position information corresponding to these aggregated prefix intervals. This method is particularly important in geographical distribution and dispersion scenarios such as power grid communication networks, and can effectively reduce the signaling overhead and the demand for storage and computing resources.

[0078] ​In some embodiments, the initial route information base is iteratively aggregated based on the distance information matrix to obtain an aggregated prefix interval and a corresponding aggregated location, including:

[0079] The prefix interval corresponding to the minimum distance in the distance information matrix is determined as a current interval and a next interval.

[0080] It is determined whether the minimum distance satisfies a first aggregation condition.

[0081] In response to the minimum distance satisfying the first aggregation condition, the aggregated location is determined based on a first geographic location corresponding to the current interval and a second geographic location corresponding to the next interval.

[0082] A first distance between the aggregated location and the first geographic location, and a second distance between the aggregated location and the second geographic location are determined.

[0083] In response to the first distance and the second distance both being less than a second aggregation condition, the current interval and the next interval are synthesized to obtain the aggregated prefix interval.

[0084] Specifically, the distance information matrix can be traversed to find a minimum distance value and record its corresponding subscript. Adjacent intervals are obtained, and two adjacent intervals are obtained from the initial route information base according to the subscript, and are respectively recorded as a "current interval" and a "next interval". It is determined whether the minimum distance satisfies the aggregation condition. If the first aggregation condition (for example, the minimum distance is greater than 2000) is satisfied, the updated compressed route information base and the non-aggregated interval set are output, and the aggregation process is ended. If the first aggregation condition (for example, the minimum distance is less than or equal to 2000) is not satisfied, an aggregated location is generated and the distance of the aggregated interval is calculated. The aggregated location is generated, and all original locations of the current interval and the next interval are aggregated into a new location, which is recorded as "aggregated location". The distance between the aggregated location and all original locations is calculated. It is determined whether the distance satisfies the second aggregation condition. If the second aggregation condition (for example, all distances are less than or equal to 1000) is satisfied, the current interval and the next interval are aggregated into a new interval, which is recorded as "aggregated interval". The current interval and the next interval are deleted from the non-aggregated interval set, and the aggregated interval is added to the non-aggregated interval set. All intervals in the address range of the aggregated interval in the non-aggregated interval set are obtained. If the second aggregation condition is not satisfied, it is detected whether the current non-aggregated interval set has a conflict interval.

[0085] In step S340, the current non-aggregated interval set and the distance information matrix are updated based on the aggregated prefix interval and the corresponding aggregated location.

[0086] By the updating process, the current non-aggregated prefix set and the distance information matrix can always reflect the latest routing state and geographical position relationship, thereby supporting subsequent route aggregation and optimization operations.

[0087] In some embodiments, updating the current non-aggregated prefix set and the distance information matrix based on the aggregated prefix and the corresponding aggregated position comprises:

[0088] removing the current prefix and the next prefix in the current non-aggregated prefix set, and adding the aggregated prefix to the current non-aggregated prefix set, to update the current non-aggregated prefix set;

[0089] updating the distance information matrix based on the distance between the aggregated position and other geographical positions in the distance information matrix.

[0090] Specifically, the current prefix and the next prefix in the current non-aggregated prefix set that have been aggregated into the aggregated prefix are removed. The newly generated aggregated prefix is added to the current non-aggregated prefix set, which ensures that the aggregated prefix is included in the subsequent routing processing flow. Based on the aggregated position of the aggregated prefix, the distance between the position and other geographical positions in the distance information matrix is calculated. The calculated distance value is updated to the distance information matrix. Specifically, for each geographical position in the distance information matrix, the distance between the position and the aggregated position is found, and the corresponding position in the matrix is updated.

[0091] In step S350, it is detected whether the current non-aggregated prefix set has a conflict prefix.

[0092] The conflict prefix can refer to an overlapping prefix of two or more prefix in the address space. By detecting the conflict prefix in the current non-aggregated prefix set, the correctness and efficiency of the routing table can be ensured.

[0093] In some embodiments, detecting whether the current non-aggregated prefix set has a conflict prefix comprises:

[0094] determining whether there is an overlapping area with the aggregated prefix in the current non-aggregated prefix set;

[0095] In response to the existence of the overlapping area with the aggregated prefix in the current non-aggregated prefix set, it is determined whether a third distance between an original position corresponding to the overlapping area and the aggregated position satisfies a third preset condition;

[0096] In response to the third distance between the original position corresponding to the overlapping area and the aggregated position satisfying the third preset condition, the overlapping area is determined as the conflict area.

[0097] The process includes checking the validity of aggregated intervals. Specifically, conflict detection is initialized as follows: an empty set is initialized to store conflict intervals; the conflict interval counter is set to zero; conflict intervals are traversed, and intervals in the non-aggregated interval set that overlap with the address range of the aggregated interval are traversed. The distance between the original location (e.g., geographic locations A, B, C, D) and the aggregated location (e.g., locations AB, ABC) is calculated. If the distance is greater than 1000m, the interval is added to the conflict set, and the conflict counter is incremented. The conflict status is then determined. If the conflict counter is greater than one, or if the conflict counter is equal to one and the conflict interval is the current interval or the next interval, the non-aggregated interval set is restored to its pre-aggregation state; the minimum distance corresponding to this distance in the distance information matrix is ​​set to a large value (e.g., 100000m), the current aggregation operation is skipped, and the process jumps back to the iterative aggregation process. Otherwise, the routing information database is updated.

[0098] In step S360, in response to the absence of conflicting intervals in the current non-aggregated interval set, or the existence of a single conflicting interval but the conflicting interval being different from the prefix interval in the current non-aggregated interval set, the initial routing information base is updated based on the aggregated prefix interval and the corresponding aggregated location to obtain the aggregated routing information base.

[0099] Specifically, if aggregation is valid, the current interval is replaced with the aggregated interval in the initial routing information base, and the next interval is deleted; the distance information matrix and the set of non-aggregated intervals are updated. For single conflicting intervals, if the conflict counter equals one, the conflicting interval is inserted into the initial routing information base, and the distance information matrix and the set of non-aggregated intervals are updated. A decision is made whether to continue aggregation. If no intervals meet the aggregation conditions, or if all intervals have been aggregated, the aggregation result, i.e., the final aggregated routing information base, is output, containing all aggregated IPv6 prefix interval information; otherwise, the process jumps to the iterative aggregation process.

[0100] For example, in the first round of aggregation: geographic location A and geographic location B. Traverse the distance matrix to find the minimum distance value: 500km, corresponding to intervals A and B. Generate the aggregation location and calculate the distance of the aggregation interval: the distance between A and B is 500km, so the aggregation location is the midpoint between A and B, with a distance of 500 / 2 = 250km from both A and B. Determine if the distances to A and B are both less than or equal to 1000km, satisfying the first aggregation condition.

[0101] Check the validity of the aggregated intervals: Initialize conflict detection by setting the conflict set to empty and the conflict counter to 0. Traverse the conflict intervals; there are no intervals overlapping with [13712, 13715] in the non-aggregated interval set. Determine the conflict status: no conflict. Update the routing information database by replacing the rows containing A and B with AB, as shown in Table 4.

[0102] Geographical position Integer interval AB [13712，13715] C [21888，21903] D [13696，79231]

[0103] Table 4

[0104] Update the non-aggregated interval set: remove [13712, 13712] and [13712, 13715] from the non-aggregated interval set, and add the aggregated interval [13712, 13715], resulting in the non-aggregated interval set: {[13712, 13715], [21888, 21903], [13696, 79231]}. Update the distance matrix, the distance between AB and C: 250 + 1000 = 1250 km, the distance between AB and D: 250 + 3500 = 3750 km, as shown in Table 5.

[0105] AB C D AB 0 1250 3750 C 1250 0 2500 D 3750 2500 0

[0106] Table 5

[0107] There are still aggregable intervals in the non-aggregated interval set, and the aggregation continues. Perform the second round of aggregation: AB and C;

[0108] Traverse the distance matrix to find the minimum distance value: 1250 km, and the corresponding interval is AB and C; generate the aggregation location and calculate the distance of the aggregated interval.

[0109] Generate the aggregation location: the distance between AB and C is 1250 km, and the aggregation location is taken as the midpoint of AB and C, with a distance of 1250 / 2 = 625 km from each of AB and C; judge that the distances from AB and C are both less than or equal to 1000 km, satisfying the first aggregation condition.

[0110] Check the validity of the aggregated interval: initialize conflict detection, set the conflict set to empty, and set the conflict counter to 0. Traverse the conflict interval: in the non-aggregated interval set, the integer interval [13696, 79231] of D overlaps with the aggregated interval [13712, 21903], resulting in the conflict interval [13712, 21888], and the conflict counter is incremented by 1. Judge the conflict situation: the conflict counter is equal to 1, and the conflict interval [13712, 21888] does not belong to the current interval or the next interval, continue to update the routing information base.

[0111] Handle the single conflict interval: insert the conflict interval [13712, 21888] into the routing information base. Update the routing information base, replace AB and C with ABC, as shown in Table 6.

[0112] Geographical position Integer interval ABC [13712，21903] D [13696，79231] D (conflict) [13712，21888]

[0113] Table 6

[0114] Update the non-aggregated interval set, remove [13712, 13715] and [21888, 21903] from the non-aggregated interval set, add aggregated interval [21888, 21903] and conflict interval [13712, 21888]. Non-aggregated interval set: {[13712, 21903], [13712, 21888], [13696, 79231]}.

[0115] Update the distance information matrix, recalculate the distance between ABC and other intervals: the distance between ABC and D: 625 + 2500 = 3125 km, as shown in Table 7.

[0116] ABC D ABC 0 3125 D 3125 0

[0117] Table 7

[0118] Determine that the minimum distance between any two intervals in the non-aggregated interval set is greater than 2000 km, which does not meet the aggregation condition, and the aggregation is complete. Output the aggregation result, i.e. the final aggregated routing information base, which contains all the aggregated IPv6 prefix interval information, as shown in Table 8.

[0119] Geographical position Integer interval ABC [13712，21903] D [13696，79231] D (conflict) [13712，21888]

[0120] Table 8

[0121] In some embodiments, the method 300 further includes:

[0122] In response to the current non-aggregated interval set having multiple conflict intervals, or having a single conflict interval but the conflict interval is incompatible with a prefix interval in the current non-aggregated interval set, restore the current non-aggregated interval set to the state before aggregation.

[0123] The restoration of the current non-aggregated interval set to the state before aggregation is an effective fault tolerance mechanism that can ensure the consistency and accuracy of the routing table. By backing up the state before aggregation, detecting conflicts, triggering restoration operations, and subsequent processing and preventive measures, the conflict problem in the routing table aggregation process can be effectively managed, and the stability and reliability of the routing system can be improved. When multiple conflict intervals are detected in the current non-aggregated interval set, it indicates that the aggregation process may have introduced multiple incompatible or overlapping prefix intervals. Even if there is only one conflict interval, if the conflict interval has serious compatibility problems with other prefix intervals in the current non-aggregated interval set (such as serious address space overlap, logical errors in geographic location, etc.), the set may need to be restored to the state before aggregation.

[0124] In some embodiments, the method 300 further includes:

[0125] Obtain new routing information;

[0126] convert the prefix part of the added route information into an added prefix interval of the certificate, and add the added prefix interval to the current non-aggregated interval set;

[0127] in response to the added prefix interval not overlapping with other intervals in the current non-aggregated interval set, updating the aggregated route information library based on the added prefix interval and the corresponding geographical location;

[0128] in response to the added prefix interval overlapping with other intervals in the current non-aggregated interval set, determining a first redundant interval overlapping with the added prefix interval; and / or, determining a second redundant interval in the aggregated route information library that is not matched with an Internet address;

[0129] removing the first redundant interval and / or the second redundant interval to update the aggregated route information library.

[0130] Wherein, it can be judged that the prefix update type is an added IPv6 prefix or an IPv6 prefix that needs to be deleted. The current non-aggregated interval set and the current compressed route information library are input. The update type is judged. If the input is an added IPv6 prefix, jump to run the incremental update algorithm; if the input is an IPv6 prefix that needs to be deleted, jump to the prefix deletion algorithm. As shown in Figure 5 , a principle diagram of prefix change of a geographical location-based route information library according to an embodiment of the present disclosure is shown. Figure 5 , a principle diagram of prefix change of a geographical location-based route information library according to an embodiment of the present disclosure is shown. Figure 5 , a principle diagram of prefix change of a geographical location-based route information library according to an embodiment of the present disclosure is shown.

[0131] For example, as shown in Figure 6 , a principle diagram of prefix change of a geographical location-based route information library according to an embodiment of the present disclosure is shown. Figure 6 , a principle diagram of prefix change of a geographical location-based route information library according to an embodiment of the present disclosure is shown. Figure 6In the middle, a new IPv6 prefix 2001:0db8:0001:3000:: / 60 is added at geographic location E, the new prefix is converted to integer interval [25984, 25999] and inserted into the non-aggregated interval set; the non-aggregated interval set is traversed, and it is found that the interval has no overlap with the existing aggregated interval; the new interval [25984, 25999] is inserted into the routing information base. For example, a new IPv6 prefix 2001:0db8:0001:200F:: / 62 is added at geographic location ABC, the new prefix is converted to integer interval [21900, 21903] and inserted into the non-aggregated interval set. The non-aggregated interval set is traversed, and it is found that the interval overlaps with the existing aggregated interval [13712, 21903]. The aggregated interval is updated to [13712, 21903] (no change), and the conflict interval [13712, 21888] remains unchanged. For example, a new IPv6 prefix 2001:0db8:0001:0000:: / 62 is added at geographic location ABC; the new prefix is converted to integer interval [13696, 13699] and inserted into the non-aggregated interval set. The non-aggregated interval set is traversed, and it is found that the interval overlaps with the existing aggregated interval [13696, 79231], and the aggregated interval is updated to [13696, 79231] (no change). The data structure is updated, and subsequent processing of the compressed routing information base and the non-aggregated interval set is performed, including updating the query index and the distance information matrix.

[0132] In some embodiments, the method 300 further includes:

[0133] obtaining removal routing information;

[0134] converting a prefix part of the removal routing information to an integer removal prefix interval;

[0135] in response to the removal prefix interval being a start part of any interval in the aggregated routing information base, removing the start part of the corresponding interval;

[0136] in response to the removal prefix interval being a middle part of any interval in the aggregated routing information base, removing the query index corresponding to the removal prefix interval without modifying the aggregated routing information base;

[0137] in response to the removal prefix interval being an end part of any interval in the aggregated routing information base, removing the end part of the corresponding interval;

[0138] in response to the removal prefix interval not belonging to any interval in the aggregated routing information base, not modifying the aggregated routing information base.

[0139] The deleted prefix is classified according to the relationship type between the deleted prefix and the compressed interval, and is divided into the following four types: internal prefix, the deleted prefix is completely contained in a certain compressed interval; starting prefix, the deleted prefix is the starting part of a certain compressed interval; end prefix, the deleted prefix is the end part of a certain compressed interval; and independent prefix, the deleted prefix does not belong to any compressed interval. Different deletion processing is performed according to the prefix classification result, the IPv6 prefix deletion is completed, the data structure is updated, and subsequent processing is performed on the compressed routing information base and the non-aggregated interval set, including updating the query index and the distance information matrix. The internal prefix is processed, the query structure is directly updated, the corresponding query index is removed, and the compressed interval does not need to be modified; the starting prefix is processed, the starting position of the next prefix in the original data is found, and the starting boundary of the compressed interval is adjusted to the starting position of the next prefix; the end prefix is processed, the end boundary of the compressed interval is adjusted to the starting position of the deleted prefix minus one; and the independent prefix is processed, the interval is directly removed from the compressed prefix list, and the compression algorithm is re-executed as needed to update the compressed routing information base and the non-aggregated interval set; the data structure is updated, and subsequent processing is performed on the compressed routing information base and the non-aggregated interval set, including updating the query index and the distance information matrix. As shown in Table 9-Table 10. Figure 5 Figure 5 A principle diagram of prefix change of a geographic location-based routing information base according to an embodiment of the present disclosure is shown.

[0140] The updated compressed routing information base and non-aggregated interval set are output, and the routing information base, non-aggregated interval set, and distance information matrix are updated, as shown in Table 9-Table 10.

[0141] Routing information base:

[0142] Geographical position Integer interval ABC [13712，21903] D [13696，79231] D (conflict) [13712，21888] E [25984，25999]

[0143] Table 9

[0144] Non-aggregated interval set: {[13712, 21903], [13712, 21888], [13696, 79231], [25984, 25999]}; distance information matrix:

[0145]

[0146]

[0147] Table 10

[0148] For example, the IPv6 prefix to be deleted is input as follows:

[0149] 2001:0db8:0001:0010:: / 62 ​

[0150] 2001:0db8:0001:0000:: / 62

[0151] 2001:0db8:0001:200F:: / 62

[0152] 2001:0db8:0001:3000:: / 60

[0153] The deleted prefixes are classified as follows:

[0154] The interval [13712, 13715] corresponding to 2001:0db8:0001:0010:: / 62 is completely contained in the aggregated interval [13712, 21903], which is an internal prefix;

[0155] The interval [13696, 13699] corresponding to 2001:0db8:0001:0000:: / 62 is the starting part of the aggregated interval [13696, 79231], which is a starting prefix;

[0156] The interval [21900, 21903] corresponding to 2001:0db8:0001:200F:: / 62 is the end part of the aggregated interval [13712, 21903], which is an end prefix;

[0157] The interval [25984, 25999] corresponding to 2001:0db8:0001:3000:: / 60 does not belong to any aggregated interval, which is an independent prefix.

[0158] Classify the deleted prefixes;

[0159] Process the internal prefix: delete the interval [13712, 13715] corresponding to 2001:0db8:0001:0010:: / 62, update the query structure, remove the corresponding query index, and do not need to modify the compressed interval;

[0160] Process the starting prefix: delete the interval [13696, 13699] corresponding to 2001:0db8:0001:0000:: / 62, find the starting position of the next prefix in the original data, adjust the starting boundary of the compressed interval to the starting position of the next prefix, that is, the "non-aggregated interval set" ({[13712, 21903], [13712, 21888], [13696, 79231], [25984, 25999]}), all numbers inside are arranged in ascending order, the next prefix number is 13712, and the updated interval is [13712, 79231];

[0161] Deletion of the interval [21900, 21903] corresponding to the suffix 2001:0db8:0001:200F:: / 62, adjustment of the end boundary of the compressed interval to the start position of the deleted prefix minus one, and the updated interval is [13712, 21899];

[0162] Deletion of the interval [25984, 25999] corresponding to the independent prefix 2001:0db8:0001:3000:: / 60, and removal of the interval from the compressed prefix list directly;

[0163] Output the aggregation result, i.e., the final aggregated routing information base, which contains all the aggregated IPv6 prefix interval information.

[0164] The routing information base is shown in Table 11.

[0165]

[0166]

[0167] Table 11

[0168] It can be seen that for prefix addition, the interval insertion of the newly added prefix and the deletion of redundant intervals are efficiently processed; for prefix deletion, different types of deletion operations (such as internal prefix, start prefix, suffix and independent prefix) are classified and processed to realize incremental updating. The algorithm avoids re-executing the complete compression process in most cases, significantly improving the updating efficiency. At the same time, the algorithm maintains the consistency of the compression result and the query structure in the deletion operation, ensuring the correctness of the route query.

[0169] Compared with the prior art, the present application can significantly reduce the size of the routing table, reduce the consumption of storage and computing resources, and optimize the routing compression effect by combining geographical location information to ensure the reachability and accuracy of the route. In addition, the method supports efficient incremental updating, including prefix addition and deletion operations, avoiding frequent execution of the complete compression process, improving the efficiency of dynamic route management, and being particularly suitable for resource-constrained power grid communication networks, such as satellite communication and edge device scenarios, further enhancing the performance and scalability of the network.

[0170] It should be noted that the method of the present disclosure can be executed by a single device, such as a computer or a server. The method of the present embodiment can also be applied to a distributed scenario, and completed by multiple devices cooperating with each other. In this distributed scenario, one of the multiple devices can only execute one or more steps in the method of the present disclosure, and the multiple devices can communicate with each other based on the geographical location of the IPv6 routing information base to complete the method.

[0171] It is to be understood that the foregoing description is directed to some embodiments of the disclosure. Various changes can be made to the application claimed without departing from the scope of the disclosure. In some cases, the acts or steps recited in the claims can be performed in a different order and still achieve desirable results. In addition, processes depicted in the accompanying figures do not necessarily require the particular order shown or sequential order to achieve desirable results. In certain implementations, multitasking and parallel processing can be advantageous.

[0172] According to the same technical concept, the disclosure also provides a geographic location-based IPv6 routing information base management device corresponding to any of the above-mentioned embodiment methods, which is described in detail in the following. Figure 7 The geographic location-based IPv6 routing information base management device comprises:

[0173] An interval conversion module is configured to convert the prefix part of all routing information into an integer prefix interval to obtain an initial routing information base.

[0174] An initialization module is configured to form initialization aggregation data based on the initial routing information base, a distance information matrix, and a current non-aggregation interval set. The distance information matrix is obtained based on the distance between the geographic locations indicated by all the prefix intervals. The current non-aggregation interval set comprises a current prefix interval and a corresponding geographic location.

[0175] An aggregation module is configured to iteratively aggregate the prefix intervals of the initial routing information base based on the distance information matrix to obtain an aggregated prefix interval and a corresponding aggregated location.

[0176] An updating module is configured to update the current non-aggregation interval set and the distance information matrix based on the aggregated prefix interval and the corresponding aggregated location.

[0177] A conflict detection module is configured to detect whether there is a conflict interval in the current non-aggregation interval set.

[0178] A routing information base updating module is configured to update the initial routing information base based on the aggregated prefix interval and the corresponding aggregated location to obtain an aggregated routing information base in response to the current non-aggregation interval set having no conflict interval or having a single conflict interval that is different from the prefix interval in the current non-aggregation interval set.

[0179] In some embodiments, the geographic location-based IPv6 routing information base management device further comprises:

[0180] a recovery module configured to, in response to the current non-aggregated interval set having multiple conflicting intervals, or having a single conflicting interval but the conflicting interval being a prefix interval in the current non-aggregated interval set, recover the current non-aggregated interval set to a state before aggregation.

[0181] In some embodiments, the geo-location based IPv6 routing information base management apparatus further comprises:

[0182] an obtaining module configured to obtain new routing information;

[0183] the interval conversion module is further configured to convert a prefix part of the new routing information into a new prefix interval of a certificate, and add the new prefix interval to the current non-aggregated interval set;

[0184] the routing information base updating module is further configured to, in response to the new prefix interval not overlapping with other intervals in the current non-aggregated interval set, update the aggregated routing information base based on the new prefix interval and a corresponding geo-location;

[0185] a redundancy detection module configured to, in response to the new prefix interval overlapping with other intervals in the current non-aggregated interval set, determine a first redundant interval overlapping with the new prefix interval; and / or, determine a second redundant interval in the aggregated routing information base not matching an Internet address;

[0186] a redundancy removal module configured to remove the first redundant interval and / or the second redundant interval to update the aggregated routing information base.

[0187] In some embodiments, the geo-location based IPv6 routing information base management apparatus further comprises:

[0188] the obtaining module is further configured to obtain removal routing information;

[0189] the interval conversion module is further configured to convert a prefix part of the removal routing information into an integer removal prefix interval;

[0190] a prefix removal module configured to:

[0191] in response to the removal prefix region being a start part of any interval in the aggregated routing information base, remove the start part of the corresponding interval;

[0192] in response to the removal prefix region being a middle part of any interval in the aggregated routing information base, remove a query index corresponding to the removal prefix region without modifying the aggregated routing information base;

[0193] remove the end part of the corresponding interval in response to the prefix removal region being the end part of any interval in the aggregated routing information base;

[0194] not modify the aggregated routing information base in response to the prefix removal region not belonging to any interval in the aggregated routing information base.

[0195] For the convenience of description, the above apparatus is described in various modules in terms of functions. Of course, the functions of the modules can be implemented in one or more software and / or hardware when implementing the present disclosure.

[0196] The apparatus of the above embodiments is used to implement the corresponding geographic location-based IPv6 routing information base management method in any of the above embodiments, and has the beneficial effects of the corresponding method embodiments, which are not described here again.

[0197] Based on the same technical concept, the present disclosure also provides a non-transitory computer-readable storage medium storing computer instructions for causing the computer to perform the geographic location-based IPv6 routing information base management method according to any of the above embodiments.

[0198] The computer-readable medium of the present embodiment includes permanent and non-permanent, removable and non-removable media, which can be implemented by any method or technology to store information. The information can be computer-readable instructions, data structures, program modules or other data. Examples of computer storage media include, but are not limited to, phase change memory (PRAM), static random access memory (SRAM), dynamic random access memory (DRAM), other types of random access memory (RAM), read-only memory (ROM), electrically erasable programmable read-only memory (EEPROM), flash memory or other memory technologies, compact disc read-only memory (CD-ROM), digital versatile disc (DVD) or other optical storage, magnetic cassette, magnetic tape disk storage or other magnetic storage devices, or any other non-transmission medium that can be used to store information accessible by a computing device.

[0199] The storage medium of the above embodiments stores computer instructions for causing the computer to perform the geographic location-based IPv6 routing information base management method according to any of the above embodiments, and has the beneficial effects of the corresponding method embodiments, which are not described here again.

[0200] Corresponding to the geographic location-based IPv6 routing information base management method of any of the above embodiments based on the same inventive concept, the disclosure also provides a computer program product comprising computer program instructions. In some embodiments, when the computer program instructions run on a computer, the computer is caused to perform each step in each embodiment of the geographic location-based IPv6 routing information base management method. The processor performing the corresponding step corresponding to the execution subject of each step in each embodiment of the geographic location-based IPv6 routing information base management method can belong to the corresponding execution subject.

[0201] The computer program product of the above embodiments is used to cause the processor to perform the geographic location-based IPv6 routing information base management method according to any of the above embodiments, and has the beneficial effects of the corresponding method embodiments, which are not described here again.

[0202] It should be understood by those of ordinary skill in the art that the discussion of any of the above embodiments is only exemplary and is not intended to imply that the scope (including claims) of the disclosure is limited to these examples; the technical features of the above embodiments or different embodiments can also be combined, the steps can be implemented in any order, and there are many other changes of different aspects of the embodiments of the disclosure as described above. In order to be brief, they are not provided in detail.

[0203] In addition, in order to simplify the description and discussion, and so as not to make the embodiments of the disclosure difficult to understand, the well-known power / ground connections of integrated circuit (IC) chips and other components can or can not be shown in the provided drawings. In addition, the devices can be shown in the form of block diagrams in order to avoid making the embodiments of the disclosure difficult to understand, and this also takes into account the fact that the details of the implementation of these block diagram devices are highly dependent on the platform on which the embodiments of the disclosure are to be implemented (i.e., these details should be fully within the understanding of those skilled in the art). Where specific details (e.g., circuitry) are set forth in order to describe an illustrative embodiment of the disclosure, it will be apparent to those skilled in the art that the embodiments of the disclosure can be practiced without these specific details or with variations on these specific details. Therefore, these descriptions should be considered as illustrative rather than limiting.

[0204] Although the disclosure has been described in conjunction with specific embodiments thereof, many alternatives, modifications and variations will be apparent to those skilled in the art in light of the foregoing description. For example, other memory architectures (e.g., dynamic RAM (DRAM)) can use the embodiments discussed.

[0205] Embodiments of the present disclosure are intended to cover all such alternatives, modifications, and variations as fall within the broad scope of the appended claims. Accordingly, any one or more of the omitted, modified, equivalently replaced, improved, and the like, as long as within the spirit and principle of the embodiments of the present disclosure, should be included in the scope of protection of the present disclosure.

Claims

1. A method for managing a geographic location based IPv6 routing information base, comprising: converting prefix parts of all routing information into prefix intervals of integers to obtain an initial routing information base; forming initialization aggregation data based on the initial routing information base, a distance information matrix, and a current non-aggregated interval set; the distance information matrix being obtained based on distances between geographic locations indicated by all the prefix intervals; the current non-aggregated interval set including a current prefix interval and a corresponding geographic location; iteratively aggregating the prefix intervals of the initial routing information base based on the distance information matrix to obtain aggregated prefix intervals and corresponding aggregated locations; updating the current non-aggregated interval set and the distance information matrix based on the aggregated prefix intervals and the corresponding aggregated locations; detecting whether the current non-aggregated interval set has a conflict interval; in response to the current non-aggregated interval set having no conflict interval, or having a single conflict interval that is different from a prefix interval in the current non-aggregated interval set, updating the initial routing information base based on the aggregated prefix intervals and the corresponding aggregated locations to obtain an aggregated routing information base.

2. The method of claim 1, wherein, the iteratively aggregating the prefix intervals of the initial routing information base based on the distance information matrix to obtain aggregated prefix intervals and corresponding aggregated locations, comprising: determining that a prefix interval corresponding to a minimum distance in the distance information matrix is a current interval and a next interval; judging whether the minimum distance satisfies a first aggregation condition; in response to the minimum distance satisfying the first aggregation condition, determining the aggregated location based on a first geographic location corresponding to the current interval and a second geographic location corresponding to the next interval; determining a first distance between the aggregated location and the first geographic location, and a second distance between the aggregated location and the second geographic location; in response to the first distance and the second distance both being less than a second aggregation condition, synthesizing the current interval and the next interval to obtain the aggregated prefix interval.

3. The method of claim 2, wherein, the updating the current non-aggregated interval set and the distance information matrix based on the aggregated prefix intervals and the corresponding aggregated locations, comprising: removing the current interval and the next interval in the current non-aggregated interval set, and adding the aggregated prefix interval to the current non-aggregated interval set to update the current non-aggregated interval set; updating the distance information matrix based on distances between the aggregated location and other geographic locations in the distance information matrix.

4. The method of claim 3, wherein, the detecting whether the current non-aggregated interval set has a conflict interval, comprising: judging whether there is an overlapping region with the aggregated prefix interval in the current non-aggregated interval set; in response to there being an overlapping region with the aggregated prefix interval in the current non-aggregated interval set, judging whether a third distance between an original location corresponding to the overlapping region and the aggregated location satisfies a third preset condition; in response to the third distance between the original location corresponding to the overlapping region and the aggregated location satisfying the third preset condition, determining that the overlapping region is the conflict region.

5. The method of claim 4, further comprising: restoring the current non-aggregated interval set to a state before aggregation in response to a plurality of the conflict intervals existing in the current non-aggregated interval set, or a single conflict interval existing in the current non-aggregated interval set but the conflict interval being a prefix interval in the current non-aggregated interval set; and / or, converting a prefix part of all route information into a prefix interval of integer, comprising: converting the route address into 128-bit binary, and extracting the prefix part; in response to the prefix part being less than 64-bit, adding 0 to the end of the prefix part to obtain an interval start address of 64-bit binary, and adding 1 to the end of the prefix part to obtain an interval end address of 64-bit binary; and in response to the prefix part being equal to 64-bit, taking the prefix part as the interval start address and the interval end address; converting the start address and the end address into decimal to obtain the prefix interval.

6. The method of claim 1, further comprising: obtaining new route information; converting a prefix part of the new route information into a new prefix interval of certificate, and adding the new prefix interval to the current non-aggregated interval set; in response to the new prefix interval not overlapping with other intervals in the current non-aggregated interval set, updating the aggregated route information database based on the new prefix interval and corresponding geographical location; in response to the new prefix interval overlapping with other intervals in the current non-aggregated interval set, determining a first redundant interval overlapping with the new prefix interval; and / or, determining a second redundant interval not matching an Internet address in the aggregated route information database; removing the first redundant interval and / or the second redundant interval to update the aggregated route information database.

7. The method of claim 1, further comprising: obtaining removal route information; converting a prefix part of the removal route information into a removal prefix interval of integer; in response to the removal prefix area being a start part of any interval in the aggregated route information database, removing the start part of the corresponding interval; in response to the removal prefix area being a middle part of any interval in the aggregated route information database, removing a query index corresponding to the removal prefix area without modifying the aggregated route information database; in response to the removal prefix area being an end part of any interval in the aggregated route information database, removing the end part of the corresponding interval; in response to the removal prefix area not belonging to any interval in the aggregated route information database, not modifying the aggregated route information database.

8. A geographical location-based IPv6 route information database management apparatus, comprising: an interval conversion module configured to convert a prefix part of all route information into a prefix interval of integer to obtain an initial route information database; an initialization module configured to form an initialization aggregation data based on the initial route information database, a distance information matrix, and a current non-aggregated interval set. ​ The distance information matrix is obtained based on distances between geographic locations indicated by all the prefix intervals; the current non-aggregated interval set includes a current prefix interval and a corresponding geographic location; an aggregation module, configured to iteratively aggregate the prefix intervals of the initial routing information base based on the distance information matrix, to obtain an aggregated prefix interval and a corresponding aggregated location; an update module, configured to update the current non-aggregated interval set and the distance information matrix based on the aggregated prefix interval and the corresponding aggregated location; a conflict detection module, configured to detect whether there is a conflict interval in the current non-aggregated interval set; a routing information base update module, configured to update the initial routing information base based on the aggregated prefix interval and the corresponding aggregated location, to obtain an aggregated routing information base, in response to that there is no conflict interval in the current non-aggregated interval set, or that there is a single conflict interval but the conflict interval is different from a prefix interval in the current non-aggregated interval set.

9. An electronic device, comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor implements the method of any one of claims 1 to 7 when executing the computer program.

10. A non-transitory computer readable storage medium, storing computer instructions for causing a computer to perform the method of any one of claims 1 to 7.

Images