CN104753739A - Method for predicting routing path between any two nodes in ISP (internet service provider) domain - Google Patents
Method for predicting routing path between any two nodes in ISP (internet service provider) domain Download PDFInfo
- Publication number
- CN104753739A CN104753739A CN201510142659.5A CN201510142659A CN104753739A CN 104753739 A CN104753739 A CN 104753739A CN 201510142659 A CN201510142659 A CN 201510142659A CN 104753739 A CN104753739 A CN 104753739A
- Authority
- CN
- China
- Prior art keywords
- node
- routed path
- path
- prediction
- nodes
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 33
- 238000001514 detection method Methods 0.000 claims abstract description 21
- 239000000523 sample Substances 0.000 claims description 27
- 238000005259 measurement Methods 0.000 claims description 7
- 238000003012 network analysis Methods 0.000 claims description 4
- 230000001934 delay Effects 0.000 claims description 2
- 239000000203 mixture Substances 0.000 claims description 2
- 238000005516 engineering process Methods 0.000 description 4
- 238000004891 communication Methods 0.000 description 3
- 230000009286 beneficial effect Effects 0.000 description 2
- 230000005540 biological transmission Effects 0.000 description 2
- 238000010586 diagram Methods 0.000 description 2
- 230000003542 behavioural effect Effects 0.000 description 1
- 238000004364 calculation method Methods 0.000 description 1
- 239000002360 explosive Substances 0.000 description 1
- 230000000717 retained effect Effects 0.000 description 1
Abstract
The invention provides a method for predicting a routing path between any two nodes in an ISP (internet service provider) domain. The method includes that minimum distance rules which are commonly adopted by internal gateway protocol are utilized and optimized on the basis of policy routing of a target address and network designing, effect on using known routing paths to fit any unknown routing path, detection node servers adjacent to a source address and the target address are selected respectively, and path combination of the detecting servers are used as approximate values of the source and target address routing paths. By the method, understanding degree of a user to a network can be increased while part of network topology data is known, the routing path can be used as basic data for routing link attribute studying, and the user can predict link attributes of any two uncontrollable nodes in the network through similar routing path.
Description
Technical field
The invention belongs to Network Measurement Technologies field, especially for the method for routed path between any two nodes in network topology model prediction ISP (Network information provider) territory of router level.
Background technology
Along with the promotion of science and technology, Internet-scale explosive increase, novel intention and application continue to bring out, and large-scale distributed to be applied in the ratio of occupying in internet application increasing: the application of VOIP, as Skype allows any two users to carry out real time phone call by the Internet; Content distributing network (CDN), as youku, the copy of its content can be preserved on the thousands of distributed flow media server in the whole world, utilize GSLB technology user to be accessed and point to the working properly streaming media server nearest apart from it, directly responded the request of user by this streaming media server.These novel Distributed Application have the following common feature: (1) identical duplicate of the document can be retained in multiple different server node, these application are made to be all the communication pattern of one-to-many or multi-to-multi, for any one communication, there are many feasible paths; (2) application can choose optimal path according to the real-time performance of network in many feasible paths, but internet provides the transmission service of doing one's best, so for this kind of application, needs the performance parameter of Active measuring link; (3) to the module of link performance quality, the module of comprehensive heterogeneous networks rank is often needed.Such as distributing network, for user, optimum mirror image depends on the TCP throughput of link between user and mirror image, and TCP throughput is determined jointly by the time delay of link, packet loss and available bandwidth.
The characteristic of these application above-mentioned shows: for large-scale distributed application, understand its behavioural characteristic, topological structure and traffic characteristic, has important reference value for improvement and managing distributed application.The real-time performance parameter being obtained network by the access of priori can improve communication quality, but the original intention of internet design is to provide the transmission service of doing one's best, and does not provide these networked-induced delay energy parameters.Application services will obtain these performance parameters, first needs the topology information knowing network, thus initiatively carries out the measurement of network performance parameter on this basis.
Summary of the invention
Goal of the invention: for problems of the prior art, the invention provides a kind of method predicting routed path between any two nodes in ISP territory, for obtaining complete router level network topology model, and then carry out Network performance parameter survey on the mold foundation is provided.
Technical scheme: internet generally adopts the strategy based on destination address to carry out route, the very near routed path of source address to same destination address causing two to lean on has overlapping significantly, based on the feature that router is above-mentioned, the present invention proposes a kind of method predicting routed path between any two nodes in ISP territory, carry out the routed path of any two passive nodes of matching by different route segment in combination existing route topological diagram, specifically comprise the steps:
(1) source node and destination node is judged whether in known detection topology set, if one or two in source node and destination node are not in known detection topology set, then jump procedure (2), otherwise, jump procedure (3);
(2) to its approximate node of the node selection not in known detection topology set, and origin node is substituted with this approximate node;
(3) according to parameter n, choose the n adjacent with a source node probe node in probe node set, its set is designated as X, chooses the n adjacent with a destination node probe node, and its set is designated as Y, and n is natural number and is less than probe node set sum;
(4) detection is from set Y to the routed path set P1 of source node;
(5) detection is from set X to the routed path set P2 of destination node;
(6) all elements in traversal set P1, judge with element in set P2 with or without common intersection, if have, then jump procedure (7), otherwise, the value of n is expanded according to the number of probe node, and jump procedure (3), until find the value of common intersection or n to be greater than probe node set sum;
(7) source node is chosen to common intersection and common intersection to the combination of paths of destination node as the prediction routed path to be selected between source and destination node;
(8) choose in the prediction routed path all to be selected obtained and prediction routed path that Actual path fitting degree is the highest as the prediction routed path between source and destination node.
Described step (2) chooses the concrete steps that node Z is similar to node:
(201) if node Z belongs to certain subnet in known detection topology set M, then the approximate node of any IP address as Z of this subnet is chosen;
(202) if node Z does not belong to any known subnet, but legal subnet can be formed, then by the approximate node of this IP as Z with certain IP in set M;
(203) if all do not find the approximate node of Z in step (201) and step (202), then from all probe nodes, traceroute measurement is carried out to Z, and Z is added known detection topology set M, avoid duplicate measurements.
The detailed process that described step (3) chooses the adjacent detector point set of node Z is: all probe nodes send 5 its time delays of ping message accounting to node Z, the median getting 5 results as the time delay of this probe node and node Z, and chooses the adjacent detector node set of the minimum n of time delay probe node composition node Z.
In described step (4), to obtain gathering in Y each element to the routed path of source node S with network analysis instrument traceroute.
In described step (5), to obtain gathering in X each element to the routed path of destination node D with network analysis instrument traceroute.
In described step (8), comprehensive minimum distance criterion and the guaranteed flow Principle of Average Allocation in backbone routers chooses prediction routed path, concrete selection course is: judge whether the path to be selected with minimum range only has one, if, then select this path to be selected as prediction routed path, otherwise, in the path to be selected with identical minimum range, choose the path to be selected that makes backbone routers flow average as prediction routed path.
Beneficial effect: the present invention adopts technique scheme, has following beneficial effect:
First: the method for routed path between any two nodes in the prediction ISP territory that the present invention realizes, obvious sensing lead can not be brought to network;
Second: can obtain the routed path information between any two nodes in ISP territory, for two complete uncontrollable nodes, such routing iinformation is particularly important;
3rd: in the measurement of the enterprising line link performance of the routed path Information base obtained, can obtain the performance parameter of any link, these parameters can provide reference for Distributed Application.
Accompanying drawing explanation
Fig. 1 is the structural representation of prediction routed path of the present invention;
Fig. 2 is that the present invention chooses the method flow diagram that nodes X is similar to node in known detection topology set.
Embodiment
Below in conjunction with specific embodiment, illustrate the present invention further, these embodiments should be understood only be not used in for illustration of the present invention and limit the scope of the invention, after having read the present invention, those skilled in the art have all fallen within the application's claim limited range to various equivalents of the present invention.
Embodiment 1 predicts the routed path (Fig. 1) of passive node S to D by the route segment combining different detecting server and obtain, and concrete steps are as follows:
(1) source node and destination node is judged whether in known detection topology set, if one or two in source node destination node D are not in known detection topology set, then jump procedure (2), otherwise, jump procedure (3);
(2) to not choosing its approximate node at known detection topology set interior joint, and substitute origin node with this approximate node, node Z is similar to the choosing method of node as shown in Figure 2, specifically comprises the steps:
(201) if node Z belongs to certain subnet in known detection topology set M, then the approximate node of any IP address as Z of this subnet is chosen;
(202) if node Z does not belong to any known subnet, but legal subnet can be formed, then by the approximate node of this IP as Z with certain IP in set M;
(203) if all do not find the approximate node of Z in step (201) and step (202), then from all probe nodes, traceroute measurement is carried out to Z, and Z is added known detection topology set M.
(3) parameters n=2, the n adjacent with a source node S probe node is chosen in probe node set, its set is designated as X=(V1, V3), choose the n adjacent with a destination node D probe node, its set is designated as Y=(V2, V4), the detailed process finding the adjacent detector node set of certain node Z is: all probe nodes send 5 ping messages to node Z and record its time delay, the median getting 5 results is as the final time delay between 2 o'clock, because the degrees of closeness of 2 are directly proportional to its time delay, namely the probe node distance node Z arriving node Z time delay less is nearer, therefore the minimum n of a final time delay probe node to be chosen as return value.
(4) routed path set P1=(V2-S, V4-S) from set Y=(V2, V4) to source node S is detected with traceroute;
(5) routed path set P2=(V1-D, V3-D) from set X=(V1, V3) to destination node D is detected with traceroute;
(6) all elements in traversal set P1, obtains and two intersection I 1 and the I2 that gather P2, and then obtains the prediction routed path (S-I1-D, S-I2-D) to be selected of two S to D;
(7) from prediction routed path to be selected, the prediction routed path the highest with actual routed path fitting degree is chosen by minimum distance criterion and network design Optimality Criteria.
In Practical Calculation process, the distance of certain paths is the hop count of its process, if the path to be selected with minimum range only has one, then this path to be selected is prediction routed path, otherwise in the path to be selected with identical minimum range, choose the conduct prediction routed path making backbone routers flow average.
In agreement network, backbone routers is R=(R
1, R
2..., R
n), be x=(x through the flow of each backbone routers
1, x
2..., x
n), suppose there is i bar predicted path to be selected, wherein kth bar path to be selected is through backbone routers R
m, and an added flow x is applied to this router
e, now x=(x
1, x
2..., x
m+ x
e..., x
n),
for the average that x is corresponding, definition MSE (Q (k)) is the mean square error of flow x behind interpolation kth bar path to be selected, and computing function is as follows:
Get in i paths make MSE (Q (k)) minimum as the optimal result under flow Principle of Average Allocation.
Claims (6)
1. predict a method for routed path between any two nodes in ISP territory, it is characterized in that, comprise the steps:
(1) source node and destination node is judged whether in known detection topology set, if one or two in source node and destination node are not in known detection topology set, then jump procedure (2), otherwise, jump procedure (3);
(2) to its approximate node of the node selection not in known detection topology set, and origin node is substituted with this approximate node;
(3) according to parameter n, choose the n adjacent with a source node probe node in probe node set, its set is designated as X, chooses the n adjacent with a destination node probe node, and its set is designated as Y, and n is natural number and is less than probe node set sum;
(4) detection is from set Y to the routed path set P1 of source node;
(5) detection is from set X to the routed path set P2 of destination node;
(6) all elements in traversal set P1, judge with element in set P2 with or without common intersection, if have, then jump procedure (7), otherwise, the value of n is expanded according to the number of probe node, and jump procedure (3), until find the value of common intersection or n to be greater than probe node set sum;
(7) source node is chosen to common intersection and common intersection to the combination of paths of destination node as the prediction routed path to be selected between source and destination node;
(8) choose in the prediction routed path all to be selected obtained and prediction routed path that Actual path fitting degree is the highest as the prediction routed path between source and destination node.
2. according to the method for routed path between any two nodes in the prediction ISP territory described in claim 1, it is characterized in that, described step (2) is chosen the concrete steps that node Z is similar to node and is:
(201) if node Z belongs to certain subnet in known detection topology set M, then the approximate node of any IP address as Z of this subnet is chosen;
(202) if node Z does not belong to any known subnet, but legal subnet can be formed, then by the approximate node of this IP as Z with certain IP in set M;
(203) if all do not find the approximate node of Z in step (201) and step (202), then from all probe nodes, traceroute measurement is carried out to Z, and Z is added known detection topology set M.
3. according to the method for routed path between any two nodes in the prediction ISP territory described in claim 1, it is characterized in that, the detailed process that described step (3) chooses the adjacent detector point set of node Z is: all probe nodes send 5 its time delays of ping message accounting to node Z, the median getting 5 results as the time delay of this probe node and node Z, and chooses the adjacent detector node set of the minimum n of time delay probe node composition node Z.
4. according to the method for routed path between any two nodes in the prediction ISP territory described in claim 1, it is characterized in that, in described step (4), to obtain gathering in Y each element to the routed path of source node S with network analysis instrument traceroute.
5. according to the method for routed path between any two nodes in the prediction ISP territory described in claim 1, it is characterized in that, in described step (5), to obtain gathering in X each element to the routed path of destination node D with network analysis instrument traceroute.
6. according to the method for routed path between any two nodes in the prediction ISP territory described in claim 1, it is characterized in that, in described step (8), comprehensive minimum distance criterion and the guaranteed flow Principle of Average Allocation in backbone routers chooses prediction routed path, concrete selection course is: judge whether the path to be selected with minimum range only has one, if, then select this path to be selected as prediction routed path, otherwise, the path to be selected that makes backbone routers flow average is chosen as prediction routed path in the path to be selected with identical minimum range.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510142659.5A CN104753739B (en) | 2015-03-27 | 2015-03-27 | In a kind of prediction ISP domain between any two node routed path method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510142659.5A CN104753739B (en) | 2015-03-27 | 2015-03-27 | In a kind of prediction ISP domain between any two node routed path method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN104753739A true CN104753739A (en) | 2015-07-01 |
| CN104753739B CN104753739B (en) | 2017-11-28 |
Family
ID=53592886
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510142659.5A Expired - Fee Related CN104753739B (en) | 2015-03-27 | 2015-03-27 | In a kind of prediction ISP domain between any two node routed path method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN104753739B (en) |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101371497A (en) * | 2006-01-27 | 2009-02-18 | 卢森特技术有限公司 | End-to-end service quality using source-routed probes |
| US8339973B1 (en) * | 2010-09-07 | 2012-12-25 | Juniper Networks, Inc. | Multicast traceroute over MPLS/BGP IP multicast VPN |
| US20130311160A1 (en) * | 2012-05-18 | 2013-11-21 | Renesys | Path reconstruction and interconnection modeling (prim) |
| CN104202211A (en) * | 2014-08-25 | 2014-12-10 | 电子科技大学 | Autonomous system level network topology identification method combining active and passive measurement |
-
2015
- 2015-03-27 CN CN201510142659.5A patent/CN104753739B/en not_active Expired - Fee Related
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101371497A (en) * | 2006-01-27 | 2009-02-18 | 卢森特技术有限公司 | End-to-end service quality using source-routed probes |
| US8339973B1 (en) * | 2010-09-07 | 2012-12-25 | Juniper Networks, Inc. | Multicast traceroute over MPLS/BGP IP multicast VPN |
| US20130311160A1 (en) * | 2012-05-18 | 2013-11-21 | Renesys | Path reconstruction and interconnection modeling (prim) |
| CN104202211A (en) * | 2014-08-25 | 2014-12-10 | 电子科技大学 | Autonomous system level network topology identification method combining active and passive measurement |
Non-Patent Citations (2)
| Title |
|---|
| LUN LI等: "A First-Principles Approach to Understanding the Internet"s Router-level Topology", 《ACM SIGCOMM COMPUTER COMMUNICATION REVIEW》 * |
| RYOTA FUKUMOTO等: "Analyzing and Modeling Router–Level Internet Topology", 《INFORMATION NETWORKING.TOWARDS UBIQUITOUS NETWORKING AND SERVICES》 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN104753739B (en) | 2017-11-28 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Aggarwal et al. | Can ISPs and P2P users cooperate for improved performance? | |
| CN102318288B (en) | Method, equipment and system of node sorting and selection | |
| Nakao et al. | Scalable routing overlay networks | |
| Lei et al. | An entropy-based probabilistic forwarding strategy in named data networking | |
| Valancius et al. | Quantifying the benefits of joint content and network routing | |
| CN103973596A (en) | P2P (peer-to-peer) network node selecting method | |
| Zhang et al. | Anyopt: Predicting and optimizing ip anycast performance | |
| Yang et al. | Bandwidth–delay constrained routing algorithms | |
| CN102469017A (en) | Relay selection method and relay control system | |
| Abboud et al. | Underlay awareness in P2P systems: Techniques and challenges | |
| Srinivasan et al. | M-coop: A scalable infrastructure for network measurement | |
| US20130159509A1 (en) | Method and system for controlling data communication within a network | |
| Becerra Sánchez et al. | An approach to support traffic engineering in IPv6 networks based on IPv6 facilities | |
| Mwewa et al. | Performance Evaluation of Routing Protocols in Enterprise Networks | |
| JP2011244312A (en) | Node device, optimal path determination method, and program | |
| Faigl et al. | Application-layer traffic optimization in software-defined mobile networks: A proof-of-concept implementation | |
| CN115622935A (en) | Network-based path processing method, system and storage medium | |
| US20130138732A1 (en) | Access to a network of nodes distributed over a communication architecture with the aid of a topology server with multicriteria selection | |
| Souza et al. | Towards the scalability of a service-oriented PCE architecture for IoT scenarios | |
| Okumus et al. | Inter-domain qos routing on diffserv networks: a region-based approach | |
| CN104753739A (en) | Method for predicting routing path between any two nodes in ISP (internet service provider) domain | |
| Gregori et al. | Inferring geography from BGP raw data | |
| Habib et al. | Improving application QoS with residential multihoming | |
| Akter et al. | Analysis and comparative study for developing computer network in terms of routing protocols having IPv6 network using cisco packet tracer | |
| Hoang-Van et al. | A hierarchical P2P traffic localization method with bandwidth limitation |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20171128 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |