CN106060114B - A kind of resource share method and device - Google Patents
A kind of resource share method and device Download PDFInfo
- Publication number
- CN106060114B CN106060114B CN201610307456.1A CN201610307456A CN106060114B CN 106060114 B CN106060114 B CN 106060114B CN 201610307456 A CN201610307456 A CN 201610307456A CN 106060114 B CN106060114 B CN 106060114B
- Authority
- CN
- China
- Prior art keywords
- node
- contributed
- resource
- time
- requesting
- 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
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
- H04L67/104—Peer-to-peer [P2P] networks
- H04L67/1074—Peer-to-peer [P2P] networks for supporting data block transmission mechanisms
- H04L67/1078—Resource delivery mechanisms
-
- 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
- H04L67/104—Peer-to-peer [P2P] networks
- H04L67/1044—Group management mechanisms
- H04L67/1053—Group management mechanisms with pre-configuration of logical or physical connections with a determined number of other peers
- H04L67/1057—Group management mechanisms with pre-configuration of logical or physical connections with a determined number of other peers involving pre-assessment of levels of reputation of peers
-
- 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
- H04L67/104—Peer-to-peer [P2P] networks
- H04L67/1074—Peer-to-peer [P2P] networks for supporting data block transmission mechanisms
- H04L67/1078—Resource delivery mechanisms
- H04L67/1082—Resource delivery mechanisms involving incentive schemes
-
- 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/50—Network services
- H04L67/55—Push-based network services
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Physics & Mathematics (AREA)
- Computing Systems (AREA)
- Mathematical Physics (AREA)
- Theoretical Computer Science (AREA)
- Computer And Data Communications (AREA)
Abstract
The embodiment of the invention provides a kind of resource share method and devices, are applied to server, instruct whether corresponding time point is in front of the corresponding Penalty time cut off of requesting node by judging that requesting node sends resource request；If not, determining node to be contributed；If being not received by node to be contributed within a preset period of time for the response instruction of inquiry instruction feedback, calculates and be directed to the corresponding Penalty time of node to be contributed；According to Penalty time and current point in time determination and the corresponding Penalty time cut off of node to be contributed is stored, and the resource high in the forward direction of Penalty time point node push resource price to be contributed, reduces the corresponding Penalty time cut off of node to be contributed.Using the embodiment of the present invention, by the way that being unwilling, contributing the node of resource to make punishes and be only capable of the high resource of downloading resource price, Lai Jili node increases the available resources quantity in P2P network to other nodes sharing resources.
Description
Technical field
The present invention relates to wireless communication technology field, in particular to a kind of resource share method and device.
Background technique
In recent years, with the fast development of network infrastructure gradually established with wireless communication technique, it is desirable to more
Extensive to participate in the shared of radio resource, therefore, peer-to-peer network also grows up therewith, so-called peer-to-peer network (Peer to
Peer Networking, abbreviation P2P network), each of P2P network node can both provide resource, service and content,
Available resource, service and content again, blunt point says to be exactly to cancel intermediate link, so that Internet resources are more directly real
It now shares and interactive, improves resource utilization.
Under normal conditions, the node in P2P network all has certain selfishness, it is always desirable to as much as possible from P2P
Resource is obtained in network, and is unwilling to contribute resource, and therefore, the available resources quantity in P2P network is fewer and fewer.
Currently, existing P2P technology usually only contributes the node of resource to reward in P2P network, there are no to not
Be ready that the node for contributing resource makes punishment, cannot by motivated to being unwilling to contribute the node of resource to make punishment node to
Other nodes sharing resources.
Summary of the invention
The embodiment of the present invention is designed to provide a kind of resource share method and device, to motivate node to other nodes
Shared resource, and then increase the available resources quantity in P2P network.
In order to achieve the above object, the embodiment of the invention provides a kind of resource share methods, are applied to server, described
Resource identification information Penalty time cut off corresponding with the corresponding relationship of node and node, institute are previously stored in server
The method of stating includes:
The resource request instruction that requesting node is sent is received, includes at least the requesting node in the resource request instruction
The identification information of the identification information of the target resource of request and the requesting node；
According to the corresponding Penalty time cut off of the requesting node, judge that the requesting node sends resource request instruction
Whether corresponding time point is in front of the corresponding Penalty time cut off of the requesting node；
If not, according to the identification information of the target resource, the corresponding relationship and the corresponding punishment of the node
Time cut off determines node to be contributed；
It sends to the node to be contributed for inquiring whether the node to be contributed is ready to provide to the requesting node
The inquiry of the target resource instructs；
Whether judgement receives the node to be contributed for the response of the inquiry instruction feedback within a preset period of time
Instruction, wherein if being not received by node to be contributed the answering for the inquiry instruction feedback within a preset period of time
Instruction is answered, indicates that the node to be contributed is reluctant that requesting node described in intention provides the target resource；
If do not received, determine that the node to be contributed does not feed back the number of response instruction continuously；
According to the number, calculates and be directed to the corresponding Penalty time of the node to be contributed；
According to the Penalty time and current time, determines and store the corresponding Penalty time of the node to be contributed and cut
Stop, and the high resource of node push resource price to be contributed described in the forward direction of the Penalty time point, with reduce it is described to
Contribute the corresponding Penalty time cut off of node.
Optionally, the response for receiving the node to be contributed within a preset period of time for the inquiry instruction feedback refers to
It enables and includes described in response instruction wait contribute in node in the case where the corresponding network address of target resource, the side
Method further include:
The network address is sent to the requesting node, so that the requesting node is according to the network address from institute
It states and obtains the target resource in node wait contribute.
Optionally, the credit value of node is also stored in the server, the method also includes:
Receive the requesting node send described in node to be contributed shared the target resource message feelings
Under condition, rule is changed according to default credit value, changes the credit value of the requesting node and the node to be contributed.
Optionally, the basis presets credit value and changes rule, changes the requesting node and the node to be contributed
Credit value, comprising:
The credit value of the requesting node is reduced into C-, whereinIn formula, A
Coefficient is reduced to be default, K is resource base price, NA(m, t) is unit interval of the target resource m before current time t
Interior requested number, NE(m, t) is the number of nodes that current time t contains target resource m；
The credit value of the node to be contributed is increased into C+, whereinIn formula, K is resource base price, riFor the node i to be contributed
Shared resource number, NA(m, t) is target resource m requested number, N in the unit interval before current time tE(m,
T) contain the number of nodes of target resource m for current time t.
Optionally, the requesting node are as follows:
Credit value is not less than the node of preset threshold.
Optionally, described according to the number, it calculates and is directed to the corresponding Penalty time of the node to be contributed, comprising:
According to formula: Penalty time=preset time * bn, calculate and be directed to the corresponding Penalty time of the node to be contributed；
Wherein, b > 1, n are the number that the node to be contributed does not feed back response instruction continuously.
In order to achieve the above object, the embodiment of the invention provides a kind of resource shared devices, are applied to server, described
Device includes:
Memory module is cut for storage resource identification information Penalty time corresponding with the corresponding relationship of node and node
Stop；
Receiving module at least wraps in the resource request instruction for receiving the resource request instruction of requesting node transmission
The identification information of the target resource of the request containing the requesting node and the identification information of the requesting node；
First judgment module, for judging the request section according to the corresponding Penalty time cut off of the requesting node
Point sends resource request and instructs whether corresponding time point is in front of the corresponding Penalty time cut off of the requesting node；
First determining module, for judging that the requesting node transmission resource request instruction corresponding time point is not at
When before the corresponding Penalty time cut off of the requesting node, according to the identification information of the target resource, described corresponding close
System and the corresponding Penalty time cut off of the node determine node to be contributed；
Module is inquired, for sending to the node to be contributed for inquiring whether the node to be contributed is ready to described
Requesting node provides the inquiry instruction of the target resource；
Second judgment module, for judging whether to receive the node to be contributed within a preset period of time for the inquiry
Ask the response instruction of instruction feedback, wherein if being not received by the node to be contributed within a preset period of time for described
The response instruction for inquiring instruction feedback indicates that the node to be contributed is reluctant that requesting node described in intention provides the target money
Source；
Second determining module when for being not received by response instruction within a preset period of time, determines described to tribute
Offer the number that node does not feed back response instruction continuously；
Computing module is directed to the corresponding Penalty time of the node to be contributed for calculating according to the number；
Third determining module, for according to the Penalty time and current time, determining and storing described wait contribute section
The corresponding Penalty time cut off of point, and the node push resource price to be contributed described in the forward direction of the Penalty time point is high
Resource, to reduce the corresponding Penalty time cut off of the node to be contributed.
Optionally, the response for receiving the node to be contributed within a preset period of time for the inquiry instruction feedback refers to
It enables and includes described in response instruction wait contribute in node in the case where the corresponding network address of target resource, the dress
It sets further include:
Sending module, for the network address to be sent to the requesting node, so that the requesting node is according to institute
It states network address and obtains the target resource in node wait contribute from described.
Optionally, the credit value of node, described device are also stored in the server further include:
Credit value changes module, for receive the requesting node send described in described in node to be contributed share
In the case where the message of target resource, rule is changed according to default credit value, changes the requesting node and described wait contribute section
The credit value of point.
Optionally, the credit value changes module, is specifically used for:
Receive the requesting node send described in node to be contributed shared the target resource message feelings
Under condition, the credit value of the requesting node is reduced into C-, whereinIn formula, A is pre-
If reducing coefficient, K is resource base price, NA(m, t) is target resource m quilt in the unit interval before current time t
The number of request, NE(m, t) is the number of nodes that current time t contains target resource m；
The credit value of the node to be contributed is increased into C+, wherein
In formula, K is resource base price, riFor the shared resource number of the node i to be contributed, NA(m, t) is that target resource m is working as
Requested number in unit interval before preceding moment t, NE(m, t) is the number of nodes that current time t contains target resource m
Amount.
Optionally, the requesting node are as follows:
Credit value is not less than the node of preset threshold.
Optionally, the computing module, is specifically used for:
According to formula: Penalty time=preset time * bn, calculate and be directed to the corresponding Penalty time of the node to be contributed；
Wherein, b > 1, n are the number that the node to be contributed does not feed back response instruction continuously.
The embodiment of the invention provides a kind of resource share method and devices, are applied to server, by receiving request section
The resource request instruction that point is sent judges that requesting node sends resource request and instructs whether corresponding time point is in requesting node
Before corresponding Penalty time cut off；If not, the identification information, corresponding relationship and node according to target resource are corresponding
Penalty time cut off determines node to be contributed, and sends inquiry instruction to node to be contributed；Judgement within a preset period of time whether
Node to be contributed is received for the response instruction of inquiry instruction feedback, if do not received, determines node to be contributed continuously not
The number for feeding back response instruction calculates further according to number and is directed to the corresponding Penalty time of node to be contributed；According to Penalty time with
And current time, it determines and stores the corresponding Penalty time cut off of node to be contributed, and wait for tribute in the forward direction of Penalty time point
The high resource of node push resource price is offered, to reduce the corresponding Penalty time cut off of node to be contributed.Using of the invention real
Example is applied, by the way that contributing the node of resource to make punishes and be only capable of the high resource of downloading resource price, Lai Jili node to being unwilling
To other nodes sharing resources, and then increase the available resources quantity in P2P network.
Detailed description of the invention
In order to more clearly explain the embodiment of the invention or the technical proposal in the existing technology, to embodiment or will show below
There is attached drawing needed in technical description to be briefly described, it should be apparent that, the accompanying drawings in the following description is only this
Some embodiments of invention for those of ordinary skill in the art without creative efforts, can be with
It obtains other drawings based on these drawings.
Fig. 1 is a kind of flow diagram of resource share method provided in an embodiment of the present invention；
Fig. 2 is the flow diagram of another resource share method provided in an embodiment of the present invention；
Fig. 3 is the flow diagram of another resource share method provided in an embodiment of the present invention；
Fig. 4 is provided in an embodiment of the present invention in different parameters lower node contribution coefficient and node contribution number of resources number
Variation relation schematic diagram；
Fig. 5 is a kind of structural schematic diagram of resource shared device provided in an embodiment of the present invention；
Fig. 6 is the structural schematic diagram of another resource shared device provided in an embodiment of the present invention；
Fig. 7 is the structural schematic diagram of another resource shared device provided in an embodiment of the present invention.
Specific embodiment
Below in conjunction with the embodiment of the present invention, technical scheme in the embodiment of the invention is clearly and completely described,
Obviously, described embodiments are only a part of the embodiments of the present invention, instead of all the embodiments.Based in the present invention
Embodiment, every other embodiment obtained by those of ordinary skill in the art without making creative efforts, all
Belong to the scope of protection of the invention.
Below by specific embodiment, the embodiment of the present invention is described in detail.
Fig. 1 is a kind of flow diagram of resource share method provided in an embodiment of the present invention；The method can be applied
Resource identification information punishment corresponding with the corresponding relationship of node and node is previously stored in server, the server
Time cut off, the method may include steps:
S101: the resource request instruction that requesting node is sent is received, includes at least described ask in the resource request instruction
The identification information for the target resource for asking node to request and the identification information of the requesting node；
It will be appreciated by persons skilled in the art that so-called P2P network, i.e. peer-to-peer network, are one kind in fellow
(Peer) the Distributed Application framework that task and workload are distributed between, is one kind that P2P computing model is formed in application layer
Networking or latticed form.Therefore, peer-to-peer network (Peer-to-peer networking) or P2P computing be can be described as from literal
(Peer-to-peer computing), can be with is defined as: the participant of network shares a part of hardware that they are possessed
Resource (processing capacity, storage capacity, network-connectivity, printer etc.), these shared resources by network offering services and
Content can directly be accessed by other peer nodes (Peer) without being subjected to intermediate entities.Participant in this network is both
The supplier (Server) of resource, service and content, and be that resource, service and content obtain taker (Client).
In P2P network environment, all in the status of equity between the multiple stage computers that are connected to each other, each computer has
Identical function, no master-slave.Each computer in network can serve as network service requestor and other meters
The request of calculation machine responds, and provides resource, service and content.These usual resources and service include: the shared of information and hand over
It changes, computing resource (such as CPU computing capability is shared), storage shared (such as the use of caching and disk space), network share, printing
Machine is shared etc..
For any one node in P2P network, resource request instruction, commonly referred to as transmission resource can be sent
The corresponding node of request instruction is requesting node, for resource request instruction, includes at least request in resource request instruction
The identification information of the target resource of node request and the identification information of the requesting node；It is understood that in P2P network
In, each resource will correspond to an identification information, for example, resource A, resource B, resource C, resource D, resource E are respectively corresponded
Identification information is zy10000001, zy10000010, zy10000011, zy10000100, zy10000101；Likewise, for
For node in P2P network, each node also corresponds to an identification information, and identification information can be the corresponding link of node
Address, for example, node 1, node 2, node 3 and node 4 respectively correspond identification information be 192.168.1.101,
192.168.1.102,192.168.1.103 and 192.168.1.104；Certainly, it above are only provided in an embodiment of the present invention one
The example of kind specific resource identification information and node identification information, the application do not believe resource identification information and node identification
The form of expression of breath, which is done, clearly to be limited, as long as being able to achieve one-to-one relationship.
Requesting node sends resource request and instructs to server, and server receives the resource request that requesting node is sent and refers to
It enables, for example, the received resource request instruction of server is the request to target resource C that requesting node 2 issues, then asking at this time
It asks to include at least in instruction and has the corresponding mark letter of 2 corresponding identification information 192.168.1.102 and target resource C of requesting node
Cease zy10000011.It should be noted that the embodiment of the present invention does not do further limit to requesting node and requested resource
It is fixed.
S102: judge that the requesting node sends resource request and instructs whether corresponding time point is in the requesting node
Before corresponding Penalty time cut off；If not, executing step S103.
It is worth noting that being stored with a Penalty time cut off corresponding with P2P nodes in the server
Table, i.e., each node will correspond to a Penalty time cut off in P2P network, understandable to be, according to requesting node pair
The Penalty time cut off answered judges, if current point in time is in front of the corresponding Penalty time cut off of the node, then
Illustrate that the node is receiving punishment, at this point, the node, which is issued resource request instruction, will cannot get the response of server.Cause
This, server needs to judge that requesting node sends resource request and instructs whether corresponding time point is in this stored in server
Before the corresponding Penalty time cut off of requesting node.
S103: when according to the identification information of the target resource, the corresponding relationship and the corresponding punishment of the node
Between cut off, determine node to be contributed；
It is understandable to be, judge that requesting node sends resource request and corresponding time point is instructed not locate in above-mentioned server
When before the corresponding Penalty time cut off of the requesting node stored in server, server is asked according to the resource received
The identification information for seeking the target resource in instruction, corresponding relationship and node pair in server between the resource stored and node
The Penalty time cut off answered provides a node to be contributed for requesting node, specifically, server is according to the resource received
The identification information of target resource in request instruction is looked into the corresponding relationship of resource identification information and node that server stores
It looks for, finds out the node for including the requested target resource of requesting node and the corresponding Penalty time of the node is being requested by point
Node is sent before resource request instruction.
In order to facilitate understanding, first assume that requesting node 2 asks target resource C what time point am11:10:25 was issued
It asks, has requesting node 2 corresponding then server includes at least in the resource request instruction that time point am11:10:25 is received
Identification information 192.168.1.102 and the corresponding identification information zy10000011 of target resource C, by the money stored in server
Source identification information Penalty time cut off corresponding with the corresponding relationship of node and node is it is known that node 1
It include resource A (zy10000001), resource B (zy10000010), resource C (zy10000011), section in (192.168.1.101)
1 corresponding Penalty time cut off of point is am11:10:05；It include resource A in node 2 (192.168.1.102) i.e. requesting node
(zy10000001), resource B (zy10000010), resource D (zy10000100), the corresponding Penalty time of node 2 are by point
am11:10:00；It include resource B (zy10000010), resource C (zy10000011), D in node 3 (192.168.1.103)
(zy10000100), the corresponding Penalty time cut off of node 3 is am11:10:30；Include in node 4 (192.168.1.104)
Resource A (zy10000001), resource D (zy10000100), resource E (zy10000101), the cut-off of the corresponding Penalty time of node 3
Point is am11:10:20.
Requesting node 2 send resource request instruct corresponding time point the corresponding Penalty time of requesting node 2 by when
Between put after, server receive requesting node 2 transmission resource request instruction, according to resource request instruct in include target
The corresponding identification information zy10000011 of resource C is looked into the corresponding relationship of resource identification information and node that server stores
It looks for, can obtain the node comprising target resource C has node 1, node 3, but the corresponding Penalty time of node 3 is by point
Am11:10:30 is sent after resource request correspond to time point in requesting node 2, and node 3 is also receiving punishment, cannot function as to
Resource node is contributed, therefore node 1 is determined as node to be contributed by server.
S104: it sends to the node to be contributed for inquiring whether the node to be contributed is ready to the requesting node
The inquiry instruction of the target resource is provided；
Server to node 1 to be contributed send inquiry instruction, inquiry instruction for inquire node 1 to be contributed whether be ready to
Requesting node 2 provides target resource C.In practice, server includes two choosings into the inquiry instruction that node 1 to be contributed is sent
, respectively " receive " and " refusal ", for example, mobile terminal device (such as mobile phone) is actually a node, server can
Inquiry instruction is sent to node 1 (mobile phone) to be contributed by network, two buttons " receiving " and " refusal " on mobile phone are provided and come
Realize the process of inquiry, naturally it is also possible to it is asked whether to be ready the resource that shared node includes to node by other forms,
The application does not do the concrete form of inquiry and clearly limits.
S105: whether judgement receives the node to be contributed for the inquiry instruction feedback within a preset period of time
Response instruction executes step S106 if be not received by；Wherein, if be not received by within a preset period of time it is described to
Node is contributed for the response instruction of the inquiry instruction feedback, indicates that the node to be contributed is reluctant requesting node described in intention
The target resource is provided；
In practice, it is contemplated that the response time of network, the embodiment of the present invention preset a period to judge wait contribute section
Whether point responds for the inquiry instruction that server is sent, it is to be understood that if within a preset period of time, wait contribute
Node is made that response for the inquiry instruction that server is sent, then a response instruction will be sent by being somebody's turn to do node to be contributed, and is used to
The tell the server node to be contributed is ready to provide target resource to requesting node.If node to be contributed is reluctant intention request section
Point provides target resource, that node to be contributed does not send response instruction.
For example, preset time period is 2 seconds, the calculation delay of server is not considered, it is corresponding that requesting node 2 sends resource request
Time point be am11:10:25, then server receive resource request instruction with to node to be contributed send inquiry instruction pair
The time answered is considered am11:10:25, then server will judge be in period am11:10:25-am11:10:27
The no response instruction for receiving node 1 to be contributed and feeding back.It is worth noting that for the embodiment of the present invention, if when
Between in section am11:10:25-am11:10:27, node 1 to be contributed both did not had " to receive " or did not had " to refuse ", at this time wait contribute section
Point does not send response instruction yet, and server is not received by the response that node 1 to be contributed is fed back, it also hold that node to be contributed
1 is reluctant that intention requesting node 2 provides target resource.
S106: determine that the node to be contributed does not feed back the number of response instruction continuously；
If it is anti-that server is not received by node 1 to be contributed in preset period am11:10:25-am11:10:27
The response of feedback instructs, then server will record its frequency n for not feeding back response instruction continuously for node 1 to be contributed, specifically
, may exist a counter in server, it is now assumed that when server receives the response instruction wait contribute node 1 to feed back,
Counter low level resets, when server is not received by the response instruction wait contribute node 1 to feed back, counter high level meter
Number；Certainly there can also be many specific implementations to count the number that node to be contributed does not feed back response instruction continuously, originally
Embodiment is not to determining that node to be contributed do not feed back the specific implementation of number of response instruction continuously and further limit.
S107: it according to the number, calculates and is directed to the corresponding Penalty time of the node to be contributed；
Server is according to the above-mentioned fixed frequency n for not feeding back response instruction continuously for node 1 to be contributed, Ke Yiji
It calculates wait contribute node continuous n-th to correspond to the Penalty time of n-th, understandable, punishment when not feeding back response instruction
Time can be the product of preset time and frequency n, and Penalty time can also be the exponential function about frequency n.The application is not
Its specific manifestation form is further limited.
In practical application, calculates and is directed to the corresponding Penalty time of the node to be contributed, comprising:
According to formula: Penalty time=preset time * bn, calculate and be directed to the corresponding Penalty time of the node to be contributed；
Wherein, b > 1, n are the number that the node to be contributed does not feed back response instruction continuously.
Under normal conditions, Penalty time TBWith indicating, preset time T0It indicates, the calculation formula that can obtain Penalty time is
TB=T0*bn, in formula, n is the number that the node to be contributed does not feed back response instruction continuously, and b is the truth of a matter, and the size of b is very big
Penalty time T is influenced in degreeBVariation tendency between frequency n, it is understandable to be, in order to motivate node to be contributed to asking
It asks node to provide target resource, needs that b > 1 is arranged, so that the Penalty time T of node to be contributed 1BWith the increase of frequency n
It is increasing；If when b < 1, Penalty time TBAs the increase of frequency n is smaller and smaller instead, it is clear that cannot in b < 1
It plays and node to be contributed is motivated to provide the purpose of target resource to requesting node.
For example, preset time T0=5 seconds, b=1.19, it is assumed that node 1 to be contributed refers to for continuous 4 times without feedback response
It enables, then, by Penalty time calculation formula TB=T0*bnIt is not difficult to calculate the continuous the 4th of node 1 to be contributed and does not feed back response
Instruct corresponding Penalty time TBIt is 10 seconds, here presetting at time and number and the truth of a matter certainly all is a kind of specific example, needle
Difference also can be set to each node truth of a matter to be contributed, the embodiment of the present invention does not further limit it.
S108: it according to the Penalty time and current point in time, determines and stores that described node to be contributed is corresponding punishes
Time cut off, and the resource that the node push resource price to be contributed described in the forward direction of the Penalty time cut off is high are penalized,
To reduce the corresponding Penalty time cut off of the node to be contributed.
It is not difficult to obtain Penalty time by above-mentioned, it is understandable to be, contribution node 1 is treated since current point in time to be made
Punishment, Penalty time terminates corresponding Penalty time cut off=current point in time+Penalty time, by calculated Penalty time
Cut off stores Penalty time cut off position corresponding with node to be contributed in the server, and Penalty time before is ended
Point deletion.For example, having determined that the continuous the 4th of node 1 to be contributed does not feed back response to instruct corresponding Penalty time is 10 seconds,
Current point in time is am11:10:27, then being not difficult to calculate the corresponding Penalty time cut off of node 1 to be contributed to be am11:
Am11:10:37 is stored Penalty time cut off position corresponding with node to be contributed in the server by 10:37, will be wait contribute
The last corresponding Penalty time cut off am11:10:05 of node 1 is deleted.
When actually treating contribution node punishment, in the corresponding Penalty time cut off am11:10:37 of node 1 to be contributed
Before, server can give the high resource supplying of P2P resources in network price to node 1 to be contributed, and node 1 to be contributed can be at this time
Reduce the corresponding Penalty time cut off of node 1 to be contributed by the resource of download server push.For example, current point in time
The high resource E of resource price is pushed to node 1 to be contributed by am11:10:30 server, if node to be contributed 1 receives push
The high resource E of resource price after, when having selected downloading, server will the corresponding time cut off am11:10 of node be contributed:
37 reduce 5 seconds, become am11:10:32, and by the Penalty time cut off am11:10:32 storage after reduction in the server with
The corresponding Penalty time cut off of node to be contributed position, will the last corresponding Penalty time cut off of node 1 be contributed
Am11:10:37 is deleted.If node 1 to be contributed does not select to download, the corresponding Penalty time cut off of node to be contributed
It is constant.It is worth noting that the reduction amount of the Penalty time cut off of node to be contributed can be according to specific network among the above
Loading condition setting, it is only example provided in an embodiment of the present invention that reduction amount, which is 5 seconds, and the embodiment of the present invention is not done reduction amount
It further limits.
The embodiment that application drawing 1 provides, by judging within a preset period of time if being not received by node needle to be contributed
Response instruction to inquiry instruction feedback, determines that node to be contributed does not feed back the number of response instruction continuously, further according to number, meter
It calculates and is directed to the corresponding Penalty time of node to be contributed；According to Penalty time and current time, determines and store node to be contributed
Corresponding Penalty time cut off, and the resource high in the forward direction of Penalty time point node push resource price to be contributed, to subtract
The corresponding Penalty time cut off of small node to be contributed.By the way that being unwilling, contributing the node of resource to make punishes and be only capable of downloading
The high resource of resource price, Lai Jili node increase the available resources number in P2P network to other nodes sharing resources
Amount.
Further, based on embodiment provided by Fig. 1, the node to be contributed is received within a preset period of time and is directed to
It include described wait contribute target resource in node corresponding in the response instruction and response instruction of the inquiry instruction feedback
In the case where network address, a kind of resource share method that the embodiment of the present invention also provides, as shown in Fig. 2, can also include
S109: being sent to the requesting node for the network address, so that the requesting node is according to the network address from described
The target resource is obtained in node wait contribute.
It should be noted that including at least in the instruction of response received by server wait contribute target resource pair in node
The network address answered, for example, the network address target resource C for including in node to be contributed 1 corresponding in P2P network is
Http:// image.***.com/search/detail? ct=503316480&z, then node to be contributed 1 is for inquiry
Network address http://image.***.com/search/ containing target resource C in the response instruction of instruction feedback
Detail? ct=503316480&z；After server receives the response instruction wait contribute node 1 to feed back, by the received response of institute
The corresponding network address http://image.***.com/search/detail of target resource C in instruction? ct=
503316480&z is sent to requesting node, and requesting node 2 receives the corresponding network address of target resource C of server transmission
So as to directly access the address, target resource C is directly obtained from node 1 to be contributed.
The embodiment that application drawing 2 provides, by the way that the corresponding network address of target resource is sent to requesting node, so as to ask
It, can be according to the network address received from wait contribute in node directly after asking node to receive the corresponding network address of target resource
Target resource is obtained, it is shared between node and node to realize resource.
Further, the case where being based on embodiment provided by Fig. 2, being also stored with the credit value of node in the server
Under, a kind of resource share method provided by the embodiment of the present invention, as shown in figure 3, can also include S110: described receiving
In the case that the node to be contributed that requesting node is sent has shared the message of the target resource, changed according to default credit value
Become rule, changes the credit value of the requesting node and the node to be contributed.
In practice, server can require requesting node to feed back a message after obtaining target resource, that is, if request
After the completion of node obtains target resource, the message that an identification request node has acquired target resource is sent, to remind clothes
Business device node to be contributed has shared target resource to it；In order to preferably motivate node can shared resource, the present embodiment
A credit value, the corresponding credit value of each node also are provided for each node, credit value is used to characterize its corresponding node letter
Reputation degree size.But when contributing resource and request resource is completed, corresponding credit value will change node, be easy reason
Solution, when completing resource request, the corresponding credit value of requesting node will reduce requesting node accordingly, and node to be contributed is in tribute
Offering the corresponding credit value of node to be contributed after resource will accordingly increase.For example, the initial credit value of node 1-4 is 0, if
Requesting node 2 from wait contribute in node 1 obtain target resource after, correspondingly, node 1 credit value increase by 1, the prestige of node 2
Value reduces 1, therefore the corresponding credit value size of node 1-4 is respectively as follows: 1, -1,0,0.Certainly, the above-mentioned credit value increase that is directed to subtracts
Few numerical value is a kind of specific example provided in this embodiment, increases and the size of reduction can also be a kind of relational expression, this
Application, which is not done its concrete form, clearly to be limited.
In practical applications, rule is changed according to default credit value, changes the requesting node and the node to be contributed
Credit value, comprising:
The credit value of the requesting node is reduced into C-, whereinIn formula, A
Coefficient is reduced to be default, K is resource base price, NA(m, t) is unit interval of the target resource m before current time t
Interior requested number, NE(m, t) is the number of nodes that current time t contains target resource m；
The credit value of the node to be contributed is increased into C+, whereinα > 0, formula
In, K is resource base price, riFor the shared resource number of the node i to be contributed, NA(m, t) is target resource m current
Requested number, N in unit interval before moment tE(m, t) is the number of nodes that current time t contains target resource m
Amount.
Under normal conditions, claimFor the well sold and in short supply degree of target resource m, indicated with b (m, t)；ClaimFor mesh
The resource price function for marking resource m is indicated with p (m, t), indicates target resource m in the corresponding resource price of moment t；ClaimFor the contribution coefficient of node to be contributed, with f (ri) indicate, work as riWhen=0, f (ri)=0.And work as riCertain journey is arrived greatly
F (r after degreei) tend to 1.The contribution coefficient function f (r under different parametersi) with the shared resource number r of node i to be contributediPair
It should be related to as shown in Figure 4.From the content that Fig. 4 is shown it is not difficult to find that when α value is smaller, such as α=1, functional image compare
Gently.I.e. contribution coefficient gradually increases as node contributes increasing for resource quantity.When α value is larger, for example, α=8, function
Image steeper.After contribution margin is greater than 1, the variation of contribution coefficient tends towards stability and moves closer in 1.It is reduced for default
Coefficient A can be adjusted according to the operating status of network, such as A=1/2, A=2/3 etc., the embodiment of the present invention be not right
The specific value of default reduction ratio A, which is done, clearly to be limited.
For example, the initial credit value of node 1-4 is 0, if requesting node 2 obtains target money from node 1 to be contributed
Behind source, reduce C using the credit value of above-mentioned requesting node 2-Formula calculates, and obtains the corresponding prestige of requesting node 2 and reduces C-=
0.8, increase C using the credit value of above-mentioned node to be contributed+Formula calculates, and obtains the corresponding prestige of node 1 to be contributed and increases C+=
1.0；So the corresponding credit value of node 1-4 is respectively as follows: 1, -0.8,0,0 at this time.
In embodiment provided by the invention, requesting node is the node that credit value is not less than preset threshold.
Understandable to be, in P2P network, each node corresponds to a credit value, if credit value very little, small
When a numerical value, generally it can be thought that this node is unworthy trusting, server no longer will provide request service for the node,
For example, preset threshold is -1, and the corresponding credit value size of node 1-4 at this time in P2P network is respectively as follows: -1, -1.5,0.5,
2, then when node 2 cannot send resource request instruction.It is only that the embodiment of the present invention provides that preset threshold among the above, which takes -1,
Example, the embodiment of the present invention do not do the specific value of preset threshold and clearly limits.
The embodiment that application drawing 3 provides, by the credit value after change requesting node request target resource and wait contribute
Node contributes the credit value after target resource, realize in P2P network requesting node and node to be contributed punish prize, with sharp
The node in P2P network is encouraged to other nodes sharing resources, and then increases the available resources quantity in P2P network.
Corresponding with embodiment of the method Fig. 1, Fig. 5 is that a kind of structure of resource shared device provided in an embodiment of the present invention is shown
It is intended to；Described device can be applied to server, the apparatus may include:
Memory module 201, when punishment corresponding with the corresponding relationship of node and node for storage resource identification information
Between cut off；
Receiving module 202, the resource request for receiving requesting node transmission instruct, in the resource request instruction at least
The identification information of target resource comprising requesting node request and the identification information of the requesting node；
First judgment module 203, for judging the request according to the corresponding Penalty time cut off of the requesting node
Node sends resource request and instructs whether corresponding time point is in front of the corresponding Penalty time cut off of the requesting node；
First determining module 204, for judging the requesting node transmission resource request instruction corresponding time point not
When before the corresponding Penalty time cut off of the requesting node, according to the identification information of the target resource, described right
It should be related to and the corresponding Penalty time cut off of the node, determine node to be contributed；
Inquire module 205, for the node to be contributed send for inquire the node to be contributed whether be ready to
The requesting node provides the inquiry instruction of the target resource；
Second judgment module 206, for judging whether to receive the node to be contributed within a preset period of time for institute
State the response instruction of inquiry instruction feedback, wherein be directed to if being not received by the node to be contributed within a preset period of time
The response instruction of the inquiry instruction feedback indicates that the node to be contributed is reluctant that requesting node described in intention provides the target
Resource；
Second determining module 207, when for being not received by response instruction within a preset period of time, determine it is described to
Contribution node does not feed back the number of response instruction continuously；
Computing module 208 is directed to the corresponding Penalty time of the node to be contributed for calculating according to the number；
In practical application, computing module 208 is specifically used for:
According to formula: Penalty time=preset time * bn, calculate and be directed to the corresponding Penalty time of the node to be contributed；
Wherein, b > 1, n are the number that the node to be contributed does not feed back response instruction continuously.
Third determining module 209, for according to the Penalty time and current point in time, determining and storing described to tribute
Offer the corresponding Penalty time cut off of node, and the node push resource to be contributed described in the forward direction of the Penalty time cut off
The high resource of price, to reduce the corresponding Penalty time cut off of the node to be contributed.
The embodiment that application drawing 5 provides, by judging within a preset period of time if being not received by node needle to be contributed
Response instruction to inquiry instruction feedback, determines that node to be contributed does not feed back the number of response instruction continuously, further according to number, meter
It calculates and is directed to the corresponding Penalty time of node to be contributed；According to Penalty time and current time, determines and store node to be contributed
Corresponding Penalty time cut off, and the resource high in the forward direction of Penalty time point node push resource price to be contributed, to subtract
The corresponding Penalty time cut off of small node to be contributed.By the way that being unwilling, contributing the node of resource to make punishes and be only capable of downloading
The high resource of resource price, Lai Jili node increase the available resources number in P2P network to other nodes sharing resources
Amount.
It is corresponding with embodiment of the method Fig. 2, on the basis of Fig. 5, receive within a preset period of time described wait contribute section
Point instructs for the response of the inquiry instruction feedback and includes described in response instruction wait contribute target resource in node
In the case where corresponding network address, a kind of resource shared device that the embodiment of the present invention also provides, as shown in fig. 6, the dress
Setting can also include: sending module 210.
Sending module 210, for the network address to be sent to the requesting node so that the requesting node according to
The network address obtains the target resource wait contribute from described in node.
The embodiment that application drawing 6 provides, by the way that the corresponding network address of target resource is sent to requesting node, so as to ask
It, can be according to the network address received from wait contribute in node directly after asking node to receive the corresponding network address of target resource
Target resource is obtained, it is shared between node and node to realize resource.
It is corresponding with embodiment of the method Fig. 3, on the basis of Fig. 6, it is also stored with the credit value of node in the server
In the case of, a kind of resource shared device that the embodiment of the present invention also provides, as shown in fig. 7, described device can also include: prestige
Value changes module 211.
Credit value changes module 211, for receive the requesting node send described in node to be contributed shared
In the case where the message of the target resource, rule is changed according to default credit value, changes the requesting node and described to tribute
Offer the credit value of node.
In a kind of specific implementation provided in an embodiment of the present invention, credit value changes module 211, is specifically used for:
Receive the requesting node send described in node to be contributed shared the target resource message feelings
Under condition, the credit value of the requesting node is reduced into C-, whereinIn formula, A is pre-
If reducing coefficient, K is resource base price, NA(m, t) is target resource m quilt in the unit interval before current time t
The number of request, NE(m, t) is the number of nodes that current time t contains target resource m；
The credit value of the node to be contributed is increased into C+, wherein
In formula, K is resource base price, riFor the shared resource number of the node i to be contributed, NA(m, t) is that target resource m is working as
Requested number in unit interval before preceding moment t, NE(m, t) is the number of nodes that current time t contains target resource m
Amount.
In embodiment provided by the invention, requesting node is the node that credit value is not less than preset threshold.
The embodiment that application drawing 7 provides, by the credit value after change requesting node request target resource and wait contribute
Node contributes the credit value after target resource, realize in P2P network requesting node and node to be contributed punish prize, with sharp
The node in P2P network is encouraged to other nodes sharing resources, and then increases the available resources quantity in P2P network.
It should be noted that, in this document, relational terms such as first and second and the like are used merely to a reality
Body or operation are distinguished with another entity or operation, are deposited without necessarily requiring or implying between these entities or operation
In any actual relationship or order or sequence.Moreover, the terms "include", "comprise" or its any other variant are intended to
Non-exclusive inclusion, so that the process, method, article or equipment including a series of elements is not only wanted including those
Element, but also including other elements that are not explicitly listed, or further include for this process, method, article or equipment
Intrinsic element.In the absence of more restrictions, the element limited by sentence "including a ...", it is not excluded that
There is also other identical elements in process, method, article or equipment including the element.
Each embodiment in this specification is all made of relevant mode and describes, same and similar portion between each embodiment
Dividing may refer to each other, and each embodiment focuses on the differences from other embodiments.Especially for device reality
For applying example, since it is substantially similar to the method embodiment, so being described relatively simple, related place is referring to embodiment of the method
Part explanation.
Those of ordinary skill in the art will appreciate that all or part of the steps in realization above method embodiment is can
It is completed with instructing relevant hardware by program, the program can store in computer-readable storage medium,
The storage medium designated herein obtained, such as: ROM/RAM, magnetic disk, CD.
The foregoing is merely illustrative of the preferred embodiments of the present invention, is not intended to limit the scope of the present invention.It is all
Any modification, equivalent replacement, improvement and so within the spirit and principles in the present invention, are all contained in protection scope of the present invention
It is interior.
Claims (6)
1. a kind of resource share method is applied to server, which is characterized in that be previously stored with resource identification in the server
Information Penalty time cut off corresponding with the corresponding relationship of node and node, which comprises
The resource request instruction that requesting node is sent is received, the requesting node is included at least in the resource request instruction and requests
Target resource identification information and the requesting node identification information；
According to the corresponding Penalty time cut off of the requesting node, judge that the requesting node sends resource request instruction and corresponds to
Time point whether be in front of the corresponding Penalty time cut off of the requesting node；
If not, being determined according to the identification information of the target resource, the corresponding relationship and the Penalty time cut off
Node to be contributed；
It sends to the node to be contributed for inquiring whether the node to be contributed is ready to described in requesting node offer
The inquiry of target resource instructs；
Whether judgement receives the node to be contributed within a preset period of time instructs for the response of the inquiry instruction feedback,
Wherein, if the response for being not received by the node to be contributed within a preset period of time for the inquiry instruction feedback refers to
It enables, indicates that the node to be contributed is reluctant that requesting node described in intention provides the target resource；
If do not received, determine that the node to be contributed does not feed back the number of response instruction continuously；
According to the number, calculates and be directed to the corresponding Penalty time of the node to be contributed；
According to the Penalty time and current point in time, determines and store the corresponding Penalty time cut-off of the node to be contributed
Point, and the high resource of node push resource price to be contributed described in the forward direction of the Penalty time cut-off, with reduce it is described to
Contribute the corresponding Penalty time cut off of node；
The credit value of node is also stored in the server, the method also includes:
In the case that the node to be contributed described in receive the requesting node and send has shared the message of the target resource,
Change rule according to default credit value, changes the credit value of the requesting node and the node to be contributed；
The basis presets credit value and changes rule, changes the credit value of the requesting node and the node to be contributed, comprising:
The credit value of the requesting node is reduced into C-, whereinK ≠ 0, in formula, A is default subtracts
Few coefficient, K are resource base price, NA(m, t) is that target resource m is requested in the unit interval before current time t
Number, NE(m, t) is the number of nodes that current time t contains target resource m；
The credit value of the node to be contributed is increased into C+, whereinα > 0, in formula, K
For resource base price, riFor the shared resource number of the node i to be contributed, NA(m, t) is target resource m in current time t
Requested number, N in unit interval beforeE(m, t) is the number of nodes that current time t contains target resource m.
2. the method according to claim 1, wherein receiving the node needle to be contributed within a preset period of time
It include described wait contribute target resource in node corresponding in response instruction and response instruction to the inquiry instruction feedback
Network address in the case where, the method also includes:
The network address is sent to the requesting node so that the requesting node according to the network address from it is described to
The target resource is obtained in contribution node.
3. the method according to claim 1, wherein the requesting node are as follows:
Credit value is not less than the node of preset threshold.
4. calculating is for described wait contribute the method according to claim 1, wherein described according to the number
The corresponding Penalty time of node, comprising:
According to formula: Penalty time=preset time * bn, calculate and be directed to the corresponding Penalty time of the node to be contributed；Wherein, b
> 1, n are the number that the node to be contributed does not feed back response instruction continuously.
5. a kind of resource shared device, it is applied to server, which is characterized in that described device includes:
Memory module, for the Penalty time cut-off corresponding with the corresponding relationship of node and node of storage resource identification information
Point；
Receiving module includes at least institute in the resource request instruction for receiving the resource request instruction of requesting node transmission
State the identification information of the target resource of requesting node request and the identification information of the requesting node；
First judgment module, for judging the requesting node hair according to the corresponding Penalty time cut off of the requesting node
Resource request is sent to instruct whether corresponding time point is in front of the corresponding Penalty time cut off of the requesting node；
First determining module, for judging that it is described that the requesting node transmission resource request instructs corresponding time point to be not at
When before the corresponding Penalty time cut off of requesting node, according to the identification information of the target resource, the corresponding relationship with
And the Penalty time cut off, determine node to be contributed；
Module is inquired, for sending to the node to be contributed for inquiring whether the node to be contributed is ready to the request
Node provides the inquiry instruction of the target resource；
Second judgment module, for judging that whether receive the node to be contributed within a preset period of time refers to for the inquiry
Enable the response instruction of feedback, wherein if being not received by the node to be contributed within a preset period of time for the inquiry
The response of instruction feedback instructs, and indicates that the node to be contributed is reluctant that requesting node described in intention provides the target resource；
Second determining module when for being not received by response instruction within a preset period of time, determines described wait contribute section
Point does not feed back the number of response instruction continuously；
Computing module is directed to the corresponding Penalty time of the node to be contributed for calculating according to the number；
Third determining module, for according to the Penalty time and current point in time, determining and storing the node to be contributed
Corresponding Penalty time cut off, and the node push resource price to be contributed described in the forward direction of the Penalty time cut off is high
Resource, to reduce the corresponding Penalty time cut off of the node to be contributed；
The credit value of node, described device are also stored in the server further include:
Credit value changes module, for receive the requesting node send described in node to be contributed shared the target
In the case where the message of resource, rule is changed according to default credit value, changes the requesting node and the node to be contributed
Credit value；
The credit value changes module, is specifically used for:
In the case that the node to be contributed described in receive the requesting node and send has shared the message of the target resource,
The credit value of the requesting node is reduced into C-, whereinK ≠ 0, in formula, A is default reduces
Coefficient, K are resource base price, NA(m, t) is that target resource m is requested in the unit interval before current time t
Number, NE(m, t) is the number of nodes that current time t contains target resource m；
The credit value of the node to be contributed is increased into C+, whereinα > 0, in formula, K
For resource base price, riFor the shared resource number of the node i to be contributed, NA(m, t) is target resource m in current time t
Requested number, N in unit interval beforeE(m, t) is the number of nodes that current time t contains target resource m.
6. device according to claim 5, which is characterized in that receive the node needle to be contributed within a preset period of time
It include described wait contribute target resource in node corresponding in response instruction and response instruction to the inquiry instruction feedback
Network address in the case where, described device further include:
Sending module, for the network address to be sent to the requesting node, so that the requesting node is according to the net
Network address obtains the target resource wait contribute from described in node.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610307456.1A CN106060114B (en) | 2016-05-11 | 2016-05-11 | A kind of resource share method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610307456.1A CN106060114B (en) | 2016-05-11 | 2016-05-11 | A kind of resource share method and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN106060114A CN106060114A (en) | 2016-10-26 |
| CN106060114B true CN106060114B (en) | 2019-04-26 |
Family
ID=57176871
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610307456.1A Active CN106060114B (en) | 2016-05-11 | 2016-05-11 | A kind of resource share method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106060114B (en) |
Families Citing this family (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109474596B (en) * | 2018-11-16 | 2021-03-26 | 中山市力泰电子工业有限公司 | Token-based resource sharing method for intelligent loudspeaker box |
| US20220030436A1 (en) * | 2018-11-30 | 2022-01-27 | Sony Group Corporation | Spectrum access restriction and re-allocation of transmit time resources |
| CN109561150A (en) * | 2018-12-04 | 2019-04-02 | 挖财网络技术有限公司 | A kind of credit value settlement method |
| CN110049109B (en) * | 2019-03-26 | 2022-04-01 | 湖南天河国云科技有限公司 | Accounting method, system and computer readable storage medium for block chain shared storage |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101345753A (en) * | 2008-08-12 | 2009-01-14 | 中国科学院软件研究所 | Resource-oriented trust appraisement method in P2P network |
| CN101510899A (en) * | 2009-04-08 | 2009-08-19 | 华为技术有限公司 | Method, system and equipment for implementing content source selection |
| CN102014135A (en) * | 2010-12-03 | 2011-04-13 | 北京航空航天大学 | Multilayer trust method for resisting selfish behavior in peer-to-peer (P2P) network |
| CN102067696A (en) * | 2008-06-26 | 2011-05-18 | 高通股份有限公司 | Fair resource sharing in wireless communications |
| CN102158864A (en) * | 2011-04-15 | 2011-08-17 | 北京航空航天大学 | Mobile AD Hoc network self-adapting secure routing method based on reliability |
-
2016
- 2016-05-11 CN CN201610307456.1A patent/CN106060114B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102067696A (en) * | 2008-06-26 | 2011-05-18 | 高通股份有限公司 | Fair resource sharing in wireless communications |
| CN101345753A (en) * | 2008-08-12 | 2009-01-14 | 中国科学院软件研究所 | Resource-oriented trust appraisement method in P2P network |
| CN101510899A (en) * | 2009-04-08 | 2009-08-19 | 华为技术有限公司 | Method, system and equipment for implementing content source selection |
| CN102014135A (en) * | 2010-12-03 | 2011-04-13 | 北京航空航天大学 | Multilayer trust method for resisting selfish behavior in peer-to-peer (P2P) network |
| CN102158864A (en) * | 2011-04-15 | 2011-08-17 | 北京航空航天大学 | Mobile AD Hoc network self-adapting secure routing method based on reliability |
Non-Patent Citations (2)
| Title |
|---|
| A Reward-and-Punishment Aware Incentive Mechanism in P2P Networks;Kun Lu,Shiyu Wang;《2015 12th International Conference on Fuzzy System and Knowledge Discovery (FSKD)》;20151231;全文 |
| 应用于移动互联网的Peer-to-Peer关键技术;李伟，徐正全，杨铸;《Journal of Software》;20090831;全文 |
Also Published As
| Publication number | Publication date |
|---|---|
| CN106060114A (en) | 2016-10-26 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106060114B (en) | A kind of resource share method and device | |
| TWI335520B (en) | Systems and methods for instant messaging | |
| US20050120133A1 (en) | Recipient-centred proactive caching in a peer-to-peer system | |
| US20100306252A1 (en) | Efficient Use of Peer Cache Space In Large Scale File Distributions | |
| CN101156407B (en) | Method for supplying content through communication network | |
| CN105450579B (en) | Internet resources pre-add support method, client and middleware server | |
| WO2010077379A1 (en) | Systems and methods for peer-to-peer bandwidth allocation | |
| CN101068173B (en) | Resource sharing method and system, and server | |
| CN108173774A (en) | The upgrade method and system of a kind of client | |
| CN110035306A (en) | Dispositions method and device, the dispatching method and device of file | |
| CN107959700A (en) | The method and cloud storage gateway that adaptive document is downloaded | |
| DE112016006436T5 (en) | End device, edge server, data delivery system and delivery control method | |
| CN108156257A (en) | A kind of information-pushing method and device | |
| CN110460879A (en) | A kind of video request dispatching method, device, server and storage medium | |
| CN107003981A (en) | It is synchronous with the equipment locally matched to obtain data from remote server using point to point link | |
| CN100579056C (en) | Data distributing method, device and system | |
| JP5938091B2 (en) | Data replication | |
| US20100257256A1 (en) | Method for downloading file in parallel | |
| CN106357783B (en) | A kind of fringe node distribution method and device | |
| CN110213155A (en) | Communication processing method, device and relevant device, storage medium | |
| JP2011159287A (en) | Device and method for controlling dissemination of contents between peers having wireless communication capacities, depending on vote vector | |
| EP2678993B1 (en) | Method and apparatus for notifications in a communication network | |
| US8856327B2 (en) | Device and method for controlling dissemination of contents between peers having wireless communication capacities, depending on impatience reaction functions | |
| CN108810070A (en) | A kind of resource share method, device, smart machine and storage medium | |
| Magharei et al. | Incorporating contribution-awareness into mesh-based Peer-to-Peer streaming systems |
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 |