CN103713895A - Data sending method and device - Google Patents
Data sending method and device Download PDFInfo
- Publication number
- CN103713895A CN103713895A CN201310632777.5A CN201310632777A CN103713895A CN 103713895 A CN103713895 A CN 103713895A CN 201310632777 A CN201310632777 A CN 201310632777A CN 103713895 A CN103713895 A CN 103713895A
- Authority
- CN
- China
- Prior art keywords
- data
- client
- queue
- distribute data
- distribute
- 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
Images
Abstract
The invention discloses a data sending method and device, and relates to the field of computers. The method includes acquiring distribution data to be distributed and a first time node and a second time node which are to be distributed; acquiring a total number N of the distribution data in the distribution data, and randomly determining N different time nodes i between the first time node and the second time node; corresponding each time node i to the distribution data, and placing the distribution data into data queues in sequence; after a data acquiring request from a client terminal is received, acquiring the initiate time of the request and the time node i according to the data, and determining whether or not the client terminal has the permission to acquire the distribution data according to the data queues; if so, acquiring and sending the distribution data to the client terminal according to the data queues. The method is convenient to maintain, occupation of system resources can be reduced, data performances can be further improved, and statistical efficiency can be improved in process of distribution data statistics.
Description
Technical field
The present invention relates to computer realm, be specifically related to a kind of data transmission method for uplink and device.
Background technology
A kind of method that exists data to send in prior art, it is certain time point in appointment of a period of time, the authority of limited data to be allocated is open to client, by client, send request and obtain in any order these data to be distributed, but this kind of disposable whole relieving authorities, obtain arbitrarily the mode of data to be distributed, for system, maintain each data to be allocated, wait meets the client of preliminary requirement and extracts, system resource takies higher, affect system performance, and obtained arbitrarily by data to be distributed, which finally in system statistics distribute data, do not send, when which data has been sent, also need to travel through each distribute data, resource occupation is high, speed is slow, efficiency is low.
Corresponding above-mentioned data transmission method for uplink, describes with an application scenarios below:
The activities such as sales promotion can be carried out in some time period in now a lot of websites, sweepstake may be set between active stage, in prior art, the appointment of its server between active stage is constantly completely open by the issued rights of prize data, when client user clicks prize drawing, it reaches prize drawing probability, server is distributed to this client user from one of these prize extracting data, finish to the prize drawing time, adding up which prize data has sent out which and has not sent out again, its implementation and aforementioned process are substantially similar, therefore for system, each data to be distributed is equivalent to exist a queue, wait meets the client of preliminary requirement and extracts, system resource takies higher, affect system performance, and obtained arbitrarily by data to be distributed, which finally in system statistics distribute data, do not send, when which data has been sent, also need to travel through each distribute data, resource occupation is high, speed is slow, efficiency is low, and its prize data may just be provided in moment, just there is no the prize data that can send out excess time.
Summary of the invention
In view of the above problems, the present invention has been proposed to provide a kind of a kind of data that overcome the problems referred to above or address the above problem at least in part to send and corresponding a kind of data transmission method for uplink.
According to one aspect of the present invention, provide and the invention discloses a kind of data transmission method for uplink, comprising:
Obtain distribute data to be allocated, and very first time node to be allocated and the second timing node;
Obtain the total N of distribute data in described distribute data, random definite N mutually different timing node i between very first time node and the second timing node;
Each timing node i and distribute data are carried out corresponding, and according to the order of sequence distribute data is put into data queue;
After receiving the data acquisition request of client, according to the initiation time point of described data acquisition request and timing node i, determine whether client possesses the authority of obtaining distribute data according to described data queue;
When client possesses described authority, according to described data queue, obtain distribute data and send to described client.
Optionally, describedly according to the order of sequence distribute data is put into data queue and comprises:
According to the Authorization Attributes of distribute data, in the data queue of affiliated Authorization Attributes, by timing node order, distribute data is deposited.
Optionally, according to the attribute of distribute data, in the data queue of affiliated attribute, by timing node order, distribute data is deposited and is comprised:
By possessing the distribute data that can repeat issued rights attribute, by timing node order, distribute data is put into the first data queue;
By possessing the distribute data of not reproducible issued rights attribute, by timing node order, distribute data is put into the second data queue.
Optionally, also comprise:
After receiving the data acquisition request of client, according to described request, extract the distribute data of this client in assignment record table and obtain record;
When recording client, obtained the distribute data that possesses not reproducible issued rights attribute, forbidden that active client obtains distribute data according to described data queue;
When recording client, do not obtain the distribute data that possesses not reproducible issued rights attribute, allow active client to obtain distribute data according to described data queue.
Optionally, also comprise:
After receiving the data acquisition request of client, complete if the distribute data in described data queue is provided, point out client distribute data to provide complete.
Optionally, described after receiving the data acquisition request of client, according to the initiation time point of described data acquisition request and timing node i, determine whether client possesses the authority of obtaining distribute data according to described data queue and comprise:
Timing node based on the described data queue of correspondence, the timing node i whether time point reaches or surpass is initiated in judgement;
If do not reach node i any time, determine that described client does not possess the authority of the distribute data of obtaining data queue;
If a timing node i who reaches or surpass, determines that described client possesses the authority of the distribute data of obtaining the file leader of data queue.
Optionally, described after receiving the data acquisition request of client, according to the initiation time point of described data acquisition request and timing node i, determine whether client possesses before obtaining the authority of distribute data according to described data queue also to comprise:
For client Random assignment one probability numbers, when described probability numbers does not meet threshold value requirement, forbid that this client obtains distribute data according to described data queue.
Optionally, described after receiving the data acquisition request of client, according to the initiation time point of described data acquisition request and timing node i, determine whether client possesses before obtaining the authority of distribute data according to described data queue also to comprise:
Whether the number of times that judges the data acquisition request that client sends surpasses threshold value; If surpassed, forbid that this client obtains distribute data according to described data queue.
The invention also discloses a kind of data sending device, comprising:
Data acquisition module, is suitable for obtaining distribute data to be allocated, and very first time node to be allocated and the second timing node;
Get module ready, be suitable for obtaining the total N of distribute data in described distribute data, random definite N mutually different timing node i between very first time node and the second timing node;
Queue storage module, is suitable for each timing node i and distribute data to carry out corresponding, and according to the order of sequence distribute data is put into data queue;
Authority analysis module, is suitable for after receiving the data acquisition request of client, according to the initiation time point of described data acquisition request and timing node i, determines whether client possesses the authority of obtaining distribute data according to described data queue;
Data transmission blocks, is suitable for possessing described authority when client, according to described data queue, obtains distribute data and sends to described client.
Optionally, described queue storage module comprises:
Attribute queue storage module, is suitable for the Authorization Attributes according to distribute data, in the data queue of affiliated Authorization Attributes, by timing node order, distribute data is deposited.
Optionally, described attribute queue storage module comprises:
The first queue storage module, is suitable for the distribute data that can repeat issued rights attribute by possessing, and by timing node order, distribute data is put into the first data queue;
The second queue storage module, is suitable for, by possessing the distribute data of not reproducible issued rights attribute, by timing node order, distribute data being put into the second data queue.
Optionally, also comprise:
Record extraction module, be suitable for after receiving the data acquisition request of client, according to described request, extract the distribute data of this client in assignment record table and obtain record;
The first authority analysis module, is suitable for having obtained when recording client the distribute data that possesses not reproducible issued rights attribute, forbids that active client obtains distribute data according to described data queue;
The second authority analysis module, is suitable for not obtaining when recording client the distribute data that possesses not reproducible issued rights attribute, allows active client to obtain distribute data according to described data queue.
Optionally, also comprise:
Complete judge module, is suitable for after receiving the data acquisition request of client, complete if the distribute data in described data queue is provided, and points out client distribute data to provide complete.
Optionally, described authority analysis module comprises:
Time point judge module, is suitable for the timing node based on the described data queue of correspondence, and the timing node i whether time point reaches or surpass is initiated in judgement;
First team's column data judge module, if be suitable for not reaching node i any time, determines that described client does not possess the authority of the distribute data of obtaining data queue;
The second queuing data judge module, if be suitable for the timing node i that reaches or surpass, determines that described client possesses the authority of the distribute data of obtaining the file leader of data queue.
Optionally, described authority analysis module also comprises:
The 3rd authority analysis module, is suitable for for client Random assignment one probability numbers, when described probability numbers does not meet threshold value requirement, forbids that this client obtains distribute data according to described data queue.
Optionally, described after receiving the data acquisition request of client, according to the initiation time point of described data acquisition request and timing node i, determine whether client possesses while obtaining the authority of distribute data according to described data queue also to comprise:
The 4th authority analysis module, is suitable for judging whether the number of times of the data acquisition request that client sends surpasses threshold value; If surpassed, forbid that this client obtains distribute data according to described data queue.
According to a kind of data transmission method for uplink of the present invention, can the total N of distribute data in described distribute data will be obtained, random definite N mutually different timing node i between very first time node and the second timing node, then each timing node i is carried out corresponding with distribute data, and according to the order of sequence distribute data is put into data queue, after receiving the data acquisition request of client, according to the initiation time point of described data acquisition request and timing node i, determine whether client possesses the authority of obtaining distribute data according to described data queue, when client possesses described authority, according to described data queue, obtain distribute data and send to described client, solved thus for system, maintain each data to be allocated, wait meets the client of preliminary requirement and extracts, system resource takies higher, affect system performance, and obtained arbitrarily by data to be distributed, which finally in system statistics distribute data, do not send, when which data has been sent, also need to travel through each distribute data, resource occupation is high, speed is slow, inefficient problem has obtained when distribute data and has maintained easily, reduce taking of system resource, improve data performance, while in the end adding up distribute data, reduce taking of system resource, improve the beneficial effect of statistical efficiency.
Above-mentioned explanation is only the general introduction of technical solution of the present invention, in order to better understand technological means of the present invention, and can be implemented according to the content of instructions, and for above and other objects of the present invention, feature and advantage can be become apparent, below especially exemplified by the specific embodiment of the present invention.
Accompanying drawing explanation
By reading below detailed description of the preferred embodiment, various other advantage and benefits will become cheer and bright for those of ordinary skills.Accompanying drawing is only for the object of preferred implementation is shown, and do not think limitation of the present invention.And in whole accompanying drawing, by identical reference symbol, represent identical parts.In the accompanying drawings:
Fig. 1 shows a kind of schematic flow sheet of data transmission method for uplink according to an embodiment of the invention;
Fig. 2 shows a kind of schematic flow sheet of data transmission method for uplink according to an embodiment of the invention;
Fig. 2 a shows the prize list example after uploading according to an embodiment of the invention;
Fig. 2 b shows and uploads according to an embodiment of the invention prize data interface example;
Fig. 3 shows a kind of structural representation of data sending device according to an embodiment of the invention;
Fig. 4 shows a kind of structural representation of data sending device according to an embodiment of the invention.
Embodiment
Exemplary embodiment of the present disclosure is described below with reference to accompanying drawings in more detail.Although shown exemplary embodiment of the present disclosure in accompanying drawing, yet should be appreciated that and can realize the disclosure and the embodiment that should do not set forth limits here with various forms.On the contrary, it is in order more thoroughly to understand the disclosure that these embodiment are provided, and can by the scope of the present disclosure complete convey to those skilled in the art.
Embodiment mono-
With reference to Fig. 1, it shows the schematic flow sheet of a kind of data transmission method for uplink of the present invention, specifically can comprise:
In embodiments of the present invention, the application scenarios of providing prize data in the network platform of take describes as example, and described distribute data can be prize data, and the present invention is not limited concrete application scenarios.
Such as the network platform is provided with N awards, technician uploads the prize data of N awards, and then the time period to be allocated is set, and this time period is determined by very first time node and the second timing node, such as 2013-9-3023:59---2013-10-300:00.
After getting prize data and very first time node time1 and the second timing node time2, obtain total number N of prize data, the random individual mutually different timing node ti(i=1 of N that selects between time1 and time2,2,3 ... N), in embodiments of the present invention, can select uniformly at random N mutually different timing node.
By the respectively corresponding timing node of N prize data, this correspondence can be corresponding at random, also can be corresponding step by step by prize grade, then the prize data of corresponding timing node are in chronological sequence sequentially deposited in data queue.In embodiments of the present invention, the sign of prize can be deposited in queue.
Preferably, describedly according to the order of sequence distribute data is put into data queue and comprises:
A12 according to the Authorization Attributes of distribute data, deposits distribute data by timing node order in the data queue of affiliated Authorization Attributes.
In practice, prize data can arrange Authorization Attributes, such as not reproducible issued rights attribute, for these prize data, server can only provide once to same client user such prize data, and same client is only to obtain one this kind prize number.Such as repeating issued rights attribute, for these prize data, server can repeat to provide to same client user, and same client is only to obtain a plurality of this kind of prize numbers.In addition, can repeat also can arrange in issued rights attribute the multiple attribute that repeats to provide, such as repeating to provide 2 times, 3 inferior, for queue of every kind of setup of attribute.
Further, according to the attribute of distribute data, in the data queue of affiliated attribute, by timing node order, distribute data is deposited and is comprised:
Steps A 22, by possessing the distribute data that can repeat issued rights attribute, puts into the first data queue by timing node order by distribute data;
Such as arranging, M1 opens reward voucher, M2 opens film ticket for can repeat issued rights, server can send a plurality of reward vouchers for same ID so, same ID also can repeated obtain reward voucher, film ticket, such prize data can be put into and can be repeated to provide queue by the sequencing of corresponding timing node i, be i.e. the first data queue.
Steps A 24, by possessing the distribute data of not reproducible issued rights attribute, puts into the second data queue by timing node order by distribute data.
Such as M3 platform mobile phone being set for can repeat issued rights, server can only send 1 reward voucher for same ID so, same ID also can only obtain 1 mobile phone, such prize data or timing node i can be put into not reproducible granting queue, i.e. the second data queue by the sequencing of corresponding timing node i.
Certainly in the application, also may there are the prize data of other Authorization Attributes, can build accordingly data queue, the prize data of corresponding authority attribute or timing node are put into corresponding data queue.
Such as user clicks prize drawing in client, client is clicked after the action of prize drawing to this, and generated data obtains request, and described data acquisition request is sent to server, server receives after described data acquisition request, can analyze the initiation time point of described data acquisition request.In embodiments of the present invention, can obtain when request using its current system time at client-side encapsulation of data in time point is encapsulated in, is resolved by server side as initiating; Also can be by server side when receiving described data acquisition request, using the time of reception as initiating time point.
Then by initiating the time point timing node corresponding with data queue, compare, judge whether client possesses the authority of obtaining distribute data according to described data queue.
Preferably, described after receiving the data acquisition request of client, according to the initiation time point of described data acquisition request and timing node i, determine whether client possesses before obtaining the authority of distribute data according to described data queue also to comprise:
Steps A 26, is client Random assignment one probability numbers, when described probability numbers does not meet threshold value requirement, forbids that this client obtains distribute data according to described data queue.
This step can be understood as the winning probability of computing client end.Such as receiving when server after prize drawing request, carry out prize drawing probability script, calculate a prize drawing probability assignments to this client user, if meet probability, allow to enter step 108.
Preferably, described after receiving the data acquisition request of client, according to the initiation time point of described data acquisition request and timing node i, determine whether client possesses while obtaining the authority of distribute data according to described data queue also to comprise:
Steps A 28, judges whether the number of times of the data acquisition request that client sends surpasses threshold value; If surpassed, forbid that this client obtains distribute data according to described data queue.
Be appreciated that this step is for user's number of times of drawing a lottery, the number of times of clicking prize drawing as user surpasses threshold value (such as 3 times), does not allow it to enter step 108, if do not surpass threshold value, allows it to enter step 108.
Preferably, described after receiving the data acquisition request of client, according to the initiation time point of described data acquisition request and timing node i, determine whether client possesses the authority of obtaining distribute data according to described data queue and comprise
Steps A 31, the timing node based on the described data queue of correspondence, the timing node i whether time point reaches or surpass is initiated in judgement;
Or queue starts to have prize data " prize 1, prize 2 ", the timing node of " t1, the t2 ... " of its correspondence from file leader.
Steps A 32, if do not reach node i any time, determines that described client does not possess the authority of the distribute data of obtaining data queue;
Such as user t0 before t1 timing node clicks prize drawing constantly, because all data in queue are all greater than t0, user cannot obtain any prize data in data queue.
Steps A 34, if a timing node i who reaches or surpass determines that described client possesses the authority of the distribute data of obtaining the file leader of data queue;
If user [t1, t2) click prize drawing in interval, judge in data queue whether also have prize before t1, in fact do not have, user can extract prize 1.
If user is at [t2, t3) interval click drawn a lottery, judge in data queue, whether t2 also has prize before, if the prize of t1 1 is not drawn, in queue, also having the prize 1 of t1, is this user assignment prize 1, if the prize of t1 is drawn, in queue, not had the prize 1 of t1, is this user assignment prize 2.
Other situations by that analogy.
In addition, also comprise:
Steps A 36, after receiving the data acquisition request of client, complete if the distribute data in described data queue is provided, point out client distribute data to provide complete.
It is complete to be that prize data all in data queue are issued, even if new client user gets the winning number in a bond and also cannot obtain prize data, server can client distribute data have been provided complete.
When judgement, this user can obtain after the prize in data queue, according to described data queue, obtains distribute data, sends to described client.Such as in data queue, store be the sign of distribute data time, according to the prize information of described marker extraction reality, send to client user.In practice, such as user has drawn reward voucher, can from tables of data, extract preferential code and send to client user; Such as user has drawn mobile phone, identifying code and prize information are sent to client client.
In embodiments of the present invention, the file leader of Ke Cong data queue starts to obtain corresponding distribute data, sends to client, then the distribute data of transmission is rejected from queue.
In embodiments of the present invention, the sign of distribute data to be allocated can be put into data queue, carry out corresponding with the data to be distributed of actual storage.When sending distribute data, according to distribute data sign, from database, extract distribute data and send to client.
The embodiment of the present invention can will be obtained the total N of distribute data in described distribute data, random definite N mutually different timing node i between very first time node and the second timing node, then each timing node i is carried out corresponding with distribute data, and according to the order of sequence distribute data is put into data queue, after receiving the data acquisition request of client, according to the initiation time point of described data acquisition request and timing node i, determine whether client possesses the authority of obtaining distribute data according to described data queue, when client possesses described authority, according to described data queue, obtain distribute data and send to described client, solved thus for system, maintain each data to be allocated, wait meets the client of preliminary requirement and extracts, system resource takies higher, affect system performance, and obtained arbitrarily by data to be distributed, which finally in system statistics distribute data, do not send, when which data has been sent, also need to travel through each distribute data, resource occupation is high, speed is slow, inefficient problem has obtained when distribute data and has maintained easily, reduce taking of system resource, improve data performance, while in the end adding up distribute data, reduce taking of system resource, improve the beneficial effect of statistical efficiency.
Embodiment bis-
With reference to Fig. 2, it shows the schematic flow sheet of a kind of data transmission method for uplink of the present invention, specifically can comprise:
As Fig. 2 a, the present invention can arrange activity time section, then the product of setting up the prize distribute the time period, such as the activity of specially offered machine anniversary activity the date is fixed for 2013-6-19 23:55 to 2013-7-6 00:00, and release date is decided to be 2013-6-22 23:55 to 2013-7-4 00:00, Time Of Release was decided to be 8 up to 22 o'clock.
In embodiments of the present invention, for the network platform, provide prize data, can first upload prize data and transmitting time.As Fig. 2 a, it is the prize list of uploading rear acquisition, altogether comprises the prize of 4 grades.In prize list, also can carry out editor and the deletion work of prize data.If Fig. 2 b is the sectional drawing of uploading prize data interface example, technician can upload data to be distributed by the interface of Fig. 2 b, the additional data that prize data refer to prize is as shown in the figure as preferential code etc., and file layout can be csv form, and line number and prize quantity equate and is corresponding one by one, maximum three fields of every row, field name is info1, info2, info3, between field, with ", ", separate; Prize contains mask in describing, as #drawdesc#, and #info1#, user can be replaced by actual information after drawing prize, returns to user.
In embodiments of the present invention, if adjusted the movable start time, random definite timing node auto-idled of start time, as long as timing node did not have, can arbitrarily readjust and provide density and Time Of Release section, can guarantee not can be multiple or leak and send out, the greatly easy work of operation.
Step 204, server obtains the total N of distribute data in described distribute data, random definite N mutually different timing node i between very first time node and the second timing node;
Data acquisition request can comprise the identity informations such as user ID, password, can comprise the initiation time point of clicking prize drawing, also can comprise current prize drawing number of times etc.
Such as the whether identity information checking such as correctly of user ID and password.
Also can notify client to fail to obtain distribute data.The present invention can notify according to actual conditions, and such as prize drawing number of times is inadequate, prize exhausts, identity information mistake etc.
The step principle that each step principle of the present embodiment and embodiment mono-introduce is similar, is not described in detail in this.
Embodiment tri-
With reference to Fig. 3, the structural representation that it shows a kind of data sending device, comprising:
Data acquisition module 302, is suitable for obtaining distribute data to be allocated, and very first time node to be allocated and the second timing node;
Get module 304 ready, be suitable for obtaining the total N of distribute data in described distribute data, random definite N mutually different timing node i between very first time node and the second timing node;
Queue storage module 306, is suitable for each timing node i and distribute data to carry out corresponding, and according to the order of sequence distribute data is put into data queue;
Authority analysis module 308, is suitable for after receiving the data acquisition request of client, according to the initiation time point of described data acquisition request and timing node i, determines whether client possesses the authority of obtaining distribute data according to described data queue;
Data transmission blocks 310, is suitable for possessing described authority when client, according to described data queue, obtains distribute data and sends to described client.
Preferably, described queue storage module comprises:
Attribute queue storage module, is suitable for the Authorization Attributes according to distribute data, in the data queue of affiliated Authorization Attributes, by timing node order, distribute data is deposited.
Preferably, described attribute queue storage module comprises:
The first queue storage module, is suitable for the distribute data that can repeat issued rights attribute by possessing, and by timing node order, distribute data is put into the first data queue;
The second queue storage module, is suitable for, by possessing the distribute data of not reproducible issued rights attribute, by timing node order, distribute data being put into the second data queue.
Preferably, also comprise:
Record extraction module, be suitable for after receiving the data acquisition request of client, according to described request, extract the distribute data of this client in assignment record table and obtain record;
The first authority analysis module, is suitable for having obtained when recording client the distribute data that possesses not reproducible issued rights attribute, forbids that active client obtains distribute data according to described data queue;
The second authority analysis module, is suitable for not obtaining when recording client the distribute data that possesses not reproducible issued rights attribute, allows active client to obtain distribute data according to described data queue.
Preferably, also comprise:
Complete judge module, is suitable for after receiving the data acquisition request of client, complete if the distribute data in described data queue is provided, and points out client distribute data to provide complete.
Preferably, described authority analysis module comprises:
Time point judge module, is suitable for the timing node based on the described data queue of correspondence, and the timing node i whether time point reaches or surpass is initiated in judgement;
First team's column data judge module, if be suitable for not reaching node i any time, determines that described client does not possess the authority of the distribute data of obtaining data queue;
The second queuing data judge module, if be suitable for the timing node i that reaches or surpass, determines that described client possesses the authority of the distribute data of obtaining the file leader of data queue.
Preferably, described authority analysis module also comprises:
The 3rd authority analysis module, is suitable for for client Random assignment one probability numbers, when described probability numbers does not meet threshold value requirement, forbids that this client obtains distribute data according to described data queue.
Preferably, described after receiving the data acquisition request of client, according to the initiation time point of described data acquisition request and timing node i, determine whether client possesses while obtaining the authority of distribute data according to described data queue also to comprise:
The 4th authority analysis module, is suitable for judging whether the number of times of the data acquisition request that client sends surpasses threshold value; If surpassed, forbid that this client obtains distribute data according to described data queue.
Embodiment tetra-
With reference to Fig. 4, the structural representation that it shows a kind of data Transmission system, comprising:
Server and client side:
Described server 400 comprises:
Data acquisition module 402, obtains distribute data to be allocated, and very first time node to be allocated and the second timing node;
Get module 404 ready, be suitable for obtaining the total N of distribute data in described distribute data, random definite N mutually different timing node i between very first time node and the second timing node;
Queue storage module 406, is suitable for each timing node i and distribute data to carry out corresponding, by possessing the distribute data that can repeat issued rights attribute, by timing node order, distribute data is put into the first data queue; By possessing the distribute data of not reproducible issued rights attribute, by timing node order, distribute data is put into the second data queue;
The first authentication module 408, is suitable for receiving described data acquisition request, and whether checking client identity is legal;
The second authentication module 410, whether the prize drawing number of times of checking client surpasses threshold value;
Time judgment module 412, is suitable for the timing node based on the described data queue of correspondence, and the timing node i whether time point reaches or surpass is initiated in judgement;
The first authority analysis module 414, if be suitable for not reaching node i any time, determines that described client does not possess the authority of the distribute data of obtaining data queue;
The second authority analysis module 416, if be suitable for the timing node i that reaches or surpass, determines that described client possesses the authority of the distribute data of obtaining the file leader of data queue;
Data transmission blocks 418, is suitable for possessing described authority when client, obtains distribute data and sends to described client, and the distribute data being sent out in queue is rejected according to described data queue.
Described client 500 comprises:
Request sending module 502, is suitable for client transmission and obtains request of data to server.
The algorithm providing at this is intrinsic not relevant to any certain computer, virtual system or miscellaneous equipment with demonstration.Various general-purpose systems also can with based on using together with this teaching.According to description above, it is apparent constructing the desired structure of this type systematic.In addition, the present invention is not also for any certain programmed language.It should be understood that and can utilize various programming languages to realize content of the present invention described here, and the description of above language-specific being done is in order to disclose preferred forms of the present invention.
In the instructions that provided herein, a large amount of details have been described.Yet, can understand, embodiments of the invention can not put into practice in the situation that there is no these details.In some instances, be not shown specifically known method, structure and technology, so that not fuzzy understanding of this description.
Similarly, be to be understood that, in order to simplify the disclosure and to help to understand one or more in each inventive aspect, in the above in the description of exemplary embodiment of the present invention, each feature of the present invention is grouped together into single embodiment, figure or sometimes in its description.Yet, the method for the disclosure should be construed to the following intention of reflection: the present invention for required protection requires than the more feature of feature of clearly recording in each claim.Or rather, as reflected in claims below, inventive aspect is to be less than all features of disclosed single embodiment above.Therefore, claims of following embodiment are incorporated to this embodiment thus clearly, and wherein each claim itself is as independent embodiment of the present invention.
Those skilled in the art are appreciated that and can the module in the equipment in embodiment are adaptively changed and they are arranged in one or more equipment different from this embodiment.Module in embodiment or unit or assembly can be combined into a module or unit or assembly, and can put them into a plurality of submodules or subelement or sub-component in addition.At least some in such feature and/or process or unit are mutually repelling, and can adopt any combination to combine all processes or the unit of disclosed all features in this instructions (comprising claim, summary and the accompanying drawing followed) and disclosed any method like this or equipment.Unless clearly statement in addition, in this instructions (comprising claim, summary and the accompanying drawing followed) disclosed each feature can be by providing identical, be equal to or the alternative features of similar object replaces.
In addition, those skilled in the art can understand, although embodiment more described herein comprise some feature rather than further feature included in other embodiment, the combination of the feature of different embodiment means within scope of the present invention and forms different embodiment.For example, in the following claims, the one of any of embodiment required for protection can be used with array mode arbitrarily.
All parts embodiment of the present invention can realize with hardware, or realizes with the software module moved on one or more processor, or realizes with their combination.It will be understood by those of skill in the art that and can use in practice microprocessor or digital signal processor (DSP) to realize the some or all functions according to the some or all parts in the data transmitting equipment of the embodiment of the present invention.The present invention for example can also be embodied as, for carrying out part or all equipment or device program (, computer program and computer program) of method as described herein.Realizing program of the present invention and can be stored on computer-readable medium like this, or can there is the form of one or more signal.Such signal can be downloaded and obtain from internet website, or provides on carrier signal, or provides with any other form.
It should be noted above-described embodiment the present invention will be described rather than limit the invention, and those skilled in the art can design alternative embodiment in the situation that do not depart from the scope of claims.In the claims, any reference symbol between bracket should be configured to limitations on claims.Word " comprises " not to be got rid of existence and is not listed as element or step in the claims.Being positioned at word " " before element or " one " does not get rid of and has a plurality of such elements.The present invention can be by means of including the hardware of some different elements and realizing by means of the computing machine of suitably programming.In having enumerated the unit claim of some devices, several in these devices can be to carry out imbody by same hardware branch.The use of word first, second and C grade does not represent any order.Can be title by these word explanations.
The invention discloses A1, a kind of data transmission method for uplink, comprising:
Obtain distribute data to be allocated, and very first time node to be allocated and the second timing node;
Obtain the total N of distribute data in described distribute data, random definite N mutually different timing node i between very first time node and the second timing node;
Each timing node i and distribute data are carried out corresponding, and according to the order of sequence distribute data is put into data queue;
After receiving the data acquisition request of client, according to the initiation time point of described data acquisition request and timing node i, determine whether client possesses the authority of obtaining distribute data according to described data queue;
When client possesses described authority, according to described data queue, obtain distribute data and send to described client.
A2, the method as described in A1, is characterized in that, describedly according to the order of sequence distribute data put into data queue and comprise:
According to the Authorization Attributes of distribute data, in the data queue of affiliated Authorization Attributes, by timing node order, distribute data is deposited.
A3, the method as described in A2, is characterized in that, according to the attribute of distribute data, in the data queue of affiliated attribute, by timing node order, distribute data deposited and comprised:
By possessing the distribute data that can repeat issued rights attribute, by timing node order, distribute data is put into the first data queue;
By possessing the distribute data of not reproducible issued rights attribute, by timing node order, distribute data is put into the second data queue.
A4, the method as described in A3, is characterized in that, also comprises:
After receiving the data acquisition request of client, according to described request, extract the distribute data of this client in assignment record table and obtain record;
When recording client, obtained the distribute data that possesses not reproducible issued rights attribute, forbidden that active client obtains distribute data according to described data queue;
When recording client, do not obtain the distribute data that possesses not reproducible issued rights attribute, allow active client to obtain distribute data according to described data queue.
A5, the method as described in A1, is characterized in that, also comprises:
After receiving the data acquisition request of client, complete if the distribute data in described data queue is provided, point out client distribute data to provide complete.
A6, the method as described in A1, it is characterized in that, described after receiving the data acquisition request of client, according to the initiation time point of described data acquisition request and timing node i, determine whether client possesses the authority of obtaining distribute data according to described data queue and comprise:
Timing node based on the described data queue of correspondence, the timing node i whether time point reaches or surpass is initiated in judgement;
If do not reach node i any time, determine that described client does not possess the authority of the distribute data of obtaining data queue;
If a timing node i who reaches or surpass, determines that described client possesses the authority of the distribute data of obtaining the file leader of data queue.
A7, as the method for A1 to A6 as described in one of them, it is characterized in that, described after receiving the data acquisition request of client, according to the initiation time point of described data acquisition request and timing node i, determine whether client possesses before obtaining the authority of distribute data according to described data queue also to comprise:
For client Random assignment one probability numbers, when described probability numbers does not meet threshold value requirement, forbid that this client obtains distribute data according to described data queue.
A8, as the method for A1 to A6 as described in one of them, it is characterized in that, described after receiving the data acquisition request of client, according to the initiation time point of described data acquisition request and timing node i, determine whether client possesses before obtaining the authority of distribute data according to described data queue also to comprise:
Whether the number of times that judges the data acquisition request that client sends surpasses threshold value; If surpassed, forbid that this client obtains distribute data according to described data queue.
The invention also discloses B9, a kind of data sending device, comprising:
Data acquisition module, is suitable for obtaining distribute data to be allocated, and very first time node to be allocated and the second timing node;
Get module ready, be suitable for obtaining the total N of distribute data in described distribute data, random definite N mutually different timing node i between very first time node and the second timing node;
Queue storage module, is suitable for each timing node i and distribute data to carry out corresponding, and according to the order of sequence distribute data is put into data queue;
Authority analysis module, is suitable for after receiving the data acquisition request of client, according to the initiation time point of described data acquisition request and timing node i, determines whether client possesses the authority of obtaining distribute data according to described data queue;
Data transmission blocks, is suitable for possessing described authority when client, according to described data queue, obtains distribute data and sends to described client.
B10, the device as described in B9, is characterized in that, described queue storage module comprises:
Attribute queue storage module, is suitable for the Authorization Attributes according to distribute data, in the data queue of affiliated Authorization Attributes, by timing node order, distribute data is deposited.
B11, the device as described in B10, is characterized in that, described attribute queue storage module comprises:
The first queue storage module, is suitable for the distribute data that can repeat issued rights attribute by possessing, and by timing node order, distribute data is put into the first data queue;
The second queue storage module, is suitable for, by possessing the distribute data of not reproducible issued rights attribute, by timing node order, distribute data being put into the second data queue.
B12, the device as described in B11, is characterized in that, also comprises:
Record extraction module, be suitable for after receiving the data acquisition request of client, according to described request, extract the distribute data of this client in assignment record table and obtain record;
The first authority analysis module, is suitable for having obtained when recording client the distribute data that possesses not reproducible issued rights attribute, forbids that active client obtains distribute data according to described data queue;
The second authority analysis module, is suitable for not obtaining when recording client the distribute data that possesses not reproducible issued rights attribute, allows active client to obtain distribute data according to described data queue.
B13, the device as described in B9, is characterized in that, also comprises:
Complete judge module, is suitable for after receiving the data acquisition request of client, complete if the distribute data in described data queue is provided, and points out client distribute data to provide complete.
B14, the device as described in B9, is characterized in that, described authority analysis module comprises:
Time point judge module, is suitable for the timing node based on the described data queue of correspondence, and the timing node i whether time point reaches or surpass is initiated in judgement;
First team's column data judge module, if be suitable for not reaching node i any time, determines that described client does not possess the authority of the distribute data of obtaining data queue;
The second queuing data judge module, if be suitable for the timing node i that reaches or surpass, determines that described client possesses the authority of the distribute data of obtaining the file leader of data queue.
B15, as the device of B9 to B14 as described in one of them, it is characterized in that, described authority analysis module also comprises:
The 3rd authority analysis module, is suitable for for client Random assignment one probability numbers, when described probability numbers does not meet threshold value requirement, forbids that this client obtains distribute data according to described data queue.
B16, as the device of B9 to B14 as described in one of them, it is characterized in that, described after receiving the data acquisition request of client, according to the initiation time point of described data acquisition request and timing node i, determine whether client possesses while obtaining the authority of distribute data according to described data queue also to comprise:
The 4th authority analysis module, is suitable for judging whether the number of times of the data acquisition request that client sends surpasses threshold value; If surpassed, forbid that this client obtains distribute data according to described data queue.
Claims (10)
1. a data transmission method for uplink, comprising:
Obtain distribute data to be allocated, and very first time node to be allocated and the second timing node;
Obtain the total N of distribute data in described distribute data, random definite N mutually different timing node i between very first time node and the second timing node;
Each timing node i and distribute data are carried out corresponding, and according to the order of sequence distribute data is put into data queue;
After receiving the data acquisition request of client, according to the initiation time point of described data acquisition request and timing node i, determine whether client possesses the authority of obtaining distribute data according to described data queue;
When client possesses described authority, according to described data queue, obtain distribute data and send to described client.
2. the method for claim 1, is characterized in that, describedly according to the order of sequence distribute data is put into data queue and comprises:
According to the Authorization Attributes of distribute data, in the data queue of affiliated Authorization Attributes, by timing node order, distribute data is deposited.
3. method as claimed in claim 2, is characterized in that, according to the attribute of distribute data, in the data queue of affiliated attribute, by timing node order, distribute data is deposited and is comprised:
By possessing the distribute data that can repeat issued rights attribute, by timing node order, distribute data is put into the first data queue;
By possessing the distribute data of not reproducible issued rights attribute, by timing node order, distribute data is put into the second data queue.
4. method as claimed in claim 3, is characterized in that, also comprises:
After receiving the data acquisition request of client, according to described request, extract the distribute data of this client in assignment record table and obtain record;
When recording client, obtained the distribute data that possesses not reproducible issued rights attribute, forbidden that active client obtains distribute data according to described data queue;
When recording client, do not obtain the distribute data that possesses not reproducible issued rights attribute, allow active client to obtain distribute data according to described data queue.
5. the method for claim 1, is characterized in that, also comprises:
After receiving the data acquisition request of client, complete if the distribute data in described data queue is provided, point out client distribute data to provide complete.
6. the method for claim 1, it is characterized in that, described after receiving the data acquisition request of client, according to the initiation time point of described data acquisition request and timing node i, determine whether client possesses the authority of obtaining distribute data according to described data queue and comprise:
Timing node based on the described data queue of correspondence, the timing node i whether time point reaches or surpass is initiated in judgement;
If do not reach node i any time, determine that described client does not possess the authority of the distribute data of obtaining data queue;
If a timing node i who reaches or surpass, determines that described client possesses the authority of the distribute data of obtaining the file leader of data queue.
7. a data sending device, comprising:
Data acquisition module, is suitable for obtaining distribute data to be allocated, and very first time node to be allocated and the second timing node;
Get module ready, be suitable for obtaining the total N of distribute data in described distribute data, random definite N mutually different timing node i between very first time node and the second timing node;
Queue storage module, is suitable for each timing node i and distribute data to carry out corresponding, and according to the order of sequence distribute data is put into data queue;
Authority analysis module, is suitable for after receiving the data acquisition request of client, according to the initiation time point of described data acquisition request and timing node i, determines whether client possesses the authority of obtaining distribute data according to described data queue;
Data transmission blocks, is suitable for possessing described authority when client, according to described data queue, obtains distribute data and sends to described client.
8. device as claimed in claim 7, is characterized in that, described queue storage module comprises:
Attribute queue storage module, is suitable for the Authorization Attributes according to distribute data, in the data queue of affiliated Authorization Attributes, by timing node order, distribute data is deposited.
9. device as claimed in claim 8, is characterized in that, described attribute queue storage module comprises:
The first queue storage module, is suitable for the distribute data that can repeat issued rights attribute by possessing, and by timing node order, distribute data is put into the first data queue;
The second queue storage module, is suitable for, by possessing the distribute data of not reproducible issued rights attribute, by timing node order, distribute data being put into the second data queue.
10. device as claimed in claim 9, is characterized in that, also comprises:
Record extraction module, be suitable for after receiving the data acquisition request of client, according to described request, extract the distribute data of this client in assignment record table and obtain record;
The first authority analysis module, is suitable for having obtained when recording client the distribute data that possesses not reproducible issued rights attribute, forbids that active client obtains distribute data according to described data queue;
The second authority analysis module, is suitable for not obtaining when recording client the distribute data that possesses not reproducible issued rights attribute, allows active client to obtain distribute data according to described data queue.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310632777.5A CN103713895B (en) | 2013-11-29 | 2013-11-29 | A kind of data transmission method for uplink and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310632777.5A CN103713895B (en) | 2013-11-29 | 2013-11-29 | A kind of data transmission method for uplink and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN103713895A true CN103713895A (en) | 2014-04-09 |
| CN103713895B CN103713895B (en) | 2017-12-05 |
Family
ID=50406902
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201310632777.5A Active CN103713895B (en) | 2013-11-29 | 2013-11-29 | A kind of data transmission method for uplink and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103713895B (en) |
Cited By (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104966205A (en) * | 2014-12-15 | 2015-10-07 | 深圳市腾讯计算机系统有限公司 | Object draw-off method and apparatus |
| CN106302710A (en) * | 2016-08-12 | 2017-01-04 | 广州华多网络科技有限公司 | Application processing method and system |
| CN107046564A (en) * | 2017-01-19 | 2017-08-15 | 腾讯科技（深圳）有限公司 | A kind of data decimation method and relevant apparatus |
| CN107124619A (en) * | 2017-04-28 | 2017-09-01 | 暴风集团股份有限公司 | User interaction method and interaction platform in a kind of net cast |
| CN108833505A (en) * | 2018-05-31 | 2018-11-16 | 康键信息技术（深圳）有限公司 | Data request processing method, server and storage medium |
| CN109033391A (en) * | 2018-07-31 | 2018-12-18 | 北京嘀嘀无限科技发展有限公司 | Method of data synchronization, system and computer readable storage medium between a kind of multiple data centers |
| CN109101344A (en) * | 2018-06-29 | 2018-12-28 | 上海瀚之友信息技术服务有限公司 | A kind of data distributing method |
| CN112215637A (en) * | 2020-09-21 | 2021-01-12 | 建信金融科技有限责任公司 | Virtual asset processing method and device, electronic equipment and storage medium |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20050119046A1 (en) * | 2003-10-28 | 2005-06-02 | Aruze Corp. | Game system and gaming management method |
| CN102063678A (en) * | 2011-01-05 | 2011-05-18 | 北京凯铭风尚网络技术有限公司 | Method and device for distributing gifts to net friends on line |
| CN102254379A (en) * | 2010-05-20 | 2011-11-23 | 中国银联股份有限公司 | Bill receiving platform, bill receiving terminal system, and bank card consumption transaction system and use thereof |
| CN103019649A (en) * | 2012-11-29 | 2013-04-03 | 北京奇虎科技有限公司 | Information providing method and device |
| CN103049860A (en) * | 2011-10-17 | 2013-04-17 | 成都蓉奥科技有限公司 | Presentation popularizing method based on social game |
| CN103078843A (en) * | 2012-12-13 | 2013-05-01 | 中国电子科技集团公司第十五研究所 | Method and device for mass data sharing of multistage deployment system |
-
2013
- 2013-11-29 CN CN201310632777.5A patent/CN103713895B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20050119046A1 (en) * | 2003-10-28 | 2005-06-02 | Aruze Corp. | Game system and gaming management method |
| CN102254379A (en) * | 2010-05-20 | 2011-11-23 | 中国银联股份有限公司 | Bill receiving platform, bill receiving terminal system, and bank card consumption transaction system and use thereof |
| CN102063678A (en) * | 2011-01-05 | 2011-05-18 | 北京凯铭风尚网络技术有限公司 | Method and device for distributing gifts to net friends on line |
| CN103049860A (en) * | 2011-10-17 | 2013-04-17 | 成都蓉奥科技有限公司 | Presentation popularizing method based on social game |
| CN103019649A (en) * | 2012-11-29 | 2013-04-03 | 北京奇虎科技有限公司 | Information providing method and device |
| CN103078843A (en) * | 2012-12-13 | 2013-05-01 | 中国电子科技集团公司第十五研究所 | Method and device for mass data sharing of multistage deployment system |
Cited By (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104966205A (en) * | 2014-12-15 | 2015-10-07 | 深圳市腾讯计算机系统有限公司 | Object draw-off method and apparatus |
| CN106302710A (en) * | 2016-08-12 | 2017-01-04 | 广州华多网络科技有限公司 | Application processing method and system |
| CN106302710B (en) * | 2016-08-12 | 2019-05-07 | 广州华多网络科技有限公司 | Application processing method and system |
| CN107046564A (en) * | 2017-01-19 | 2017-08-15 | 腾讯科技（深圳）有限公司 | A kind of data decimation method and relevant apparatus |
| CN107124619A (en) * | 2017-04-28 | 2017-09-01 | 暴风集团股份有限公司 | User interaction method and interaction platform in a kind of net cast |
| CN108833505A (en) * | 2018-05-31 | 2018-11-16 | 康键信息技术（深圳）有限公司 | Data request processing method, server and storage medium |
| CN109101344A (en) * | 2018-06-29 | 2018-12-28 | 上海瀚之友信息技术服务有限公司 | A kind of data distributing method |
| CN109033391A (en) * | 2018-07-31 | 2018-12-18 | 北京嘀嘀无限科技发展有限公司 | Method of data synchronization, system and computer readable storage medium between a kind of multiple data centers |
| CN112215637A (en) * | 2020-09-21 | 2021-01-12 | 建信金融科技有限责任公司 | Virtual asset processing method and device, electronic equipment and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN103713895B (en) | 2017-12-05 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103713895A (en) | Data sending method and device | |
| Aliapoulios et al. | An early look at the parler online social network | |
| CN104065565B (en) | The method of PUSH message, server, client terminal device and system | |
| CN103647800A (en) | Method and system of recommending application resources | |
| Scellato et al. | Measuring user activity on an online location-based social network | |
| CN104125203A (en) | Permission management method and system | |
| CN104392535A (en) | Method and device for voting in group | |
| US20190087858A1 (en) | Systems and methods for leveraging social queuing to identify and prevent ticket purchaser simulation | |
| CN103618717A (en) | Multi-account client information dynamic authentication method, device and system | |
| CN102868726A (en) | Method and system for publishing Internet information | |
| US20160232459A1 (en) | Systems and methods for leveraging social queuing to facilitate event ticket distribution | |
| CN110233741B (en) | Service charging method, device, equipment and storage medium | |
| CN110544134A (en) | resource processing method and device and computer storage medium | |
| CN109542395A (en) | Lottery information determines method, apparatus, equipment and storage medium | |
| CN107465593B (en) | Electronic resource transfer method and device | |
| CN107357885A (en) | Method for writing data and device, electronic equipment, computer-readable storage medium | |
| CN109150757B (en) | Advertisement resource processing method and device and electronic equipment | |
| CN102315955A (en) | Control method for setting obstruction for junk information and corresponding control device | |
| CN111625348A (en) | Task allocation method, device, server and storage medium | |
| US20140164270A1 (en) | Method, system and computer readable medium for recommending medium users | |
| US20160203512A1 (en) | Systems and methods for leveraging social queuing to simulate ticket purchaser behavior | |
| KR20130091391A (en) | Server and method for recommending contents, and recording medium storing program for executing method of the same in computer | |
| US20230388120A1 (en) | Client-Side Device Bloom Filter Mapping | |
| CN113626509A (en) | Data access method and device, electronic equipment and readable storage medium | |
| CN109982143B (en) | Method, device, medium and equipment for determining video playing time delay |
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 | ||
| TR01 | Transfer of patent right | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20220729 Address after: Room 801, 8th floor, No. 104, floors 1-19, building 2, yard 6, Jiuxianqiao Road, Chaoyang District, Beijing 100015 Patentee after: BEIJING QIHOO TECHNOLOGY Co.,Ltd. Address before: 100088 room 112, block D, 28 new street, new street, Xicheng District, Beijing (Desheng Park) Patentee before: BEIJING QIHOO TECHNOLOGY Co.,Ltd. Patentee before: Qizhi software (Beijing) Co.,Ltd. |