CN105791408B - A kind of construction method and system of P2P network - Google Patents

A kind of construction method and system of P2P network Download PDF

Info

Publication number
CN105791408B
CN105791408B CN201610184905.8A CN201610184905A CN105791408B CN 105791408 B CN105791408 B CN 105791408B CN 201610184905 A CN201610184905 A CN 201610184905A CN 105791408 B CN105791408 B CN 105791408B
Authority
CN
China
Prior art keywords
network node
node
network
circuit
domain
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
CN201610184905.8A
Other languages
Chinese (zh)
Other versions
CN105791408A (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.)
Institute of Information Engineering of CAS
Original Assignee
Institute of Information Engineering of CAS
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 Institute of Information Engineering of CAS filed Critical Institute of Information Engineering of CAS
Priority to CN201610184905.8A priority Critical patent/CN105791408B/en
Publication of CN105791408A publication Critical patent/CN105791408A/en
Application granted granted Critical
Publication of CN105791408B publication Critical patent/CN105791408B/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
    • H04L67/00Network arrangements or protocols for supporting network services or applications
    • H04L67/01Protocols
    • H04L67/10Protocols in which an application is distributed across nodes in the network
    • H04L67/104Peer-to-peer [P2P] networks
    • H04L67/1042Peer-to-peer [P2P] networks using topology management mechanisms

Landscapes

  • Business, Economics & Management (AREA)
  • General Business, Economics & Management (AREA)
  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

The invention discloses the construction methods and system of a kind of P2P network.This method comprises: all network nodes are numbered;A circuit by all-network node is constructed, and two network nodes being connected in circuit are located at different domains;All network nodes are traversed, and randomly choose target network node: if the network node currently traversed is located at different domains from target network node, a directed edge is added between current network node and target network node.The P2P network constructed through the invention has stronger connectivity, trans-regional characteristic and robustness.

Description

