CN106685690A - Computer network key node discovery method based on simulated building process - Google Patents

Computer network key node discovery method based on simulated building process Download PDF

Info

Publication number
CN106685690A
CN106685690A CN201610973338.4A CN201610973338A CN106685690A CN 106685690 A CN106685690 A CN 106685690A CN 201610973338 A CN201610973338 A CN 201610973338A CN 106685690 A CN106685690 A CN 106685690A
Authority
CN
China
Prior art keywords
node
network
port
routing device
communication
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
Application number
CN201610973338.4A
Other languages
Chinese (zh)
Other versions
CN106685690B (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.)
Central South University
Original Assignee
Central South University
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 Central South University filed Critical Central South University
Priority to CN201610973338.4A priority Critical patent/CN106685690B/en
Publication of CN106685690A publication Critical patent/CN106685690A/en
Application granted granted Critical
Publication of CN106685690B publication Critical patent/CN106685690B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

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/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

Abstract

The invention discloses a computer network key node discovery method based on a simulated building process, comprising the following steps: S1, looking for servers using a default function port according to the port use condition; S2, taking a node set having a record of communication with the nodes in a server set obtained in S1, carrying out screening according to the standard of alternative routers, and adding screened-out nodes to an alternative route set; S3, simulating a network building process with the communication records in a network as a basis, and perfecting the server set and the alternative router set; and S4, screening the nodes in the alternative router set according to a network modularity function, and adding the screened-out nodes to the router set. Servers and routers in a network can be found more accurately based on data of communication between the nodes in a network.

Description

