CN114745350B - IPv6 target positioning method based on time delay constraint and adjacent sequence - Google Patents
IPv6 target positioning method based on time delay constraint and adjacent sequence Download PDFInfo
- Publication number
- CN114745350B CN114745350B CN202210380354.8A CN202210380354A CN114745350B CN 114745350 B CN114745350 B CN 114745350B CN 202210380354 A CN202210380354 A CN 202210380354A CN 114745350 B CN114745350 B CN 114745350B
- Authority
- CN
- China
- Prior art keywords
- ipv6
- time delay
- target
- distance
- constraint
- 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.)
- Active
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L61/00—Network arrangements, protocols or services for addressing or naming
- H04L61/09—Mapping addresses
- H04L61/10—Mapping addresses of different types
-
- 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/70—Reducing energy consumption in communication networks in wireless communication networks
Abstract
The invention provides an IPv6 target positioning method based on time delay constraint and a neighboring sequence. The method comprises the steps of using multiple detection sources to detect a large amount of path information from the detection sources to a target, using the path information obtained by detection to obtain a time delay-distance conversion relation, using network time delay and a network topology structure to restrict the target to a coarse granularity range, finally judging an IPv6 adjacent sequence according to a target address and a landmark address in a constraint area, and positioning the target based on the adjacent sequence.
Description
Technical Field
The invention relates to the technical field of network communication, in particular to an IPv6 target positioning method based on time delay constraint and adjacent sequences.
Background
With the rapid development of network technology, the internet has become a social key infrastructure, playing an important role in various fields of human life. The network space is taken as a fifth strategic space which is juxtaposed with 'land, sea, air and sky', and has become a new battlefield for the world major national strategic game. The united states has developed and implemented network space resource mapping projects such as the X-plan, the treasury drawing plan, etc. to take strategic advantages in network space. The network space resource mapping technology aims at measuring various resources in the network space, and drawing information such as states, distribution, development trends and the like of the resources, is an important technology for grasping the network space resources, and has very important roles in various fields including business application, network management and control and network security.
IP positioning technology is a key technology for implementing network space resource mapping. IP positioning techniques aim at determining the actual geographical location of a network device by means of network measurements, data acquisition, etc. With the continuous development of the IP positioning technology, the precision of the IP positioning algorithm is continuously improved, wherein most of the high-precision algorithms depend on a large number of accurate landmarks as supports. The landmark refers to a network entity with a stable IP address, can be expressed by a (IP, geographic position) binary group, is important basic data for mapping network space resources, and is an important support for IP positioning technology. Through years of research, the IP positioning technology has achieved a plurality of excellent research results, and a plurality of results are published in authoritative academic conferences and academic journals. IP positioning technology has been widely used in real life. In the aspect of business application, enterprises can provide services based on location information for users according to the geographic locations of the users, such as weather forecast, advertisement push, news broadcast and the like; in the aspect of network management, a manager can improve network management efficiency by locating a target position, such as regional network management and control, user access control and the like; in the field of network security, security institutions may trace the geographical location of network attackers to combat network criminals, such as performing crime evidence collection, capturing criminals, and the like. However, the existing IP positioning technology is mainly focused on positioning an IPv4 network target, and when the existing IP positioning technology is applied to an IPv6 network, there are problems that positioning accuracy is reduced, partial targets cannot be positioned, landmark discovery efficiency is low, and the like due to imperfect network deployment, sparse survival addresses, limited landmark resources, and the like. In recent years, the continuous emergence of new internet technologies greatly promotes the demand for IP addresses, and since IPv4 address resources are exhausted, IPv6 has been changed from "options" to "necessary options", and the world-wide disputes accelerate the promotion of IPv6 network deployment.
With the gradual progress of the deployment of the IPv6 network, the research of the IPv6 network target positioning technology is started, and some research results are obtained. Kester J. Et al, gives a rule for measuring the accuracy of an IP geographic location database and uses it to compare the accuracy of the location of a plurality of well known public IPv6 geographic location databases. The method uses 3206 network targets of known accurate positions and IP addresses provided in research networks of Internet data analysis Cooperation Association (Cooperative Association for Internet Data Analysis, CAIDA) as positioning targets, queries different IPv6 geographic position databases for positioning, and compares the result positions with actual positions. Research results show that the IPv6 geographic position accuracy of all databases is obviously lower than that of the IPv4 geographic position, and limit errors of more than 15,000 kilometers exist between a very few positioning positions and actual positions. Thus, this document indicates that the accuracy of the IPv6 geographic location database is not yet sufficient to meet the positioning requirements in practical applications. Koch r et al present an IPv 6-based target positioning algorithm. The algorithm extracts information from three data sources, namely an IP location database, a RIR (Regional Internet Registry ) database and a coding database (postal code, airport code and the like), and respectively gives different weights to locate a target address. The experimental result shows that the positioning accuracy of the algorithm at the national level is about 79%, and the result is difficult to evaluate reliably due to the lack of landmark data, so that the requirements in practical application cannot be met.
The existing IP positioning method depends on time delay measurement data accuracy, the number of landmarks and landmark accuracy in positioning. However, many research results show that the deployment of the IPv6 network environment is not perfect, the routing detour condition exists in a large quantity, and the reliable landmark quantity is difficult to meet the high-precision positioning requirement, so that the precision of the mature traditional positioning method in the IPv4 network is greatly reduced and even the positioning cannot be finished when the positioning method is applied to the current IPv6 network environment. Therefore, it is necessary to design an IPv6 target positioning algorithm for the current IPv6 network environment to meet the actual application requirements.
Disclosure of Invention
Aiming at the problem of poor positioning accuracy when the conventional IP positioning method is applied to an IPv6 network due to imperfect IPv6 network deployment, the invention provides the IPv6 target positioning method based on time delay constraint and adjacent sequences.
The invention provides an IPv6 target positioning method based on time delay constraint and adjacent sequences, which comprises the following steps:
step 1: detecting targets to be positioned of a given IPv6 address by using a plurality of IPv6 detection sources, and acquiring the IPv6 address of a router on a detection path and time delay data between hops;
step 2: inquiring whether the IP address of the router passing through the detection path exists in the landmark database, and extracting the geographic position information of the corresponding router if the IP address of the router passing through the detection path exists;
step 3: the IPv6 detection source and the router on the detection path are regarded as nodes forming the detection path; for the nodes with known positions on the detection path, extracting time delay data between adjacent nodes and measuring the actual distance between the adjacent nodes;
step 4: calculating to obtain the value of a time delay-distance conversion parameter k according to the time delay data and the actual distance between adjacent nodes;
step 5: according to the value of the time delay-distance conversion parameter k, converting the time delay from the last node at the known position on the detection path to the target to be positioned into a constraint distance;
step 6: determining a circular constraint area by taking the position of the node of the last known position on the detection path as the circle center and the constraint distance as the radius;
step 7: all landmarks in the circular constraint area are obtained in a landmark database, the IPv6 address of each landmark is respectively subjected to adjacent sequence comparison with the IPv6 address of the target to be positioned, the IPv6 address block distance between each landmark and the target to be positioned is obtained, and the position of the landmark corresponding to the minimum IPv6 address block distance is used as the positioning position of the target to be positioned.
Further, in step 4, an objective function shown in formula (1) is used as an objective function for solving the k value of the delay-distance conversion parameter:
wherein t is ij Representing the time delay between adjacent nodes i and j, d ij The actual distance between adjacent nodes i and j is represented, c is the speed of light, and b represents the error adjustment parameter.
Further, in step 5, the conversion relationship between the time delay and the distance is shown in formula (2):
y＝kx+b(2)
where x represents time delay, y represents distance, and b represents error adjustment parameter.
Further, in step 7, the calculation formula of the IPv6 address block distance is shown in formula (3):
wherein t is 1 ，t 2 A 64-bit prefix of an IPv6 address to be targeted and a 64-bit prefix of an address block in a landmark database,
representing an exclusive or operation.
The invention has the beneficial effects that:
aiming at the problem that the accuracy of the existing IPv6 target positioning algorithm is limited, the IPv6 network target positioning algorithm based on the time delay constraint and the adjacent sequence comprehensively uses a network detection technology and a data query analysis technology, and compared with a method based on network measurement, the method greatly improves the positioning accuracy and can give a more accurate positioning result; compared with a method based on database query, the method can locate IPv6 network targets which do not exist in the database, can utilize the network measurement result to restrict the error range, and avoids extreme cases. Experimental results show that the method has higher accuracy than a simple network detection technology, can avoid extreme errors in a data query mode, has higher positioning accuracy than the existing method in China and Japanese part of the weak communication environment, and provides a new solution to the problem of IPv6 network target positioning.
Drawings
Fig. 1 is a schematic flow chart of an IPv6 target positioning method based on a delay constraint and a neighboring sequence according to an embodiment of the present invention;
FIG. 2 is a schematic diagram of selecting path information for calculating a delay-distance conversion parameter k according to an embodiment of the present invention;
FIG. 3 is a schematic diagram of determining a circular constraint area provided by an embodiment of the present invention;
FIG. 4 is a schematic diagram of an IPv6 address structure;
FIG. 5 shows a positioning target T according to an embodiment of the present invention 1 And T 2 Schematic of (2);
fig. 6 is a schematic diagram of constraint conditions of a delay-distance conversion parameter k according to an embodiment of the present invention.
Detailed Description
For the purpose of making the objects, technical solutions and advantages of the present invention more apparent, the technical solutions in the embodiments of the present invention will be clearly described below with reference to the accompanying drawings in the embodiments of the present invention, and it is apparent that the described embodiments are some embodiments of the present invention, but not all embodiments. All other embodiments, which can be made by those skilled in the art based on the embodiments of the invention without making any inventive effort, are intended to be within the scope of the invention.
Example 1
As shown in fig. 1, an embodiment of the present invention provides an IPv6 target positioning method based on a delay constraint and a neighbor sequence, including the following steps:
s101: detecting targets to be positioned of a given IPv6 address by using a plurality of IPv6 detection sources, and acquiring the IPv6 address of a router on a detection path and time delay data between hops;
specifically, an IPv6 detection source deployed in various places in the environment and the outside is utilized to detect a target of a given IPv6 address, and IPv6 addresses of routers of all hops on a detection path and delay data among all hops are obtained.
S102: inquiring whether the IP address of the router passing through the detection path exists in the landmark database, and extracting the geographic position information of the corresponding router if the IP address of the router passing through the detection path exists;
s103: the IPv6 detection source and the router on the detection path are regarded as nodes forming the detection path; for the nodes with known positions on the detection path, extracting time delay data between adjacent nodes and measuring the actual distance between the adjacent nodes;
s104: calculating to obtain the value of a time delay-distance conversion parameter k according to the time delay data and the actual distance between adjacent nodes;
specifically, multi-path long-time detection is carried out on the existing landmarks, landmark nodes on the detection path are found out according to a landmark database, and direct communication paths among the known landmarks are screened out according to the actual geographic positions of the landmarks on the detection path. As shown in FIG. 2, R 1 、R 2 、R 3 、R 4 、R 5 、R 6 Are routers. Detection source and R 1 、R 2 、R 5 、R 6 The position is known, R 3 、R 4 If the position is unknown, selecting a path d 1 、d 6 、d 7 、d 8 As the basis for k value calculation.
S105: according to the value of the time delay-distance conversion parameter k, converting the time delay from the last node at the known position on the detection path to the target to be positioned into a constraint distance;
s106: determining a circular constraint area by taking the position of the node of the last known position on the detection path as the circle center and the constraint distance as the radius;
s107: all landmarks in the circular constraint area are obtained in a landmark database, the IPv6 address of each landmark is respectively subjected to adjacent sequence comparison with the IPv6 address of the target to be positioned, the IPv6 address block distance between each landmark and the target to be positioned is obtained, and the position of the landmark corresponding to the minimum IPv6 address block distance is used as the positioning position of the target to be positioned.
Specifically, as shown in fig. 3, the geographical position of the last router R in the known landmark database in the detection path is used as the center, the delay from the router R to the target is converted into a constraint distance according to the obtained k value, and a circular constraint area is made by taking the constraint distance as the radius. In the landmark database, all landmarks (such as landmark 1 and landmark 2 … … landmark n) in the constraint area are screened out, and a new sub-landmark set is constructed. And respectively comparing the IPv6 address of the target with the IPv6 addresses of all landmarks in the sub-landmark set, and positioning the target address to the geographic position of the landmark address with the smallest difference value between the sub-landmark set and the adjacent sequence.
As shown in fig. 4, the IPv6 address is typically composed of a routing prefix, a subnet ID, and an interface ID. Wherein the first 48 bits are the routing prefix, the public topology of the sites typically assigned by ISPs or regional Internet registration agencies (Regional Internet Registry, RIRs); the middle 16 bits are the subnet ID and the last 64 bits are for assignment to network devices within the subnet. In general, the addresses within the same/64 subnet are distributed more closely geographically, and the address blocks are also used as storage units in the database of the presently disclosed IPv6 geographic location. Since IPv6 is generally expressed in address blocks when an access network layer allocates an address, the same node may be allocated with a plurality of IPv6 addresses. Therefore, it is meaningless to consider neighbor sequences inefficiently in units of a single address. Therefore, the embodiment of the invention takes the/64 address block as a basic unit to locate, and the rear 64 position is 0 when the neighbor sequence determination is carried out on the given target IPv6 address.
It should be noted that the IPv6 address has various expression formats. The standard format is 128 bits in length, usually written in 8 groups of 4 hexadecimal numbers, separated by English, and represented schematically by zero compression, but is essentially a 128-bit binary number which is often converted into decimal numbers in landmark data storage. Meanwhile, in the transition stage from IPv4 to IPv6, IPv4 addresses can be embedded into IPv6 addresses to form a mixture of IPv6 addresses and IPv4 addresses. There are two ways in which IPv4 can be embedded in IPv 6: IPv4 image addresses and IPv4 compatible addresses. The first 80 bits of the IPv4 mapping address are all 0, the 16 bits in the middle are positioned as FFFF, and the last 32 bits are IPv4 addresses, so that the positioning problem under an IPv4 network can be converted, and the existing mature algorithm is used for positioning the target; IPv4 compatible addresses have been discarded from use in RFC4213 documents and such addresses are not encountered in practical applications. Therefore, the present invention does not consider the case of locating a target having the above two special IPv6 addresses.
According to the IPv6 target positioning method based on the time delay constraint and the adjacent sequence, a plurality of detection sources are used for detecting a large amount of path information from the detection sources to the target, the path information obtained by detection is used for obtaining a time delay-distance conversion relation, the target is constrained to a coarse granularity range by using network time delay and a network topological structure, finally, the IPv6 adjacent sequence is judged according to the target address and the landmark address in the constraint area, and the target is positioned based on the adjacent sequence.
Example 2
As shown in fig. 5, P 1 、P 2 For detecting source, T 1 、T 2 For the target to be located, R 1 、R 2 、R 3 、R 4 、R 5 、R 6 、R 7 、R 8 Is a router, L 1 、L 2 、L 3 、L 4 Is a landmark; given target T 1 ，T 2 An IPv6 address of (c); in the scenario shown in fig. 5, the IPv6 target positioning method based on the delay constraint and the adjacent sequence provided by the embodiment of the present invention specifically includes the following steps:
s201: using a probe source P 1 ，P 2 To target T 1 ，T 2 Initiating detection, and acquiring the IP address of a router on a detection path and time delay data between hops;
s202: inquiring whether the IP address of the router passing through the detection path exists in the landmark database, extracting the position information of the router if the IP address exists, and setting R in the embodiment 1 ，R 2 ，R 3 ，R 4 ，R 5 ，R 6 、R 8 In a landmark database, knowing their actual geographic location; setting R 7 Not in the landmark database, the actual geographic location is unknown;
s203: for the nodes with known positions on the detection path, extracting time delay data between adjacent nodes, and measuring the actual distance between the nodes, namely measuring the path d 1 ，d 2 ，d 3 ，d 4 ，d 5 ，d 6 ，d 7 ，d 8 Length and time delay of (a);
s204: an objective function shown in a formula (1) is adopted as an objective function for solving the k value of the delay-distance conversion parameter:
wherein t is ij Representing the time delay between adjacent nodes i and j, d ij Representing the actual distance between adjacent nodes i and j, c being the speed of light, b representing the error adjustment parameter; due to the limitation of the transmission speed of the electric signal in the transmission medium, the maximum value of k is not exceeding in theory
The data acquired in step S203 is calculated according to formula (1) to obtain the value of the delay-distance conversion parameter k.
Specifically, in the embodiment of the present invention, since the center of the circular constraint area is not a probe source, the optimal k value cannot be obtained for each probe source, and thus the global optimal k value will be obtained for the area range. Wherein i and j are landmark pairs with small influence on mutual communication due to path tortuosity through screening, d ij T is the actual distance between them ij For the transmission delay between them. Is satisfied that
In the case of (2), the value obtained by the formula (1) is minimized. As shown in FIG. 6In the calculation method, in the solving of the time delay-distance conversion parameter k, the constraint distance after time delay conversion is ensured to be larger than the actual distance, the true geographic position of the target can be ensured to be positioned in the constraint range, and meanwhile, the error between the constraint distance and the actual distance is ensured to be minimum in the whole.
S205: the conversion relation between the set time delay and the distance is shown in a formula (2):
y＝kx+b(2)
wherein x represents time delay, y represents distance, and b represents error adjustment parameter;
using the obtained k value, for the target T 1 The last known position router R on the path from the probe source to the target is determined according to formula (2) 3 To target T 1 Is converted into a constraint distance D 1 The method comprises the steps of carrying out a first treatment on the surface of the Similarly, for target T 2 Obtaining the constraint distance D according to the same method 2 ；
S206: to target T 1 In order to get from the target T on the path 1 Nearest router R of known actual position 3 Is the position of the center of a circle, D 1 For constraining the radius, a circular constraint area is created, and all landmarks L in the circular constraint area are obtained from a landmark database 1 ，L 2 The method comprises the steps of carrying out a first treatment on the surface of the Similarly, for target T 2 The landmarks L are obtained according to the same method 3 ，L 4 ；
The calculation formula for setting the IPv6 address block distance is shown as a formula (3):
wherein t is 1 ，t 2 A 64-bit prefix of an IPv6 address to be targeted and a 64-bit prefix of an address block in a landmark database,
representing an exclusive or operation. The above formula (3) can be understood as: if the prefixes of the two IPv6 addresses are completely identical, that is, the exclusive or operation result is 0, the distance is considered to be 0. If the prefix exclusive OR operation resultIf not 0, the result is the distance between two IPv6 address blocks.
Target T 1 Address and L of (2) 1 ，L 2 Is aligned with the target T by the adjacent sequence 2 Address and L of (2) 3 ，L 4 Is aligned in the vicinity of the address of (2), and targets are located at the landmark positions with the smallest distance to the target, in this embodiment T 1 Positioning to L 1 Location, T 2 Positioning to L 3 The position;
T 1 and L is equal to 1 Located in the same city, output L 1 The actual geographic position is T 1 Positioning position, T 2 And L is equal to 3 Not located in the same city, output L 3 The actual geographic position is T 2 And positioning the position, and outputting the distance S between the two actual geographic positions as positioning errors.
For a given IPv6 target address, all landmark addresses in the address block having the smallest distance to the target address are used as its neighbor sequence, and the target is located at the center of each landmark address coverage area in the neighbor sequence.
Finally, it should be noted that: the above embodiments are only for illustrating the technical solution of the present invention, and are not limiting; although the invention has been described in detail with reference to the foregoing embodiments, it will be understood by those of ordinary skill in the art that: the technical scheme described in the foregoing embodiments can be modified or some technical features thereof can be replaced by equivalents; such modifications and substitutions do not depart from the spirit and scope of the technical solutions of the embodiments of the present invention.
Claims (4)
1. The IPv6 target positioning method based on the time delay constraint and the adjacent sequence is characterized by comprising the following steps:
step 1: detecting targets to be positioned of a given IPv6 address by using a plurality of IPv6 detection sources, and acquiring the IPv6 address of a router on a detection path and time delay data between hops;
step 2: inquiring whether the IP address of the router passing through the detection path exists in the landmark database, and extracting the geographic position information of the corresponding router if the IP address of the router passing through the detection path exists;
step 3: the IPv6 detection source and the router on the detection path are regarded as nodes forming the detection path; for the nodes with known positions on the detection path, extracting time delay data between adjacent nodes and measuring the actual distance between the adjacent nodes;
step 4: calculating to obtain the value of a time delay-distance conversion parameter k according to the time delay data and the actual distance between adjacent nodes;
step 5: according to the value of the time delay-distance conversion parameter k, converting the time delay from the last node at the known position on the detection path to the target to be positioned into a constraint distance;
step 6: determining a circular constraint area by taking the position of the node of the last known position on the detection path as the circle center and the constraint distance as the radius;
step 7: all landmarks in the circular constraint area are obtained in a landmark database, the IPv6 address of each landmark is respectively subjected to adjacent sequence comparison with the IPv6 address of the target to be positioned, the IPv6 address block distance between each landmark and the target to be positioned is obtained, and the position of the landmark corresponding to the minimum IPv6 address block distance is used as the positioning position of the target to be positioned.
2. The IPv6 target positioning method based on the delay constraint and the neighbor sequence according to claim 1, wherein in step 4, an objective function shown in formula (1) is adopted as an objective function for solving the value of the delay-distance conversion parameter k:
wherein t is ij Representing the time delay between adjacent nodes i and j, d ij The actual distance between adjacent nodes i and j is represented, c is the speed of light, and b represents the error adjustment parameter.
3. The method for positioning an IPv6 target based on a time delay constraint and a neighbor sequence according to claim 1, wherein in step 5, a conversion relationship between time delay and distance is shown in formula (2):
y＝kx+b(2)
where x represents time delay, y represents distance, and b represents error adjustment parameter.
4. The method for positioning an IPv6 target based on a time delay constraint and a neighbor sequence according to claim 1, wherein in step 7, a calculation formula of the IPv6 address block distance is shown in formula (3):
wherein t is 1 ，t 2 A 64-bit prefix of an IPv6 address to be targeted and a 64-bit prefix of an address block in a landmark database,
representing an exclusive or operation. />
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210380354.8A CN114745350B (en) | 2022-04-12 | 2022-04-12 | IPv6 target positioning method based on time delay constraint and adjacent sequence |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210380354.8A CN114745350B (en) | 2022-04-12 | 2022-04-12 | IPv6 target positioning method based on time delay constraint and adjacent sequence |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN114745350A CN114745350A (en) | 2022-07-12 |
| CN114745350B true CN114745350B (en) | 2023-04-28 |
Family
ID=82280641
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202210380354.8A Active CN114745350B (en) | 2022-04-12 | 2022-04-12 | IPv6 target positioning method based on time delay constraint and adjacent sequence |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114745350B (en) |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104506591A (en) * | 2014-12-11 | 2015-04-08 | 罗向阳 | Target IP (Internet protocol) geographic position locating method based on nearest common router |
| CN105245627A (en) * | 2015-08-31 | 2016-01-13 | 罗向阳 | IP positioning method based on network coordinate system |
| CN110912756A (en) * | 2019-12-13 | 2020-03-24 | 罗向阳 | IP positioning-oriented network topology boundary routing IP identification algorithm |
| CN114244849A (en) * | 2021-11-08 | 2022-03-25 | 北京中合谷投资有限公司 | Routing layer of P2P network |
| CN114301874A (en) * | 2021-11-10 | 2022-04-08 | 北京邮电大学 | IPv6 address positioning method based on IPv4 address geographical position information and electronic equipment |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US10397896B2 (en) * | 2017-04-19 | 2019-08-27 | International Business Machines Corporation | IP address geo-position detection based on landmark sequencing |
-
2022
- 2022-04-12 CN CN202210380354.8A patent/CN114745350B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104506591A (en) * | 2014-12-11 | 2015-04-08 | 罗向阳 | Target IP (Internet protocol) geographic position locating method based on nearest common router |
| CN105245627A (en) * | 2015-08-31 | 2016-01-13 | 罗向阳 | IP positioning method based on network coordinate system |
| CN110912756A (en) * | 2019-12-13 | 2020-03-24 | 罗向阳 | IP positioning-oriented network topology boundary routing IP identification algorithm |
| CN114244849A (en) * | 2021-11-08 | 2022-03-25 | 北京中合谷投资有限公司 | Routing layer of P2P network |
| CN114301874A (en) * | 2021-11-10 | 2022-04-08 | 北京邮电大学 | IPv6 address positioning method based on IPv4 address geographical position information and electronic equipment |
Non-Patent Citations (4)
| Title |
|---|
| Siqi Liu等.IP city-level geolocation based on the PoP-level network topoloty analysis.2016 6th international conference on information communication and management.2016,全文. * |
| Zhao Fan，Luo Xiangyang等.Ip geolocation based on identification routers and local delay distribution similarity.Concurrency and Computation Practice and Experience.2018,全文. * |
| 周苗 ; 杨家海 ; 吴建平 ; .基于滑动地址序列的IPv6网络拓扑发现引擎.清华大学学报(自然科学版).2009,(第08期),全文. * |
| 郭立轩 ; 卓子寒 ; 何跃鹰 ; 李强 ; 李舟军 ; .基于邻近序列的IP地址地理定位方法.计算机科学.2018,(第01期),全文. * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN114745350A (en) | 2022-07-12 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110474843B (en) | IP positioning method based on route hop count | |
| Scheitle et al. | HLOC: Hints-based geolocation leveraging multiple measurement frameworks | |
| Tian et al. | Topology mapping and geolocating for China's Internet | |
| CN104717304B (en) | A kind of CDN P2P content optimizations select system | |
| CN107786678B (en) | Domain name resolution method, device and system | |
| Zhao et al. | IP Geolocation based on identification routers and local delay distribution similarity | |
| US20130242801A1 (en) | Reverse Engineering Peering At Internet Exchange Points | |
| Landa et al. | Measuring the relationships between Internet geography and RTT | |
| Mátray et al. | On the spatial properties of internet routes | |
| Zu et al. | City-level IP geolocation algorithm based on PoP network topology | |
| Li et al. | Street-Level Landmarks Acquisition Based on SVM Classifiers. | |
| CN114301874B (en) | IPv6 address positioning method based on IPv4 address geographical position information and electronic equipment | |
| Lee et al. | IP Geolocation with a crowd-sourcing broadband performance tool | |
| Winter et al. | Geo-locating BGP prefixes | |
| Zu et al. | IP-geolocater: a more reliable IP geolocation algorithm based on router error training | |
| CN114745350B (en) | IPv6 target positioning method based on time delay constraint and adjacent sequence | |
| CN111064817A (en) | City-level IP positioning method based on node sorting | |
| CN111901201B (en) | IPv6 network topology measurement target selection method | |
| CN109639510B (en) | Regional PoP division method based on subnet analysis | |
| CN111711707B (en) | IP address positioning method based on neighbor relation | |
| US11792110B2 (en) | Geolocation system and method | |
| CN113395211B (en) | Routing IP positioning optimization method based on clustering idea | |
| CN104079681A (en) | Alias analysis method | |
| Ding et al. | A street-level IP geolocation method based on delay-distance correlation and multilayered common routers | |
| Zhang et al. | An empirical evaluation of internet latency expansion |
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 |