CN110708186B - Method, device, equipment and medium for evaluating topology fidelity of internet test bed - Google Patents

Method, device, equipment and medium for evaluating topology fidelity of internet test bed Download PDF

Info

Publication number
CN110708186B
CN110708186B CN201910846377.1A CN201910846377A CN110708186B CN 110708186 B CN110708186 B CN 110708186B CN 201910846377 A CN201910846377 A CN 201910846377A CN 110708186 B CN110708186 B CN 110708186B
Authority
CN
China
Prior art keywords
topological
value
test
topology
kth
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
Application number
CN201910846377.1A
Other languages
Chinese (zh)
Other versions
CN110708186A (en
Inventor
胡梦琪
焦波
张小刚
江友辉
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Haihua Electronics Enterprise China Corp
Original Assignee
Guangdong Southern Coast Technology Services Co ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Guangdong Southern Coast Technology Services Co ltd filed Critical Guangdong Southern Coast Technology Services Co ltd
Priority to CN201910846377.1A priority Critical patent/CN110708186B/en
Publication of CN110708186A publication Critical patent/CN110708186A/en
Application granted granted Critical
Publication of CN110708186B publication Critical patent/CN110708186B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/14Network analysis or design
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F18/00Pattern recognition
    • G06F18/20Analysing
    • G06F18/23Clustering techniques
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/12Discovery or management of network topologies
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/14Network analysis or design
    • H04L41/142Network analysis or design using statistical or mathematical methods
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/14Network analysis or design
    • H04L41/145Network analysis or design involving simulating, designing, planning or modelling of a network
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L43/00Arrangements for monitoring or testing data switching networks
    • H04L43/50Testing arrangements
    • YGENERAL 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
    • Y02TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02DCLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
    • Y02D10/00Energy efficient computing, e.g. low power processors, power management or thermal management

Landscapes

  • Engineering & Computer Science (AREA)
  • Signal Processing (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Data Mining & Analysis (AREA)
  • Theoretical Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Physics & Mathematics (AREA)
  • Mathematical Physics (AREA)
  • Bioinformatics & Cheminformatics (AREA)
  • Probability & Statistics with Applications (AREA)
  • Mathematical Optimization (AREA)
  • Mathematical Analysis (AREA)
  • Life Sciences & Earth Sciences (AREA)
  • Artificial Intelligence (AREA)
  • Pure & Applied Mathematics (AREA)
  • Bioinformatics & Computational Biology (AREA)
  • Computer Vision & Pattern Recognition (AREA)
  • Evolutionary Biology (AREA)
  • Evolutionary Computation (AREA)
  • General Engineering & Computer Science (AREA)
  • Algebra (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)

Abstract

The invention discloses a method, a device, equipment and a medium for evaluating the topology fidelity of an internet test bed, wherein the method comprises the following steps: receiving a test task, and inputting a test index and a corresponding test method into an Internet test bed topology simulation system; inputting the topological characteristics and the corresponding calculation method into the domain of discourse of the Internet test bed topological simulation system; inputting a topology generation tool into a domain of an internet test bed topology simulation system; calculating an importance weight value of each topological feature in a domain relative to the test index, sequencing the importance of all topological features in the domain, and outputting a corresponding importance sequencing vector; extracting the first n topological features in the importance ranking according to the importance ranking vector, and generating a value function; and evaluating the topology fidelity of the topology generation tool by adopting a cost function. The invention provides technical support for feature screening and configuration of topology structure fidelity evaluation, and obtains the result of selecting a topology generation tool in a customized manner for different test tasks.

Description

Method, device, equipment and medium for evaluating topology fidelity of internet test bed
Technical Field
The invention relates to a method, a device, equipment and a medium for evaluating the topology fidelity of an internet test bed, and belongs to the field of characteristic screening and configuration of the internet test bed topology structure fidelity evaluation.
Background
The Internet test bed establishes a simulation test environment for development, test and evaluation of technologies such as resource positioning, access control, routing protocol, active defense and the like. The topological structure represents the interconnection relation among simulation nodes of the test bed, and the fidelity of the topological structure relative to the real world internet topological structure has important influence on the accuracy of a test conclusion on the test bed. At present, the technology for generating the topology structure of the internet test bed mainly comprises a graph sampling algorithm (for example, Random walk, Forest Fire, break-first Search, etc.), and the goal of the technology is to realize the large scale reduction of the real world internet topology scale under the condition of maintaining the stability and invariability of the topology characteristics. The design and evaluation of these techniques relies on a cost function of topological features. However, internet topology has the nontrivial nature of a complex network that possesses an infinite number of topological features (e.g., average, maximum kernel, spectral radius, path length, clustering coefficients, coordination coefficients, algebraic connectivity, weighted spectral distributions, etc.), resulting in the construction of the cost function of existing topology generation techniques often relying on the subjective preferences of researchers (i.e., to subjectively extract a limited subset from the infinite number of topological features), lacking an association with the needs of a particular testing task.
In the existing internet topology generation technology, the internet test bed topology structure large-scale reduction method disclosed in chinese patent application No. CN201810565884.3 takes a complete original internet topology graph as input, and extracts partial nodes and edges from the original topology graph through a graph sampling technology to output a large-scale reduced sampling result graph; the method for reducing the topological structure of the internet test bed in a large scale disclosed in Chinese patent application No. CN201810565884.3 does not sequence the importance of the topological features of the test bed, the evaluation of the scale reduction effect depends on a few of the subjectively selected topological features, no quantitative basis for screening and configuring the topological features is given, and the correlation with the indexes of test tasks is lacked.
Disclosure of Invention
In view of the above, the invention provides a method, a device, equipment and a medium for evaluating the topology fidelity of an internet test bed, which are oriented to the requirements of test tasks, based on equivalent deduction of test indexes, and by quantitatively sequencing the importance of the topology characteristics of the internet test bed, the evaluation on the topology fidelity can be realized, technical support is provided for characteristic screening and configuration of the topology fidelity evaluation, and the result of selecting a topology generation tool in a customized manner for different test tasks is obtained.
The invention aims to provide an internet test bed topology fidelity evaluation method.
The invention also provides a device for evaluating the topological fidelity of the Internet test bed.
It is a third object of the invention to provide a computer apparatus.
It is a fourth object of the invention to provide a storage medium.
The first purpose of the invention can be achieved by adopting the following technical scheme:
an internet test bed topology fidelity evaluation method, the method comprising:
receiving a test task, and inputting a test index and a corresponding test method into an Internet test bed topology simulation system;
inputting the topological characteristics and the corresponding calculation method into the domain of discourse of the Internet test bed topological simulation system; wherein, the discourse domain is a discourse domain oriented to the equivalent deduction of the test index;
inputting a topology generation tool into a domain of an internet test bed topology simulation system;
calculating an importance weight value of each topological feature in a domain relative to the test index, sequencing the importance of all topological features in the domain, and outputting a corresponding importance sequencing vector;
extracting the first n topological features in the importance ranking according to the importance ranking vector, and generating a value function;
and evaluating the topology fidelity of the topology generation tool by adopting a cost function.
Further, the calculating an importance weight value of each topological feature in the domain of discourse relative to the test index, ranking the importance of all the topological features in the domain of discourse, and outputting a corresponding importance ranking vector specifically includes:
for any one quadruple (p)s+k1·lp,qdd,ns+k4·ln) Generating a topological graph G (p) by adopting a parallel characteristic pyramid models+k1·lp,qdd,ns+k4·ln) (ii) a Wherein k is1=0,1,L,mp,k4=0,1,L,mn,qdAnd deltadIs a preset parameter;
for the kth topological feature in the theoretical domain, calculating the topological feature in a topological graph G (p)s+k1·lp,qdd,ns+k4·ln) Topological characteristic value f ofk(ps+k1·lp,qdd,ns+k4·ln);
Using a topological graph G (p)s+k1·lp,qdd,ns+k4·ln) Configuring the topological connection relation between simulation nodes on the Internet test bed, and testing to obtain the value x (p) of the test index xs+k1·lp,qdd,ns+k4·ln);
Computing the kth topological feature fkPyramid model parameter p ═ p relative to parallel featuress+k1·lpA first spatial recognition capability value of (a);
computing the kth topological feature fkParameter p for parallel feature pyramid models+k1·lpAnd a first equivalent deduction value of the test index x;
for any one quadruple (p)d,qs+k2·lqd,ns+k4·ln) Generating a topological graph G (p) by adopting a parallel characteristic pyramid modeld,qs+k2·lqd,ns+k4·ln) (ii) a Wherein k is2=0,1,L,mq,k4=0,1,L,mn,pdAnd deltadIs a preset parameter;
for the kth topological feature in the theoretical domain, calculating the topological feature in a topological graph G (p)d,qs+k2·lqd,ns+k4·ln) Topological characteristic value f ofk(pd,qs+k2·lqd,ns+k4·ln);
Using a topological graph G (p)d,qs+k2·lqd,ns+k4·ln) Configuring the topological connection relation between simulation nodes on the Internet test bed, and testing to obtain the value x (p) of the test index xd,qs+k2·lqd,ns+k4·ln);
Computing the kth topological feature fkPyramid model parameter q ═ q relative to parallel featuress+k2·lqA second spatial recognition capability value of (a);
computing the kth topological feature fkPyramid model parameter q ═ q relative to parallel featuress+k2·lqAnd a second equivalent derived measure value for the test index x;
for any one quadruple (p)d,qds+k3·lδ,ns+k4·ln) Generating a topological graph G (p) by adopting a parallel characteristic pyramid modeld,qds+k3·lδ,ns+k4·ln) (ii) a Wherein k is3=0,1,L,mδ,k4=0,1,L,mn,pdAnd q isdIs a preset parameter;
for the kth topological feature in the theoretical domain, calculating the topological feature in a topological graph G (p)d,qds+k3·lδ,ns+k4·ln) Topological characteristic value f ofk(pd,qds+k3·lδ,ns+k4·ln);
Using a topological graph G (p)d,qds+k3·lδ,ns+k4·ln) Configuring the topological connection relation between simulation nodes on the Internet test bed, and testing to obtain the value x (p) of the test index xd,qds+k3·lδ,ns+k4·ln);
Computing the kth topological feature fkPyramid model parameter delta relative to parallel featuress+k3·lδA third spatial recognition capability value of (1);
computing the kth topological feature fkPyramid model parameter delta relative to parallel featuress+k3·lδAnd a third equivalent deduction value of the test index x;
calculating the kth topological feature f according to the first space recognition capability value, the second space recognition capability value and the third space recognition capability valuekThe comprehensive space recognition capability value;
calculating the kth topological feature f according to the first equivalent deduction degree value, the second equivalent deduction degree value and the third equivalent deduction degree valuekThe integrated equivalent derived metric value of (2);
calculating the kth topological feature f according to the comprehensive space recognition capability value and the comprehensive equivalent deduction degree valuekImportance weight value relative to test index x.
And sorting the importance of all the topological features in the domain of discourse according to the importance weight value, and outputting a corresponding importance sorting vector.
Further, the k topological feature f is calculatedkPyramid model parameter p ═ p relative to parallel featuress+k1·lpThe first spatial recognition capability value of (1), as follows:
Figure GDA0003611020660000041
wherein,
Figure GDA0003611020660000042
the k-th of the calculationTopological feature fkPyramid model parameter p ═ p relative to parallel featuress+k1·lpAnd a first equivalent deductive value for the test index x, as follows:
Figure GDA0003611020660000043
wherein,
Figure GDA0003611020660000044
the k topological feature f is calculatedkPyramid model parameter q ═ q relative to parallel featuress+k2·lqThe second spatial recognition capability value of (1), as follows:
Figure GDA0003611020660000045
wherein,
Figure GDA0003611020660000046
the k topological feature f is calculatedkPyramid model parameter q ═ q relative to parallel featuress+k2·lqAnd a second equivalent derived measure of test index x, as follows:
Figure GDA0003611020660000047
wherein,
Figure GDA0003611020660000048
the k topological feature f is calculatedkPyramid model parameter delta relative to parallel featuress+k3·lδThe third spatial recognition capability value of (1), as follows:
Figure GDA0003611020660000049
wherein,
Figure GDA00036110206600000410
the k topological feature f is calculatedkPyramid model parameter delta relative to parallel featuress+k3·lδAnd a third equivalent derived measure for test index x, as follows:
Figure GDA00036110206600000411
wherein,
Figure GDA00036110206600000412
further, the kth topological feature f is calculated according to the first space identification capacity value, the second space identification capacity value and the third space identification capacity valuekThe comprehensive space recognition capability value of (1) is as follows:
Figure GDA0003611020660000051
wherein,
Figure GDA0003611020660000052
Sr(fkp) is a first spatial recognition capability value, Sr(fkQ) is a second spatial recognition ability value, Sr(fkδ) is the third spatial recognition capability value.
Further, the kth topological feature f is calculated according to the first equivalent deduction degree value, the second equivalent deduction degree value and the third equivalent deduction degree valuekThe integrated equivalent derived measure value of (a) is as follows:
Figure GDA0003611020660000053
wherein,
Figure GDA0003611020660000054
Ex(fkp) is a first equivalent derived measure, Ex(fkQ) is a second equivalent derived measure, Ex(fkδ) is the third equivalent derivative metric value.
Further, the kth topological feature f is calculated according to the comprehensive space identification capacity value and the comprehensive equivalent deduction degree valuekThe importance weight value relative to test index x is given by:
Rx(fk)=ws·Sr(fk)+we·Ex(fk)
wherein, ws=0.5,we=0.5,Sr(fk) Identifying the capability value for the synthesis space, Ex(fk) And the equivalent derived measure value is integrated.
Further, the topological feature includes an average node degree f1Maximum nucleus f2Average path length f3Average clustering coefficient f4Mixed coordination coefficient f5Algebraic connectivity f6Natural connectivity f7Weighted spectral distribution f8The repetition degree f of the characteristic value 19Laplacian spectrum radius f10Adjacent spectral radius f11And the radius f of the regular Laplacian spectrum12
The second purpose of the invention can be achieved by adopting the following technical scheme:
an apparatus for evaluating the topology fidelity of an internet test bed, the apparatus comprising:
the first input module is used for receiving a test task and inputting a test index and a corresponding test method into the Internet test bed topology simulation system;
the second input module is used for inputting the topological characteristics and the corresponding calculation method into the domain of discourse of the topology simulation system of the Internet test bed; wherein, the discourse domain is a discourse domain oriented to the equivalent deduction of the test index;
the third input module is used for inputting the topology generation tool into the domain of discourse of the topology simulation system of the Internet test bed;
the calculation module is used for calculating the importance weight value of each topological feature in the domain of discourse relative to the test index, sorting the importance of all the topological features in the domain of discourse, and outputting a corresponding importance sorting vector;
the extracting module is used for extracting the first n topological features in the importance sequence according to the importance sequence vector and generating a value function;
and the evaluation module is used for evaluating the topology fidelity of the topology generation tool by adopting a cost function.
The third purpose of the invention can be achieved by adopting the following technical scheme:
a computer device comprises a processor and a memory for storing a program executable by the processor, wherein the processor executes the program stored in the memory to realize the method for evaluating the topological fidelity of the Internet test bed.
The fourth purpose of the invention can be achieved by adopting the following technical scheme:
a storage medium stores a program, and when the program is executed by a processor, the method for evaluating the topology fidelity of the Internet test bed is realized.
Compared with the prior art, the invention has the following beneficial effects:
the invention provides a quantitative internet test bed topological feature importance ordering method by aiming at infinite characteristics of the topological structure of the internet test bed, solving the defects of strong subjectivity of traditional topological feature extraction and configuration and lack of quantitative data support, taking equivalent deduction of specific test indexes as a standard, realizing self-adaptive matching of topological fidelity optimal tools from different topological generation tools according to different test indexes, and providing technical support for accurate testing of internet technologies which strongly depend on the topological structure, such as resource positioning, access control, routing protocols, active defense and the like.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below, it is obvious that the drawings in the following description are only some embodiments of the present invention, and for those skilled in the art, other drawings can be obtained according to the structures shown in the drawings without creative efforts.
Fig. 1 is a flowchart of an internet test bed topology fidelity evaluation method according to embodiment 1 of the present invention.
Fig. 2 is a flowchart of calculating an importance weight value of each topological feature relative to a test indicator in a domain of discourse according to embodiment 1 of the present invention.
FIG. 3 is a graph of the importance ranking of topological features relative to the test index "delay rate" in the domain of discourse in embodiment 1 of the present invention.
FIG. 4 is a graph of the ranking of importance of topological features in the domain of discourse relative to the test indicator "cost rate" in accordance with embodiment 1 of the present invention.
Fig. 5 is a block diagram of a topology fidelity evaluation apparatus of an internet test bed in embodiment 2 of the present invention.
Fig. 6 is a block diagram of a computing module according to embodiment 2 of the present invention.
Fig. 7 is a block diagram of a computer device according to embodiment 3 of the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the embodiments of the present invention clearer and more complete, the technical solutions in the embodiments of the present invention will be described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are some embodiments of the present invention, but not all embodiments, and all other embodiments obtained by a person of ordinary skill in the art without creative efforts based on the embodiments of the present invention belong to the protection scope of the present invention.
Example 1:
as shown in fig. 1, the present embodiment provides an internet test bed topology fidelity evaluation method, which includes the following steps:
s101, receiving a test task, and inputting a test index and a corresponding test method into an Internet test bed topology simulation system.
In this step, the test index is denoted as x, which is a specific index for measuring the tested object (such as resource location, admission control, routing protocol, active defense, etc.).
S102, inputting the topological characteristics and the corresponding calculation method into a domain of discourse of the Internet test bed topological simulation system.
In this step, the domain of discourse of the topology simulation system of the internet test bed is marked as Ω, which refers to a topology characteristic domain enumerated in advance by a tester, and the internet topology structure has infinite topological characteristics, so the topological characteristic importance ranking must be oriented to a specific domain of discourse, the domain of discourse Ω of this embodiment is a domain oriented to equivalent deduction of test indexes, wherein the equivalent deduction means that the test conclusion of the test indexes on the scale-down internet test bed is consistent with the operation effect of the test indexes on the real world large-scale internet; it can be seen that the domain Ω is essentially a topological feature set Ω, which contains t topological features enumerated in advance.
By default, the domain of discourse Ω contains twelve common topological features: average nodal degree f1Maximum nucleus f2Average path length f3Average clustering coefficient f4Mixed coordination coefficient f5Algebraic connectivity f6Natural connectivity f7Weighted spectral distribution f8Characteristic value 1 repetition degree f9Laplacian spectrum radius f10Adjacent spectral radius f11And the radius f of the regular Laplacian spectrum12
Specifically, the calculation method of the twelve topological features of the embodiment is as follows:
and (V, E) representing the internet topology by using a simple undirected graph G, wherein V and E are a node set and an edge set respectively.
Let dvFor the degree of the node v in the graph G, | S | | | represents the total number of contained elements in the set S.
1) Average sectionPoint degree f1The calculation method comprises the following steps:
Figure GDA0003611020660000071
wherein d ismaxFor the maximum node degree in graph G, p (k) represents the percentage of nodes in node set V that are k.
2) Maximum nucleus f2The calculation method comprises the following steps:
step 1, arranging all nodes in the graph G into v according to the sequence of degree from small to large1,v2,L,vnWherein n ═ V | |;
step 2, initialize i ← 1 (symbol ← indicating assignment of 1 to variable i), G0And (3) going to step 3.
Step 3, connecting the node viFrom subfigure Gi-1Deleting, and setting a subgraph formed by the residual nodes as Gi(ii) a Computation subgraph GiMinimum node degree k ini(ii) a And (3) updating i ← i +1, if i is less than n, turning to step 3, otherwise, turning to step 4.
Step 4, calculating k1,k2,L,kn-1Maximum value k inmaxThen f is2=kmaxThe algorithm terminates.
3) Average path length f3The calculation method comprises the following steps:
Figure GDA0003611020660000081
wherein lmaxIs the maximum value of the shortest path length between any pair of nodes in graph G, Pl(k) The node pair number with shortest path length k in graph G is represented as a percentage of the total number of all node pairs.
4) Average clustering coefficient f4The calculation method comprises the following steps:
Figure GDA0003611020660000082
C(k)=2Tk/k(k-1),
Figure GDA0003611020660000083
wherein d ismaxIs the maximum node degree in graph G, P (k) represents the percentage of nodes in node set V with k, C (k) represents the nodes V 'with k in graph G'1,v′2,L,v′tT (v)'i) (i ═ 1,2, L, t) denotes a node v'iThe total number of edges between any two adjacent nodes. Note: if T is 0, then T (v'i)=0。
5) Coefficient of coordination of mixing f5The calculation method comprises the following steps:
Figure GDA0003611020660000084
wherein j isi,kiRepresenting the degrees of the two endpoints (nodes) of the ith edge in the edge set E, | | E | | | represents the total number of edges included in the graph G.
6) Algebraic connectivity f6The calculation method comprises the following steps:
f6=λ2
wherein λ is1≤λ2≤L≤λnAll eigenvalues of the Laplacian matrix l (G) D-a of the graph G, D representing all nodes v in the graph G1,v2,L,vnDegree of (1)
Figure GDA0003611020660000085
L,
Figure GDA0003611020660000086
Is a diagonal matrix of diagonal elements, A ═ aij)n×nThe adjacency matrix of diagram G is represented, namely: if node vi,vjIn graph G, taken together, then aij1, otherwise aij=0。
7) Natural connectivity f7The calculation method comprises the following steps:
Figure GDA0003611020660000091
wherein, γ12,L,γnIs adjacency matrix A ═ of (a) of graph Gij)n×nAll characteristic values of (a).
8) Weighted spectral distribution f8The calculation method comprises the following steps:
Figure GDA0003611020660000092
wherein eta is12,L,ηnNormal Laplacian matrix NL (G) D of fig. G-1/2(D-A)D-1/2D represents the total number of nodes v in the graph G1,v2,L,vnDegree of (1)
Figure GDA0003611020660000093
L,
Figure GDA0003611020660000094
Is a diagonal matrix of diagonal elements, A ═ aij)n×nThe adjacency matrix of diagram G is represented, namely: if node vi,vjIn the graph G are connected, then aij1, otherwise aij=0。
9) Repetition degree f of eigenvalue 19The calculation method comprises the following steps:
f9=g(1)/n,
wherein G (1) represents all eigenvalues η of the regular Laplacian matrix NL (G) of the graph G12,L,ηnThe total number of median values is 1.
10) Laplacian spectrum radius f10The calculation method comprises the following steps:
f10=max(|λ1|,|λ2|,L,|λn|),
wherein λ is12,L,λnAll eigenvalues of the Laplacian matrix l (G) of the graph G.
Remarking: | g | represents taking the absolute value, and max represents taking the maximum value.
11) Adjacent spectral radius f11The calculating method of (2):
f11=max(|γ1|,|γ2|,L,|γn|),
wherein, γ12,L,γnIs adjacency matrix A ═ of (a) of graph Gij)n×nAll characteristic values of (a).
12) Regular Laplacian spectrum radius f12The calculation method comprises the following steps:
f12=max(|η1|,|η2|,L,|ηn|),
wherein eta is12,L,ηnIs the overall eigenvalue of the regular Laplacian matrix nl (G) of the graph G.
And S103, inputting the topology generation tool into the domain of the topology simulation system of the Internet test bed.
In this step, the topology generation tools include Random walk, Forest Fire, break-first Search, SnowBall, node/edge Random deletion, and the like.
And S104, calculating the importance weight value of each topological feature in the domain relative to the test index, sorting the importance of all topological features in the domain, and outputting a corresponding importance sorting vector.
In order to output the importance ranking vector of all the topological features in the domain of discourse, the present embodiment needs to input a discrete sequence p of a topological Feature set Ω and a Parallel Feature Pyramid model (PFP for short) parameter ps+k1·lp(k1=0,1,L,mp) Discrete sequence q of parallel feature pyramid model parameters qs+k2·lq(k2=0,1,L,mq) Discrete sequence of parallel feature pyramid model parameters deltas+k3·lδ(k3=0,1,L,mδ) A discrete sequence n of the number n of topological nodess+k4·ln(k4=0,1,L,mn) And a test index x.
The parallel feature pyramid model is a simulation model for generating an internet topological graph by taking quadruples (p, q, delta, n) as input.
By default, (p)s,lp,mp)=(0.2,0.1,5),(qs,lq,mq)=(0.1,0.1,5),
s,lδ,mδ)=(0.008,0.02,5),(ns,ln,mn)=(1000,500,11)。
The embodiment only focuses on the topological structure of the internet test bed; therefore, the test conclusion of the test index x only depends on the topological connection relation between the simulation nodes of the Internet test bed.
The step of generating the topological graph G in this embodiment is as follows:
inputting: quadruplets (p, q, δ, n);
and (3) outputting: and G, simulating a topological graph.
And step 1, generating a complete graph G containing 9 nodes.
And 2, if the graph G contains the number of nodes smaller than n, turning to the step 3, otherwise, G is the output simulation topological graph.
And 3, generating a random number r between 0 and 1, if r is more than or equal to 0 and less than p, turning to the step 4, if r is more than or equal to p and less than p + q, turning to the step 5, and if r is more than or equal to p + q and less than or equal to 1, turning to the step 6.
Step 4, distributing by probability
Figure GDA0003611020660000101
Wherein v isiRepresents the ith node, k, in graph GiRepresenting a node viIn degree of graph G, n (G) represents the total number of nodes contained in graph G), two different nodes w are randomly extracted in graph G1And w2And adding a new node v and two new edges (v, w) in the graph G1)、(v,w2) (ii) a And (6) turning to the step 2.
Step 5, pi (v) with probability distributioni) Randomly drawing three different nodes w in graph G1、w2And w3And a new node v is added in the graph GAnd three new edges (v, w)1)、(w1,w2)、(w1,w3) (ii) a And (6) turning to the step 2.
Step 6, distributing II (v) according to probabilityi) Randomly drawing three different nodes w in graph G1、w2And w3And adding a new node v and three new edges (v, w) in the graph G1)、(v,w2)、(w1,w3) (ii) a And (6) turning to the step 2.
As shown in fig. 2, the step S104 specifically includes:
s10401, setting parameter pd=0.3,qd=0.1,δd=0.048。
S10402, for any one quadruple (p)s+k1·lp,qdd,ns+k4·ln) Generating a topological graph G (p) by adopting a parallel characteristic pyramid models+k1·lp,qdd,ns+k4·ln) Recording the quadruple as a first quadruple, and taking the topological graph as a first topological graph; wherein k is1=0,1,L,mp,k4=0,1,L,mn
S10403, for the kth topological feature in the theory domain, calculating the first topological graph G (p) of the topological features+k1·lp,qdd,ns+k4·ln) Topological characteristic value f ofk(ps+k1·lp,qdd,ns+k4·ln)。
S10404, adopting a first topological graph G (p)s+k1·lp,qdd,ns+k4·ln) Configuring the topological connection relation between simulation nodes on the Internet test bed, and testing to obtain the value x (p) of the test index xs+k1·lp,qdd,ns+k4·ln)。
S10405, calculating the kth topological feature fkRelative to the first levelLine characteristic pyramid model parameter p ═ ps+k1·lpIs determined by the first spatial recognition capability value.
Specifically, the kth topological feature f is calculatedkPyramid model parameter p ═ p relative to the first parallel featuress+k1·lpA first spatial recognition capability value of (a), as follows:
Figure GDA0003611020660000111
wherein,
Figure GDA0003611020660000112
s10406, calculating the kth topological feature fkPyramid model parameter p ═ p relative to the first parallel featuress+k1·lpAnd a first equivalent deduction value for the test index x.
Specifically, the kth topological feature f is calculatedkPyramid model parameter q ═ q relative to the first parallel featuress+k2·lqAnd a first equivalent deductive value for the test index x, as follows:
Figure GDA0003611020660000113
wherein,
Figure GDA0003611020660000114
s10407, for any one quadruple (p)d,qs+k2·lqd,ns+k4·ln) Generating a topological graph G (p) by adopting a parallel characteristic pyramid modeld,qs+k2·lqd,ns+k4·ln) Recording the quadruple as a second quadruple, and taking the topological graph as a second topological graph; wherein k is2=0,1,L,mq,k4=0,1,L,mn
S10408, for the kth topological feature in the theoretical domain, calculating the second topological graph G (p) of the topological featured,qs+k2·lqd,ns+k4·ln) Topological characteristic value f ofk(pd,qs+k2·lqd,ns+k4·ln)。
S10409, adopting a second topological graph G (p)d,qs+k2·lqd,ns+k4·ln) Configuring the topological connection relation between simulation nodes on the Internet test bed, and testing to obtain the value x (p) of the test index xd,qs+k2·lqd,ns+k4·ln)。
S10410, calculating the kth topological feature fkWith respect to the second parallel feature pyramid model parameter q ═ qs+k2·lqThe second spatial recognition capability value of (1).
Specifically, the kth topological feature f is calculatedkPyramid model parameter q ═ q relative to the second parallel featuress+k2·lqA second spatial recognition capability value of (a), as follows:
Figure GDA0003611020660000121
wherein,
Figure GDA0003611020660000122
s10411, calculating the kth topological feature fkPyramid model parameter q ═ q relative to the second parallel featuress+k2·lqAnd a second equivalent deduction value for the test index x.
Specifically, the kth topological feature f is calculatedkPyramid model parameter q ═ q relative to the second parallel featuress+k2·lqAnd the first of the test index xTwo equivalent derived metric values, as follows:
Figure GDA0003611020660000123
wherein,
Figure GDA0003611020660000124
s10412, for any one quadruple (p)d,qds+k3·lδ,ns+k4·ln) Generating a topological graph G (p) by adopting a parallel characteristic pyramid modeld,qds+k3·lδ,ns+k4·ln) Recording the quadruple as a third quadruple, and taking the topological graph as a third topological graph; wherein k is3=0,1,L,mδ,k4=0,1,L,mn
S10413, for the kth topological feature in the theory domain, calculating the topological feature in the third topological graph G (p)d,qds+k3·lδ,ns+k4·ln) Topological characteristic value f ofk(pd,qds+k3·lδ,ns+k4·ln)。
S10414, adopting a third topological graph G (p)d,qds+k3·lδ,ns+k4·ln) Configuring the topological connection relation between simulation nodes on the Internet test bed, and testing to obtain the value x (p) of the test index xd,qds+k3·lδ,ns+k4·ln)。
S10415, calculating the kth topological feature fkThe pyramid model parameter delta is delta relative to the third parallel features+k3·lδThe third spatial recognition capability value of (1).
Specifically, the kth topological feature f is calculatedkRelative toThe third parallel characteristic pyramid model parameter delta is deltas+k3·lδThe third spatial recognition capability value of (1), as follows:
Figure GDA0003611020660000125
wherein,
Figure GDA0003611020660000131
s10416, calculating the kth topological feature fkThe pyramid model parameter delta is delta relative to the third parallel features+k3·lδAnd a third equivalent deduction value for the test index x.
Specifically, the kth topological feature f is calculatedkThe pyramid model parameter delta is delta relative to the third parallel features+k3·lδAnd a third equivalent derived measure for test index x, as follows:
Figure GDA0003611020660000132
wherein,
Figure GDA0003611020660000133
s10417, calculating the kth topological feature f according to the first space recognition capability value, the second space recognition capability value and the third space recognition capability valuekThe comprehensive space recognition capability value of (1).
Specifically, the kth topological feature f is calculated according to the first space recognition capability value, the second space recognition capability value and the third space recognition capability valuekThe comprehensive space recognition capability value of (1) is as follows:
Figure GDA0003611020660000134
wherein,
Figure GDA0003611020660000135
Sr(fkp) is a first spatial recognition capability value, Sr(fkQ) is a second spatial recognition ability value, Sr(fkδ) is the third spatial recognition capability value.
S10418, calculating a kth topological feature f according to the first equivalent deduction degree value, the second equivalent deduction degree value and the third equivalent deduction degree valuekThe integrated equivalent derived measure value.
Specifically, the kth topological feature f is calculated according to the first equivalent deduction degree value, the second equivalent deduction degree value and the third equivalent deduction degree valuekThe integrated equivalent derived measure value of (a) is as follows:
Figure GDA0003611020660000136
wherein,
Figure GDA0003611020660000137
Ex(fkp) is a first equivalent derived measure, Ex(fkQ) is a second equivalent derived measure value, Ex(fkδ) is the third equivalent derivative metric value.
S10419, calculating the kth topological feature f according to the comprehensive space identification capacity value and the comprehensive equivalent deduction degree valuekImportance weight value relative to test index x.
Specifically, the kth topological feature f is calculated according to the comprehensive space identification capacity value and the comprehensive equivalent deduction degree valuekThe importance weight value relative to test index x is given by:
Rx(fk)=ws·Sr(fk)+we·Ex(fk)
wherein ws=0.5,we=0.5,Sr(fk) To synthesize the spatial recognition capability value, Ex(fk) For comprehensive equivalent deduction degreeThe value is obtained.
And S10420, sorting the importance of all the topological features in the domain of discourse according to the importance weight value, and outputting a corresponding importance sorting vector.
And S105, extracting the first n topological features in the importance sequence according to the importance sequence vector, and generating a cost function.
And S106, evaluating the topology fidelity of the topology generation tool by adopting a cost function.
In particular, assume that G is a real-world topological graph, z1,z2,L,zkCorresponding k topology generation tools, and the simulation graphs generated by the k tools are respectively set as G1,G2,L,GkThen, evaluate ziThe cost function of (i ═ 1,2, L, k) is an objective function, as follows:
Figure GDA0003611020660000141
wherein f is1,f2,L,ftIs t topological features, w, arranged by importance1,w2,L,wtAre respectively f1,f2,L,ftOf importance ranking the weight values, fj(G) And fj(Gi) Representing the jth topological feature fjRespectively in the real graph G and the simulation graph GjThe value of (d).
Computing
Figure GDA0003611020660000142
Then it can be deduced that: the s th tool zsIs an optimal topology generation tool.
In step S105 and step S106, the vectors V are sorted according to importancerankA small number of topological features with high importance (the first three topological features in the importance ranking in the embodiment) can be screened out to form a cost function; the merit function can be used as an evaluation standard for generating topology fidelity by a topology generation tool, and a simulation topology which is closer to a real world internet topological structure in the topological characteristic of the merit function is extracted as a recordEntering a test task of the Internet test bed topology simulation system and an Internet test bed topology environment of a test index; importance ranking vector VrankThe self-adaptive matching method strongly depends on the test index x, so that the self-adaptive matching of the optimal topological fidelity tool can be realized from different topological generation tools such as Random walk, Forest Fire, break-first Search, SnowBall and Random node/edge deletion according to different test indexes.
In a specific example of this embodiment, the test task is a specific cbt (center Based tree) -oriented multicast routing protocol test task, and Based on equivalent deduction of two specific test indexes, namely delay rate and cost rate, by using the quantitative ranking method for importance of the topology features of the internet test bed of this embodiment, the importance of twelve topology features in the domain Ω is ranked under a default condition, and the ranking result is shown in fig. 3 and fig. 4, which shows that the ranking of the importance of the topology features is usually different for different test indexes, that is, the selection of the cost function composed of the topology features used in the fidelity evaluation of the topology structure of the internet test bed strongly depends on the specific test task and test indexes. The technology of the embodiment is applied to the self-adaptive matching selection of the test bed topology generation tool under different test task requirements, and has important application value for the accurate test of the internet technology which strongly depends on the topology structure, such as resource positioning, access control, routing protocol, active defense and the like.
Those skilled in the art will appreciate that all or part of the steps in the method for implementing the above embodiments may be implemented by a program to instruct associated hardware, and the corresponding program may be stored in a computer-readable storage medium.
It should be noted that although the method operations of the above-described embodiments are depicted in the drawings in a particular order, this does not require or imply that these operations must be performed in this particular order, or that all of the illustrated operations must be performed, to achieve desirable results. Rather, the depicted steps may change the order of execution. Additionally or alternatively, certain steps may be omitted, multiple steps combined into one step execution, and/or one step broken down into multiple step executions.
Example 2:
as shown in fig. 5, the present embodiment provides an apparatus for evaluating internet test bed topology fidelity, the apparatus includes a first entry module 501, a second entry module 502, a third entry module 503, a calculation module 504, an extraction module 505, and an evaluation module 506, and specific functions of each module are as follows:
the first entry module 501 is configured to receive a test task and enter a test index and a corresponding test method into the internet test bed topology simulation system.
The second entry module 502 is configured to enter the topological feature and the corresponding calculation method into a domain of the topology simulation system of the internet test bed; wherein, the discourse domain is a discourse domain oriented to the equivalent deduction of the test indexes.
The third entering module 503 is configured to enter a topology generating tool into a domain of discourse of the internet test bed topology simulation system.
The calculating module 504 is configured to calculate an importance weight value of each topological feature in the domain relative to the test indicator, rank the importance of all topological features in the domain, and output a corresponding importance ranking vector.
The extracting module 505 is configured to extract the top n topological features in the importance ranking according to the importance ranking vector, and generate a cost function.
The evaluation module 506 is configured to evaluate the topology fidelity of the topology generation tool by using a cost function.
Further, the calculating module 504 specifically includes:
a first generating unit 50401 for generating a four-tuple (p) for any ones+k1·lp,qdd,ns+k4·ln) Generating a topological graph G (p) by adopting a parallel characteristic pyramid models+k1·lp,qdd,ns+k4·ln) (ii) a Wherein k is1=0,1,L,mp,k4=0,1,L,mn,qdAnd deltadIs a preset parameter.
A first calculating unit 50402, configured to calculate, for the kth topological feature in the theoretical domain, the topological feature in the topological graph G (p)s+k1·lp,qdd,ns+k4·ln) Topological characteristic value f ofk(ps+k1·lp,qdd,ns+k4·ln)。
A first test unit 50403 for employing the topology map G (p)s+k1·lp,qdd,ns+k4·ln) Configuring the topological connection relation between simulation nodes on the Internet test bed, and testing to obtain the value x (p) of the test index xs+k1·lp,qdd,ns+k4·ln);
A second calculating unit 50404 for calculating the kth topological feature fkPyramid model parameter p ═ p relative to parallel featuress+k1·lpIs determined by the first spatial recognition capability value.
A third calculating unit 50405 for calculating the kth topological feature fkPyramid model parameter p ═ p relative to parallel featuress+k1·lpAnd a first equivalence deduction value for the test index x.
A second generating unit 50406, for generating a four-tuple (p) for any oned,qs+k2·lqd,ns+k4·ln) Generating a topological graph G (p) by adopting a parallel characteristic pyramid modeld,qs+k2·lqd,ns+k4·ln) (ii) a Wherein k is2=0,1,L,mq,k4=0,1,L,mn,pdAnd deltadAre preset parameters.
A fourth calculation unit 50407, configured to calculate, for a kth topological feature in the theory domain, the topological feature in the topological graph G (p)d,qs+k2·lqd,ns+k4·ln) Topological characteristic value f ofk(pd,qs+k2·lqd,ns+k4·ln)。
A second test unit 50408 for employing the topology G (p)d,qs+k2·lqd,ns+k4·ln) Configuring the topological connection relation between simulation nodes on the Internet test bed, and testing to obtain the value x (p) of the test index xd,qs+k2·lqd,ns+k4·ln)。
A fifth calculating unit 50409 for calculating the kth topological feature fkRelative to the parameter q of the parallel characteristic pyramid model, q is qs+k2·lqThe second spatial recognition capability value of (2).
A sixth calculating unit 50410, configured to calculate a kth topological feature fkPyramid model parameter q ═ q relative to parallel featuress+k2·lqAnd a second equivalent derived metric value for test metric x.
A third generating unit 50411 for generating a four-tuple (p) for any one of the four tuplesd,qds+k3·lδ,ns+k4·ln) Generating a topological graph by adopting a parallel characteristic pyramid model; wherein k is3=0,1,L,mδ,k4=0,1,L,mn,pdAnd q isdIs a preset parameter.
A seventh calculating unit 50412, configured to calculate, for the kth topological feature in the theoretical domain, the topological feature in the topological graph G (p)d,qds+k3·lδ,ns+k4·ln) Topological characteristic value f ofk(pd,qds+k3·lδ,ns+k4·ln)。
A third test unit 50413 for employing a topologyGraph G (p)d,qds+k3·lδ,ns+k4·ln) Configuring the topological connection relation between simulation nodes on the Internet test bed, and testing to obtain the value x (p) of the test index xd,qds+k3·lδ,ns+k4·ln)。
An eighth calculating unit 50414 for calculating a kth topological feature fkPyramid model parameter delta relative to parallel featuress+k3·lδThe third spatial recognition capability value of (1).
A ninth calculating unit 50415 for calculating a kth topological feature fkParameter delta is equal to delta relative to parallel characteristic pyramid models+k3·lδAnd a third equivalent derivative value for the test index x.
A tenth calculating unit 50416, configured to calculate the kth topological feature f according to the first space recognition capability value, the second space recognition capability value and the third space recognition capability valuekThe comprehensive space recognition capability value of (2).
An eleventh calculating unit 50417, configured to calculate the kth topological feature f according to the first equivalent derived metric value, the second equivalent derived metric value, and the third equivalent derived metric valuekThe integrated equivalent derived measure value.
A twelfth calculating unit 50418, configured to calculate the kth topological feature f according to the integrated space recognition capability value and the integrated equivalent deduction degree valuekImportance weight value relative to test index x.
And the output unit 50419 is used for sorting the importance of all the topological features in the domain of interest according to the importance weight value and outputting a corresponding importance sorting vector.
The specific implementation of each module in this embodiment may refer to embodiment 1, which is not described herein any more; it should be noted that, the apparatus provided in this embodiment is only illustrated by dividing the functional modules, and in practical applications, the functions may be distributed by different functional modules according to needs, that is, the internal structure is divided into different functional modules to complete all or part of the functions described above.
Example 3:
the present embodiment provides a computer device, which is the local computer described in embodiment 1 above, and as shown in fig. 7, the computer device includes a processor 702, a memory, an input device 703, a display 704, and a network interface 705, which are connected by a system bus 701, the processor is configured to provide computing and control capabilities, the memory includes a nonvolatile storage medium 706 and an internal memory 707, the nonvolatile storage medium 706 stores an operating system, a computer program, and a database, the internal memory 707 provides an environment for the operating system and the computer program in the nonvolatile storage medium to run, and when the processor 702 executes the computer program stored in the memory, the internet test bed topology fidelity evaluation method of embodiment 1 above is implemented, as follows:
receiving a test task, and inputting a test index and a corresponding test method into an Internet test bed topology simulation system;
inputting the topological characteristics and the corresponding calculation method into the domain of discourse of the Internet test bed topological simulation system; wherein, the discourse domain is a discourse domain oriented to the equivalent deduction of the test index;
inputting a topology generation tool into a domain of discourse of the Internet test bed topology simulation system;
calculating the importance weight value of each topological feature in the domain relative to the test index;
sorting the importance of all topological features in the domain of discourse according to the importance weight value, and outputting a corresponding importance sorting vector;
extracting the first n topological features in the importance ranking according to the importance ranking vector, and generating a value function;
and evaluating the topology fidelity of the topology generation tool by adopting a cost function.
Further, the calculating an importance weight value of each topological feature in the domain of discourse relative to the test index, ranking the importance of all the topological features in the domain of discourse, and outputting a corresponding importance ranking vector specifically includes:
for any one quadruple (p)s+k1·lp,qdd,ns+k4·ln) Generating a topological graph G (p) by adopting a parallel characteristic pyramid models+k1·lp,qdd,ns+k4·ln) (ii) a Wherein k is1=0,1,L,mp,k4=0,1,L,mn,qdAnd deltadIs a preset parameter;
for the kth topological feature in the theoretical domain, calculating the topological feature in a topological graph G (p)s+k1·lp,qdd,ns+k4·ln) Topological characteristic value f ofk(ps+k1·lp,qdd,ns+k4·ln);
Using a topological graph G (p)s+k1·lp,qdd,ns+k4·ln) Configuring the topological connection relation between simulation nodes on the Internet test bed, and testing to obtain the value x (p) of the test index xs+k1·lp,qdd,ns+k4·ln);
Computing the kth topological feature fkPyramid model parameter p ═ p relative to parallel featuress+k1·lpA first spatial recognition capability value of (a);
computing the kth topological feature fkPyramid model parameter p ═ p relative to parallel featuress+k1·lpAnd a first equivalent deduction value of the test index x;
for any one quadruple (p)d,qs+k2·lqd,ns+k4·ln) Generating a topological graph G (p) by adopting a parallel characteristic pyramid modeld,qs+k2·lqd,ns+k4·ln) (ii) a Wherein,k2=0,1,L,mq,k4=0,1,L,mn,pdand deltadIs a preset parameter;
for the kth topological feature in the theoretical domain, calculating the topological feature in a topological graph G (p)d,qs+k2·lqd,ns+k4·ln) Topological characteristic value f ofk(pd,qs+k2·lqd,ns+k4·ln);
Using a topological graph G (p)d,qs+k2·lqd,ns+k4·ln) Configuring the topological connection relation between simulation nodes on the Internet test bed, and testing to obtain the value x (p) of the test index xd,qs+k2·lqd,ns+k4·ln);
Computing the kth topological feature fkPyramid model parameter q ═ q relative to parallel featuress+k2·lqA second spatial recognition capability value of (a);
computing the kth topological feature fkPyramid model parameter q ═ q relative to parallel featuress+k2·lqAnd testing a second equivalent derived metric value of the index x;
for any one quadruple (p)d,qds+k3·lδ,ns+k4·ln) Generating a topological graph G (p) by adopting a parallel characteristic pyramid modeld,qds+k3·lδ,ns+k4·ln) (ii) a Wherein k is3=0,1,L,mδ,k4=0,1,L,mn,pdAnd q isdIs a preset parameter;
for the kth topological feature in the theoretical domain, calculating the topological feature in a topological graph G (p)d,qds+k3·lδ,ns+k4·ln) Topology ofCharacteristic value fk(pd,qds+k3·lδ,ns+k4·ln);
Using a topological graph G (p)d,qds+k3·lδ,ns+k4·ln) Configuring the topological connection relation between simulation nodes on the Internet test bed, and testing to obtain the value x (p) of the test index xd,qds+k3·lδ,ns+k4·ln);
Computing the kth topological feature fkPyramid model parameter delta relative to parallel featuress+k3·lδA third spatial recognition capability value of (a);
computing the kth topological feature fkParameter delta is equal to delta relative to parallel characteristic pyramid models+k3·lδAnd a third equivalent deduction value of the test index x;
calculating the kth topological feature f according to the first space recognition capability value, the second space recognition capability value and the third space recognition capability valuekThe comprehensive space recognition capability value;
calculating the kth topological feature f according to the first equivalent deduction degree value, the second equivalent deduction degree value and the third equivalent deduction degree valuekThe integrated equivalent derived metric value of (a);
calculating the kth topological feature f according to the comprehensive space recognition capability value and the comprehensive equivalent deduction degree valuekAn importance weight value relative to the test index x;
and sorting the importance of all the topological features in the domain of discourse according to the importance weight value, and outputting a corresponding importance sorting vector.
Example 4:
the present embodiment provides a storage medium, which is a computer-readable storage medium, and stores a computer program, and when the computer program is executed by a processor, the method for evaluating the topology fidelity of the internet test bed in the foregoing embodiment 1 is implemented as follows:
receiving a test task, and inputting a test index and a corresponding test method into an Internet test bed topology simulation system;
inputting the topological characteristics and the corresponding calculation method into the domain of discourse of the Internet test bed topological simulation system; wherein, the discourse domain is a discourse domain oriented to the equivalent deduction of the test index;
inputting a topology generation tool into a domain of discourse of the Internet test bed topology simulation system;
calculating the importance weight value of each topological feature in the domain relative to the test index;
sorting the importance of all topological features in the domain of discourse according to the importance weight value, and outputting a corresponding importance sorting vector;
extracting the first n topological features in the importance ranking according to the importance ranking vector, and generating a value function;
and evaluating the topology fidelity of the topology generation tool by adopting a cost function.
Further, the calculating an importance weight value of each topological feature in the domain of discourse relative to the test index, ranking the importance of all the topological features in the domain of discourse, and outputting a corresponding importance ranking vector specifically includes:
for any one quadruple (p)s+k1·lp,qdd,ns+k4·ln) Generating a topological graph G (p) by adopting a parallel characteristic pyramid models+k1·lp,qdd,ns+k4·ln) (ii) a Wherein k is1=0,1,L,mp,k4=0,1,L,mn,qdAnd deltadIs a preset parameter;
for the kth topological feature in the theory domain, the topological feature is calculated in a topological graph G (p)s+k1·lp,qdd,ns+k4·ln) Topological characteristic value f ofk(ps+k1·lp,qdd,ns+k4·ln);
Using a topological graph G (p)s+k1·lp,qdd,ns+k4·ln) Configuring the topological connection relation between simulation nodes on the Internet test bed, and testing to obtain the value x (p) of the test index xs+k1·lp,qdd,ns+k4·ln);
Computing the kth topological feature fkPyramid model parameter p ═ p relative to parallel featuress+k1·lpA first spatial recognition capability value of (a);
computing the kth topological feature fkPyramid model parameter p ═ p relative to parallel featuress+k1·lpAnd a first equivalent deduction value of the test index x;
for any one quadruple (p)d,qs+k2·lqd,ns+k4·ln) Generating a topological graph G (p) by adopting a parallel characteristic pyramid modeld,qs+k2·lqd,ns+k4·ln) (ii) a Wherein k is2=0,1,L,mq,k4=0,1,L,mn,pdAnd deltadIs a preset parameter;
for the kth topological feature in the theoretical domain, calculating the topological feature in a topological graph G (p)d,qs+k2·lqd,ns+k4·ln) Topological characteristic value f ofk(pd,qs+k2·lqd,ns+k4·ln);
Using a topological graph G (p)d,qs+k2·lqd,ns+k4·ln) Configuring the topological connection relation between simulation nodes on the Internet test bed, and testing to obtain the value x (p) of the test index xd,qs+k2·lqd,ns+k4·ln);
Computing the kth topological feature fkRelative to the parameter q of the parallel characteristic pyramid model, q is qs+k2·lqA second spatial recognition capability value of (a);
computing the kth topological feature fkPyramid model parameter q ═ q relative to parallel featuress+k2·lqAnd a second equivalent derived measure value for the test index x;
for any one quadruple (p)d,qds+k3·lδ,ns+k4·ln) Generating a topological graph G (p) by adopting a parallel characteristic pyramid modeld,qds+k3·lδ,ns+k4·ln) (ii) a Wherein k is3=0,1,L,mδ,k4=0,1,L,mn,pdAnd q isdIs a preset parameter;
for the kth topological feature in the theory domain, the topological feature is calculated in a topological graph G (p)d,qds+k3·lδ,ns+k4·ln) Topological characteristic value f ofk(pd,qds+k3·lδ,ns+k4·ln);
Using a topological graph G (p)d,qds+k3·lδ,ns+k4·ln) Configuring the topological connection relation between simulation nodes on the Internet test bed, and testing to obtain the value x (p) of the test index xd,qds+k3·lδ,ns+k4·ln);
Computing the kth topological feature fkPyramid model parameter delta relative to parallel featuress+k3·lδA third spatial recognition capability value of (1);
computing the kth topological feature fkPyramid model parameter delta relative to parallel featuress+k3·lδAnd a third equivalent deduction degree value of the test index x;
calculating the kth topological feature f according to the first space recognition capability value, the second space recognition capability value and the third space recognition capability valuekThe comprehensive space recognition capability value;
calculating the kth topological feature f according to the first equivalent deduction degree value, the second equivalent deduction degree value and the third equivalent deduction degree valuekThe integrated equivalent derived metric value of (a);
calculating the kth topological feature f according to the comprehensive space recognition capability value and the comprehensive equivalent deduction degree valuekAn importance weight value relative to the test index x;
and sorting the importance of all the topological features in the domain of discourse according to the importance weight value, and outputting a corresponding importance sorting vector.
The storage medium in this embodiment may be a magnetic disk, an optical disk, a computer Memory, a Read-Only Memory (ROM), a Random Access Memory (RAM), a usb disk, a removable hard disk, or other media.
In summary, the invention provides a quantitative internet test bed topological feature importance ranking method in view of infinite characteristics of the topological structure of the internet test bed, overcomes the defects of strong subjectivity of traditional topological feature extraction and configuration and lack of quantitative data support, takes equivalent deduction of specific test indexes as a standard, can realize self-adaptive matching of topological fidelity optimal tools from different topological generation tools according to different test indexes, and provides technical support for accurate testing of internet technologies which strongly depend on the topological structure, such as resource positioning, admission control, routing protocols, active defense and the like.
The above description is only for the preferred embodiments of the present invention, but the protection scope of the present invention is not limited thereto, and any person skilled in the art can substitute or change the technical solution and the inventive concept of the present invention within the scope of the present invention.