Method is found based on the computer network key node of simulation building process
Technical field
The present invention relates to a kind of computer network key node (server and router) based on simulation building process is sent out Existing method.
Background technology
Server and router are the key nodes in network, and server is network offering services, and router is tissue net The key of network structure.The distribution of key node in definite network contributes to pointedly studying network behavior, such as network behavior Whether relevant with some key nodes, whether the state change of key node represents some behaviors of network etc..
Due to some moral reasons and safety problem, few people are ready gratuitously to disclose the network structure of oneself to other people; Therefore it is difficult the distribution for clearly obtaining server and router in network.The network that present analysis and research worker can be obtained Data, major part is indefinite server and router distribution.
The content of the invention
Technical problem solved by the invention is, for the deficiencies in the prior art, there is provided one kind is based on simulation building process Computer network key node find method, net more can relatively accurately be found out by the communication data between nodes Server and router in network, so that research worker can targetedly analyze network behavior.
Technical scheme provided by the present invention is:
A kind of computer network key node based on simulation building process finds method, based in network in a period of time (concrete analysis field has 7 to the packet of inter-node communication:Time, communicate four-tuple (source ip, purpose ip, source port, purpose Port), uplink traffic size, downlink traffic size) follow the steps below:
A kind of computer network key node based on simulation building process finds method, comprises the following steps:
Step 1:Found using the server of default feature port according to port service condition;Specifically include following steps:
1.1) each port is pressed respectively connecting node number, communication connection number of times and the arrangement of communication flows size inverted order;
1.2) to step 1.1) obtain by connecting node number inverted order arrange port sequence, intercept connecting node number ratio under The port of big n times of the connecting node number of a port;
To step 1.1) port sequence by communication connection number of times inverted order arrangement that obtains, under intercept communication connection number of times ratio The port of big 10n times of the number of times of communication connection of a port;
To step 1.1) port sequence arranged by communication flows size inverted order that obtains, intercept communication flow-rate ratio is next The port of big 100n times of the communication flows of port;
Wherein, 7 < n≤10;
Result is intercepted to 3 times to take simultaneously, and the silent of server is therefrom chosen in the port used according to various COSs acquiescence Recognize function port;
It is conventional as shared file service default uses 389,1025,135,139,445 ports;HTTP service acquiescence makes With 80,443 ports;FTP service acquiescence uses 21,20 ports;DNS service acquiescence uses 53 ports;Mail service acquiescence is used 25,110,109,143 ports;Database service acquiescence uses 1433,1521,3306 ports;Etc..
1.3) from the node using default feature port, screened according to Servers standard, by the node for filtering out Add server set;
Step 2:Taking the node in the server set obtained with step 1 has the node set of communications records, according to alternative Router standard is screened, and the node for filtering out is added into alternate routing device set;
Step 3:Based on the communications records in network, analog network building process, perfect service device set and alternative Set of routers;Specifically include following steps:
3.1) order growth set is equal to alternate routing device set;
3.2) node is taken out as seed node, growth course is carried out to it from growth set;
3.3) from network it is all do not randomly choose in server set point also not in alternate routing device set it is N number of Node, to its repeated growth process;
3.4) judge that whether growth set is empty, if not empty, then rebound step 3.2), otherwise step 3 terminates;
Step 4:Server set and alternate routing device set are finally given based on step 3, according to mixed-media network modules mixed-media degree function Node in alternate routing device set is screened, the node for filtering out is added into set of routers:
4.1) it is empty set to initialize set of routers;
4.2) by the node in alternate routing device set according to (connecting node number × communication connection number of times × communication flows is big It is little) inverted order arrangement;
4.3) by step 4.2) sequence that obtains, an alternate routing device node is taken successively, follow the steps below:
First, with the node in server set, the node in set of routers and all notes that communicate with above-mentioned node The node of record is summit network consisting;If there are communications records between two summits, a line, the power on side are set up between two summits Number of communications × the communication flows being equal to again between two summits;Calculate above network (not adding the network of alternate routing device node) Modularity function maximum Qmax1
Then, with the node in alternate routing device node, the server set, the node in set of routers and it is all with The node that above-mentioned node has communications records is summit network consisting;Calculate above network and (add the net of alternate routing device node Network) modularity function maximum Qmax2
If Qmax2< Qmax1, then the alternate routing device node be added without set of routers;Otherwise, the alternate routing device node Add set of routers.
In the step 1, Servers standard is referred to and meets following condition:
A) the connecting node number of the node is more than the X tantiles of the connecting node number of all nodes in network (such as 3/4 point of position Value means, arranges from small to large, is in that number of the 3/4th position);
B) X tantile of the communication connection number of times of the node more than the communication connection number of times of all nodes in network;
C) X tantile of the communication flows of the node more than the communication flows of all nodes in network;
D) node is more than net by the ratio that its function port communication connects the communication connection number of times that number of times accounts for the node All nodes connect the Y tantiles that number of times accounts for the ratio of respective nodes communication connection number of times by its function port communication in network;
Or the node accounts for the ratio of the communication flows of the node by the communication flows of its function port more than institute in network There is node that the Z tantiles of the ratio of the communication flows of respective nodes are accounted for by the communication flows of its function port;
If e) the function port of the node is 80 or 443, in addition it is also necessary to met, the node is most multiple by 80 or 443 ports Uplink traffic size be all nodes pass through the most multiple uplink traffic size in 80 or 443 ports in network multiple;
Wherein, the function port of node refers to:In whole ports that certain node is used, if by certain Single port The ratio that communication connection number of times accounts for the communication connection number of times of the node is maximum, or accounts for this by the communication flows size of certain Single port The ratio of the communication flows size of node is maximum, then the port is the function port of the node.Number of times ratio is communicated to connect in practice The maximum port of the maximum port of example and communication flows ratio is probably very much same port greatly;If not same port, then Carry out conditional judgment respectively to different function ports, the judged result of different function ports is pressed or computing;
The 0 < X, Y, Z≤1.
Meet the node of Servers standard according to function port segmentation service type.
In the step 2, alternate routing device standard refers to meet:
F) it is unsatisfactory for Servers standard;
G) meet Servers standard a), b) and c) or meet:
H1) the connecting node number > (the X tantiles -1 of all node connecting node numbers in network) of the node and
H2) (the communication connection number of times of the node/(all node connections in network are saved the communication connection number of times > of the node The X tantiles -1 of points))
Or, the communication connection number > of the node (the communication connection number of the node × (the connection section of all nodes in network The X tantiles -1 of points)/the node connecting node number)
Or, the communication flows > of the node (communication flows of the node/(the connecting node number of all nodes in network X tantiles -1))
Or, the communication flows > of the node (communication flows of the node × (the connecting node number of all nodes in network X tantiles -1)/the node connecting node number).
The growth course is comprised the following steps:
I) node set C for there are communications records with the seed node is chosen;
Ii a node) is taken out from C;
Iii the node for taking out) is judged whether in server set or alternate routing device set, if it is, jumping To vi), otherwise into next step;
Iv) judge whether the node for taking out meets Servers standard, if it is, the node is added server set, Subsequently into next step, next step is otherwise directly entered;
V) judge whether the node for taking out meets alternate routing device standard, if it is, the node is added alternate routing Device set and growth set;Subsequently into next step, next step is otherwise directly entered;
Vi) if judging whether C is empty, if it is, terminating growth course;Otherwise rebound step i);
For the randomness of uniform growth process steps 3, step 3 is run multiple times;Again respectively to the clothes for obtaining are run multiple times The business device set and then conjunction of alternate routing device collection is simultaneously, obtains final server set and alternate routing device set.
In the step 4,
The maximum of the modularity function of calculating network is concretely comprised the following steps:
1. remove all of side in network, using each connected component in network as a class, initialize the every of network Individual node is all separately as a class;
2. the side for also not adding network by add-back network again;If the side for adding is connected to two different classes, Then merge the two classes, and calculate the modularity functional value for adding network behind side;The situation of all edgeds is traveled through, selection makes module The edged method that degree functional value increment is maximum or reduction is minimum;
If 3. the class number of network is more than 1 or also side does not add to return, return 2., otherwise go to step 4.;
4. merge corresponding modularity functional value in traveling through 2. every time, obtain the maximum value of the modularity functional value of network;
Wherein, modularity function is:
AijFor the weight on summit i and j side, if being connected without side between summit i and j, Aij=0;kiFor all and summit i Connected side right weight sum, kjFor all side right weight sums being connected with summit j, δ (ci,cj) function decision node ciWith node cj It is whether similar, if so, then δ (ci,cj)=1, otherwise, δ (ci,cj)=0;M is side number total in network.
It should be noted that the side for adding every time simply affects the class in network to divide, i.e. δ (ci,cj) value;And it is each During the modularity functional value of calculating network, carried out in the complete topological structure of network, i.e. all of side of network is all present Topological structure on.
In the step 1, the value of n is adjusted according to the practical situation of network, and different with the method inspection institute of sampling Value filters out the accuracy rate of server, using accuracy rate highest value.
N takes first a less value (such as 1) in the step 3, is then stepped up, and verifies that N is filtered out after increasing Whether the accuracy rate of server rises, and continues to increase if rising, until the accuracy rate of algorithm no longer rises.
In the step 1, the value of X, Y, Z is adjusted according to the practical situation of network, and is used with the method inspection institute of sampling Different values filter out the accuracy rate of server, using accuracy rate highest value.
The X=3/4, Y=1/3, Z=2/5.
Beneficial effect:
The present invention is applied to large, medium and small network, more can relatively accurately be analyzed based on communication data between nodes Go out which node in network be server, the COS of server, and which node be router;So that research people Member can targetedly analyze network behavior.
Specific embodiment
The present invention is described in more detail below.
The invention discloses a kind of computer network key node based on simulation building process finds method, including it is following Step:
Step 1:Found using the server of default feature port according to port service condition;Specifically include following steps:
1.1) each port is pressed respectively connecting node number, communication connection number of times and the arrangement of communication flows size inverted order;
1.2) to step 1.1) obtain by connecting node number inverted order arrange port sequence, intercept connecting node number ratio under The port of big n times of the connecting node number of a port;
To step 1.1) port sequence by communication connection number of times inverted order arrangement that obtains, under intercept communication connection number of times ratio The port of big 10n times of the number of times of communication connection of a port;
To step 1.1) port sequence arranged by communication flows size inverted order that obtains, intercept communication flow-rate ratio is next The port of big 100n times of the communication flows of port;
Wherein, 7 < n≤10;
Result is intercepted to 3 times to take simultaneously, and the silent of server is therefrom chosen in the port used according to various COSs acquiescence Recognize function port;
1.3) from the node using default feature port, screened according to Servers standard, by the node for filtering out Add server set;
Step 2:Taking the node in the server set obtained with step 1 has the node set of communications records, according to alternative Router standard is screened, and the node for filtering out is added into alternate routing device set;
Step 3:Based on the communications records in network, analog network building process, perfect service device set and alternative Set of routers;Specifically include following steps:
3.1) order growth set is equal to alternate routing device set;
3.2) node is taken out as seed node, following growth course is carried out to it from growth set:
I) node set C for there are communications records with the seed node is chosen;
Ii a node) is taken out from C;
Iii the node for taking out) is judged whether in server set or alternate routing device set, if it is, jumping To vi), otherwise into next step;
Iv) judge whether the node for taking out meets Servers standard, if it is, the node is added server set, Subsequently into next step, next step is otherwise directly entered;
V) judge whether the node for taking out meets alternate routing device standard, if it is, the node is added alternate routing Device set and growth set;Subsequently into next step, next step is otherwise directly entered;
Vi) if judging whether C is empty, if it is, terminating growth course;Otherwise rebound step i);
3.3) from network it is all do not randomly choose in server set point also not in alternate routing device set it is N number of Node, to its repeated growth process;
3.4) judge that whether growth set is empty, if not empty, then rebound step 3.2), otherwise step 3 terminates;
Step 4:Server set and alternate routing device set are finally given based on step 3, according to mixed-media network modules mixed-media degree function Node in alternate routing device set is screened, the node for filtering out is added into set of routers:
4.1) it is empty set to initialize set of routers;
4.2) by the node in alternate routing device set according to (connecting node number × communication connection number of times × communication flows is big It is little) inverted order arrangement;
4.3) by step 4.2) sequence that obtains, an alternate routing device node is taken successively, follow the steps below:
First, with the node in server set, the node in set of routers and all notes that communicate with above-mentioned node The node of record is summit network consisting;If there are communications records between two summits, a line, the power on side are set up between two summits Number of communications × the communication flows being equal to again between two summits;Calculate the maximum Q of the modularity function of above networkmax1
Then, with the node in alternate routing device node, the server set, the node in set of routers and it is all with The node that above-mentioned node has communications records is summit network consisting;Calculate the maximum Q of the modularity function of above networkmax2
If Qmax2< Qmax1, then the alternate routing device node be added without set of routers;Otherwise, the alternate routing device node Add set of routers.
Experimental verification:
Tested in 3 truthful data collection using technical scheme disclosed by the invention, experimental conditions are as follows:
Wherein, accuracy rate is referred to:The accounting of actual server and router in the result found out with the inventive method.Call together The rate of returning is referred to:The server and router of reality, the accounting called in by the inventive method.
It is demonstrated experimentally that the present invention is suitable for the ABC class networks of heterogeneous networks scale, and accuracy is higher.

