CN106060114A - Resource sharing method and device - Google Patents
Resource sharing method and device Download PDFInfo
- Publication number
- CN106060114A CN106060114A CN201610307456.1A CN201610307456A CN106060114A CN 106060114 A CN106060114 A CN 106060114A CN 201610307456 A CN201610307456 A CN 201610307456A CN 106060114 A CN106060114 A CN 106060114A
- Authority
- CN
- China
- Prior art keywords
- node
- contributed
- resource
- point
- time
- 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
- 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 present invention provides a resource sharing method and device. The resource sharing method is applied to a server, and comprises the steps of determining whether a time point when a request node sends a resource request instruction is before a punishment time cut-off point corresponding to the request node; if not, determining a to-be-contributed node; if a response instruction fed back by the to-be-contributed node aiming at a query instruction is not received within a preset time quantum, calculating the punishment time corresponding to the to-be-contributed node; according to the punishment time and a current time point, determining and storing the punishment time cut-off point corresponding to the to-be-contributed node, and pushing the resources of high prices to the to-be-contributed node before a punishment time point, thereby reducing the punishment time cut-off point corresponding to the to-be-contributed node. By applying the embodiment of the present invention and punishing the node which is loath to contribute resources to only can download the resources of high prices, the node is stimulated to share resources with other nodes, thereby increasing the available resource number in a P2P network.
Description
Technical field
The present invention relates to wireless communication technology field, particularly to a kind of resource share method and device.
Background technology
In recent years, along with progressively setting up and the fast development of wireless communication technology of network infrastructure, it is desirable to more
Participating in sharing of Radio Resource widely, therefore, peer-to-peer network grows up the most therewith, so-called peer-to-peer network (Peer to
Peer Networking, is called for short P2P network), each node in P2P network both can provide resource, service and content,
Can obtain again resource, service and content, blunt point says the link canceling centre exactly so that Internet resources are more directly real
Now share and mutual, improve resource utilization.
Under normal circumstances, the node in P2P network all has certain selfishness, it is always desirable to as much as possible from P2P
Obtaining resource in network, and be unwilling to contribute resource, therefore, the available resources quantity in P2P network is fewer and feweri.
At present, existing P2P technology is the most only to contributing the node of resource to reward in P2P network, the most not to not
Be ready contribute resource node make punishment, it is impossible to by be unwilling contribute resource node make punishment encourage node to
Other nodes sharing resources.
Summary of the invention
The purpose of the embodiment of the present invention is to provide a kind of resource share method and device, to encourage node to other nodes
Share resource, and then add the available resources quantity in P2P network.
In order to achieve the above object, embodiments provide a kind of resource share method, be applied to server, described
Server is previously stored with the Penalty time cut-off point that resource identification information is corresponding with the corresponding relation of node and node, institute
The method of stating includes:
Receive the resource request instruction that requesting node sends, including at least described requesting node in the instruction of described resource request
The identification information of the target resource of request and the identification information of described requesting node；
According to the Penalty time cut-off point that described requesting node is corresponding, it is judged that described requesting node sends resource request instruction
Before whether corresponding time point is in the Penalty time cut-off point that described requesting node is corresponding；
If it does not, according to punishment corresponding to the identification information of described target resource, described corresponding relation and described node
Time cut-off point, determines node to be contributed；
Send whether node contribute described in inquire is willing to requesting node offer described in purpose to described node to be contributed
The inquiry instruction of described target resource；
Judge the response for described inquiry instruction feedback of the node to be contributed described in whether receiving in preset time period
Instruction, wherein, if the answering for described inquiry instruction feedback of node to be contributed described in being not received by preset time period
Answering instruction, node to be contributed described in expression is reluctant that requesting node described in purpose provides described target resource；
If do not received, determine described in node to be contributed the most do not feed back response instruction number of times；
According to described number of times, calculate the Penalty time corresponding for described node to be contributed；
According to described Penalty time and current time, determine and Penalty time that node to be contributed described in storing is corresponding cuts
Stop, and push, at node to be contributed described in the forward direction of described Penalty time point, the resource that resource price is high, treat described in reducing
The Penalty time cut-off point that contribution node is corresponding.
Optionally, receive in preset time period described in node to be contributed refer to for the response of described inquiry instruction feedback
Make and described response instruction include described in the case of target resource is corresponding in node to be contributed the network address, described side
Method also includes:
The described network address is sent to described requesting node so that described requesting node according to the described network address from institute
State and node to be contributed obtains described target resource.
Optionally, in described server, also storage has the credit value of node, and described method also includes:
Receiving the feelings that node to be contributed described in the transmission of described requesting node has shared the message of described target resource
Under condition, change rule according to default credit value, change described requesting node and the credit value of described node to be contributed.
Optionally, described basis is preset credit value and is changed rule, changes described requesting node and described node to be contributed
Credit value, including:
The credit value of described requesting node is reduced C-, wherein,In formula, A
For default minimizing coefficient, K is resource base price, NA(m t) is target resource m unit interval section before current time t
Interior requested number of times, NE(m t) is the current time t number of nodes that contains target resource m；
The credit value of described node to be contributed is increased C+, wherein,
In formula, K is resource base price, riFor the shared resource number of described node i to be contributed, NA(m is t) that target resource m is working as
Requested number of times in unit interval section before front moment t, NE(m t) is the current time t nodes that contains target resource m
Amount.
Optionally, described requesting node is:
Credit value is not less than the node of predetermined threshold value.
Optionally, described according to described number of times, calculate the Penalty time corresponding for described node to be contributed, including:
According to formula: Penalty time=Preset Time * bn, calculate the Penalty time corresponding for described node to be contributed；
Wherein, b > 1, n be described in node to be contributed the most do not feed back response instruction number of times.
In order to achieve the above object, embodiments provide a kind of resource shared device, be applied to server, described
Device includes:
Memory module, cuts for the Penalty time storing resource identification information corresponding with the corresponding relation of node and node
Stop；
Receiver module, for receiving the resource request instruction that requesting node sends, at least wraps in the instruction of described resource request
The identification information of the target resource asked containing described requesting node and the identification information of described requesting node；
First judge module, for the Penalty time cut-off point corresponding according to described requesting node, it is judged that described request saves
Before whether the time point of some transmission resource request instruction correspondence is in the Penalty time cut-off point that described requesting node is corresponding；
First determines module, for judging that the time point that described requesting node sends resource request instruction corresponding is not at
Time before the Penalty time cut-off point that described requesting node is corresponding, according to identification information, the described corresponding pass of described target resource
System and Penalty time cut-off point corresponding to described node, determine node to be contributed；
Whether inquiry module, for being willing to described in purpose to described node contribute transmission node to be contributed described in inquire
Requesting node provides the inquiry instruction of described target resource；
Second judge module, whether node to be contributed is for described inquiry described in judge to receive in preset time period
Ask the response instruction of instruction feedback, wherein, if node to be contributed is for described described in being not received by preset time period
The response of inquiry instruction feedback instructs, and node to be contributed described in expression is reluctant that requesting node described in purpose provides described target money
Source；
Second determines module, for be not received by preset time period described response instruction time, determine described in treat tribute
Offer node and the most do not feed back the number of times of response instruction；
Computing module, for according to described number of times, calculating the Penalty time corresponding for described node to be contributed；
3rd determines module, for according to described Penalty time and current time, determines and treats that contribution saves described in store
The Penalty time cut-off point that point is corresponding, and it is high to push resource price at node to be contributed described in the forward direction of described Penalty time point
Resource, with the Penalty time cut-off point that node to be contributed described in reduction is corresponding.
Optionally, receive in preset time period described in node to be contributed refer to for the response of described inquiry instruction feedback
Make and described response instruction include described in the case of target resource is corresponding in node to be contributed the network address, described dress
Put and also include:
Sending module, for being sent to described requesting node by the described network address, so that described requesting node is according to institute
State the network address and obtain described target resource from described node to be contributed.
Optionally, in described server, also storage has the credit value of node, and described device also includes:
Credit value change module, for receive described requesting node send described in node contribute share described in
In the case of the message of target resource, change rule according to default credit value, change described requesting node and described waiting contributes joint
The credit value of point.
Optionally, described credit value changes module, specifically for:
Receiving the feelings that node to be contributed described in the transmission of described requesting node has shared the message of described target resource
Under condition, the credit value of described requesting node is reduced C-, wherein,In formula, A is pre-
If minimizing coefficient, K is resource base price, NA(m t) is quilt in target resource m unit interval section before current time t
The number of times of request, NE(m t) is the current time t number of nodes that contains target resource m；
The credit value of described node to be contributed is increased C+, wherein,
In formula, K is resource base price, riFor the shared resource number of described node i to be contributed, NA(m is t) that target resource m is working as
Requested number of times in unit interval section before front moment t, NE(m t) is the current time t nodes that contains target resource m
Amount.
Optionally, described requesting node is:
Credit value is not less than the node of predetermined threshold value.
Optionally, described computing module, specifically for:
According to formula: Penalty time=Preset Time * bn, calculate the Penalty time corresponding for described node to be contributed；
Wherein, b > 1, n be described in node to be contributed the most do not feed back response instruction number of times.
Embodiments provide a kind of resource share method and device, be applied to server, by receiving request joint
The resource request instruction that point sends, it is judged that whether the time point that requesting node sends resource request instruction corresponding is in requesting node
Before corresponding Penalty time cut-off point；If it does not, identification information, corresponding relation and node according to target resource are corresponding
Penalty time cut-off point, determines node to be contributed, and sends inquiry instruction to node to be contributed；Whether judge in preset time period
Receiving the node the to be contributed response instruction for inquiry instruction feedback, if do not received, determining node to be contributed the most not
The number of times of feedback response instruction, further according to number of times, calculates the Penalty time corresponding for node to be contributed；According to Penalty time with
And current time, determine and store the Penalty time cut-off point that node to be contributed is corresponding, and treat tribute at the forward direction of Penalty time point
Offer node and push the resource that resource price is high, the Penalty time cut-off point corresponding to reduce node to be contributed.The application present invention is real
Execute example, by contributing being unwilling the node of resource make punishment and be only capable of downloading the resource that resource price is high, encourage node
To other nodes sharing resources, and then add the available resources quantity in P2P network.
Accompanying drawing explanation
In order to be illustrated more clearly that the embodiment of the present invention or technical scheme of the prior art, below will be to embodiment or existing
In having technology to describe, the required accompanying drawing used is briefly described, it should be apparent that, the accompanying drawing in describing below is only this
Some embodiments of invention, for those of ordinary skill in the art, on the premise of not paying creative work, it is also possible to
Other accompanying drawing is obtained according to these accompanying drawings.
The schematic flow sheet of a kind of resource share method that Fig. 1 provides for the embodiment of the present invention；
The schematic flow sheet of the another kind of resource share method that Fig. 2 provides for the embodiment of the present invention；
The schematic flow sheet of the another kind of resource share method that Fig. 3 provides for the embodiment of the present invention；
Fig. 4 contributes number of resources number at different parameters lower node contribution coefficient with node for what the embodiment of the present invention provided
Variation relation schematic diagram；
The structural representation of a kind of resource shared device that Fig. 5 provides for the embodiment of the present invention；
The structural representation of the another kind of resource shared device that Fig. 6 provides for the embodiment of the present invention；
The structural representation of the another kind of resource shared device that Fig. 7 provides for the embodiment of the present invention.
Detailed description of the invention
Below in conjunction with the embodiment of the present invention, the technical scheme in the embodiment of the present invention is clearly and completely described,
Obviously, described embodiment is only a part of embodiment of the present invention rather than whole embodiments.Based in the present invention
Embodiment, the every other embodiment that those of ordinary skill in the art are obtained under not making creative work premise, all
Belong to the scope of protection of the invention.
Below by specific embodiment, the embodiment of the present invention is described in detail.
The schematic flow sheet of a kind of resource share method that Fig. 1 provides for the embodiment of the present invention；Described method can be applied
The punishment that resource identification information is corresponding with the corresponding relation of node and node it is previously stored with in server, described server
Time cut-off point, described method can include step:
S101: the resource request instruction that reception requesting node sends, asks including at least described in the instruction of described resource request
Ask identification information and the identification information of described requesting node of the target resource that node asks；
It will be appreciated by persons skilled in the art that so-called P2P network, i.e. peer-to-peer network, be a kind of fellow
(Peer) distribute task and the Distributed Application framework of live load between, be the one that formed in application layer of P2P computing model
Networking or latticed form.Therefore, from literal, can be described as peer-to-peer network (Peer-to-peer networking) or P2P computing
(Peer-to-peer computing), it can be defined as: the participant of network shares a part of hardware that they are had
Resource (disposal ability, storage capacity, network-connectivity, printer etc.), these shared resources by network offering services and
Content, can directly be accessed by other peer node (Peer) and need not move through intermediate entities.Participant in this network is
The supplier (Server) of resource, service and content, be again resource, service and content obtain taker (Client).
In P2P network environment, all in the status of equity between the multiple stage computer being connected to each other, each computer has
Identical function, without master-slave.Each computer in network can serve as the requestor of network service, counts other again
The request of calculation machine responds, it is provided that resource, service and content.Generally these resources and service includes: sharing and friendship of information
Change, calculate resource (as CPU computing capability is shared), (such as caching and the use of disk space) is shared in storage, network is shared, print
Machine is shared.
For any one node in P2P network, resource request instruction can be sent, commonly referred to as send resource
The node that request instruction is corresponding is requesting node, for resource request instructs, including at least request in resource request instruction
The identification information of the target resource of node request and the identification information of described requesting node；It is understood that at P2P network
In, each resource is by one identification information of correspondence, such as, and resource A, resource B, resource C, resource D, resource E correspondence respectively
Identification information is zy10000001, zy10000010, zy10000011, zy10000100, zy10000101；Same, for
For node in P2P network, each node also corresponding identification information, identification information can be the link that node is corresponding
Address, such as node 1, node 2, node 3 and node 4 corresponding identification information respectively be 192.168.1.101,
192.168.1.102,192.168.1.103 and 192.168.1.104；Certainly, the one of embodiment of the present invention offer is provided
Planting concrete resource identification information and the example of node identification information, resource identification information and node identification are not believed by the application
The form of expression of breath is done and is clearly limited, as long as one-to-one relationship can be realized.
Requesting node sends resource request and instructs to server, and server receives the resource request of requesting node transmission and refers to
Order, such as, the resource request that server receives instructs the request to target resource C sent for requesting node 2, then now please
Ask in instruction including at least the mark letter corresponding with target resource C for identification information 192.168.1.102 having requesting node 2 correspondence
Breath zy10000011.It should be noted that requesting node and requested resource are not done limit further by the embodiment of the present invention
Fixed.
S102: judge whether the time point that described requesting node sends resource request instruction corresponding is in described requesting node
Before corresponding Penalty time cut-off point；If it does not, perform step S103.
What deserves to be explained is, storage has a Penalty time cut-off point corresponding with P2P nodes in the server
Table, i.e. in P2P network, each node is by one Penalty time cut-off point of correspondence, understandable, according to requesting node pair
The Penalty time cut-off point answered judges, if before current point in time is in the Penalty time cut-off point that this node is corresponding, then
Illustrate that this node is accepting punishment, now, this node is sent resource request instruction and will can not get the response of server.Cause
This, server needs to judge that requesting node sends whether time point corresponding to resource request instruction is in server being somebody's turn to do of storage
Before the Penalty time cut-off point that requesting node is corresponding.
S103: during according to the punishment that the identification information of described target resource, described corresponding relation and described node are corresponding
Between cut-off point, determine node to be contributed；
Understandable, judge that the time point that requesting node sends resource request instruction corresponding is not located at above-mentioned server
Time before the Penalty time cut-off point that this requesting node of storage is corresponding in server, server please according to the resource received
Seek the identification information of target resource in instruction, the corresponding relation between resource and the node of storage and node pair in server
The Penalty time cut-off point answered, provides a node to be contributed for requesting node, and concrete, server is according to the resource received
The resource identification information that the identification information of the target resource in request instruction stores at server is looked in the corresponding relation of node
Look for, find out and include the node of the target resource that requesting node is asked and Penalty time corresponding to this node by point in request
Before node sends resource request instruction.
Understand for convenience, first suppose that target resource C is asked what time point am11:10:25 sent by requesting node 2
Ask, then server is corresponding including at least there being requesting node 2 in the resource request instruction that time point am11:10:25 receives
Identification information zy10000011 corresponding with target resource C for identification information 192.168.1.102, by server storage money
Penalty time cut-off point that source identification information is corresponding with the corresponding relation of node and node is it is known that node 1
(192.168.1.101) resource A (zy10000001), resource B (zy10000010), resource C (zy10000011) are comprised in, joint
The Penalty time cut-off point of point 1 correspondence is am11:10:05；Node 2 (192.168.1.102) i.e. requesting node comprises resource A
(zy10000001), resource B (zy10000010), resource D (zy10000100), the Penalty time of node 2 correspondence by point is
am11:10:00；Node 3 (192.168.1.103) comprises resource B (zy10000010), resource C (zy10000011), D
(zy10000100), the Penalty time cut-off point of node 3 correspondence is am11:10:30；Node 4 (192.168.1.104) comprises
Resource A (zy10000001), resource D (zy10000100), resource E (zy10000101), the Penalty time cut-off of node 3 correspondence
Point is am11:10:20.
Requesting node 2 send time point corresponding to resource request instruction requesting node 2 correspondence Penalty time by time
Between after point, server receives the resource request instruction that requesting node 2 sends, the target that comprises in instructing according to resource request
The resource identification information that identification information zy10000011 corresponding to resource C stores at server is looked in the corresponding relation of node
Looking for, the node that can obtain comprising target resource C has node 1, node 3, but the Penalty time of node 3 correspondence respectively by point is
Am11:10:30 is after requesting node 2 sends resource request correspondence time point, and node 3 is also receiving punishment, it is impossible to as treating
Contribution resource node, therefore node 1 is defined as node to be contributed by server.
S104: send whether node to be contributed described in inquire is willing to requesting node described in purpose to described node to be contributed
The inquiry providing described target resource instructs；
Server sends inquiry instruction to node 1 to be contributed, and inquiry instruction is used for inquiring whether node 1 to be contributed is willing to purpose
Requesting node 2 provides target resource C.In reality, server comprises two choosings in the inquiry instruction that node 1 to be contributed sends
, it is respectively " acceptance " and " refusal ", such as, mobile terminal device (such as mobile phone) is actually a node, and server can
Inquiry instruction is sent to node 1 (mobile phone) to be contributed, it is provided that two buttons " accept " and " refusal " on mobile phone by network
Realize the process of inquiry, naturally it is also possible to ask whether to be ready to share the resource that node is comprised to node by other forms,
The concrete form inquired is not done and clearly limits by the application.
S105: whether described in judging to receive in preset time period node to be contributed is for described inquiry instruction feedback
Response instructs, and without receiving, performs step S106；Wherein, if treated described in being not received by preset time period
Contribution node instructs for the response of described inquiry instruction feedback, and node to be contributed described in expression is reluctant requesting node described in purpose
Described target resource is provided；
In reality, it is contemplated that the response time of network, the embodiment of the present invention is preset a time period and is judged to treat contribution joint
The inquiry instruction whether point sends for server responds, it is to be understood that if in preset time period, wait to contribute
The inquiry instruction that node sends for server is made that response, then this node to be contributed will send a response instruction, be used for
This node to be contributed of notification server is willing to that purpose requesting node provides target resource.If node to be contributed is reluctant purpose, request saves
Point provides target resource, and that node to be contributed does not sends response instruction.
Such as, preset time period is 2 seconds, does not consider that the calculation delay of server, requesting node 2 send resource request corresponding
Time point be am11:10:25, then server receive resource request instruction with to node contribute send inquire instruct right
The time answered all is considered am11:10:25, then server will determine that in time period am11:10:25-am11:10:27 and is
The no response instruction receiving node 1 to be contributed feedback.What deserves to be explained is, for the embodiment of the present invention, if time
Between in section am11:10:25-am11:10:27, node 1 to be contributed both did not had " acceptance " not have " refusal " yet, now treated contribution joint
Point does not the most send response instruction, 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 purpose requesting node 2 provides target resource.
S106: node to be contributed described in determining the most does not feeds back the number of times of response instruction；
If it is anti-that server is not received by node 1 to be contributed in default time period am11:10:25-am11:10:27
The response instruction of feedback, then server will record its frequency n the most not feeding back response instruction for node 1 to be contributed, specifically
, server can exist an enumerator, it is now assumed that server receives in time contributing the response instruction of node 1 feedback,
Enumerator low level resets, and server is not received by time contributing the response instruction of node 1 feedback, enumerator high level meter
Number；Certainly a lot of specific implementation can also be had to count node to be contributed and the most not feed back the number of times of response instruction, this
Embodiment is to determining that node to be contributed the most does not feeds back the specific implementation of number of times of response instruction and does restriction further.
S107: according to described number of times, calculate the Penalty time corresponding for described node to be contributed；
Server is according to the above-mentioned fixed frequency n not feeding back response instruction for node 1 to be contributed continuously, Ke Yiji
Calculate at the Penalty time of correspondence n-th in time contributing the continuous n-th of node not feed back response instruction, understandable, punishment
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 concrete manifestation form is done restriction further.
In actual application, calculate the Penalty time corresponding for described node to be contributed, including:
According to formula: Penalty time=Preset Time * bn, calculate the Penalty time corresponding for described node to be contributed；
Wherein, b > 1, n be described in node to be contributed the most do not feed back response instruction number of times.
Under normal circumstances, Penalty time TBWith representing, Preset Time T0Representing, the computing formula that can obtain Penalty time is
TB=T0*bn, in formula, n be described in node to be contributed the most do not feed back response instruction number of times, b is the truth of a matter, and the size of b is the biggest
Penalty time T is affected in degreeBAnd the variation tendency between frequency n, understandable, in order to encourage node to be contributed to asking
Ask node to provide target resource, need to arrange b 1, so that the Penalty time T of node to be contributed 1BAlong with frequency n increase also
Increasing；If b is < when 1, then Penalty time TBAlong with the increase of frequency n is more and more less, it is clear that < can not when 1 at b
Play and encourage node to be contributed to provide the purpose of target resource to requesting node.
Such as, preset time T0=5 seconds, b=1.19, it is assumed that node 1 to be contributed does not feeds back response the most continuous 4 times and refers to
Order, then, by Penalty time computing formula TB=T0*bnIt is not difficult to calculate continuous the 4th of node 1 to be contributed and does not feed back response
The Penalty time T that instruction is correspondingBIt is 10 seconds, certainly here presets at time and number of times and the truth of a matter is all a kind of concrete example, pin
Each node truth of a matter to be contributed can also be arranged difference, and it is not done restriction further by the embodiment of the present invention.
S108: according to described Penalty time and current point in time, determines and corresponding the punishing of node to be contributed described in storing
Penalize time cut-off point, and push, at node to be contributed described in the forward direction of described Penalty time cut-off point, the resource that resource price is high,
With the Penalty time cut-off point that node to be contributed described in reduction is corresponding.
It is not difficult to obtain Penalty time by above-mentioned, understandable, start to treat contribution node 1 from current point in time and make
Punishment, Penalty time terminates the Penalty time cut-off point=current point in time+Penalty time of correspondence, the Penalty time that will calculate
The Penalty time cut-off point position that cut-off point storage is corresponding with node to be contributed in the server, ends Penalty time before
Point deletion.Such as, it has been determined that go out continuous the 4th of node 1 to be contributed do not feed back response instructing corresponding Penalty time is 10 seconds,
Current point in time is am11:10:27, then the Penalty time cut-off point being not difficult to calculate node 1 correspondence to be contributed is am11:
10:37, by Penalty time cut-off point position corresponding with node to be contributed in the server for am11:10:37 storage, will wait to contribute
The last corresponding Penalty time cut-off point am11:10:05 of node 1 deletes.
Actual treat contribution node punishment time, at the Penalty time cut-off point am11:10:37 of node 1 correspondence to be contributed
Before, resource supplying high for P2P resources in network price can be given node 1 to be contributed by server, and node 1 to be contributed is permissible
The resource pushed by download server reduces the Penalty time cut-off point of node 1 correspondence to be contributed.Such as, current point in time
Resource E high for resource price is pushed to node 1 to be contributed by am11:10:30 server, if node to be contributed 1 receives propelling movement
High resource E of resource price after, when have selected download, server is by time cut-off point am11:10 corresponding for node to be contributed:
37 reduce 5 seconds, become am11:10:32, and the Penalty time cut-off point am11:10:32 storage after reducing in the server with
The Penalty time cut-off point position that node to be contributed is corresponding, by last for node 1 to be contributed corresponding Penalty time cut-off point
Am11:10:37 deletes.If node 1 to be contributed does not selects to download, then the Penalty time cut-off point that node to be contributed is corresponding
Constant.What deserves to be explained is, above-mentioned in the reduction amount of Penalty time cut-off point of node to be contributed can be according to concrete network
Loading condition is arranged, and reduction amount was only, for 5 seconds, the example that the embodiment of the present invention provides, and reduction amount is not done by the embodiment of the present invention
Limit further.
The embodiment that application drawing 1 provides, by judging in preset time period without receiving node pin to be contributed
Response instruction to inquiry instruction feedback, determines that node to be contributed the most does not feeds back the number of times of response instruction, further according to number of times, meter
Calculate the Penalty time corresponding for node to be contributed；According to Penalty time and current time, determine and store node to be contributed
Corresponding Penalty time cut-off point, and in the high resource of the forward direction node contribute propelling movement resource price of Penalty time point, to subtract
The Penalty time cut-off point that little node to be contributed is corresponding.By contributing the node of resource make punishment and be only capable of downloading to being unwilling
The resource that resource price is high, encourages node to other nodes sharing resources, and then adds the available resources number in P2P network
Amount.
Further, the embodiment provided based on Fig. 1, receive in preset time period described in node to be contributed for
The response instruction of described inquiry instruction feedback and described response instruction include described in node to be contributed target resource corresponding
In the case of the network address, a kind of resource share method that the embodiment of the present invention is also provided for, as shown in Figure 2, it is also possible to include
S109: the described network address is sent to described requesting node so that described requesting node according to the described network address from described
Node to be contributed obtains described target resource.
It should be noted that the response received by server includes at least target resource pair in node to be contributed in instructing
The network address answered, such as, the network address corresponding in P2P network for the target resource C comprised in node 1 to be contributed is
http://image.baidu.com/search/detail？Ct=503316480&z, then node to be contributed 1 is for inquiry
The response instruction of instruction feedback contains the network address http://image.baidu.com/search/ of target resource C
detail？Ct=503316480&z；Server receives after the response instruction of contribution node 1 feedback, the response that will be received
Network address http://image.baidu.com/search/detail corresponding for target resource C in instruction？Ct=
503316480&z is sent to requesting node, and requesting node 2 receives the network address corresponding for target resource C that server sends
So that this address can directly be accessed, from node 1 to be contributed, directly obtain target resource C.
The embodiment that application drawing 2 provides, by the network address corresponding for target resource is sent to requesting node, so that please
After asking node to receive the network address that target resource is corresponding, can according to the network address received from node to be contributed directly
Obtain target resource, it is achieved that resource sharing between node and node.
Further, the embodiment provided based on Fig. 2, the most also storage have the situation of the credit value of node
Under, a kind of resource share method that the embodiment of the present invention is provided, as shown in Figure 3, it is also possible to include S110: described receiving
In the case of node to be contributed described in requesting node transmission has shared the message of described target resource, change according to default credit value
Become rule, change described requesting node and the credit value of described node to be contributed.
In reality, server may require that requesting node feeds back a message after obtaining target resource, i.e. if request
After node acquisition target resource completes, send an identification request node and acquired the message of target resource, to remind clothes
Business device node to be contributed has shared target resource to it；In order to preferably encourage node can share resource, the present embodiment
Also providing a credit value for each node, the corresponding credit value of each node, credit value is used for characterizing its corresponding node letter
Reputation degree size.But node is when contributing resource and request resource completes, and the credit value of its correspondence will change, easily manage
Solving, requesting node is when completing resource request, and the credit value that requesting node is corresponding will reduce accordingly, and node to be contributed is in tribute
The credit value that after offering resource, node to be contributed is corresponding will accordingly increase.Such as, the initial credit value of node 1-4 is 0, if
Requesting node 2 is from after obtaining target resource contribution node 1, and accordingly, the credit value of node 1 increases by 1, the prestige of node 2
Value minimizing 1, therefore credit value size corresponding to node 1-4 is respectively as follows: 1 ,-1,0,0.Certainly, above-mentioned subtract for credit value increase
A kind of concrete example that few numerical value provides for the present embodiment, the size increasing and reducing can also be for a kind of relational expression, this
Its concrete form is not done and clearly limits by application.
In actual applications, change rule according to default credit value, change described requesting node and described node to be contributed
Credit value, including:
The credit value of described requesting node is reduced C-, wherein,In formula, A
For default minimizing coefficient, K is resource base price, NA(m t) is target resource m unit interval section before current time t
Interior requested number of times, NE(m t) is the current time t number of nodes that contains target resource m；
The credit value of described node to be contributed is increased C+, wherein,α ＞ 0, formula
In, K is resource base price, riFor the shared resource number of described node i to be contributed, NA(m is t) that target resource m is currently
Requested number of times in unit interval section before moment t, NE(m t) is the current time t nodes that contains target resource m
Amount.
Under normal circumstances, claimFor the well sold and in short supply degree of target resource m, with b, (m t) represents；ClaimFor mesh
The resource price function of mark resource m, with p, (m, t) represents, represents that target resource m is at resource price corresponding for moment t；ClaimFor the contribution coefficient of node to be contributed, with f (ri) represent, work as riWhen=0, f (ri)=0.And work as riBig to certain journey
F (r after degreei) tend to 1.Contribution coefficient function f (r under different parametersi) with shared resource number r of node i to be contributediRight
Should be related to as shown in Figure 4.From the content that Fig. 4 is shown it is seen that, when α value is less, such as α=1, functional image compares
Gently.I.e. contribution coefficient progressively increases along with node increasing of resource quantity of contribution.When α value is bigger, such as α=8, function
Image steeper.After contribution margin is more than 1, the change of contribution coefficient tends towards stability and moves closer in 1.For default minimizing
Coefficient A, can be adjusted according to the running status of network, such as A=1/2, A=2/3 etc., and the embodiment of the present invention is the most right
The concrete numerical value of default reduction ratio A does and clearly limits.
Such as, 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, the credit value of above-mentioned requesting node 2 is utilized to reduce C-Formula calculates, and the prestige obtaining requesting node 2 correspondence reduces C-=
0.8, utilize the credit value of above-mentioned node to be contributed to increase C+Formula calculates, and the prestige obtaining node 1 correspondence to be contributed increases C+=
1.0；Now the most corresponding for node 1-4 credit value is respectively as follows: 1 ,-0.8,0,0.
In the embodiment that the present invention provides, requesting node is the node that credit value is not less than predetermined threshold value.
Understandable, in P2P network, the corresponding credit value of each node is if credit value is the least, little
When a numerical value, generally it can be thought that this node is unworthy trusting, server no longer will provide request service for this node,
Such as, predetermined threshold value is-1, and now the credit value size corresponding for node 1-4 in P2P network be respectively as follows :-1 ,-1.5,0.5,
2, then when node 2 can not send resource request instruction.Predetermined threshold value in above-mentioned takes-1 and is only embodiment of the present invention offer
Example, the embodiment of the present invention not concrete numerical value to predetermined threshold value does and clearly limits.
The embodiment that application drawing 3 provides, by changing the credit value after requesting node request target resource and waiting to contribute
Credit value after node contribution target resource, it is achieved the requesting node in P2P network and node contribute punished prize, with sharp
Encourage the node in P2P network to other nodes sharing resources, and then add the available resources quantity in P2P network.
Corresponding with embodiment of the method Fig. 1, Fig. 5 shows for the structure of a kind of resource shared device that the embodiment of the present invention provides
It is intended to；Described device can apply to server, and described device may include that
Memory module 201, during for storing the resource identification information punishment corresponding with the corresponding relation of node and node
Between cut-off point；
Receiver module 202, for receiving the resource request instruction that requesting node sends, in the instruction of described resource request at least
Comprise identification information and the identification information of described requesting node of the target resource of described requesting node request；
First judge module 203, for the Penalty time cut-off point corresponding according to described requesting node, it is judged that described request
Before whether the time point of node transmission resource request instruction correspondence is in the Penalty time cut-off point that described requesting node is corresponding；
First determines module 204, for judging that described requesting node sends time point corresponding to resource request instruction not
When being in before the Penalty time cut-off point that described requesting node is corresponding, according to the identification information of described target resource, described right
Should be related to and Penalty time cut-off point that described node is corresponding, determine node to be contributed；
Whether inquiry module 205, for being willing to purpose to described node contribute transmission node to be contributed described in inquire
Described requesting node provides the inquiry instruction of described target resource；
Second judge module 206, whether node to be contributed is for institute described in judge to receive in preset time period
State inquiry instruction feedback response instruction, wherein, if node to be contributed described in being not received by preset time period for
The response of described inquiry instruction feedback instructs, and node to be contributed described in expression is reluctant that requesting node described in purpose provides described target
Resource；
Second determines module 207, for be not received by preset time period described response instruction time, determine described in treat
Contribution node does not the most feed back the number of times of response instruction；
Computing module 208, for according to described number of times, calculating the Penalty time corresponding for described node to be contributed；
In actual application, computing module 208, specifically for:
According to formula: Penalty time=Preset Time * bn, calculate the Penalty time corresponding for described node to be contributed；
Wherein, b > 1, n be described in node to be contributed the most do not feed back response instruction number of times.
3rd determines module 209, for according to described Penalty time and current point in time, determines and treats tribute described in storing
Offer the Penalty time cut-off point that node is corresponding, and push resource at node to be contributed described in the forward direction of described Penalty time cut-off point
The resource that price is high, with the Penalty time cut-off point that node to be contributed described in reduction is corresponding.
The embodiment that application drawing 5 provides, by judging in preset time period without receiving node pin to be contributed
Response instruction to inquiry instruction feedback, determines that node to be contributed the most does not feeds back the number of times of response instruction, further according to number of times, meter
Calculate the Penalty time corresponding for node to be contributed；According to Penalty time and current time, determine and store node to be contributed
Corresponding Penalty time cut-off point, and in the high resource of the forward direction node contribute propelling movement resource price of Penalty time point, to subtract
The Penalty time cut-off point that little node to be contributed is corresponding.By contributing the node of resource make punishment and be only capable of downloading to being unwilling
The resource that resource price is high, encourages node to other nodes sharing resources, and then adds the available resources number in P2P network
Amount.
Corresponding with embodiment of the method Fig. 2, on the basis of Fig. 5, receive in preset time period described in treat contribution joint
Point instructs for the response of described inquiry instruction feedback and described response instruction include described in target resource in node to be contributed
In the case of the corresponding network address, a kind of resource shared device that the embodiment of the present invention also provides for, as shown in Figure 6, described dress
Put and can also include: sending module 210.
Sending module 210, for the described network address is sent to described requesting node so that described requesting node according to
The described network address obtains described target resource from described node to be contributed.
The embodiment that application drawing 6 provides, by the network address corresponding for target resource is sent to requesting node, so that please
After asking node to receive the network address that target resource is corresponding, can according to the network address received from node to be contributed directly
Obtain target resource, it is achieved that resource sharing between node and node.
Corresponding with embodiment of the method Fig. 3, on the basis of Fig. 6, the most also storage has the credit value of node
In the case of, a kind of resource shared device that the embodiment of the present invention also provides for, as it is shown in fig. 7, described device can also include: prestige
Value changes module 211.
Credit value change module 211, for receive described requesting node send described in node to be contributed the most shared
In the case of the message of described target resource, change rule according to default credit value, change described requesting node and described treat tribute
Offer the credit value of node.
In a kind of specific implementation that the embodiment of the present invention provides, credit value changes module 211, specifically for:
Receiving the feelings that node to be contributed described in the transmission of described requesting node has shared the message of described target resource
Under condition, the credit value of described requesting node is reduced C-, wherein,In formula, A is pre-
If minimizing coefficient, K is resource base price, NA(m t) is quilt in target resource m unit interval section before current time t
The number of times of request, NE(m t) is the current time t number of nodes that contains target resource m；
The credit value of described node to be contributed is increased C+, wherein,
In formula, K is resource base price, riFor the shared resource number of described node i to be contributed, NA(m is t) that target resource m is working as
Requested number of times in unit interval section before front moment t, NE(m t) is the current time t nodes that contains target resource m
Amount.
In the embodiment that the present invention provides, requesting node is the node that credit value is not less than predetermined threshold value.
The embodiment that application drawing 7 provides, by changing the credit value after requesting node request target resource and waiting to contribute
Credit value after node contribution target resource, it is achieved the requesting node in P2P network and node contribute punished prize, with sharp
Encourage the node in P2P network to other nodes sharing resources, and then add the available resources quantity in P2P network.
It should be noted that in this article, the relational terms of such as first and second or the like is used merely to a reality
Body or operation separate with another entity or operating space, and deposit between not necessarily requiring or imply these entities or operating
Relation or order in any this reality.And, term " includes ", " comprising " or its any other variant are intended to
Comprising of nonexcludability, so that include that the process of a series of key element, method, article or equipment not only include that those are wanted
Element, but also include other key elements being not expressly set out, or also include for this process, method, article or equipment
Intrinsic key element.In the case of there is no more restriction, statement " including ... " key element limited, it is not excluded that
Including process, method, article or the equipment of described key element there is also other identical element.
Each embodiment in this specification all uses relevant mode to describe, identical similar portion between each embodiment
Dividing and see mutually, what each embodiment stressed is the difference with other embodiments.Real especially for device
For executing example, owing to it is substantially similar to embodiment of the method, so describe is fairly simple, relevant part sees embodiment of the method
Part illustrate.
One of ordinary skill in the art will appreciate that all or part of step realizing in said method embodiment is can
Completing instructing relevant hardware by program, described program can be stored in computer read/write memory medium,
The storage medium obtained designated herein, such as: ROM/RAM, magnetic disc, CD etc..
The foregoing is only presently preferred embodiments of the present invention, be not intended to limit protection scope of the present invention.All
Any modification, equivalent substitution and improvement etc. made within the spirit and principles in the present invention, are all contained in protection scope of the present invention
In.
Claims (10)
1. a resource share method, is applied to server, it is characterised in that be previously stored with resource identification in described server
The Penalty time cut-off point that information is corresponding with the corresponding relation of node and node, described method includes:
Receive the resource request instruction that requesting node sends, the instruction of described resource request is asked including at least described requesting node
The identification information of target resource and the identification information of described requesting node；
According to the Penalty time cut-off point that described requesting node is corresponding, it is judged that described requesting node sends resource request instruction correspondence
Time point whether be in the Penalty time cut-off point that described requesting node is corresponding before；
If it does not, according to Penalty time corresponding to the identification information of described target resource, described corresponding relation and described node
Cut-off point, determines node to be contributed；
Send described in whether node contribute described in inquire be willing to that requesting node described in purpose provides to described node to be contributed
The inquiry instruction of target resource；
Judge that node to be contributed described in whether receiving in preset time period instructs for the response of described inquiry instruction feedback,
Wherein, if node to be contributed described in being not received by preset time period refers to for the response of described inquiry instruction feedback
Making, node to be contributed described in expression is reluctant that requesting node described in purpose provides described target resource；
If do not received, determine described in node to be contributed the most do not feed back response instruction number of times；
According to described number of times, calculate the Penalty time corresponding for described node to be contributed；
According to described Penalty time and current point in time, determine and Penalty time cut-off that node to be contributed described in storing is corresponding
Point, and push, at node to be contributed described in the forward direction of described Penalty time cut-off, the resource that resource price is high, treat described in reducing
The Penalty time cut-off point that contribution node is corresponding.
Method the most according to claim 1, it is characterised in that node pin to be contributed described in receiving in preset time period
The response of described inquiry instruction feedback is instructed and described response instruction include described in target resource correspondence in node contribute
The network address in the case of, described method also includes:
The described network address is sent to described requesting node, so that described requesting node is treated from described according to the described network address
Contribution node obtains described target resource.
Method the most according to claim 2, it is characterised in that in described server, also storage has the credit value of node, institute
Method of stating also includes:
Receive described requesting node send described in the case of node to be contributed shared the message of described target resource,
Change rule according to default credit value, change described requesting node and the credit value of described node to be contributed.
Method the most according to claim 3, it is characterised in that described basis is preset credit value and changed rule, changes described
Requesting node and the credit value of described node to be contributed, including:
The credit value of described requesting node is reduced C-, wherein,K ≠ 0, in formula, A subtracts for presetting
Few coefficient, K is resource base price, NA(m is t) requested in target resource m unit interval section before current time t
Number of times, NE(m t) is the current time t number of nodes that contains target resource m；
The credit value of described node to be contributed is increased C+, wherein,α ＞ 0, in formula, K
For resource base price, riFor the shared resource number of described node i to be contributed, NA(m is t) that target resource m is at current time t
Requested number of times in unit interval section before, NE(m t) is the current time t number of nodes that contains target resource m.
Method the most according to claim 3, it is characterised in that described requesting node is:
Credit value is not less than the node of predetermined threshold value.
Method the most according to claim 1, it is characterised in that described according to described number of times, calculates and contributes for described waiting
The Penalty time that node is corresponding, including:
According to formula: Penalty time=Preset Time * bn, calculate the Penalty time corresponding for described node to be contributed；Wherein, b
> 1, n be described in node to be contributed the most do not feed back response instruction number of times.
7. a resource shared device, is applied to server, it is characterised in that described device includes:
Memory module, for storing the Penalty time cut-off that resource identification information is corresponding with the corresponding relation of node and node
Point；
Receiver module, for receiving the resource request instruction that requesting node sends, including at least institute in the instruction of described resource request
State identification information and the identification information of described requesting node of the target resource of requesting node request；
First judge module, for the Penalty time cut-off point corresponding according to described requesting node, it is judged that described requesting node is sent out
Before whether the time point sending resource request instruction corresponding is in the Penalty time cut-off point that described requesting node is corresponding；
First determines module, for judging that described requesting node sends time point corresponding to resource request instruction and is not at described
Time before the Penalty time cut-off point that requesting node is corresponding, according to the identification information of described target resource, described corresponding relation with
And the Penalty time cut-off point that described node is corresponding, determine node to be contributed；
To described node contribute, inquiry module, for sending whether node to be contributed described in inquire is willing to request described in purpose
Node provides the inquiry instruction of described target resource；
Second judge module, node to be contributed described in judge whether to receive in preset time period refers to for described inquiry
The response instruction of order feedback, wherein, if node to be contributed is for described inquiry described in being not received by preset time period
The response of instruction feedback instructs, and node to be contributed described in expression is reluctant that requesting node described in purpose provides described target resource；
Second determines module, for be not received by preset time period described response instruction time, determine described in treat contribution joint
Point does not feed back the number of times of response instruction continuously；
Computing module, for according to described number of times, calculating the Penalty time corresponding for described node to be contributed；
3rd determines module, for according to described Penalty time and current point in time, determines and node to be contributed described in storing
Corresponding Penalty time cut-off point, and it is high to push resource price at node to be contributed described in the forward direction of described Penalty time cut-off point
Resource, with Penalty time cut-off point corresponding to node to be contributed described in reducing.
Device the most according to claim 7, it is characterised in that node pin to be contributed described in receiving in preset time period
The response of described inquiry instruction feedback is instructed and described response instruction include described in target resource correspondence in node contribute
The network address in the case of, described device also includes:
Sending module, for being sent to described requesting node by the described network address, so that described requesting node is according to described net
Network address obtains described target resource from described node to be contributed.
Device the most according to claim 8, it is characterised in that in described server, also storage has the credit value of node, institute
State device also to include:
Credit value change module, for receive described requesting node send described in node to be contributed shared described target
In the case of the message of resource, change rule according to default credit value, change described requesting node and described node to be contributed
Credit value.
Device the most according to claim 9, it is characterised in that described credit value changes module, specifically for:
Receive described requesting node send described in the case of node to be contributed shared the message of described target resource,
The credit value of described requesting node is reduced C-, wherein,K ≠ 0, in formula, A reduces system for presetting
Number, K is resource base price, NA(m t) is in target resource m unit interval section before current time t requested time
Number, NE(m t) is the current time t number of nodes that contains target resource m；
The credit value of described node to be contributed is increased C+, wherein,α ＞ 0, in formula, K
For resource base price, riFor the shared resource number of described node i to be contributed, NA(m is t) that target resource m is at current time t
Requested number of times in unit interval section before, NE(m t) is the current time t number of nodes that contains target resource m.
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 true CN106060114A (en) | 2016-10-26 |
| CN106060114B 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) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109474596A (en) * | 2018-11-16 | 2019-03-15 | 中山市力泰电子工业有限公司 | A kind of resource share method of the intelligent sound box based on token |
| CN109561150A (en) * | 2018-12-04 | 2019-04-02 | 挖财网络技术有限公司 | A kind of credit value settlement method |
| CN110049109A (en) * | 2019-03-26 | 2019-07-23 | 湖南天河国云科技有限公司 | Accounting method, system and the computer readable storage medium of the shared storage of block chain |
| CN113303026A (en) * | 2018-11-30 | 2021-08-24 | 索尼集团公司 | Spectrum access restriction and re-allocation of transmit time resources |
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 |
|---|
| KUN LU,SHIYU WANG: "A Reward-and-Punishment Aware Incentive Mechanism in P2P Networks", 《2015 12TH INTERNATIONAL CONFERENCE ON FUZZY SYSTEM AND KNOWLEDGE DISCOVERY (FSKD)》 * |
| 李伟，徐正全，杨铸: "应用于移动互联网的Peer-to-Peer关键技术", 《JOURNAL OF SOFTWARE》 * |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109474596A (en) * | 2018-11-16 | 2019-03-15 | 中山市力泰电子工业有限公司 | A kind of resource share method of the intelligent sound box based on token |
| CN113303026A (en) * | 2018-11-30 | 2021-08-24 | 索尼集团公司 | 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 |
| CN110049109A (en) * | 2019-03-26 | 2019-07-23 | 湖南天河国云科技有限公司 | Accounting method, system and the computer readable storage medium of the shared storage of block chain |
| CN110049109B (en) * | 2019-03-26 | 2022-04-01 | 湖南天河国云科技有限公司 | Accounting method, system and computer readable storage medium for block chain shared storage |
Also Published As
| Publication number | Publication date |
|---|---|
| CN106060114B (en) | 2019-04-26 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US10530874B2 (en) | Locality based content distribution | |
| CN106060114A (en) | Resource sharing method and device | |
| CN101098267B (en) | Method and system for establishing cluster conversation | |
| JP5327852B2 (en) | Optimize communication using scalable peer groups | |
| CN108737534B (en) | Block chain-based data transmission method and device and block chain system | |
| CN101068173B (en) | Resource sharing method and system, and server | |
| US20090086745A1 (en) | Method and a system for matching between network nodes | |
| CN108173774A (en) | The upgrade method and system of a kind of client | |
| CN101720136A (en) | Method for controlling number of neighbor nodes of client and device and cache system thereof | |
| CN102067565A (en) | System, sharing node, server, and method for content distribution | |
| DE112016006436T5 (en) | End device, edge server, data delivery system and delivery control method | |
| CN101267383B (en) | Data transmission method and system | |
| CN110493321A (en) | System, server are dispatched in a kind of resource acquiring method and edge | |
| CN108156257A (en) | A kind of information-pushing method and device | |
| CN101500016A (en) | Service control method, system and equipment | |
| US9332062B2 (en) | Method and arrangement for providing documents | |
| CN108616600A (en) | Resource regulating method, client server, node device, network system and medium | |
| CN103166978A (en) | Method and device of data obtaining | |
| US8706831B2 (en) | Device and method for controlling dissemination of contents between peers having wireless communication capacities, depending on vote vectors | |
| US8924474B2 (en) | Device and method for controlling dissemination of data by transfer of sets of instructions between peers having wireless communication capacities | |
| US20150026235A1 (en) | Device and method for controlling dissemination of contents between peers having wireless communication capacities, depending on impatience reaction functions | |
| CN108449371B (en) | A kind of contents access method and device | |
| CN106714235A (en) | Content request response method based on D2D communication | |
| CN102035866A (en) | Method and device for downloading data by P2P | |
| EP2372976B1 (en) | Device and method for controlling dissemination of contents between peers having wireless communication capacities, depending on vote vectors |
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 |