Claims (9)

1. An internet test bed topology fidelity evaluation method is characterized by comprising the following steps:
receiving a test task, and inputting a test index and a corresponding test method into an Internet test bed topology simulation system;
inputting the topological characteristics and the corresponding calculation method into the domain of discourse of the Internet test bed topological simulation system; wherein, the discourse domain is a discourse domain oriented to the equivalent deduction of the test index;
inputting a topology generation tool into a domain of an internet test bed topology simulation system;
calculating an importance weight value of each topological feature in the domain of discourse relative to the test index, sorting the importance of all the topological features in the domain of discourse, and outputting a corresponding importance sorting vector;
extracting the first n topological features in the importance ranking according to the importance ranking vector, and generating a cost function;
evaluating the topology fidelity of the topology generation tool by adopting a cost function;
the method includes the steps of calculating an importance weight value of each topological feature in a domain relative to a test index, sorting the importance of all topological features in the domain, and outputting a corresponding importance sorting vector, and specifically includes:
for any one quadruple (p)s+k1·lp,qdd,ns+k4·ln) Generating a topological graph G (p) by adopting a parallel characteristic pyramid models+k1·lp,qdd,ns+k4·ln) (ii) a Wherein k is1=0,1,L,mp,k4=0,1,L,mn,qdAnd deltadIs a preset parameter;
for the kth topological feature in the theoretical domain, calculating the topological feature in a topological graph G (p)s+k1·lp,qdd,ns+k4·ln) Topological characteristic value f ofk(ps+k1·lp,qdd,ns+k4·ln);
Using a topological graph G (p)s+k1·lp,qdd,ns+k4·ln) Configuring the topological connection relation between simulation nodes on the Internet test bed, and testing to obtain the value x (p) of the test index xs+k1·lp,qdd,ns+k4·ln);
Computing the kth topological feature fkPyramid model parameter p ═ p relative to parallel featuress+k1·lpA first spatial recognition capability value of (a);
computing the kth topological feature fkPyramid model parameter p ═ p relative to parallel featuress+k1·lpAnd a first equivalent deduction value of the test index x;
for any one quadruple (p)d,qs+k2·lqd,ns+k4·ln) Generating a topological graph G (p) by adopting a parallel characteristic pyramid modeld,qs+k2·lqd,ns+k4·ln) (ii) a Wherein k is2=0,1,L,mq,k4=0,1,L,mn,pdAnd deltadIs a preset parameter;
for the kth topological feature in the theoretical domain, calculating the topological feature in a topological graph G (p)d,qs+k2·lqd,ns+k4·ln) Topological characteristic value f ofk(pd,qs+k2·lqd,ns+k4·ln);
Using a topological graph G (p)d,qs+k2·lqd,ns+k4·ln) Configuring the topological connection relation between simulation nodes on the Internet test bed, and testing to obtain the value x (p) of the test index xd,qs+k2·lqd,ns+k4·ln);
Computing the kth topological feature fkPyramid model parameter q ═ q relative to parallel featuress+k2·lqA second spatial recognition capability value of (a);
computing the kth topological feature fkPyramid model parameter q ═ q relative to parallel featuress+k2·lqAnd a second equivalent derived measure value for the test index x;
for any one quadruple (p)d,qds+k3·lδ,ns+k4·ln) Generating a topological graph G (p) by adopting a parallel characteristic pyramid modeld,qds+k3·lδ,ns+k4·ln) (ii) a Wherein k is3=0,1,L,mδ,k4=0,1,L,mn,pdAnd q isdIs a preset parameter;
for the kth topological feature in the theoretical domain, calculating the topological feature in a topological graph G (p)d,qds+k3·lδ,ns+k4·ln) Topological characteristic value f ofk(pd,qds+k3·lδ,ns+k4·ln);
Using a topological graph G (p)d,qds+k3·lδ,ns+k4·ln) Configuring the topological connection relation between simulation nodes on the Internet test bed, and testing to obtain the value x (p) of the test index xd,qds+k3·lδ,ns+k4·ln);
Computing the kth topological feature fkPyramid model parameter delta relative to parallel featuress+k3·lδA third spatial recognition capability value of (1);
computing the kth topological feature fkRelative to flatLine characteristic pyramid model parameter delta is deltas+k3·lδAnd a third equivalent deduction value of the test index x;
calculating the kth topological feature f according to the first space recognition capability value, the second space recognition capability value and the third space recognition capability valuekThe comprehensive space recognition capability value;
calculating the kth topological feature f according to the first equivalent deduction degree value, the second equivalent deduction degree value and the third equivalent deduction degree valuekThe integrated equivalent derived metric value of (a);
calculating the kth topological feature f according to the comprehensive space recognition capability value and the comprehensive equivalent deduction degree valuekAn importance weight value relative to the test index x;
sorting the importance of all topological features in the domain of discourse according to the importance weight value, and outputting a corresponding importance sorting vector;
wherein (p)s,lp,mp)=(0.2,0.1,5),(qs,lq,mq)=(0.1,0.1,5),(δs,lδ,mδ)=(0.008,0.02,5),(ns,ln,mn)=(1000,500,11)。
2. The method of claim 1, wherein the computing of the kth topological feature fkWith respect to the parameter p ═ ps+k1·lpA first spatial recognition capability value of (a), as follows:
Figure FDA0003611020650000031
wherein,
Figure FDA0003611020650000032
the k topological feature f is calculatedkPyramid model parameter p ═ p relative to parallel featuress+k1·lpAnd a first of the test index xThe equivalent derived metric value is given by:
Figure FDA0003611020650000033
wherein,
Figure FDA0003611020650000034
the k topological feature f is calculatedkPyramid model parameter q ═ q relative to parallel featuress+k2·lqThe second spatial recognition capability value of (1), as follows:
Figure FDA0003611020650000035
wherein,
Figure FDA0003611020650000036
the k topological feature f is calculatedkPyramid model parameter q ═ q relative to parallel featuress+k2·lqAnd a second equivalent derived measure of test index x, as follows:
Figure FDA0003611020650000037
wherein,
Figure FDA0003611020650000038
the k topological feature f is calculatedkParameter delta is equal to delta relative to parallel characteristic pyramid models+k3·lδThe third spatial recognition capability value of (1), as follows:
Figure FDA0003611020650000039
wherein,
Figure FDA00036110206500000310
the k topological feature f is calculatedkPyramid model parameter delta relative to parallel featuress+k3·lδAnd a third equivalent derivative value for test index x, as follows:
Figure FDA00036110206500000311
wherein,
Figure FDA00036110206500000312
3. the evaluation method according to claim 1, wherein the k-th topological feature f is calculated according to the first space recognition capability value, the second space recognition capability value and the third space recognition capability valuekThe comprehensive space recognition capability value of (1) is as follows:
Figure FDA0003611020650000041
wherein,
Figure FDA0003611020650000042
Sr(fkp) is a first spatial recognition capability value, Sr(fkQ) is a second spatial recognition ability value, Sr(fkδ) is the third spatial recognition capability value.
4. The evaluation method according to claim 1, wherein the k-th topology bit is calculated based on the first equivalent derived metric value, the second equivalent derived metric value and the third equivalent derived metric valueSign fkThe integrated equivalent derived measure value of (a) is as follows:
Figure FDA0003611020650000043
wherein,
Figure FDA0003611020650000044
Ex(fkp) is a first equivalent derived measure, Ex(fkQ) is a second equivalent derived measure, Ex(fkδ) is the third equivalent derivative metric value.
5. The evaluation method according to claim 1, wherein the kth topological feature f is calculated according to the comprehensive space recognition capability value and the comprehensive equivalent deduction degree valuekThe importance weight value relative to test index x is given by:
Rx(fk)=ws·Sr(fk)+we·Ex(fk)
wherein, ws=0.5,we=0.5,Sr(fk) Identifying the capability value for the synthesis space, Ex(fk) Is the comprehensive equivalent deductive degree value.
6. The evaluation method according to any one of claims 1 to 5, wherein the topological feature comprises an average degree of nodes f1Maximum nucleus f2Average path length f3Average clustering coefficient f4Mixed coordination coefficient f5Algebraic connectivity f6Natural connectivity f7Weighted spectral distribution f8Characteristic value 1 repetition degree f9Laplacian spectrum radius f10Adjacent spectral radius f11And the radius f of the regular Laplacian spectrum12
7. An internet test bed topology fidelity assessment device, the device comprising:
the first input module is used for receiving a test task and inputting a test index and a corresponding test method into the Internet test bed topology simulation system;
the second input module is used for inputting the topological characteristics and the corresponding calculation method into the domain of the topology simulation system of the Internet test bed; wherein, the discourse domain is a discourse domain oriented to the equivalent deduction of the test index;
the third input module is used for inputting the topology generation tool into the domain of discourse of the topology simulation system of the Internet test bed;
the calculation module is used for calculating the importance weight value of each topological feature in the domain of discourse relative to the test index, sorting the importance of all the topological features in the domain of discourse, and outputting a corresponding importance sorting vector;
the extracting module is used for extracting the first n topological features in the importance sequence according to the importance sequence vector and generating a value function;
the evaluation module is used for evaluating the topology fidelity of the topology generation tool by adopting a value function;
the calculation module specifically includes:
a first generation unit for generating a first four-tuple (p) for any one of the four-tupless+k1·lp,qdd,ns+k4·ln) Generating a topological graph G (p) by adopting a parallel characteristic pyramid models+k1·lp,qdd,ns+k4·ln) (ii) a Wherein k is1=0,1,L,mp,k4=0,1,L,mn,qdAnd deltadIs a preset parameter;
a first calculation unit for calculating the k-th topological feature in the theoretical domain in the topological graph G (p)s+k1·lp,qdd,ns+k4·ln) Topological characteristic value f ofk(ps+k1·lp,qdd,ns+k4·ln);
A first test unit for employing the topology G (p)s+k1·lp,qdd,ns+k4·ln) Configuring the topological connection relation between simulation nodes on the Internet test bed, and testing to obtain the value x (p) of the test index xs+k1·lp,qdd,ns+k4·ln);
A second calculation unit for calculating the kth topological feature fkPyramid model parameter p ═ p relative to parallel featuress+k1·lpA first spatial recognition capability value of (a);
a third calculation unit for calculating the kth topological feature fkPyramid model parameter p ═ p relative to parallel featuress+k1·lpAnd a first equivalent deduction value of the test index x;
a second generation unit for generating a second vector for any one of the four tuples (p)d,qs+k2·lqd,ns+k4·ln) Generating a topological graph G (p) by adopting a parallel characteristic pyramid modeld,qs+k2·lqd,ns+k4·ln) (ii) a Wherein k is2=0,1,L,mq,k4=0,1,L,mn,pdAnd deltadIs a preset parameter;
a fourth calculating unit, for calculating the kth topological feature in the theoretical domain, the topological feature is in the topological graph G (p)d,qs+k2·lqd,ns+k4·ln) Topological characteristic value f ofk(pd,qs+k2·lqd,ns+k4·ln);
A second test unit for employing the topology G (p)d,qs+k2·lqd,ns+k4·ln) Configuration of simulation nodes on Internet test bedThe topological connection relation between the two is tested to obtain the value x (p) of the test index xd,qs+k2·lqd,ns+k4·ln);
A fifth calculation unit for calculating the kth topological feature fkPyramid model parameter q ═ q relative to parallel featuress+k2·lqA second spatial recognition capability value of (a);
a sixth calculation unit for calculating the kth topological feature fkPyramid model parameter q ═ q relative to parallel featuress+k2·lqAnd a second equivalent derived measure value for the test index x;
a third generating unit for generating a fourth tuple (p) for any one of the four tuplesd,qds+k3·lδ,ns+k4·ln) Generating a topological graph by adopting a parallel characteristic pyramid model; wherein k is3=0,1,L,mδ,k4=0,1,L,mn,pdAnd q isdIs a preset parameter;
a seventh calculating unit, for calculating the kth topological feature in the theory domain, the topological feature is in the topological graph G (p)d,qds+k3·lδ,ns+k4·ln) Topological characteristic value f ofk(pd,qds+k3·lδ,ns+k4·ln);
A third test unit for employing the topology G (p)d,qds+k3·lδ,ns+k4·ln) Configuring the topological connection relation between simulation nodes on the Internet test bed, and testing to obtain the value x (p) of the test index xd,qds+k3·lδ,ns+k4·ln);
An eighth calculation unit for calculating the kth topological feature fkPyramid model parameter delta relative to parallel featuress+k3·lδA third spatial recognition capability value of (a);
a ninth calculating unit for calculating the kth topological feature fkPyramid model parameter delta relative to parallel featuress+k3·lδAnd a third equivalent deduction degree value of the test index x;
a tenth calculating unit, configured to calculate the kth topological feature f according to the first space recognition capability value, the second space recognition capability value, and the third space recognition capability valuekThe comprehensive space recognition capability value;
an eleventh calculating unit, configured to calculate a kth topological feature f according to the first equivalent derived metric value, the second equivalent derived metric value, and the third equivalent derived metric valuekThe integrated equivalent derived metric value of (2);
a twelfth calculating unit, configured to calculate the kth topological feature f according to the comprehensive space recognition capability value and the comprehensive equivalent deduction degree valuekAn importance weight value relative to the test index x;
the output unit is used for sorting the importance of all the topological features in the domain of discourse according to the importance weight value and outputting corresponding importance sorting vectors;
wherein (p)s,lp,mp)=(0.2,0.1,5),(qs,lq,mq)=(0.1,0.1,5),(δs,lδ,mδ)=(0.008,0.02,5),(ns,ln,mn)=(1000,500,11)。
8. A computer device comprising a processor and a memory for storing a program executable by the processor, wherein the processor, when executing the program stored in the memory, implements the internet test bed topology fidelity assessment method of any of claims 1-6.
9. A storage medium storing a program, wherein the program, when executed by a processor, implements the internet test bed topology fidelity evaluation method of any of claims 1-6.
CN201910846377.1A 2019-09-09 2019-09-09 Method, device, equipment and medium for evaluating topology fidelity of internet test bed Active CN110708186B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201910846377.1A CN110708186B (en) 2019-09-09 2019-09-09 Method, device, equipment and medium for evaluating topology fidelity of internet test bed

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201910846377.1A CN110708186B (en) 2019-09-09 2019-09-09 Method, device, equipment and medium for evaluating topology fidelity of internet test bed