Claims (10)

1. a kind of computer network key node based on simulation building process finds method, it is characterised in that including following step Suddenly:
Step 1:Found using the server of default feature port according to port service condition;Specifically include following steps:
1.1) each port is pressed respectively connecting node number, communication connection number of times and the arrangement of communication flows size inverted order;
1.2) to step 1.1) port sequence arranged by connecting node number inverted order that obtains, connecting node number is intercepted than next The port of big n times of the connecting node number of port;
To step 1.1) port sequence by communication connection number of times inverted order arrangement that obtains, intercept communication connection number of times is than next The port of big 10n times of the number of times of communication connection of port;
To step 1.1) obtain by communication flows size inverted order arrange port sequence, intercept communication flow-rate ratio next port Big 100n times of communication flows port;
Wherein, 7 < n≤10;
Result is intercepted to 3 times to take simultaneously, and the acquiescence work(of server is therefrom chosen in the port used according to various COSs acquiescence Can port;
1.3) from the node using default feature port, screened according to Servers standard, the node for filtering out is added Server set;
Step 2:Taking the node in the server set obtained with step 1 has the node set of communications records, according to alternate routing Device standard is screened, and the node for filtering out is added into alternate routing device set;
Step 3:Based on the communications records in network, analog network building process, the set of perfect service device and alternate routing Device set;Specifically include following steps:
3.1) order growth set is equal to alternate routing device set;
3.2) node is taken out as seed node, growth course is carried out to it from growth set;
3.3) it is all from network not randomly choose N number of section in server set point also not in alternate routing device set Point, to its repeated growth process;
3.4) judge that whether growth set is empty, if not empty, then rebound step 3.2), otherwise step 3 terminates;
Step 4:Server set and alternate routing device set are finally given based on step 3, it is standby according to mixed-media network modules mixed-media degree function pair Select the node in set of routers to be screened, the node for filtering out is added into set of routers:
4.1) it is empty set to initialize set of routers;
4.2) by the node in alternate routing device set according to (connecting node number × communication connection number of times × communication flows size) Inverted order is arranged;
4.3) by step 4.2) sequence that obtains, an alternate routing device node is taken successively, follow the steps below:
First, with the node in server set, the node in set of routers and all there are communications records with above-mentioned node Node is summit network consisting;If there are communications records between two summits, a line, the weight on side etc. are set up between two summits Number of communications × communication flows between two summits;Calculate the maximum Q of the modularity function of above networkmax1
Then, with the node in alternate routing device node, the server set, the node in set of routers and it is all with it is above-mentioned The node that node has communications records is summit network consisting;Calculate the maximum Q of the modularity function of above networkmax2
If Qmax2< Qmax1, then the alternate routing device node be added without set of routers;Otherwise, the alternate routing device node is added Set of routers.
2. the computer network key node based on simulation building process according to claim 1 finds method, its feature It is that in the step 1, Servers standard is referred to and meets following condition:
A) X tantile of the connecting node number of the node more than the connecting node number of all nodes in network;
B) X tantile of the communication connection number of times of the node more than the communication connection number of times of all nodes in network;
C) X tantile of the communication flows of the node more than the communication flows of all nodes in network;
D) node is more than in network by the ratio that its function port communication connects the communication connection number of times that number of times accounts for the node All nodes connect number of times and account for the Y tantiles that respective nodes communicate to connect the ratio of number of times by its function port communication;
Or the node accounts for the ratio of the communication flows of the node by the communication flows of its function port more than all sections in network Point accounts for the Z tantiles of the ratio of the communication flows of respective nodes by the communication flows of its function port;
If e) the function port of the node is 80 or 443, in addition it is also necessary to met, the node is most multiple upper by 80 or 443 ports Row uninterrupted is the multiple that all nodes pass through the most multiple uplink traffic size in 80 or 443 ports in network;
Wherein, the function port of node refers to:In whole ports that certain node is used, if the communication for passing through certain Single port The ratio that connection number of times accounts for the communication connection number of times of the node is maximum, or accounts for the node by the communication flows size of certain Single port Communication flows size ratio it is maximum, then the port is the function port of the node;
The 0 < X, Y, Z≤1.
3. the computer network key node based on simulation building process according to claim 2 finds method, its feature It is that in the step 2, alternate routing device standard refers to meet:
F) it is unsatisfactory for Servers standard;
G) meet Servers standard a), b) and c) or meet:
H1) the connecting node number > (the X tantiles -1 of all node connecting node numbers in network) of the node and
H2) communication connection number of times > (the communication connection number of times of the node/(all node connecting node numbers in network of the node X tantiles -1))
Or, the communication connection number > of the node (the communication connection number of the node × (the connecting node number of all nodes in network X tantiles -1)/the node connecting node number)
Or, (communication flows of the node/(X of the connecting node number of all nodes divides the communication flows > of the node in network Place value -1))
Or, the communication flows > of the node (communication flows of the node × (X of the connecting node number of all nodes in network Tantile -1)/the node connecting node number).
4. the computer network key node based on simulation building process according to claim 3 finds method, its feature It is that the growth course is comprised the following steps:
I) node set C for there are communications records with the seed node is chosen;
Ii a node) is taken out from C;
Iii the node for taking out) is judged whether in server set or alternate routing device set, if it is, jumping to Vi), otherwise into next step;
Iv) judge whether the node for taking out meets Servers standard, if it is, the node is added server set, then Into next step, next step is otherwise directly entered;
V) judge whether the node for taking out meets alternate routing device standard, if it is, the node is added alternate routing device collection Close and grow set;Subsequently into next step, next step is otherwise directly entered;
Vi) if judging whether C is empty, if it is, terminating growth course;Otherwise rebound step i).
5. the computer network key node based on simulation building process according to claim 4 finds method, its feature It is, for the randomness of uniform growth process steps 3, step 3 to be run multiple times;Again respectively to the server for obtaining is run multiple times The set and then conjunction of alternate routing device collection is simultaneously, obtains final server set and alternate routing device set.
6. the computer network key node based on simulation building process according to claim 5 finds method, its feature It is, in the step 4,
The maximum of the modularity function of calculating network is concretely comprised the following steps:
1. all of side in network is removed, using each connected component in network as a class, i.e. each of initialization network Node is all separately as a class;
2. the side for also not adding network by add-back network again;If the side for adding is connected to two different classes, close And the two classes, and calculate the modularity functional value for adding network behind side;The situation of all edgeds is traveled through, selection makes modularity letter The edged method that numerical value increment is maximum or reduction is minimum;
If 3. the class number of network is more than 1 or also side does not add to return, return 2., otherwise go to step 4.;
4. merge corresponding modularity functional value in traveling through 2. every time, obtain the maximum value of the modularity functional value of network;
Wherein, modularity function is:
Q = 1 2 m Σ i , j [ A i j - k i k j 2 m ] δ ( c i , c j )
AijFor the weight on summit i and j side, if being connected without side between summit i and j, Aij=0;kiIt is connected with summit i for all Side right weight sum, kjFor all side right weight sums being connected with summit j, δ (ci,cj) function decision node ciWith node cjWhether It is similar, if so, then δ (ci,cj)=1, otherwise, δ (ci,cj)=0;M is side number total in network.
7. the computer network key node discovery based on simulation building process according to any one of claim 1~6 Method, it is characterised in that in the step 1, the value of n is adjusted according to the practical situation of network, and is checked with the method for sampling Different values used filter out the accuracy rate of server, using accuracy rate highest value.
8. the computer network key node discovery based on simulation building process according to any one of claim 1~6 Method, it is characterised in that N takes first a less value in the step 3, is then stepped up, and verify that N is screened after increasing Whether the accuracy rate for going out server rises, and continues to increase if rising, until the accuracy rate of algorithm no longer rises.
9. the computer network key node discovery based on simulation building process according to any one of claim 2~6 Method, it is characterised in that in the step 1, the value of X, Y, Z is adjusted according to the practical situation of network, and the method with sampling Inspection institute filters out the accuracy rate of server with different values, using accuracy rate highest value.
10. the computer network key node discovery based on simulation building process according to any one of claim 2~6 Method, it is characterised in that the X=3/4, Y=1/3, Z=2/5.
CN201610973338.4A 2016-10-27 2016-10-27 Computer network key node based on simulation building process finds method Active CN106685690B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201610973338.4A CN106685690B (en) 2016-10-27 2016-10-27 Computer network key node based on simulation building process finds method

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201610973338.4A CN106685690B (en) 2016-10-27 2016-10-27 Computer network key node based on simulation building process finds method

Publications (2)

Publication Number Publication Date
CN106685690A true CN106685690A (en) 2017-05-17
CN106685690B CN106685690B (en) 2019-07-09

Family

ID=58839255

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201610973338.4A Active CN106685690B (en) 2016-10-27 2016-10-27 Computer network key node based on simulation building process finds method

Country Status (1)

Country Link
CN (1) CN106685690B (en)

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104933624A (en) * 2015-06-29 2015-09-23 电子科技大学 Community discovery method of complex network and important node discovery method of community
CN105069290A (en) * 2015-08-03 2015-11-18 同济大学 Parallelization critical node discovery method for postal delivery data
CN105337773A (en) * 2015-11-19 2016-02-17 南京邮电大学 ReciprocityRank algorithm based microblogging network influence node discovering method
US20160315964A1 (en) * 2015-04-24 2016-10-27 Dell Products L.P. System and method for authorizing devices joining a network fabric

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20160315964A1 (en) * 2015-04-24 2016-10-27 Dell Products L.P. System and method for authorizing devices joining a network fabric
CN104933624A (en) * 2015-06-29 2015-09-23 电子科技大学 Community discovery method of complex network and important node discovery method of community
CN105069290A (en) * 2015-08-03 2015-11-18 同济大学 Parallelization critical node discovery method for postal delivery data
CN105337773A (en) * 2015-11-19 2016-02-17 南京邮电大学 ReciprocityRank algorithm based microblogging network influence node discovering method

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
龚玉坤: "非合作目标网络重要节点识别技术", 《万方知识数据库》 *

