CN109451039A - A kind of network information transfer processing method - Google Patents
A kind of network information transfer processing method Download PDFInfo
- Publication number
- CN109451039A CN109451039A CN201811496088.5A CN201811496088A CN109451039A CN 109451039 A CN109451039 A CN 109451039A CN 201811496088 A CN201811496088 A CN 201811496088A CN 109451039 A CN109451039 A CN 109451039A
- Authority
- CN
- China
- Prior art keywords
- node
- network
- information
- neighbor
- seed
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/10—Protocols in which an application is distributed across nodes in the network
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The present invention provides a kind of network information transfer processing methods, comprising: network adaptability regulating step, network common recognition step and Its Fault Tolerance processing step.Total nodal point number of network is estimated, obtain network node total number estimated value, network parameter is adjusted according to the network node total number estimated value, initialization process is carried out to the link pond of neighbor node in new node starting simultaneously, to improve the adaptability of network, prevent the variation of network node total number from impacting to the stability of network；The information transmission mode by active broadcast and passively broadcasted, is adjusted the link of node, guarantees the efficiency of transmission of the network information；The linking status of network is detected, and capable processing is tapped into stale link, neighbor node link pond is adjusted after common recognition switching, improves the fault-tolerance of network.
Description
Technical field
The present invention relates to block chain technical field more particularly to a kind of network information transfer processing methods.
Background technique
Block chain network is as a distributed type open network, it is desirable to provide a kind of quick, safe and stable P2P network
Information transmission processing method, to realize high performance information propagation, common recognition agreement etc. on upper layer.
Due to the opening of block chain network, information transmission processing method can not estimate the number of nodes in network, thus nothing
Method adjusts the neighbor node number of each node, leads to the bad adaptability of network；Not due to current most of block catenary systems
It is the Point-to-Point system of equity, causes the information broadcasting efficiency of network very low；And existing flooding algorithm fault-tolerance is low.
The Chinese invention patent application of Publication No. CN108108487A discloses a kind of common recognition method of block chain, block
After catenary system generates block, in next round common recognition, N number of validator (Validator) can be randomly choosed to a upper block
Legitimacy is voted, if Validator has different opinions, continues to vote, until can be determined that out a block
Legitimacy.Wherein lack and nodes number is estimated, when number of network node is widely varied, the adaptation of network
Property can then be deteriorated, so that the serious stability for influencing network, spreading network information mode are single, information propagation receives limit
System, information broadcasting efficiency is low, and will not detect to network node linking status, and flooding algorithm fault-tolerance is relatively low.
Summary of the invention
The purpose of the present invention is to provide a kind of network information transfer processing methods, to improve the appearance of broadcasting efficiency, network
Mistake and adaptability.
To achieve the above object, a kind of network information transfer processing method of the present invention characterized by comprising
Network adaptability regulating step, network common recognition step and Its Fault Tolerance processing step；
The network adaptability regulating step includes: to be estimated by sampling estimation the total node number of network, is obtained
Then network node total number estimated value carries out at adaptability network parameter according to the network node total number estimated value
Reason, and initialization process is carried out to the link pond of neighbor node in new node starting；
Network common recognition step includes: that the information transmission mode by active broadcast and passively broadcasted carries out network and is total to
Know, and common recognition processing is carried out to node according to the information transmission mode and request source；
The Its Fault Tolerance processing step include: by the active broadcast and it is described it is passive broadcast to linking status into
Row link detection carries out link fails processing to interdependent node after judging information transmission failure, links pond according to neighbor node
Type carries out common recognition hand-off process to node.
The beneficial effects of the present invention are: total nodal point number of network is estimated, the estimation of network node total number is obtained
Value, is adjusted network parameter according to the network node total number estimated value, while saving in new node starting to neighbours
The link pond of point carries out initialization process prevents the variation of network node total number to net to improve the adaptability of network
The stability of network impacts；The information transmission mode by active broadcast and passively broadcasted, is adjusted the link of node,
Guarantee the efficiency of transmission of the network information；The linking status of network is detected, and capable processing, common recognition switching are tapped into stale link
Neighbor node link pond is adjusted afterwards, improves the fault-tolerance of network.
Preferably, the neighbor node includes active neighbor node and passive neighbor node.
Preferably, the active broadcast is after any node receives information, to described in active neighbor node transmission
Information, the beneficial effect is that: the information transmission mode between active neighbor node improves information transfer efficiency.
Preferably, described passively to broadcast as after any node receives information, periodically to the passive neighbor node
The information is transmitted, the passive neighbor node detects own message pond and judges whether to save the information, has
Beneficial effect is: the information transmission mode between passive neighbor node improves information transfer efficiency.
Preferably, the sampling, which is estimated, includes:
S11: the network randomly selects node as seed node, and the seed node generates a random number；
S12: the seed node counts the number of synchronization node in itself neighbor node, obtains seed statistics knot
Fruit；
S13: the seed node passes through building information formula according to the random number and the seed statistical result, with
To seed sample information, the seed sample information is saved in the message pool of itself by the seed node；
S14: the seed node randomly chooses the first synchronization node and the second synchronization node, institute from itself neighbor node
It states seed node and the seed sample information is transferred to first synchronization node and second synchronization node；
S15: first synchronization node receives the seed sample information and stores, and first synchronization node is to itself
The number of synchronization node described in neighbor node is counted, and obtains the first statistical result, first synchronization node is according to institute
It states seed sample information and first statistical result and the first sample information is constructed by newly building information formula, described second is same
It walks node and executes operation identical with first synchronization node, to construct the second sample information；
S16: first synchronization node and second synchronization node respectively choose two new synchronization nodes, the new synchronization
Node receives first sample information and second sample information, and executes the step S15, to construct new sampling letter
Breath；
S17: the seed node receives return information, estimates that formula calculates net by number of nodes according to the return information
Network node total number mesh estimated value.The beneficial effect is that: using the method for sampling estimation, it can quickly obtain network node total number
Estimated value.
It is further preferred that ignoring and having stored information of the information with the identical random number, the random number is letter
Breath label, the beneficial effect is that: guarantee the unicity of information, avoids repeating to count.
It is further preferred that the number of nodes estimation formula is N '=(N-Nc+d×m)/2+Nc, the N ' is the network
Node total number mesh estimated value, the N are initial network node total number, the NcFor the sum for node of knowing together in the network parameter
Mesh, the d are the seed statistical result, and the m is the return information.
It is further preferred that the return information that the seed node is received according to the 15th time, passes through the section
The network node total number estimated value that points estimation formula is calculated is usable levels.
Preferably, the initialization process includes: that the new node reads all seed nodes from configuration file, and with
All seed nodes establish temporary link, and the new node obtains the neighboring node list of all seed nodes；Institute
There is the seed node to estimate the total node number, obtains the n network node total number estimated values, calculate n
The average value of the network node total number estimated value；The new node is random from the neighbor node of all seed nodes
Select m node as by selection node, the seed node obtains all neighboring node lists by selection node；Institute
New node is stated from described by random in the neighbor list information of the neighboring node list information of selection node and the seed node
Node is selected to construct new neighbor node listing；Chain is established in node application in the new node and the new neighbor node listing
It connects, to complete the initialization process.
It is further preferred that the m is 2 × lnNi, the NiFor being averaged for a network node total number estimated value of n
Value.
Preferably, the link detection includes: detection node to neighbor node transmission information, and passes through transmission control protocol
Judge whether the neighbor node receives the information.
Preferably, the link fails processing includes: to judge that the active neighbor node of the detection node does not receive institute
Information is stated, then selects node from the passive neighbor node of the detection node at random, and is transferred to the institute of the detection node
It states in the link pond of active neighbor node.
It is further preferred that the link fails processing includes: to judge that the passive neighbor node of the detection node does not have
The information is received, then is deleted the passive neighbor node from link pond.
It is further preferred that when the passive neighbor node number of the detection node is less than defined in the network parameter
The 2/3 of interstitial content then carries out the initialization process to the neighbor node of detection node link pond, and from the network
Middle random selection node is added in the link pond of the passive neighbor node.
Preferably, the common recognition hand-off process includes: that will newly know together in the link pond of the active neighbor node of destination node
The neighbor node in period moves in the link set of the active neighbor node of the destination node；By the passive neighbours of destination node
Newly know together in the link pond of node the period the neighbor node passive neighbor node that moves to the destination node link set in.
It is further preferred that when the number of links of the active neighbor node is greater than the number that the network parameter defines,
Then the neighbor node in the new common recognition period is moved in the link set of passive neighbor node；When the passive neighbor node
Number of links is greater than the number that the network parameter defines, then disconnects the link of the new common recognition periodic knot.
It is further preferred that defining the 2/ of number when the number of links of the passive neighbor node is less than the network parameter
3, then initialization process is carried out to the neighbor node, and select node to be added to the passive neighbor node from the network
Link pond in.
Detailed description of the invention
Fig. 1 is the flow chart of inventive network information transmission processing method.
Fig. 2 is the flow chart of present invention sampling estimation.
Specific embodiment
To make the object, technical solutions and advantages of the present invention clearer, below in conjunction with attached drawing of the invention, to this hair
Technical solution in bright embodiment is clearly and completely described, it is clear that described embodiment is that a part of the invention is real
Example is applied, instead of all the embodiments.Based on the embodiments of the present invention, those of ordinary skill in the art are not making creation
Property labour under the premise of every other embodiment obtained, shall fall within the protection scope of the present invention.Unless otherwise defined, make herein
Technical term or scientific term should be persons with general skills in the field understood it is usual
Meaning.The similar word such as " comprising " used herein, which means to occur element or object before the word, to be covered and appears in this
The element of word presented hereinafter perhaps object and its equivalent and be not excluded for other elements or object.
In view of the problems of the existing technology, the embodiment provides a kind of network information transfer processing method,
It is characterised by comprising: network adaptability regulating step, network common recognition step and Its Fault Tolerance processing step,
S1: the network adaptability regulating step estimates the total node number of network by sampling estimation, obtains net
Then network node total number mesh estimated value carries out adaptive processes to network parameter according to the network node total number estimated value,
And initialization process is carried out to the link pond of neighbor node in new node starting；
S2: the network is known together step, the information transmission mode progress network common recognition by active broadcast and passively broadcasted,
And common recognition processing is carried out to node according to the information transmission mode and request source；
S3: the Its Fault Tolerance processing step, by the active broadcast and it is described it is passive broadcast to linking status into
Row link detection carries out link fails processing to interdependent node after judging information transmission failure, links pond according to neighbor node
Type carries out common recognition hand-off process to node.
In some embodiments of the present invention, the neighbor node includes active neighbor node and passive neighbor node.
In some embodiments of the present invention, the active broadcast is after any node receives information, to the active neighbour
Occupy information described in node-node transmission.
It is described passively to broadcast as after any node receives information in some embodiments of the present invention, periodically to institute
It states passive neighbor node and transmits the information, the passive neighbor node detects own message pond and judges whether to save
The information.
In some embodiments of the present invention, the sampling estimation includes:
S11: the network randomly selects node as seed node, and the seed node generates a random number；
S12: the seed node counts the number of synchronization node in itself neighbor node, obtains seed statistics knot
Fruit；
S13: the seed node passes through building information formula according to the random number and the seed statistical result, with
To seed sample information, the seed sample information is saved in the message pool of itself by the seed node；
S14: the seed node randomly chooses the first synchronization node and the second synchronization node, institute from itself neighbor node
It states seed node and the seed sample information is transferred to first synchronization node and second synchronization node；
S15: first synchronization node receives the seed sample information and stores, and first synchronization node is to itself
The number of synchronization node described in neighbor node is counted, and obtains the first statistical result, first synchronization node is according to institute
It states seed sample information and first statistical result and the first sample information is constructed by newly building information formula, described second is same
It walks node and executes operation identical with first synchronization node, to construct the second sample information；
S16: first synchronization node and second synchronization node respectively choose two new synchronization nodes, the new synchronization
Node receives first sample information and second sample information, and executes the step S15, to construct new sampling letter
Breath；
S17: the seed node receives return information, estimates that formula calculates net by number of nodes according to the return information
Network node total number mesh estimated value.The beneficial effect is that: using the method for sampling estimation, it can quickly obtain network node total number
Estimated value.
In some embodiments of the present invention, ignore with the information with the identical random number that stored information, it is described with
Machine number is information flag.
In some embodiments of the present invention, the number of nodes estimation formula is N '=(N-Nc+d×m)/2+Nc, the N ' is
The network node total number estimated value, the N are initial network node total number, the NcFor section of knowing together in the network parameter
The total number of point, the d are the seed statistical result, and the m is the return information.
In some embodiments of the present invention, the return information that the seed node is received according to the 15th time leads to
Crossing the network node total number estimated value that the number of nodes estimation formula is calculated is usable levels.
In some embodiments of the present invention, current network total node number is estimated:
S11: the network randomly selects node as seed node, seed node Pi, the PiGenerate one at random
Number, the random number are r；
S12: the PiThe number of synchronization node in itself neighbor node is counted, seed statistical result, institute are obtained
Stating seed statistical result is di；
S13: the PiAccording to the r and diBuilding information architecture sample information was listened, the sample information is mR, i, described
PiBy mR, iIt is saved in the message pool of itself；
S14: the PiRandomly choose the first synchronization node and the second synchronization node from the neighbor node of itself, described
One synchronization node is Pj, second synchronization node is Py, the PiBy the mR, iIt is transferred to the PjWith the Py；
S15: the PiIt receives and stores the mR, i, the PjSynchronization node number in itself neighbor node is dj, described
PjAccording to the mR, iWith the djNew sample information is constructed by newly constructing information formula, the new sample information is mR, j,
The PyCarry out the PjIdentical operation；
S16: the PjWith the PyIt executes the step S14 and respectively chooses two new synchronization nodes, the new synchronization node is held
The row step S15 constructs new sample information；
S17: the PiReturn information is received, the return information is mr' .D, and according to mr' to pass through number of nodes estimation public by .D
Formula obtains network node total number estimated value, and network node total number estimated value is N '.
In some embodiments of the present invention, the mR, iIncluding mR, iAnd m .RR, i.D。
In some embodiments of the present invention, the building information formula is mR, iAnd m .R=rR, i.D=1/di。
In some embodiments of the present invention, the new building information formula is mR, iAnd m .R=rR, j.D=mr,i.D+1/dj,
The mR, i.D the value of position can be with the execution of the step S15 by the mr,j.D the value substitution of position, to calculate new
The mr,j.D the value of position.
In some embodiments of the present invention, the number of nodes estimation formula is N '=(N-Nc+di×mr’.D)/2+Nc。
In some specific embodiments of the present invention,
Wherein, initial network node total number is N, N=45；
The total number of common recognition node is N in network parameterc, Nc=20；
S11: the network randomly selects node as seed node, seed node Pi, the PiGenerate one at random
Number, the random number are r, r=2；
S12: the PiThe number of synchronization node in itself neighbor node is counted, seed statistical result is obtained,
The seed statistical result is di, di=30；
S13: the seed node is according to the r and the diSeed sample information is constructed by building information formula and is stored up
It deposits, the seed sample information is mR, i, the mR, iIncluding m2, iAnd m .R2, i.D, m2, i.R=2, m2, i.D=1/30.
S14: the PiRandomly choose the first synchronization node and the second synchronization node from the neighbor node of itself, described
One synchronization node is Pj, second synchronization node is Py, the PiBy the m2, iIt is transferred to the PjWith the Py；
S15: the PiIt receives and stores the m2, i, the PjSynchronization node number in itself neighbor node is dj, described
dj=50, the PjAccording to the m2, iWith the djNew sample information is constructed by newly constructing information formula, described new adopts
Sample information is m2, j, the m2, jIncluding m2, jAnd m .R2, j.D, m2, j.R=2, m2, j.D=1/30+1/50；
S16: the PjP is randomly choosed from the neighbor node of oneselfxAnd Pz, the PjDescribed in oneself message pool
m2, jIt is sent to randomly selected PxAnd Pz, the PyCarry out PjIdentical operation；
S17: the PxIt receives and stores the m2, j, the PxIt unites to the synchronization node number of the neighbor node of itself
Meter, the number of nodes of statistics are dx, dx=45, the PxAccording to the m2, jWith the dxBy newly constructing described in the building of information formula
m2, x, the m2, xIncluding m2, xAnd m .R2, x.D, m2, x.R=2, m2, x.D=1/30+1/50+1/45, the PxIt can repeat above-mentioned Pi、
PjDeng operation, the PzCarry out PxIdentical operation, until the PiReceive has the return information walked, the return at random
Information is m2', wherein the PiReturn information m can repeatedly be received2', wherein the PiThe 15th m received2' it is available
Value, the 15th m received2' it include m2, nAnd m .R2, n.D, m2, n.R=2, m2, n.D=
1/30+1/50+1/45+1/35+1/50+1/70+1/55+1/35+1/45+1/50+1/30+1/55+1/30+1/50
+1/45+1/35+1/50+1/70+1/55+1/35+1/45+1/30+1/50+1/45+1/35+1/50+1/70+1/55+1/35+
1/45+1/30+1/50+1/45+1/35+1/50+1/70+1/55+1/35+1/45,
M is calculated2, n.D=0.228688551778008,
Estimate that formula calculates network node total number estimated value by the number of nodes again,
N '=(N-Nc+di×mr’.D)/2+Nc=(45-20+30 × 0.228688551778008)
/ 2+20=32.84303282766701 ≈ 33, current network total node number are 33.
In some embodiments of the present invention, the initialization process are as follows: the new node reads all from configuration file
Seed node, and temporary link is established with all seed nodes, the new node obtains the neighbour of all seed nodes
Occupy node listing；All seed nodes estimate the total node number, obtain the n network node sum visual estimations
Calculation value calculates the average value of the n network node total number estimated values；Neighbour of the new node from all seed nodes
It occupies and randomly chooses m node in node as by selection node, the seed node obtains all neighbours by selection node
Occupy node listing；The new node is arranged from described by the neighbours of the neighboring node list information of selection node and the seed node
Node is randomly choosed in table information constructs new neighbor node listing；Node in the new node and the new neighbor node listing
Application establishes the link, to complete the initialization process.
In some embodiments of the present invention, the m is 2 × lnNi, the NiFor the n network node total number estimations
The average value of value.
In some embodiments of the present invention, the neighboring node list is Ngbi, Ngbi={ Ac, As, Sc, Sc,
Wherein, AcThe information of the middle active neighbours common recognition node saved in neighbours, each active neighbours common recognition node
Information include the total key of the node of actively knowing together, the key altogether is the ID of the node of actively knowing together；The active common recognition
The network information of node, the network information include: the port IP/；With the linking status of the node of actively knowing together, the link
State includes: active link [HTML] state, half active link [HTML] state, half alternate links state and alternate links state；The active is total
Know the set for the information that node is received.
AsThe middle information for saving active neighbours' synchronization node in neighbours, the information of each active neighbours synchronization node
With the Ac；
ScThe information of the middle passive neighbours common recognition node saved in neighbours, the information of each passive neighbours' common recognition node
With the Ac；
SsThe middle information for saving passive neighbours' synchronization node in neighbours, the information of each dynamic neighbours' synchronization node are same
The Ac。
In some embodiments of the present invention, the link detection includes: detection node to neighbor node transmission information, and is led to
It crosses transmission control protocol and judges whether the neighbor node receives the information.
In some embodiments of the present invention, the link fails processing includes: the active neighbours for judging the detection node
Node does not receive the information, then selects node from the passive neighbor node of the detection node at random, and be transferred to institute
It states in the link pond of the active neighbor node of detection node.
In some embodiments of the present invention, the link fails processing includes: the passive neighbours for judging the detection node
Node does not receive the information, then deletes the passive neighbor node from link pond.
In some embodiments of the present invention, when the passive neighbor node number of the detection node is less than the network parameter
Defined in interstitial content 2/3, then the initialization process carried out to the neighbor node of detection node link pond, and from
Node is randomly choosed in the network to be added in the link pond of the passive neighbor node.
In some embodiments of the present invention, the common recognition hand-off process are as follows: by the chain of the active neighbor node of destination node
In the link set for the active neighbor node that the neighbor node for connecing the period of newly knowing together in pond moves to the destination node；By target section
The neighbor node in period of newly knowing together in the link pond of the passive neighbor node of point moves to the passive neighbor node of the destination node
Link set in.
In some embodiments of the present invention, when the number of links of the active neighbor node is defined greater than the network parameter
Number, then by it is described it is new common recognition the period neighbor node move in the link set of passive neighbor node；As the passive neighbour
The number of links for occupying node is greater than the number that the network parameter defines, then disconnects the link of the new common recognition periodic knot.
In some embodiments of the present invention, when the number of links of the passive neighbor node is defined less than the network parameter
The 2/3 of number then carries out initialization process to the neighbor node, and it is described passive to select node to be added to from the network
In the link pond of neighbor node.
In some fact Examples of the invention, the common recognition hand-off process includes the processing of active neighbor node, passive neighbours section
Point processing and the processing of passive neighbor node number deficiency.
The active neighbor node processing specifically: active neighbor node is linked in pond and newly known together the period by destination node
The link of common recognition neighbor node, moves in the link set for neighbor node of actively knowing together；The destination node saves active neighbours
Point links the link of the synchronization neighbor node in period of newly knowing together in pond, moves in the link set of active synchronization neighbor node；If
The number of links of active neighbor node is more than interstitial content defined in the network parameter, and the destination node is then by the master
The link of dynamic neighbor node moves in the link set of corresponding passive neighbor node.
The passive neighbor node processing specifically: passive neighbor node is linked week of newly knowing together in pond by the destination node
The link of the common recognition neighbor node of phase moves in the link set of passive common recognition neighbor node；The destination node will be passive adjacent
The link for occupying the synchronization neighbor node in period of newly knowing together in node link pond moves to the link set of passive and synchronous neighbor node
In；If the number of links of the passive neighbor node of the destination node is more than interstitial content defined in parameter, break link.
The passive neighbor node number deficiency processing specifically: the passive neighbor node number of links of the destination node is few
2/3 of the interstitial content defined in the network parameter, the destination node then carry out the initialization process to link pond,
The neighboring node list information for reading neighbor node, randomly chooses node from the neighboring node list information of the neighbor node
As its passive neighbor node.
In some embodiments of the present invention, there is the network common recognition operation node to receive new link request, operation node
Receive client-side information broadcast request, operation node receives active broadcast information and operation node receives passive broadcast message.
In some embodiments of the present invention, the operation node receives new link request specifically: the operation node is received
To the linking request of new node, the requesting node completion that linking request is received in the new node and the operation node is shaken hands,
And it is exchanged with each other nodal information；Whether the requesting node is vacant to the standby neighbor list of itself to be detected, and is located
Reason.
It, then will be described new when the standby neighbor list of the requesting node is vacant in some embodiments of the present invention
Node is added in the standby neighbor list.
In some embodiments of the present invention, when the standby neighbor list of the requesting node do not have it is vacant, then it is described
Node in standby neighbor list described in requesting node random replacement.
It, will when node in the standby neighbor list is to link with common recognition node in some embodiments of the present invention
The requesting node is substituted into neighbours' common recognition node listing.
It, will when the node in the standby neighbor list is to link with synchronization node in some fact Examples of the invention
The requesting node is substituted into neighbours' synchronization node list.
In some specific embodiments of the present invention, the operation node receives new link request specifically: the operation section
Point receives the linking request of new node, and the operation node is Pa, the new node is Pb, the PbWith the PaCompletion is shaken hands,
And it is exchanged with each other nodal information；The PaIt is whether vacant to the standby neighbor list of itself to detect；If the PaSpare neighbour
It is vacant to occupy list, the PaStandby neighbor list be { Pa1, Pa2, Pa3, Pa4, Pa5, by the PbIt is added to the PaIt is spare
{ P in neighbor lista1, Pa2, Pa3, Pa4, Pa5, Pb}；If the PaStandby neighbor list there is no vacant, the PaSpare neighbour
Occupying list is { Pa1, Pa2, Pa3, Pa4, Pa5, Pa6, the PbThen P described in random replacementaStandby neighbor list in one section
Point, the replaced PaStandby neighbor list be { Pa1, Pa2, Pa3, Pb, Pa5, Pa6}。
In some embodiments of the present invention, the operation node receives client-side information broadcast request specifically: the fortune
Row node receives and stores the information broadcast request of client；The operation node starts the first timer and the second timer,
The record time of first timer is the initiative information broadcast delays time, and the record time of second timer is passive
The information broadcast delays time；If the record time of first timer is greater than the first parameter preset value, the operation node
Active broadcast information is constructed, and the active broadcast information is transferred to all active neighbor nodes, if first timer
The record time be less than or equal to the first parameter preset value, then be not processed, the first parameter preset value be 0.2S；If institute
The record time for stating the second timer is greater than the second parameter preset value, and the operation node, which then passes through, passively broadcasts to passive neighbours
The cryptographic Hash of the information of the information broadcast request transmission of client described in node-node transmission, if the record time of the timer is less than
It equal to the second parameter preset value, is then not processed, the second parameter preset value is 5S.
In some embodiments of the present invention, node link state conversion specifically: it is spare that passive linking status is upgraded to half
Linking status, the half alternate links state are upgraded to active link [HTML] state；The active link [HTML] state is downgraded to half drive chain
State is connect, the half active link [HTML] state is downgraded to the passive linking status.
In some embodiments of the present invention, the operation node receives active broadcast information specifically: the operation node
Receive the message pool that itself is detected after the active broadcast information；The operation node judge the active broadcast information whether be
New information；If active broadcast information described in the operation nodal test is new information, the operation node is wide by the active
Information preservation is broadcast into the message pool of itself, and starts the first timer, the record time of first timer is actively to believe
Cease the broadcast delays time；If the record time of first timer is greater than the first parameter preset value, the operation node structure
Active broadcast information is built, the new information in the message pool is transferred in active neighbor node, if first timing
The record time of device is less than or equal to the first parameter preset value, then is not processed, and the first parameter preset value is 0.2S；If
The record time of first timer is greater than the first parameter preset value, then improves the network linking state of the operation node,
If the linking status of the operation node is upgraded to the active link [HTML] state, and active link [HTML] pond has been expired, then randomly chooses institute
The link for stating half active link [HTML] state is downgraded to the passive linking status, is otherwise not processed；If the operation nodal test
The active broadcast information is duplicate message, then reduces the network linking state of the operation node, if the operation node
Linking status is downgraded to the alternate links state, and the number of links in the alternate links pond of the operation node is more than described
The number of links that network parameter defines then disconnects an alternate links at random.
In some embodiments of the present invention, the operation node receives passive broadcast message specifically: the operation node
Receive passive broadcast message；Judge the cryptographic Hash that whether there is passive broadcast message in the message pool of the operation node；If institute
The cryptographic Hash for stating the existing passive broadcast message in the message pool of operation node, then ignore the passive broadcast message；If
There is no the cryptographic Hash of the passive broadcast message in the message pool of the operation node, then saves the passive broadcast letter
Breath, and improve the Hyperlink rank of the operation node；If the linking status of the operation node has been increased to the drive chain
State is connect, then judges whether the number of links in the active link [HTML] pond of the operation node is more than chain that the network parameter schedules
Connect number；If the number of links in the active link [HTML] pond of the operation node is more than the number of links that the network parameter defines,
The node for then randomly choosing a half active link [HTML] state moves in the passive link pond of the operation node, does not otherwise do
Processing；If the linking status of the operation node is not increased to the active link [HTML] state, it is not processed.
Although embodiments of the present invention are hereinbefore described in detail, show for those skilled in the art
And be clear to, these embodiments can be carry out various modifications and be changed.However, it is understood that this modifications and variations are all
Belong within scope and spirit of the present invention described in the claims.Moreover, the present invention described herein can have others
Embodiment, and can be practiced or carried out in several ways.
Claims (17)
1. a kind of network information transfer processing method characterized by comprising network adaptability regulating step, network common recognition step
Rapid and Its Fault Tolerance processing step；
The network adaptability regulating step includes: to be estimated by sampling estimation the total node number of network, obtains network
Then node total number mesh estimated value carries out adaptive processes to network parameter according to the network node total number estimated value, and
Initialization process is carried out to the link pond of neighbor node in new node starting；
Network common recognition step includes: the information transmission mode progress network common recognition by active broadcast and passively broadcasted, and
Common recognition processing is carried out to node according to the information transmission mode and request source；
The Its Fault Tolerance processing step includes: to carry out chain to linking status by the active broadcast and the passive broadcast
Detection is connect, link fails processing is carried out to interdependent node after judging information transmission failure, the type in pond is linked according to neighbor node
Common recognition hand-off process is carried out to node.
2. network information transfer processing method according to claim 1, it is characterised in that: the neighbor node includes actively
Neighbor node and passive neighbor node.
3. network information transfer processing method according to claim 1 or 2, it is characterised in that: the active broadcast is to appoint
After one node receives information, the information is transmitted to the active neighbor node.
4. network information transfer processing method according to claim 1 or 2, it is characterised in that: described passively to broadcast as appointing
After one node receives information, the information, the passive neighbor node pair periodically are transmitted to the passive neighbor node
It is detected and judges whether to save the information in own message pond.
5. network information transfer processing method according to claim 1, which is characterized in that the sampling, which is estimated, includes:
S11: the network randomly selects node as seed node, and the seed node generates a random number；
S12: the seed node counts the number of synchronization node in itself neighbor node, obtains seed statistical result；
S13: the seed node passes through building information formula according to the random number and the seed statistical result, to be planted
The seed sample information is saved in the message pool of itself by sub-sampling information, the seed node；
S14: the seed node randomly chooses the first synchronization node and the second synchronization node from itself neighbor node, and described kind
The seed sample information is transferred to first synchronization node and second synchronization node by child node；
S15: first synchronization node receives the seed sample information and stores, and first synchronization node is to itself neighbour
The number of synchronization node described in node is counted, and obtains the first statistical result, first synchronization node is according to described kind
Sub-sampling information and first statistical result pass through newly the first sample information of building information formula building, the described second synchronous section
Point executes operation identical with first synchronization node, to construct the second sample information；
S16: first synchronization node and second synchronization node respectively choose two new synchronization nodes, the new synchronization node
First sample information and second sample information are received, and executes the step S15, to construct new sample information；
S17: the seed node receives return information, estimates that formula calculates network section by number of nodes according to the return information
Point total number estimated value.
6. network information transfer processing method according to claim 5, it is characterised in that: ignore and stored information and have
The information of the identical random number, the random number are information flag.
7. network information transfer processing method according to claim 1 or 5, it is characterised in that: the number of nodes estimation is public
Formula is N '=(N-Nc+d×m)/2+Nc, the N ' is the network node total number estimated value, and the N is initial network node
Sum, the NcFor the total number for node of knowing together in the network parameter, the d is the seed statistical result, and the m is institute
State return information.
8. network information transfer processing method according to claim 5, it is characterised in that: the seed node is according to the tenth
Five return informations received estimate the network node sum visual estimation that formula is calculated by the number of nodes
Calculation value is usable levels.
9. network information transfer processing method according to claim 1, which is characterized in that the initialization process includes:
The new node reads all seed nodes from configuration file, and establishes temporary link with all seed nodes,
The new node obtains the neighboring node list of all seed nodes；
All seed nodes estimate the total node number, obtain the n network node total number estimated values, meter
Calculate the average value of the n network node total number estimated values；
The new node randomly chooses m node from the neighbor node of all seed nodes and is used as by selection node, institute
It states seed node and obtains all neighboring node lists by selection node；
The new node is from the neighbor list information by the neighboring node list information of selection node and the seed node
Middle random selection node constructs new neighbor node listing；
The new node is established the link with the node application in the new neighbor node listing, to complete the initialization process.
10. network information transfer processing method according to claim 9, it is characterised in that: the m is 2 × lnNi, described
NiFor the average value of the n network node total number estimated values.
11. network information transfer processing method according to claim 1, which is characterized in that the link detection includes: inspection
It surveys node and transmits information to neighbor node, and judge whether the neighbor node receives the information by transmission control protocol.
12. according to claim 1 or network information transfer processing method described in 11, which is characterized in that at the link fails
Reason includes: to judge that the active neighbor node of the detection node does not receive the information, then at random from the detection node
Node is selected in passive neighbor node, and is transferred in the link pond of the active neighbor node of the detection node.
13. according to claim 1 or network node transmissions processing method described in 11, which is characterized in that at the link fails
Reason includes: to judge that the passive neighbor node of the detection node does not receive the information, then by the passive neighbor node from
Link is deleted in pond.
14. according to claim 1 or network node transmissions processing method described in 13, it is characterised in that: when the detection node
2/3 of passive neighbor node number less than interstitial content defined in the network parameter, then to the neighbour of the detection node
It occupies node link pond and carries out the initialization process, and randomly choose node from the network and be added to passive neighbours' section
In the link pond of point.
15. network information transfer processing method according to claim 1, which is characterized in that the common recognition hand-off process packet
It includes:
The neighbor node in period of newly knowing together in the link pond of the active neighbor node of destination node is moved into the destination node
In the link set of active neighbor node；
The neighbor node in period of newly knowing together in the link pond of the passive neighbor node of destination node is moved into the destination node
In the link set of passive neighbor node.
16. according to claim 1 or network information transfer processing method described in 15, it is characterised in that:
When the number of links of the active neighbor node is greater than the number that the network parameter defines, then by the new common recognition period
Neighbor node move in the link set of passive neighbor node；
When the number of links of the passive neighbor node is greater than the number that the network parameter defines, then by the new common recognition period
The link of node disconnects.
17. according to claim 1 or network information transfer processing method described in 15, it is characterised in that: as the passive neighbours
The number of links of node is less than the network parameter and defines the 2/3 of number, then carries out initialization process to the neighbor node, and
Node is selected to be added in the link pond of the passive neighbor node from the network.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811496088.5A CN109451039B (en) | 2018-12-07 | 2018-12-07 | Network information transmission processing method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811496088.5A CN109451039B (en) | 2018-12-07 | 2018-12-07 | Network information transmission processing method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109451039A true CN109451039A (en) | 2019-03-08 |
| CN109451039B CN109451039B (en) | 2021-06-04 |
Family
ID=65558384
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201811496088.5A Active CN109451039B (en) | 2018-12-07 | 2018-12-07 | Network information transmission processing method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109451039B (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111432011A (en) * | 2020-03-30 | 2020-07-17 | 百度国际科技（深圳）有限公司 | Block chain network communication method and equipment |
| CN111740915A (en) * | 2020-08-05 | 2020-10-02 | 百度在线网络技术（北京）有限公司 | Neighbor node determination method, device, equipment and storage medium |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1874284A (en) * | 2006-06-21 | 2006-12-06 | 中国科学院计算技术研究所 | Distributed type clustering method in use for constructing cluster type peer-to-peer network |
| US20170017936A1 (en) * | 2015-07-14 | 2017-01-19 | Fmr Llc | Point-to-Point Transaction Guidance Apparatuses, Methods and Systems |
| CN106789095A (en) * | 2017-03-30 | 2017-05-31 | 腾讯科技（深圳）有限公司 | Distributed system and message treatment method |
| CN107579848A (en) * | 2017-08-30 | 2018-01-12 | 上海保险交易所股份有限公司 | The method that common recognition node is dynamically changed in practical Byzantine failure tolerance common recognition mechanism |
| CN108616596A (en) * | 2018-05-09 | 2018-10-02 | 南京邮电大学 | It is adaptively known together method based on the block chain that dynamic authorization and network environment perceive |
| CN108776929A (en) * | 2018-04-02 | 2018-11-09 | 成都云创智融科技有限公司 | Bill processing method, system based on block chain database and readable storage medium storing program for executing |
-
2018
- 2018-12-07 CN CN201811496088.5A patent/CN109451039B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1874284A (en) * | 2006-06-21 | 2006-12-06 | 中国科学院计算技术研究所 | Distributed type clustering method in use for constructing cluster type peer-to-peer network |
| US20170017936A1 (en) * | 2015-07-14 | 2017-01-19 | Fmr Llc | Point-to-Point Transaction Guidance Apparatuses, Methods and Systems |
| CN106789095A (en) * | 2017-03-30 | 2017-05-31 | 腾讯科技（深圳）有限公司 | Distributed system and message treatment method |
| CN107579848A (en) * | 2017-08-30 | 2018-01-12 | 上海保险交易所股份有限公司 | The method that common recognition node is dynamically changed in practical Byzantine failure tolerance common recognition mechanism |
| CN108776929A (en) * | 2018-04-02 | 2018-11-09 | 成都云创智融科技有限公司 | Bill processing method, system based on block chain database and readable storage medium storing program for executing |
| CN108616596A (en) * | 2018-05-09 | 2018-10-02 | 南京邮电大学 | It is adaptively known together method based on the block chain that dynamic authorization and network environment perceive |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111432011A (en) * | 2020-03-30 | 2020-07-17 | 百度国际科技（深圳）有限公司 | Block chain network communication method and equipment |
| CN111432011B (en) * | 2020-03-30 | 2023-02-17 | 百度国际科技（深圳）有限公司 | Block chain network communication method and equipment |
| CN111740915A (en) * | 2020-08-05 | 2020-10-02 | 百度在线网络技术（北京）有限公司 | Neighbor node determination method, device, equipment and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109451039B (en) | 2021-06-04 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Chithaluru et al. | AREOR–Adaptive ranking based energy efficient opportunistic routing scheme in Wireless Sensor Network | |
| Liao et al. | Anysee: Peer-to-peer live streaming | |
| Helder et al. | End-host multicast communication using switch-trees protocols | |
| CN109451039A (en) | A kind of network information transfer processing method | |
| Levin et al. | Fair File Swarming with FOX. | |
| Sidik et al. | PALE: Time bounded practical agile leader election | |
| Tootaghaj et al. | Game-theoretic approach to mitigate packet dropping in wireless ad-hoc networks | |
| CN108616380A (en) | The tree network restoration methods and controller of software defined network | |
| US20080212617A1 (en) | System and method for synchronization of time sensitive user events in a network | |
| Guo et al. | P2Cast: peer-to-peer patching for video on demand service | |
| Vogel et al. | Priority-based distribution trees for application-level multicast | |
| Tian et al. | Improving stability for peer-to-peer multicast overlays by active measurements | |
| Zhang et al. | Treeclimber: A network-driven push-pull hybrid scheme for peer-to-peer video live streaming | |
| Tian et al. | Improving reliability for application-layer multicast overlays | |
| Yuan et al. | Drip: A dynamic voronoi regions-based publish/subscribe protocol in mobile networks | |
| Alkubeily et al. | A new Application-Level Multicast technique for stable, robust and efficient overlay tree construction | |
| Li et al. | QoS-aware streaming in overlay multicast considering the selfishness in construction action | |
| Oliveira et al. | Improving peer neighborhood on P2P video distribution networks using Push/Pull protocol | |
| Jeon et al. | Overlay multicast tree recovery scheme using a proactive approach | |
| Nguyen et al. | RBCS: A resilient backbone construction scheme for hybrid Peer-To-Peer streaming | |
| Li et al. | An efficient broadcast algorithm in distributed hash table under churn | |
| Yang et al. | Cooperative failure detection in overlay multicast | |
| Lu et al. | Towards limited scale-free topology with dynamic peer participation | |
| Gu et al. | Peertalk: a peer-to-peer multiparty voice-over-ip system | |
| Veglia et al. | Performance evaluation of P2P-TV diffusion algorithms under realistic settings |
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 |