Publications (2)

Publication Number Publication Date
CN110708186A CN110708186A (en) 2020-01-17
CN110708186B true CN110708186B (en) 2022-07-12

Family

ID=69195263

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201910846377.1A Active CN110708186B (en) 2019-09-09 2019-09-09 Method, device, equipment and medium for evaluating topology fidelity of internet test bed

Country Status (1)

Country Link
CN (1) CN110708186B (en)

Citations (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2012025773A1 (en) * 2010-08-25 2012-03-01 Telefonaktiebolaget L M Ericsson (Publ) Infrastructure model generation system and method
CN105824980A (en) * 2015-01-06 2016-08-03 中国石油大学(华东) Multi-level UPQC topology structure assessment method
CN106503319A (en) * 2016-10-13 2017-03-15 中国人民解放军国防科学技术大学 A kind of artificial network generation method suitable for the assessment of classified nodes method
CN107453897A (en) * 2017-07-03 2017-12-08 北京邮电大学 A kind of node importance evaluation method, device, electronic equipment and storage medium
CN108733976A (en) * 2018-05-23 2018-11-02 扬州大学 Key protein matter recognition methods based on fusion biology and topological characteristic
CN108880872A (en) * 2018-06-04 2018-11-23 佛山科学技术学院 A kind of internet test envelope topological structure decomposition method and device
CN108900320A (en) * 2018-06-04 2018-11-27 佛山科学技术学院 A kind of internet test envelope topological structure large scale shrinkage in size method and device
CN109309390A (en) * 2018-10-22 2019-02-05 黑龙江科技大学 A kind of evaluation method of the MTDC system topology of integrated wind plant

Patent Citations (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2012025773A1 (en) * 2010-08-25 2012-03-01 Telefonaktiebolaget L M Ericsson (Publ) Infrastructure model generation system and method
CN105824980A (en) * 2015-01-06 2016-08-03 中国石油大学(华东) Multi-level UPQC topology structure assessment method
CN106503319A (en) * 2016-10-13 2017-03-15 中国人民解放军国防科学技术大学 A kind of artificial network generation method suitable for the assessment of classified nodes method
CN107453897A (en) * 2017-07-03 2017-12-08 北京邮电大学 A kind of node importance evaluation method, device, electronic equipment and storage medium
CN108733976A (en) * 2018-05-23 2018-11-02 扬州大学 Key protein matter recognition methods based on fusion biology and topological characteristic
CN108880872A (en) * 2018-06-04 2018-11-23 佛山科学技术学院 A kind of internet test envelope topological structure decomposition method and device
CN108900320A (en) * 2018-06-04 2018-11-27 佛山科学技术学院 A kind of internet test envelope topological structure large scale shrinkage in size method and device
CN109309390A (en) * 2018-10-22 2019-02-05 黑龙江科技大学 A kind of evaluation method of the MTDC system topology of integrated wind plant

Also Published As

Publication number Publication date
CN110708186A (en) 2020-01-17

Similar Documents

Publication Publication Date Title
Makarenkov et al. Optimal variable weighting for ultrametric and additive trees and K-means partitioning: Methods and software
US20170330078A1 (en) Method and system for automated model building
CN106251174A (en) Information recommendation method and device
US20070083347A1 (en) Modeling directed scale-free object relationships
Shore et al. Spectral goodness of fit for network models
Gosea et al. Stability preserving post-processing methods applied in the Loewner framework
Alves Unveiling community structures in weighted networks
CN103559205A (en) Parallel feature selection method based on MapReduce
CN110096630A (en) Big data processing method of the one kind based on clustering
CN113792110A (en) Equipment trust value evaluation method based on social networking services
CN110472659B (en) Data processing method, device, computer readable storage medium and computer equipment
CN113409157B (en) Cross-social network user alignment method and device
CN110708186B (en) Method, device, equipment and medium for evaluating topology fidelity of internet test bed
Mahdi et al. Efficient Bayesian modeling of large lattice data using spectral properties of Laplacian matrix
Li et al. Degree distribution of large networks generated by the partial duplication model
CN114091794A (en) Patent value evaluation model training method, evaluation method, device and equipment
Kutsukake et al. Detecting phenotypic selection by approximate bayesian computation in phylogenetic comparative methods
JP4994199B2 (en) Machine learning apparatus and machine learning method
Huang et al. NGD: Filtering graphs for visual analysis
CN110313150B (en) Network analysis tool testing
CN114461390A (en) Evaluation method combining multi-dimensional analysis and critical path method and related device
Li Detecting fuzzy network communities based on semi-supervised label propagation
Farrow et al. Sensitivity of decisions with imprecise utility trade-off parameters using boundary linear utility
Krész et al. Economic network analysis based on infection models
Olucha et al. On the reduction of Linear Parameter-Varying State-Space models

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
TR01 Transfer of patent right
TR01 Transfer of patent right

Effective date of registration: 20240419

Address after: No.23 Nanxiang 2nd Road, Science City, Guangzhou hi tech Industrial Development Zone, Guangdong 510000

Patentee after: HAIHUA ELECTRONICS ENTERPRISE (CHINA) Corp.

Country or region after: China

Address before: 510235 floor 3, Haitian building, No. 28, Binjiang West Road, Haizhu District, Guangzhou City, Guangdong Province

Patentee before: GUANGDONG SOUTHERN COAST TECHNOLOGY SERVICES CO.,LTD.

Country or region before: China