Also Published As

Publication number Publication date
CN106685690B (en) 2019-07-09

Similar Documents

Publication Publication Date Title
CN103023725A (en) Anomaly detection method based on network flow analysis
Gürsun et al. On traffic matrix completion in the internet
CN105162759A (en) SDN network DDoS attack detecting method based on network layer flow abnormity
CN107370752A (en) A kind of efficient remote control Trojan detection method
Shakkottai et al. Evolution of the internet as-level ecosystem
CN100446486C (en) Extracting method for behaviour analysis parameter of network behaviour
CN108494594A (en) A kind of analysis method and system of EIGRP route networks failure
CN107294966A (en) A kind of IP white list construction methods based on Intranet flow
CN106953854A (en) A kind of method for building up of the darknet flow identification model based on SVM machine learning
CN107483267A (en) A kind of EIGRP routing failures recognition methods
CN112134875B (en) IoT network abnormal flow detection method and system
CN103973589A (en) Network traffic classification method and device
Haddadi et al. Modeling internet topology dynamics
CN101267353B (en) A load-independent method for detecting network abuse
KR101073402B1 (en) Method for simulating and examining traffic and network traffic analysis system
CN105554786B (en) A kind of method and device of addressing network problems
CN105634868B (en) A kind of network sweep packet sending speed detection system and method
Zhang et al. Traffic fluctuations on weighted networks
Jaber et al. Using host profiling to refine statistical application identification
CN112291226B (en) Method and device for detecting abnormity of network flow
CN110830499B (en) Network attack application detection method and system
CN106685690A (en) Computer network key node discovery method based on simulated building process
CN106257867A (en) A kind of business recognition method encrypting flow and device
CN104601400B (en) Shunting device performance test methods, test client and test server
Aceto et al. Open source platforms for Internet Monitoring and Measurement

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