A kind of construction method and system of P2P network
Technical field
The present invention relates to network technique field, in particular to a kind of the construction method and system of P2P network.
Background technique
P2P (peer-to-peer, equity) network is widely used due to the advantage of its strong robustness by communication system.So And from the angle of tracking, existing P2P network has following defects that
Communication has locality first: communication is prone between the node in same domain, once certain communication Source node exposure, third can track corresponding destination node easily." domain " refers to the logic list for dividing internet herein Position can be region (country/province/city/...), Autonomous Domain, ISP etc..Each domain has independent mutual Networking monitoring power, is monitored multiple domains, needs to cooperate between domain.Secondly communication source easily exposes: node utilizes true identity It is communicated, once the destination node exposure of certain communication, then corresponding source node exposes therewith.
There are a large amount of frequent communications since the communication mechanism of P2P network complexity often leads to network internal, it is above-mentioned The P2P topological characteristic that defect likely results in communication subgraph of the existing P2P network in each domain is exposed.And still lack at present It is capable of the P2P network of effectively anti-tracking, therefore, how to guarantee that P2P network has strong anti-traceability is current network technique field A technical problem urgently to be resolved.
Summary of the invention
In order to solve the problems, such as that the anti-trace ability of P2P network is poor in the prior art, the invention proposes a kind of novel The construction method and system of P2P network.
In order to solve the above-mentioned technical problem, the present invention is achieved through the following technical solutions.
According to one aspect of the present invention, a kind of construction method of P2P network is provided, comprising:
All network nodes are numbered;
A circuit by all-network node is constructed, and two network nodes being connected in the circuit are located at difference Domain;
Traverse all network nodes, and randomly choose target network node: if the network node currently traversed with it is described Target network node is located at different domains, then adding one between the current network node and the target network node has Xiang Bian.
Further, described pair of all network node is numbered, comprising:
Statistics network node, and all-network node is sorted out by domain;
A network node is selected in the domain most from number of network node at random, selects a network at random from other domains Node repeats the step, until all-network node is selected and finished;
If remaining network node is located at same domain, network node is selected at random in this domain, until all-network Node, which is selected, to be finished;
After all-network node is selected, all-network node is sequentially compiled according to the sequencing being selected Number.
Further, circuit of the building one by all-network node, and two nets being connected in the circuit Network node is located at different domains, comprising:
From arbitrary node, the circuit of connection all-network node is constructed by directed edge;
Inversely traverse the circuit: if the source node of directed edge and destination node are located at same domain in the circuit, Then by the oriented edge contract;
A network node is randomly selected from other domains, in the source node and the network node, the network section Directed edge is added between point and the destination node.
Further, if the network node currently traversed is located at different domains from the target network node, Directed edge is added between the current network node and the target network node, comprising:
Using current network node as source node, and the mesh of predetermined number is never randomly choosed in other network nodes of same area Node is marked, and adds directed edge between the source node and the destination node.
According to another aspect of the invention, a kind of building system of P2P network is provided, comprising:
Node sequencing subsystem, for all network nodes to be numbered;
Circuit constructs subsystem, for constructing a circuit by all-network node, and be connected in the circuit Two network nodes are located at different domains;
Random edged subsystem, for traversing all network nodes, and randomly chooses target network node: if current time The network node gone through is located at different domains from the target network node, then in the current network node and the target network Directed edge is added between node.
Further, the node sequencing subsystem includes:
Statistic unit is used for statistics network node, and all-network node is sorted out by domain;
Module of selection, for selecting a network node at random from the most domain of number of network node, from other domains with Machine selects a network node, repeats the step, until all-network node is selected and finished;If remaining network node is same When domain, then network node is selected at random in this domain, until all-network node is selected and finished;
Numbered cell, it is after selecting when all-network node, all-network node is successive according to what is be selected Sequence is sequentially numbered.
Further, the circuit building subsystem includes:
Circuit construction unit, for connecting returning for all network nodes by directed edge building from arbitrary node Road;
Delete unit, for inversely traversing the circuit: if in the circuit directed edge source node and target section When point is located at same domain, by the oriented edge contract;
Edged unit, for randomly selecting a network node from other domains, in the source node and the network section Directed edge is added between point, the network node and the destination node.
Further, the random edged subsystem is specifically used for:
Using current network node as source node, and the mesh of predetermined number is never randomly choosed in other network nodes of same area Node is marked, and adds directed edge between the source node and the destination node.
The present invention has the beneficial effect that:
The construction method and system of P2P network provided by the present invention, message are injected from arbitrary node, can cover institute There is node, so that whole network has stronger connectivity;Difference is belonged to for the source node and destination node of any a line Domain, have trans-regional characteristic;After deleting part of nodes and its connected side, remaining subgraph still has stronger robust Property.
Detailed description of the invention
Fig. 1 is the flow chart of P2P network establishing method in one embodiment of the invention;
Fig. 2 is the flow chart of one embodiment of the invention interior joint sequence;
Fig. 3 is the flow chart that circuit constructs in one embodiment of the invention;
Fig. 4 is the P2P directed graph constructed in one embodiment of the invention;
Fig. 5 is the flow chart of random edged in one embodiment of the invention;
Fig. 6 is the P2P network and the anti-traceability comparison diagram of TDL-4 network constructed in the embodiment of the present invention;
Fig. 7 is the robustness of the P2P network and TDL-4 network constructed in the embodiment of the present invention to comparison diagram;
Fig. 8 is the structural block diagram of the building system of P2P network in one embodiment of the invention.
Specific embodiment
In order to solve the problems, such as that the anti-trace ability of network is poor in the prior art, the present invention provides a kind of P2P networks Construction method and system.Below in conjunction with attached drawing and embodiment, the present invention will be described in further detail.It should be appreciated that this Locate described specific embodiment to be only used to explain the present invention, does not limit the present invention.
Referring to Fig. 1, the embodiment of the invention provides a kind of construction methods of P2P network, specifically comprise the following steps:
Step 1, all network nodes are numbered;
Step 2, a circuit by all-network node is constructed, and two network nodes being connected in circuit are located at not Same domain;
Step 3, all network nodes are traversed, and randomly choose target network node: if the network node currently traversed It is located at different domains from target network node, then adds a directed edge between current network node and target network node.
The construction method of P2P network provided in the present invention, message can cover after the injection of arbitrary network node All nodes, so that whole network has stronger connectivity;Two network nodes of a line any in network are belonged to In different domains, there is trans-regional characteristic;After deleting part of nodes and its connected side, rest network subgraph still has Stronger robustness.
It describes in detail below to the specific implementation process of each step of the invention.
The process of node sequencing is introduced first: all network nodes are numbered.Referring to fig. 2, it specifically includes as follows Step:
Step 101, statistics network node, and all-network node is sorted out by domain;
Step 102, it selects a network node at random from the most domain of number of network node, is selected at random from other domains One network node repeats the step, until all-network node is selected and finished;If remaining network node is located at same domain When, then network node is selected at random in this domain, until all-network node is selected and finished;
Step 103, after all nodes have been selected, all-network node is sequentially carried out according to the sequencing being selected Number, number consecutively are as follows: v0,v1,…,vN-1
Next introduces the process of circuit building: building one circuit by all-network node, and be connected in circuit Two network nodes are located at different domains.Referring to Fig. 3, comprising:
Step 201, from arbitrary node, the circuit of all network nodes is connected by directed edge building.The present invention One embodiment in, from the network node of lowest number, arrive from small to large sequentially according to number, be sequentially connected each section Point building circuit.Wherein, the circuit of composition is a directed loop by each node at least once.For example, V0-V1-V2-V3- V0For a directed loop primary by each node, or V0-V3-V1-V2-V3-V0.Directed loop interior joint V3By Twice, remaining each point have passed through once.
Step 202, circuit is inversely traversed: if the source node of directed edge and destination node are located at same domain in circuit When, by oriented edge contract.
Referring to fig. 4, this network is described with digraph G (V, E) in the embodiment of the present invention.Wherein, V indicates network node collection (v0,v1,…,vN-1), E indicates connection collection, i.e. set between two network node sides.Scheming G includes N number of network node, distribution In M domain (N > > M > > 1).Each network node indicates a host;vi.m node v is indicatediField Number, be used for Identify node viDomain belonging to corresponding host;Dotted line side < vi,vj> indicate to lead to relationship vi→vj, wherein viReferred to as source node, vjReferred to as destination node, and viUsing the identity of forgery to vjSend message.
Specifically, after the completion of directed loop building, the co-domain side in directed loop is deleted.From v in the embodiment of the present inventionN-1Out Hair, inversely traverses directed loop, if having:Then delete side < vi,vj>;When source node and mesh When marking node from same domain, then by the edge contract between source node and destination node.Due to co-domain side can destroy network across Domain characteristic, it is therefore necessary to be deleted from figure.
Step 203, a network node is randomly selected from other domains, source node and network node, network node with Directed edge is added between destination node.
For the cross-domain characteristic for guaranteeing network, co-domain side < vi,vj> be deleted after, need at random from the domain different from source node One node v of middle selectionk(meet condition: vk.m≠vi.m), then two sides: < v are added in a networki, vk>and<vk,vj>.This In inventive embodiments, by deleting co-domain side, and carry out cross-domain random reconnection, ensure that circuit strong connectedness and cross-domain spy Property.
It finally introduces the process of random edged: traversing all network nodes, and randomly choose target network node: if working as The network node of preceding traversal is located at different domains from target network node, then between current network node and target network node Add a directed edge.
Specifically, it in random edged, needs using current network node as source node, and never other network sections of same area The destination node of predetermined number is randomly choosed in point, and directed edge is added between source node and destination node.It is this hair in Fig. 5 The flow chart of random edged, specific implementation step are as follows in bright embodiment:
Step 301, edged parameter K, juxtaposition initial value k=0 are preset;
Step 302, all-network node is traversed;
Step 303, using present node as source node, and a destination node is randomly choosed from remaining node, if target Node from different domains, then adds a line, k=k+1 from source node;If k≤K, continue to choose destination node, and edged;
Step 304, after the completion of all-network node edged, method terminates.
The experimental results showed that comparing published the relevant technologies, method and system disclosed by the invention mainly have following product Pole effect:
(1) anti-traceability is strong: Fig. 6 gives the P2P network (entitled CRA network) constructed through the invention and the prior art The anti-traceability comparison diagram of middle TDL-4 network.Abscissa (#of realms) indicates Field Number, all 17 countries in Fig. 6 (" Others " is considered as a special country) is numbered according to the sequence of host occupation rate from low to high from 1.Ordinate (α) represents anti-traceability, i.e., temporary, the host number that may be tracked accounts for sum for the monitoring in i domain before defender possesses Percentage.α is smaller, then anti-traceability is stronger.Total curve represents accumulation occupation rate of the host on domain.It can from Fig. 7 Out, CRA curve is compared, TDL-4 curve is closer to Total curve, and therefore, the anti-traceability ratio TDL-4 of CRA is stronger.
(2) strong robustness: Fig. 7 gives the robustness comparison diagram of CRA and TDL-4.Abscissa (p) represents removal rate, i.e., The highest p part of nodes of removal degree from topological diagram.Ordinate represents robustness (β), i.e., is moved in the highest p part of nodes of degree After removing, the number of nodes that maximal connected subgraphs include accounts for the ratio for the node total number that remaining subgraph includes.β is bigger, then robustness is got over By force.From figure 8, it is seen that the robustness ratio TDL-4 of CRA is stronger.
Referring to Fig. 8, the embodiment of the invention also provides a kind of building systems of P2P network, comprising:
Node sequencing subsystem, for all network nodes to be numbered;
Circuit constructs subsystem, for constructing a circuit by all-network node, and two to be connected in circuit Network node is located at different domains;
Random edged subsystem, for traversing all network nodes, and randomly chooses target network node: if current time The network node gone through is located at different domains from target network node, then adds between current network node and target network node Directed edge.
Further, node sequencing subsystem includes:
Statistic unit is used for statistics network node, and all-network node is sorted out by domain;
Module of selection, for selecting a network node at random from the most domain of number of network node, from other domains with Machine selects a network node, repeats the step, until all-network node is selected and finished;If remaining network node is same When domain, then network node is selected at random in this domain, until all-network node is selected and finished;
Numbered cell, it is after selecting when all-network node, all-network node is successive according to what is be selected Sequence is sequentially numbered.
Further, building subsystem in circuit includes:
Circuit construction unit, for connecting returning for all network nodes by directed edge building from arbitrary node Road;
Delete unit, for inversely traversing circuit: if in circuit the source node of directed edge and destination node be located at it is same When one domain, by oriented edge contract;
Edged unit, for randomly selecting a network node from other domains, in source node and network node, network section Directed edge is added between point and destination node.
Further, random edged subsystem is specifically used for:
Using current network node as source node, and the mesh of predetermined number is never randomly choosed in other network nodes of same area Node is marked, and adds directed edge between source node and destination node.
By the method that the function that the device of the present embodiment is realized essentially corresponds to Fig. 1-Fig. 5 above-mentioned, therefore this implementation The not detailed place of description of example, may refer to the related description in previous embodiment, therefore not to repeat here.
Although for illustrative purposes, the preferred embodiment of the present invention has been disclosed, those skilled in the art will recognize It is various improve, increase and replace be also it is possible, therefore, the scope of the present invention should be not limited to the above embodiments.

Claims (6)

1. a kind of construction method of P2P network characterized by comprising
All network nodes are numbered;
A circuit by all-network node is constructed, and two network nodes being connected in the circuit are positioned at different Domain;
All network nodes are traversed, and randomly choose target network node: if the network node currently traversed and the target Network node is located at different domains, then addition one is oriented between the current network node and the target network node Side;
Wherein, circuit of the building one by all-network node, and two network node positions being connected in the circuit In different domains, comprising:
From arbitrary node, the circuit of connection all-network node is constructed by directed edge;
Inversely traverse the circuit:, will if the source node of directed edge and destination node are located at same domain in the circuit The oriented edge contract;
A network node is randomly selected from other domains, the source node and the network node, the network node with Directed edge is added between the destination node.
2. the method as described in claim 1, which is characterized in that described pair of all network node is numbered and includes:
Step 1: statistics network node, and all-network node is sorted out by domain;
Step 2: a network node is selected in the domain most from number of network node at random, selects one at random from other domains Network node repeats step 2, until all-network node is selected and finished;
Step 3: if remaining network node is located at same domain, selecting network node at random in this domain, until all nets Network node, which is selected, to be finished;
Step 4: after all-network node is selected, by all-network node according to the sequencing being selected sequentially into Row number.
3. the method as described in claim 1, which is characterized in that if the network node currently traversed and the target network Node is located at different domains, then adds directed edge between the current network node and the target network node, comprising:
Using current network node as source node, and the target section of predetermined number is never randomly choosed in other network nodes of same area Point, and directed edge is added between the source node and the destination node.
4. a kind of building system of P2P network characterized by comprising
Node sequencing subsystem, for all network nodes to be numbered;
Circuit constructs subsystem, for constructing a circuit by all-network node, and two to be connected in the circuit Network node is located at different domains;
Random edged subsystem, for traversing all network nodes, and randomly chooses target network node: if currently traverse Network node is located at different domains from the target network node, then in the current network node and the target network node Between add directed edge;
Wherein, the circuit building subsystem includes:
Circuit construction unit, for constructing the circuit of connection all-network node by directed edge from arbitrary node;
Unit is deleted, for inversely traversing the circuit: if the source node of directed edge and destination node position in the circuit In same domain, by the oriented edge contract;
Edged unit, for randomly selecting a network node from other domains, in the source node and the network node, institute It states and adds directed edge between network node and the destination node.
5. system as claimed in claim 4, which is characterized in that the node sequencing subsystem, comprising:
Statistic unit is used for statistics network node, and all-network node is sorted out by domain;
Module of selection is chosen from other domains at random for selecting a network node at random from the most domain of number of network node A network node is selected, above-mentioned module of selection step is repeated, until all-network node is selected and finished;If remaining network node When for same domain, then network node is selected at random in this domain, until all-network node is selected and finished;
Numbered cell, after selecting when all-network node, by all-network node according to the sequencing being selected Sequentially it is numbered.
6. system as claimed in claim 4, which is characterized in that the random edged subsystem is specifically used for:
Using current network node as source node, and the target section of predetermined number is never randomly choosed in other network nodes of same area Point, and directed edge is added between the source node and the destination node.
CN201610184905.8A 2016-03-29 2016-03-29 A kind of construction method and system of P2P network Active CN105791408B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201610184905.8A CN105791408B (en) 2016-03-29 2016-03-29 A kind of construction method and system of P2P network

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201610184905.8A CN105791408B (en) 2016-03-29 2016-03-29 A kind of construction method and system of P2P network

Publications (2)

Publication Number Publication Date
CN105791408A CN105791408A (en) 2016-07-20
CN105791408B true CN105791408B (en) 2019-04-02

Family

ID=56392200

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201610184905.8A Active CN105791408B (en) 2016-03-29 2016-03-29 A kind of construction method and system of P2P network

Country Status (1)

Country Link
CN (1) CN105791408B (en)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111314336B (en) * 2020-02-11 2021-03-23 中国科学院信息工程研究所 Dynamic transmission path construction method and system for anti-tracking network

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101127649A (en) * 2007-09-30 2008-02-20 华为技术有限公司 A method and system for preventing from network attacks
WO2013048484A1 (en) * 2011-09-30 2013-04-04 Intel Corporation Quality of experience enhancements over wireless networks

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8799498B2 (en) * 2011-11-18 2014-08-05 Peerialism AB Method and device for peer arrangement in streaming-constrained P2P overlay networks

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101127649A (en) * 2007-09-30 2008-02-20 华为技术有限公司 A method and system for preventing from network attacks
WO2013048484A1 (en) * 2011-09-30 2013-04-04 Intel Corporation Quality of experience enhancements over wireless networks

Also Published As

Publication number Publication date
CN105791408A (en) 2016-07-20

Similar Documents

Publication Publication Date Title
Strayer et al. Detecting botnets with tight command and control
CN106506274B (en) Dynamically-expandable efficient single-packet tracing method
Shi et al. Sybilshield: An agent-aided social network-based sybil defense among multiple communities
CN110113328A (en) A kind of software definition opportunistic network DDoS defence method based on block chain
Lin et al. A graph patrol problem with random attack times
CN108965141B (en) Method and device for calculating multipath routing tree
Shang et al. L-hop percolation on networks with arbitrary degree distributions and its applications
CN101127649A (en) A method and system for preventing from network attacks
CN105791408B (en) A kind of construction method and system of P2P network
CN102065006B (en) Method for recovering inter-domain failure of cross-domain label switched path
CN107148013A (en) A kind of source position method for secret protection of many phantom facility strategies
Krupp et al. Bgpeek-a-boo: Active bgp-based traceback for amplification ddos attacks
Diep et al. Detecting flooding attack in delay tolerant networks by piggybacking encounter records
Zhao et al. P2p network based on neighbor-neighbor lists
CN106936710B (en) Mesh Group configuration method and device
Duwairi et al. An efficient probabilistic packet marking scheme for IP traceback
Yoon et al. Detecting stealthy spreaders by random aging streaming filters
Zhao et al. K-core-based attack to the internet: Is it more malicious than degree-based attack?
Byrenheid et al. Secure embedding of rooted spanning trees for scalable routing in topology-restricted networks
CN103457947B (en) A kind of scales-free network attack method based on random neighbor node
Maneenil et al. Preventing malicious nodes in ad hoc networks using reinforcement learning
Bhavani et al. An efficient IP traceback through packet marking algorithm
Böhmer et al. Stochastic modeling and simulation for redundancy and coexistence in graphs resulting from log-normal shadowing
CN106549929B (en) The localization method and system in a kind of APT attack source
Bachmann et al. Miuz: measuring the impact of disconnecting a node

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant