CN108428144A - Flow allocation method, service distribution method and the device of pushed information order - Google Patents

Flow allocation method, service distribution method and the device of pushed information order Download PDF

Info

Publication number
CN108428144A
CN108428144A CN201710080661.3A CN201710080661A CN108428144A CN 108428144 A CN108428144 A CN 108428144A CN 201710080661 A CN201710080661 A CN 201710080661A CN 108428144 A CN108428144 A CN 108428144A
Authority
CN
China
Prior art keywords
order
supply node
assignment
flow
ratio
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
Application number
CN201710080661.3A
Other languages
Chinese (zh)
Other versions
CN108428144B (en
Inventor
刘磊
陈戈
徐澜
江志
金伟
张弘
赵鹏昊
黄伟
黄东波
姜磊
朱思宇
谷俊青
游乐
魏望
洪福兴
陈怡然
李世强
江进
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Tencent Technology Beijing Co Ltd
Original Assignee
Tencent Technology Beijing Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Tencent Technology Beijing Co Ltd filed Critical Tencent Technology Beijing Co Ltd
Priority to CN201710080661.3A priority Critical patent/CN108428144B/en
Priority to PCT/CN2018/076226 priority patent/WO2018149371A1/en
Publication of CN108428144A publication Critical patent/CN108428144A/en
Application granted granted Critical
Publication of CN108428144B publication Critical patent/CN108428144B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q30/00Commerce
    • G06Q30/02Marketing; Price estimation or determination; Fundraising
    • G06Q30/0241Advertisements
    • G06Q30/0242Determining effectiveness of advertisements
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q30/00Commerce
    • G06Q30/02Marketing; Price estimation or determination; Fundraising
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q30/00Commerce
    • G06Q30/02Marketing; Price estimation or determination; Fundraising
    • G06Q30/0241Advertisements
    • G06Q30/0251Targeted advertisements
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q30/00Commerce
    • G06Q30/02Marketing; Price estimation or determination; Fundraising
    • G06Q30/0241Advertisements
    • G06Q30/0277Online advertisement

Abstract

This application discloses a kind of flow allocation methods of pushed information order, including:Obtain the information of each order comprising directed information and the frequency requirement of order;For each order, each supply node being consistent with the directed information of the order is determined, and determined in the case where the frequency for meeting the order requires, wherein expectation assignment of traffic ratio of each supply node for the order;For any order, the expectation assignment of traffic ratio of each supply node being consistent according to the directed information with the order for the order, it determines in the case where meeting frequency requirement and the flow supply and demand constraints of the order, the assignment of traffic ratio that for push server menu uses of each supply node being consistent for the order.Disclosed herein as well is a kind of service distribution method of pushed information order and corresponding devices.Keep information push more reasonable using these technical solutions.

Description

Flow allocation method, service distribution method and the device of pushed information order
Technical field
This application involves Internet technical field more particularly to a kind of flow allocation method of pushed information order, services Distribution method and device.
Background technology
With the development of Internet technology, more and more data (including:Text, picture, audio, video etc.) it can pass through Internet is pushed to various users.Such as:User can receive network when browsing webpage using terminal devices such as mobile phone, PC The various data of side push, such as:Advertisement, public good advertisement information, news of picture or video format etc..In this way, user can be with News, interested content etc. when knowing in time.This kind of data are referred to alternatively as pushed information or push media content etc..
Invention content
This application provides a kind of flow allocation methods of pushed information order, including:
The information of each order is obtained, described information includes directed information and the frequency requirement of order;
For each order, each supply node being consistent with the directed information of the order is determined, and determination is meeting In the case that the frequency of the order requires, wherein expectation assignment of traffic ratio of each supply node for the order;
For any order, each supply node being consistent according to the directed information with the order is for the order The expectation assignment of traffic ratio is determined and is required in the frequency for meeting the order and the case where flow supply and demand constraints Under, the assignment of traffic ratio that for push server menu uses of each supply node being consistent for the order.
Present invention also provides a kind of service distribution methods of pushed information order, including:
The information push request that user sends is received,
Determine the supply node to match with the user;
Determine multiple orders that orientation is consistent with the supply node;
It receives flow allocation unit and obtains each order in the multiple order according to flow allocation method above-mentioned Assignment of traffic ratio;
The assignment of traffic ratio is provided to push server, so that the push server is according to the distribution ratio of liquid flow Example carries out menu processing.
Present invention also provides a kind of flow distribution devices of pushed information order, including:
Order information acquiring unit, the information for obtaining each order, described information include the directed information and frequency of order Secondary requirement;
It is expected that assignment of traffic ratio determination unit determines the directed information with the order for being directed to each order Each supply node being consistent, and determine in the case where the frequency for meeting the order requires, wherein each supply node pair In the expectation assignment of traffic ratio of the order;
Assignment of traffic ratio determination unit, for for any order, being consistent according to the directed information with the order Each supply node for the order the expectation assignment of traffic ratio, determine meet the order the frequency requirement And in the case of flow supply and demand constraints, each supply node being consistent selects the order for push server The assignment of traffic ratio singly used.
Present invention also provides a kind of service distributors of pushed information order, including:
Information pushes request reception unit, and the information for receiving user's transmission pushes request,
Node determination unit is supplied, for determining the supply node to match with the user;
Order determination unit, the multiple orders being consistent with the supply node for determining orientation;
Assignment of traffic ratio acquiring unit, for receiving flow allocation unit assignment of traffic described in accordance with the claim 1 Method obtains the assignment of traffic ratio of each order in the multiple order;
Assignment of traffic ratio provides unit, for providing the assignment of traffic ratio to push server, so that described push away Server is sent to carry out menu processing according to the assignment of traffic ratio.
Using said program provided by the present application, it is contemplated that the assignment of traffic ratio under the conditions of frequency control can be suitable for having The pushed information order that the frequency requires so that the order dispensing under the conditions of frequency is controlled is more reasonable.
Description of the drawings
In order to more clearly explain the embodiment of the invention or the technical proposal in the existing technology, to embodiment or will show below There is attached drawing needed in technology description to be briefly described, it should be apparent that, the accompanying drawings in the following description is only this Some embodiments of invention without having to pay creative labor, may be used also for those of ordinary skill in the art With obtain other attached drawings according to these attached drawings.
Fig. 1 is the system architecture figure that present application example is related to;
Fig. 2 shows the relationships between supply node and demand nodes;
Fig. 3 is the flow allocation method flow chart of pushed information order in one example of the application;
Fig. 4 is that order it is expected that assignment of traffic ratio obtains flow chart in one example of the application;
Fig. 5 is that assignment of traffic ratio flow chart is determined in one example of the application;
Fig. 6 is to calculate to preserve constraint of demand parameter flow chart in one example of the application;
Fig. 7 is the service distribution method flow chart of pushed information order in one example of the application;
Fig. 8 is to obtain alternative order flow chart in one example of the application;
Fig. 9 is the flow distribution device schematic diagram of the pushed information order in one example of the application;
Figure 10 is the service distributor schematic diagram of the pushed information order in one example of the application;And
Figure 11 is the computing device composed structure schematic diagram in present application example.
Specific implementation mode
Following will be combined with the drawings in the embodiments of the present invention, and technical solution in the embodiment of the present invention carries out clear, complete Site preparation describes, it is clear that described embodiment is only a part of the embodiment of the present invention, instead of all the embodiments.Based on this Embodiment in invention, every other reality obtained by those of ordinary skill in the art without making creative efforts Example is applied, shall fall within the protection scope of the present invention.
In information advancing technique Internet-based, the displaying service of online pushed information (such as online advertisement Displaying) it can be realized by the order that flow (exposing quantity) ensures.Wherein, it is responsible for the media side of displaying pushed information (Publisher, also referred to as supplier) ensures that the order that meets of predetermined quantity is determined to party in request (such as advertiser Advertiser) Exposure to (targeting predicates).Here, so-called to orient the target for describing the corresponding pushed information of the order Audient's feature, primary displaying of the pushed information to user are referred to as single exposure.The stage is pushed in information, is needed based on current Flow estimation results come select prepare expose order and determine to it is each prepare exposure Order splitting how many light exposure.Example Such as:Most crucial problem is how to distribute in Cost Per Mille (CPM, Cost Per Impressions) contract advertisement system For the advertisement exposure sold, i.e., under estimating flow what is given to one group of order with contract amount and audient's orientation constraint, Constraint is oriented according to its audient to each order and demand distributes ad traffic so that the not exposed or whole of all orders lacks Amount is minimum.
Fig. 1 is the system architecture figure that present application example is related to.As shown in Figure 1, the system includes at least:Flow estimates module 101, assignment of traffic module 102, push server 103 and data module 104.
In internet, each user accesses number of site using client, such as:Browsing webpage or viewing regard online Frequency etc., push server 103 (such as:Advertisement Server for launching Internet advertising) can be collected into currently have which use Family has accessed which page (URL), and then determines and need which user's pushed information thereto and push which type of information. The user that push server 103 can be directed to current access network generates each information push request (such as exposure request) and return to pair It using the client at family, and passes to data module 104 and is preserved as history exposure data, while can also be transmitted to assignment of traffic Module 102 can also be pushed request based on these information and update the current reservation amount of each order, and by the newest predetermined amount of each order Pass to assignment of traffic module 102.
Flow is estimated module 101 and can be estimated to flow according to the history exposure data obtained from data module 104 The flow estimated, assignment of traffic module 102 are oriented according to the exposure request from push server 103 of reception The supply node being consistent with the exposure request, and then determine the order that orientation is consistent with the supply node, while receiving and coming from Flow estimates the flow of module 101 estimated, and calculates the assignment of traffic ratio of the above order, and the assignment of traffic ratio is sent out Push server 103 is given, push server 103 can carry out menu processing, base according to assignment of traffic ratio to these orders In menu result can provide information push service (such as:Advertisement Server can be pushed according to menu result to each user Corresponding advertisement, or determine the order that do not choose without giving user's advertisement).
In some instances, flow estimates module 101 and assignment of traffic module 102 based on a kind of inventory model to estimate stream It measures and completes assignment of traffic.This inventory model describe each supply node (supply node) and its it is corresponding estimate flow, Wherein, a supply node (an also referred to as flow cell) can be the exposure under a corresponding stereotactic conditions, the supply section The corresponding flow of estimating of point is to estimate light exposure under the corresponding stereotactic conditions of supply node, and supplying the various information of node is (can be obtained by statistics or be estimated by algorithm) determined according to history exposure data.In addition, an order also can be by One demand nodes (demand node) characterizes, a demand nodes correspond to the order orientation and demand (i.e. this is ordered Single reservation amount).
Fig. 2 shows the relationships between supply node and demand nodes.Wherein, supply node has 6, they have respective Directed information and quantity in stock (also referred to as estimating flow), demand nodes have it is N number of, they have it is respective orientation and demand ( Claim the flow reservation amount of order).Such as:The directed information (also referred to as user's dimensional information) for supplying node 1 is { Beijing, body Educate, the user that sports channel is accessed from Pekinese is represented, corresponding flow of estimating is 8M, and representing has this orientation letter (the chance for exposure quantity counted according to history exposure data, also referred to as exposes user's access times of breath { Beijing, sport } Quantity) it is 8M.Demand nodes 1 are orientated { sport }, represent the user for accessing sports channel, and corresponding reservation amount is 15M, It represents and wishes to ensure that the number that corresponding order is exposed to the user for accessing sports channel as 15M.As shown in Fig. 2, connecting for having Any of line is consistent to supply node and demand nodes, the directed information of the supply node with the orientation of demand nodes, Ke Yikao Consider to the corresponding user of the supply node and exposes the corresponding order of the demand nodes.About specifically how by it is each supply node stream Amount distributes to each demand nodes, and the orientation constraint and the requirement of reservation amount of energy meet demand node are asked in information push Topic.
In some instances, the distribution of flow is carried out by the assignment of traffic scheme based on optimal model, but it is simultaneously Frequency control is not considered, can not directly apply to the push of the information push order of frequency requirement.In other examples, profit Assignment of traffic is carried out than model with the frequency, is only applied to heuritic approach HWM models, flow point is carried out than module using the frequency The allocation result matched is not optimal.
Based on above-mentioned technical problem, the application proposes that a kind of flow allocation method of pushed information order, this method can answer For assignment of traffic module 102.In one example, as shown in figure 3, this approach includes the following steps:
Step 301:The information of each order is obtained, described information includes directed information and the frequency requirement of order.
When party in request reaches an order with media side (also referred to as supplier), there are media side and party in request described in the order The target audience's feature appointed, the i.e. directed information of the order.Party in request can also make a reservation for an order with media side simultaneously Exposure quantity is arranged.Such as order is orientated { sport }, represents the user for accessing sports channel, corresponding reservation amount For 15M, represents and wish to ensure that the number that corresponding order is exposed to the user for accessing sports channel as 15M.In the information of order also Include requirement of the order to the frequency, i.e. each user of the order requirements watches the number of the order within the set time.In addition Further include in the information of order the order importance and the order for fail exposure flow fine unit price.
Step 302:For each order, each supply node being consistent with the directed information of the order is determined, and really In the case of being scheduled on the frequency requirement for meeting the order, wherein expectation assignment of traffic of each supply node for the order Ratio.
For each order, each supply node being consistent with the directed information of the order is determined.Such as in Fig. 2 In, for being orientated the order of { sport }, the supply node being consistent with the directed information of the order is supply node 1,2,3.Together When calculate directed information be consistent with the order respectively supply the corresponding order of node expectation assignment of traffic ratio, it is expected that flow Allocation proportion is obtained by the flow reservation amount and the order of the order in each utilizable flow supplied at node.I.e. The predetermined amount of order is evenly distributed on utilizable flow, however in actual assignment of traffic, each supply and demand node will also meet Some constraintss, there is any discrepancy with the expectation distribution ratio of liquid flow regular meeting for actual assignment of traffic ratio, it may be desirable to actual stream The deviation of amount allocation proportion and expectation assignment of traffic ratio reaches minimum.The utilizable flow is the frequency requirement for considering order Afterwards, it respectively can be used to show the flow of the order at supply node.
Step 303:For any order, each supply node for being consistent according to the directed information with the order for The expectation assignment of traffic ratio of the order determines and constrains item in the frequency requirement and flow supply and demand for meeting the order In the case of part, the distribution ratio of liquid flow that for push server menu uses of each supply node being consistent for the order Example.
In the actual flow allocation proportion for determining order, need to consider that demand constraint, supply constraint, frequency are controlled Constraints and Condition of Non-Negative Constrains solve and desired assignment of traffic ratio in the case where meeting these constraintss Deviation reaches the assignment of traffic ratio under minimum.
Using the flow allocation method of pushed information order provided by the present application, flow is estimated based on supply node, is asked Solution considers the assignment of traffic ratio under the conditions of frequency control, the pushed information order that can be suitable for having frequency control to require so that control item frequently It is more reasonable that order under part is launched, and reduces the benefit dose rate of order.
In some instances, the supply node corresponds to user's dimension or dimension combination, or a corresponding user, When the supply node correspond to a user when, determine the order assignment of traffic ratio be a user for the order Assignment of traffic ratio;When the supply node corresponds to user's dimension or dimension combines, the stream of the order determined It is the assignment of traffic ratio of user's dimension or dimension combination for the order to measure allocation proportion.
When supplying node one user's dimension of correspondence or dimension combines, the flow supplied at node is identical orientation condition Under all users flow, in this way with all users under stereotactic conditions, no matter access times how much, all use same flow Allocation proportion, there are some problems for the assignment of traffic scheme being achieved in that, for example, the frequency of order is limited to 3, then right For the user that an access times are 10, assignment of traffic ratio should be 0.3, and (i.e. 30% exposure can be used for showing that this is ordered It is single), and for an access times are 3 or less users, frequency ratio should be 1, however if both users are in Under the same stereotactic conditions, they can use a common assignment of traffic ratio, such as 0.5, this is for two kinds of users Obviously all it is inappropriate.When supplying node one user of correspondence, assignment of traffic can obtain the flow based on user class Allocation proportion is a more reasonably assignment of traffic ratio.
In some instances, in above-mentioned steps 302, the determination is being executed in the frequency requirement for meeting the order In the case of, wherein it is each supply node for the order expectation assignment of traffic ratio when, as shown in figure 4, may include with Lower step:
Step 401:The frequency ratio for requiring to determine each supply node for the order according to the frequency of the order.
It is required to obtain each frequency ratio for supplying node for the order for orienting and being consistent with the order according to the frequency of order, The frequency can be used for described order than being characterized in meet in the flow that corresponding supply node provides in the case that the frequency requires Single flow accounting.
Step 402:According to each supply node for the frequency ratio of the order, determine each supply node for this The utilizable flow that order provides.
As soon as after frequency limitation is designated in an order, the utilizable flow for meeting its orientation only has part available.It lifts For example, if demands of the order j to frequency control were n days k times, it is more for access times in n days, more than k times For user, the access times within only k times are only the utilizable flow of order j.By it is each supply node estimate flow with it is right The frequency answered than obtained after multiplication it is each supply node at utilizable flow, by it is each supply node at utilizable flow sum it up to get To the utilizable flow of the order.
Step 403:For each supply node, subscribed than the flow of the, order according to the utilizable flow, the frequency Amount and the supply node estimate flow, determine expectation assignment of traffic ratio of the supply node for the order.
It is as described above, it is expected that assignment of traffic ratio is desirable to the predetermined amount of order being evenly distributed on utilizable flow, It can be obtained by the ratio of the utilizable flow of the flow reservation amount and order of the order.
In some instances, the corresponding utilizable flow S of order jj' the available stream determined by following formula (1) Amount is:
Sj'=∑i∈Γ(j)min{si,si×fij} (1)
Supply the expectation assignment of traffic ratio t of the node i for order jijIt is determined by following formula (2):
Wherein, siFlow, f are estimated for supply node iijBe supply node i for order j frequency ratio, Γ (j) be with The set that each supply node that the directed information of order j is consistent is constituted, djFor the flow reservation amount of order j.
In some instances, in above-mentioned steps 303, supply node i uses order j for push server menu Assignment of traffic ratio xijIt is determined by the model of following formula (3) expression
I.e. calculating actual flow allocation proportion deviates with desired assignment of traffic ratio and order is not launched flow punishment and reached Actual flow allocation proportion in the case of minimum.
Wherein, shown in the flow supply and demand constraints such as following formula (4)~(6):
Demand constraint:
Supply constraint:
Frequency control constraints:
Wherein, siFlow, V are estimated for supply node ijFor the importance of order j, tijIt is to supply node i for order j Expectation assignment of traffic ratio, μjFlow, p are not launched for order jjNot launch the punishment unit price of flow, J is order set, djFor the flow reservation amount of order j, fijIt is to supply node i for the frequency ratio of order j, the frequency ratio, which is characterized in, meets order The frequency of j supplies the flow accounting that can be used for order j in the flow that node i provides in the case of requiring, Γ (j) is and order j The set that constitutes of each supply node for being consistent of directed information, Γ (i) is each order being consistent with the directed information of supply node i The set of composition.
In addition can also include Condition of Non-Negative Constrains in assignment of traffic model, such as following formula (7) and (8):
In some instances, a supply node determines the frequency ratio of an order in the following manner:
When the supply node corresponds to a user, the frequency of the order is required into the flow of estimating with the supply node Ratio is as the supply node for the frequency ratio of the order.
When the supply node corresponds to user's dimension or dimension combines, required according to the frequency of the order, the order History exposure data statistics obtain the supply node for the order frequency ratio.
In some instances, the assignment of traffic ratio x that for push server menu uses of the supply node i for order jij It is determined by following formula (9):
Wherein, αjFor the constrained parameters corresponding to demand constraint of order j, βiCorrespond to supply for supply node i The constrained parameters of constraints, fijIt is to supply node i for the frequency ratio of order j, siFlow, V are estimated for supply nodejFor The importance of order j, tijIt is the expectation assignment of traffic ratio for supplying node i for order j.
The distribution ratio of liquid flow for calculating order is obtained by above-mentioned assignment of traffic model (3) and constraints (4), (5), (6) Example formula (9).Specifically, α is enabledjIndicate constraint of demand parameter, also referred to as demand antithesis, βiIndicate supply constraint, also referred to as Supply antithesis, γijIndicate xijNonnegativity restrictions parameter, also referred to as xijNon-negative antithesis, ψjIndicate μjNonnegativity restrictions parameter, Referred to as μjNon-negative antithesis, ηijFrequency control constrained parameters, also referred to as frequency control antithesis are indicated, then according to KKT (Karush-Kuhn- Tucker) condition, xijCorresponding stability condition (stationarity) such as following formula (10):
γijAnd ηijCorresponding complementary slackness condition such as following formula (11) and (12):
γijAnd ηijAntithesis feasible condition be following formula (13):
γij≥0,ηij≥0 (13)
According to xijCorresponding stability condition, i.e. formula (10) can obtain following formula (14):
And then according to ηijCorresponding complementary slackness condition, i.e. formula (12), otherwise obtain meeting following formula (15) or Meet following formula (16):
xij=fij (15)
Constraints is controlled according to frequency, i.e. formula (6) obtains formula (17):
xij≤fij (17)
Therefore when the right of formula (16) is more than fijWhen, ηijIt will increase so that xij=fij, thus obtain formula (18):
γ is eliminated with similar methodijObtain above-mentioned formula (9):
It enables
It can obtain formula (20)
xij=hijji) (20)
To obtain constraint of demand parameter alphajAnd supply constrained parameters βiAfterwards, you can the stream of order is calculated according to formula (20) Measure allocation proportion.
Constraint of demand parameter alphajComplementary slackness condition be formula (21):
For all j, 0≤αj≤pj, and or αj=pjOr ∑i∈Γ(j)sixij=dj (21)
Supply constrained parameters βiComplementary slackness condition be formula (22):
For all i, βi>=0, and or βi=0 or ∑j∈Γ(i)xij=1 (22)
In some instances, assignment of traffic ratio x is determined by the formula (20) described in executingijWhen, such as Fig. 5 institutes Show, mainly includes the following steps that:
Step 501:In off-line phase, the α of each order j is calculatedjWith the β of each supply node ii, and preserve each αj
In off-line phase, the α of each order j is calculatedjWith the β of each supply node ii, but only preserve each αj, because of αjDimension Number, β identical as the dimension of orderiDimension with supply the dimension of node it is identical, the dimension of order is generally thousands of or tens thousand of dimensions Degree, and when supplying node and characterizing a user for one, several hundred million or even billions of dimensions can be reached by supplying the dimension of node, from And only preserve each αj, save memory space.
Step 502:When the push server receives the information push request of user, each α preserved is readj, and According to read each αjCalculate the β of each supply nodei
According to described above, in order to save memory space, off-line phase only stores αj, push server receives user's When information push request, when assignment of traffic module 102 carries out assignment of traffic, the α of storage is readj, and according to the α of readingjAnd formula (22) β of each supply node is calculatedi, i.e., according to ∑j∈Γ(i)hijji)=1 calculates each βi
Step 503:According to read each αjAnd each β calculatedi, each x is calculated by the formula (20)ij
According to each αjAnd βi, each x is calculated using formula (20)ij
In some instances, the α for calculating each order j is being executedjAnd when preserving, as shown in fig. 6, including mainly following Step:
Step 601:For the α of all ordersjAssign initial value.
αjAnd βiIt is convergent, while according to αjComplementary slackness condition in 0≤αj≤pj, for the α of all ordersjIt assigns One close to 0 value, while may be its assignment 0.
Step 602:According to αjConstraints and βiConstraints, iteratively solve each αjAnd each βiConvergence solution.
It is as described above, αjConstraints, i.e. αjComplementary slackness condition be formula (21):
For all j, 0≤αj≤pj, and or αj=pjOr ∑i∈Γ(j)sixij=dj (21)
βiConstraints, i.e. βiComplementary slackness condition be formula (22):
For all i, βi>=0, and or βi=0 or ∑j∈Γ(i)xij=1 (22)
In iterative solution αjAnd βiConvergence solution when:
First according to the α of initializationj=0, according to βiConstraints, i.e. formula (22) calculates each βi, specifically, according to ∑ in formula (22)j∈Γ(i)xij=1, i.e. ∑j∈Γ(i)hijji)=1 calculates each βi, while the β in formula (22)i≥ 0, and may βi=0, thus as the β solvedi<0 or without solution when, enable βi=0.
When each β is calculatediAfterwards, according to αjConstraints, i.e. formula (21) calculates each αj, specifically, according to formula (21) the formula ∑ ini∈Γ(j)sixij=dj, i.e. ∑i∈Γ(j)sihijji)=djTo calculate each αj.Simultaneously in formula (21) In, 0≤αj≤pj, and may αj=pj, thus as the α solvedj>pjOr when without solution, enable αj=pj.To in iterative solution one After determining number, each α is obtainedjConvergence solution.
Step 603:Preserve each αjConvergence solution.
The application also proposes that a kind of service distribution method of pushed information order, this method can be applied to assignment of traffic module 102.In one example, as shown in fig. 7, this approach includes the following steps:
Step 701:Receive the information push request that user sends.
After assignment of traffic module 102 receives the exposure request from push server 103, obtains orientation and asked with the exposure Seek the supply node being consistent.
Step 702:Determine the supply node to match with the user.
After assignment of traffic module 102 receives exposure request, is determined and be somebody's turn to do according to the information of the user in exposure request The corresponding supply node of exposure request.Such as in fig. 2, the user of Shanghai access sports channel can be matched supply node 2.
Step 703:Determine multiple orders that orientation is consistent with the supply node.
In bigraph (bipartite graph) for example shown in Fig. 2, orientation and the supply section can be determined according to the directed information of supply node Multiple orders that point is consistent.
Step 704:Receive the multiple ordering of the flow allocation unit 102 according to flow allocation method acquisition described above The assignment of traffic ratio of each order in list.
For the multiple orders determined in step 703, can be obtained according to flow allocation method shown in above-mentioned each The assignment of traffic ratio of a order.
Step 705:The assignment of traffic ratio is provided to push server, so that the push server is according to the stream It measures allocation proportion and carries out menu processing.
The assignment of traffic ratio of each order obtained in step 704 is supplied to push server, push server root Menu processing is carried out according to the assignment of traffic ratio of each order.
Using a kind of service distribution method of pushed information order provided by the present application, stream is estimated based on supply node Amount solves the assignment of traffic ratio considered under the conditions of frequency control, the pushed information order that can be suitable for having frequency control to require so that frequently It is more reasonable that order under the conditions of control is launched, and reduces the benefit dose rate of order.
In some instances, for an exposure (i.e. one supply node i), calculated all xijThe sum of (j ∈ Γ (i)) the case where being likely to occur not equal to 1.Work as xijThe sum of be less than 1, it is meant that less than one suitable order may be selected To show, cause empty single.Work as xijThe sum of be more than 1, need first to select a part of important order, then be thrown again It puts.For this reason, it may be necessary to for order definition distribution priority.Specifically, as shown in figure 8, mainly including the following steps that:
Step 801:When the flow proportional of the multiple order adduction is more than 1, the flow for calculating each order is subscribed The ratio of amount and utilizable flow.
In this example, the ratio between the utilizable flow under the conditions of being controlled using the predetermined amount of order with frequency is excellent as the distribution of order First grade.
Step 802:Each order is ranked up from big to small by the ratio.
By the calculated above-mentioned priority of each order from big to small in the way of, corresponding order is ranked up.I.e. for All j ∈ Γ (i), according toIt sorts from big to small.
Step 803:M order before being chosen in each order after the sequence so that the flow proportional of the m order Adduction is equal to 1;Wherein, m is the integer more than 1.I.e. so that Σmxij=1.
Step 804:The assignment of traffic ratio of the selected m order is provided to push server, so that described push away Server is sent to carry out menu processing in the m order according to the assignment of traffic ratio of the m order.
The application also proposes that a kind of flow distribution device 900 of pushed information order, the device can be applied to assignment of traffic Module 102.In one example, as shown in figure 9, the device includes:
Order information acquiring unit 901, the information for obtaining each order, described information include order directed information and Frequency requirement.
It is expected that assignment of traffic ratio determination unit 902 determines and believes with the orientation of the order for being directed to each order Each supply node of manner of breathing symbol, and determine in the case where the frequency for meeting the order requires, wherein each supply node For the expectation assignment of traffic ratio of the order.
Assignment of traffic ratio determination unit 903 is used for for any order, according to the directed information phase with the order Each supply node of symbol is determined and is wanted in the frequency for meeting the order for the expectation assignment of traffic ratio of the order Ask and flow supply and demand constraints in the case of, each supply node being consistent is for the order for push server The assignment of traffic ratio that menu uses.
Using the flow distribution device of pushed information order provided by the present application, flow is estimated based on supply node, is asked Solution considers the assignment of traffic ratio under the conditions of frequency control, the pushed information order that can be suitable for having frequency control to require so that control item frequently It is more reasonable that order under part is launched, and reduces the benefit dose rate of order.
In some instances, the supply node corresponds to user's dimension or dimension combination, or a corresponding user, When the supply node correspond to a user when, determine the order assignment of traffic ratio be a user for the order Assignment of traffic ratio;When the supply node corresponds to user's dimension or dimension combines, the stream of the order determined It is the assignment of traffic ratio of user's dimension or dimension combination for the order to measure allocation proportion.
In some instances, the expectation assignment of traffic ratio determination unit 902, is used for:
Require to determine each supply node for the frequency ratio of the order according to the frequency of the order, the frequency is than characterization It can be used for the flow accounting of the order in the flow that corresponding supply node provides in the case where meeting the frequency and requiring;
According to each supply node for the frequency ratio of the order, determine that each supply node provides the order Utilizable flow;
For each supply node, according to the utilizable flow, the frequency than, the flow reservation amount of the order and the confession That answers node estimates flow, determines expectation assignment of traffic ratio of the supply node for the order.
The application also proposes that a kind of service distributor 1000 of pushed information order, the device can be applied to assignment of traffic Module 102.In one example, as shown in Figure 10, which includes:
Information pushes request reception unit 1001, and the information for receiving user's transmission pushes request,
Node determination unit 1002 is supplied, for determining the supply node to match with the user;
Order determination unit 1003, the multiple orders being consistent with the supply node for determining orientation;
Assignment of traffic ratio acquiring unit 1004, for receiving flow allocation unit flow described in accordance with the claim 1 Distribution method obtains the assignment of traffic ratio of each order in the multiple order;
Assignment of traffic ratio provides unit 1005, for providing the assignment of traffic ratio to push server, so that institute It states push server and menu processing is carried out according to the assignment of traffic ratio.
Using a kind of service distributor of pushed information order provided by the present application, stream is estimated based on supply node Amount solves the assignment of traffic ratio considered under the conditions of frequency control, the pushed information order that can be suitable for having frequency control to require so that frequently It is more reasonable that order under the conditions of control is launched, and reduces the benefit dose rate of order.
In some instances, the assignment of traffic ratio acquiring unit 1004, is used for, when the flow-rate ratio of the multiple order When example adduction is more than 1, further comprise:Calculate the flow reservation amount of each order and the ratio of utilizable flow;By the ratio Value is from big to small ranked up each order;M order before being chosen in each order after the sequence so that the m are ordered Single flow proportional adduction is equal to 1;Wherein, m is the integer more than 1;Wherein, assignment of traffic ratio provides unit 1005 and provides institute The assignment of traffic ratio for the m order chosen is to push server, so that the push server is according to the m order Assignment of traffic ratio menu processing is carried out in the m order.
Figure 11 shows the flow distribution device 900 of pushed information order and the service distributor of pushed information order The composite structural diagram of computing device where 1000.As shown in figure 11, which includes one or more processor (CPU) 1102, communication module 1104, memory 1106, user interface 1110, and the communication bus for interconnecting these components 1108。
Processor 1102 can send and receive data to realize network communication and/or locally lead to by communication module 1104 Letter.
User interface 1110 includes one or more output equipments 1112 comprising one or more speakers and/or one A or multiple visual displays.User interface 1110 also includes one or more input equipments 1114 comprising such as, key Disk, mouse, voice command input unit or loudspeaker, touch screen displays, touch sensitive tablet, posture capture camera or other are defeated Enter button or control etc..
Memory 1106 can be high-speed random access memory, such as DRAM, SRAM, DDR RAM or other deposit at random Take solid storage device;Or nonvolatile memory, such as one or more disk storage equipments, optical disc memory apparatus, sudden strain of a muscle Deposit equipment or other non-volatile solid-state memory devices.
Memory 1106 stores the executable instruction set of processor 1102, including:
Operating system 1116 includes the journey for handling various basic system services and for executing hardware dependent tasks Sequence;
Include the various application programs distributed for assignment of traffic and order placement service, this application program energy using 1118 It enough realizes the process flow in above-mentioned each example, for example may include the flow distribution device of pushed information order shown in Fig. 9 Part or complete some or all of in 900 in the service distributor 1000 of unit or pushed information order shown in Fig. 10 Portion's unit.At least one of each unit 901-903 units can be stored with machine-executable instruction, each unit 1001-1005 At least one of unit can be stored with machine-executable instruction.Processor 1102 is by executing each unit in memory 1106 Machine-executable instruction in 901-903 or in each unit 1001-1005 at least one unit, and then can realize above-mentioned each The function of at least one of unit 901-903 modules realizes at least one of above-mentioned each unit 1001-1005 modules Function.
It should be noted that step and module not all in above-mentioned each flow and each structure chart is all necessary, it can To ignore certain steps or module according to the actual needs.Each step execution sequence be not it is fixed, can as needed into Row adjustment.The division of each module is intended merely to facilitate the division functionally that description uses, and in actual implementation, a module can It is realized by multiple modules with point, the function of multiple modules can also be realized by the same module, these modules can be located at same In a equipment, it can also be located in different equipment.
Hardware module in each embodiment can in hardware or hardware platform adds the mode of software to realize.Above-mentioned software Including machine readable instructions, it is stored in non-volatile memory medium.Therefore, each embodiment can also be presented as software product.
In each example, hardware can be by special hardware or the hardware realization of execution machine readable instructions.For example, hardware can be with Permanent circuit or logical device (such as application specific processor, such as FPGA or ASIC) specially to design are used to complete specifically to grasp Make.Hardware can also include programmable logic device or circuit by software provisional configuration (as included general processor or other Programmable processor) for executing specific operation.
In addition, each example of the application can pass through the data processor by data processing equipment such as computer execution To realize.Obviously, data processor constitutes the application.In addition, being generally stored inside the data processing in a storage medium Program by program by directly reading out storage medium or the storage by program being installed or being copied to data processing equipment It is executed in equipment (such as hard disk and/or memory).Therefore, such storage medium also constitutes the application, and present invention also provides one Kind non-volatile memory medium, wherein being stored with data processor, this data processor can be used for executing in the application State any one of method example example.
The corresponding machine readable instructions of Figure 11 modules can make operating system operated on computer etc. to complete to retouch here The some or all of operation stated.Non-volatile computer readable storage medium storing program for executing can be inserted into institute in the expansion board in computer In the memory of setting or write the memory being arranged in the expanding element being connected with computer.Mounted on expansion board or CPU on expanding element etc. can be according to instruction execution part and whole practical operations.
The foregoing is merely illustrative of the preferred embodiments of the present invention, is not intended to limit the invention, all essences in the present invention With within principle, any modification, equivalent substitution, improvement and etc. done should be included within the scope of protection of the invention god.

Claims (17)

1. a kind of flow allocation method of pushed information order, which is characterized in that including:
The information of each order is obtained, described information includes directed information and the frequency requirement of order;
For each order, each supply node being consistent with the directed information of the order is determined, and determination is ordered meeting this In the case that single frequency requires, wherein expectation assignment of traffic ratio of each supply node for the order;
For any order, each supply node being consistent according to the directed information with the order is for described in the order It is expected that assignment of traffic ratio, determines in the case where meeting frequency requirement and the flow supply and demand constraints of the order, The assignment of traffic ratio that for push server menu uses of each supply node being consistent for the order.
2. according to the method described in claim 1, wherein, the supply node corresponds to user's dimension or dimension combination, or Person corresponds to a user;
When the supply node correspond to a user when, determine the order assignment of traffic ratio be a user for this The assignment of traffic ratio of order;When the supply node corresponds to user's dimension or dimension combines, the determining order Assignment of traffic ratio be user's dimension or dimension combination for the order assignment of traffic ratio.
3. according to the method described in claim 1, wherein, the determination is the case where the frequency for meeting the order requires Under, wherein each supply node includes for the expectation assignment of traffic ratio of the order:
According to the frequency ratio that the frequency of the order requires to determine each supply node for the order, the frequency ratio is characterized in full It can be used for the flow accounting of the order in the foot frequency flow that corresponding supply node provides in the case of requiring;
According to it is described it is each supply node for the order frequency ratio, determine it is described it is each supply node for the order provide can Use flow;
For each supply node, according to the utilizable flow, the frequency than, the flow reservation amount of the order and the supply section Point estimates flow, determines expectation assignment of traffic ratio of the supply node for the order.
4. according to the method described in claim 3, wherein, the corresponding utilizable flow S of order jj' true by following formula (1) It is fixed:
Sj'=∑i∈Γ(j)min{si,si×fij} (1);
Supply the expectation assignment of traffic ratio t of the node i for order jijIt is determined by following formula (2):
Wherein, siFlow, f are estimated for supply node iijIt is frequency ratio of the supply node i for order j, Γ (j) is and order The set that each supply node that the directed information of j is consistent is constituted, djFor the flow reservation amount of order j.
5. according to the method described in claim 1, wherein, supply node i is used for order j's for push server menu Assignment of traffic ratio xijIt is determined by the model of following formula (3) expression:
Wherein, the flow supply and demand constraints includes:
Demand constraint:
Supply constraint:
Frequency control constraints:
Wherein, siFlow, V are estimated for supply node ijFor the importance of order j, tijIt is the phase for supplying node i for order j Hope assignment of traffic ratio, μjFlow, p are not launched for order jjNot launch the punishment unit price of flow, J is order set, djFor The flow reservation amount of order j, fijIt is the frequency ratio for supplying node i for order j, the frequency meets order j's than being characterized in The frequency is supplied in the case of requiring in the flow that node i provides can be used for the flow accounting of order j, and Γ (j) is to determine with order j The set that each supply node being consistent to information is constituted, Γ (i) are that each order being consistent with the directed information of supply node i is constituted Set.
6. according to claim 3 to 5 any one of them method, wherein the frequency ratio of the supply node for an order It determines in the following manner:
When the supply node corresponds to a user, the frequency of the order is required into the ratio for estimating flow with the supply node As the supply node for the frequency ratio of the order;
When the supply node, which corresponds to user's dimension or dimension, to be combined, required according to the frequency of the order, the order is gone through History exposure data statistics obtains frequency ratio of the supply node for the order.
7. according to the method described in claim 5, wherein, supply node i is used for order j's for push server menu Assignment of traffic ratio xijIt is determined by following formula (9)::
Wherein, αjFor the constrained parameters corresponding to demand constraint of order j, βiCorrespond to supply constraint for supply node i The constrained parameters of condition, fijIt is to supply node i for the frequency ratio of order j, siFlow, V are estimated for supply nodejFor order The importance of j, tijIt is the expectation assignment of traffic ratio for supplying node i for order j.
8. according to the method described in claim 7, wherein, assignment of traffic ratio x is determined by the formula (9)ij, including:
In off-line phase, the α of each order j is calculatedjWith the β of each supply node ii, and preserve each αj
When the push server receives the information push request of user, each α preserved is readj, and according to read each αjCalculate the β of each supply nodei
According to read each αjAnd each β calculatedi, each x is calculated by the formula (9)ij
9. according to the method described in claim 8, wherein, the α for calculating each order jjAnd it preserves and includes:
For the α of all ordersjAssign initial value;
According to αjConstraints and βiConstraints, iteratively solve each αjAnd each βiConvergence solution;
Preserve each αjConvergence solution.
10. a kind of service distribution method of pushed information order, which is characterized in that including:
The information push request that user sends is received,
Determine the supply node to match with the user;
Determine multiple orders that orientation is consistent with the supply node;
Receive the flow point that flow allocation unit obtains each order in the multiple order according to claim 1 the method With ratio;
The assignment of traffic ratio is provided to push server so that the push server according to the assignment of traffic ratio into The processing of row menu.
11. according to the method described in claim 10, wherein, when the flow proportional of the multiple order adduction is more than 1, into one Step includes:
Calculate the flow reservation amount of each order and the ratio of utilizable flow;
Each order is ranked up from big to small by the ratio;
M order before being chosen in each order after the sequence so that the flow proportional adduction of the m order is equal to 1;Its In, m is the integer more than 1;
The assignment of traffic ratio of the selected m order is provided to push server so that the push server according to The assignment of traffic ratio of the m order carries out menu processing in the m order.
12. a kind of flow distribution device of pushed information order, which is characterized in that including:
Order information acquiring unit, the information for obtaining each order, described information include that the directed information of order and the frequency are wanted It asks;
It is expected that assignment of traffic ratio determination unit, for being directed to each order, determination is consistent with the directed information of the order Each supply node, and determine meet the order the frequency require in the case of, wherein each supply node is for this The expectation assignment of traffic ratio of order;
Assignment of traffic ratio determination unit, for for any order, being consistent according to the directed information with the order every One supply node for the order the expectation assignment of traffic ratio, determine meet the order the frequency require and In the case of flow supply and demand constraints, each supply node being consistent makes the order for push server menu Assignment of traffic ratio.
13. device according to claim 12, wherein the supply node corresponds to user's dimension or dimension combination, Or a corresponding user, when the supply node corresponds to a user, the assignment of traffic ratio of the order determined is Assignment of traffic ratio of one user for the order;When the supply node corresponds to user's dimension or dimension combines, The assignment of traffic ratio of the determining order is the assignment of traffic ratio of user's dimension or dimension combination for the order.
14. device according to claim 12, wherein the expectation assignment of traffic ratio determination unit is used for,
According to the frequency ratio that the frequency of the order requires to determine each supply node for the order, the frequency ratio is characterized in full It can be used for the flow accounting of the order in the foot frequency flow that corresponding supply node provides in the case of requiring;
According to it is described it is each supply node for the order frequency ratio, determine it is described it is each supply node for the order provide can Use flow;
For each supply node, according to the utilizable flow, the frequency than, the flow reservation amount of the order and the supply section Point estimates flow, determines expectation assignment of traffic ratio of the supply node for the order.
15. device according to claim 12, wherein the assignment of traffic ratio determination unit is indicated by following formula Model determine supply node i for order j the assignment of traffic ratio x used for push server menuij
Wherein, the flow supply and demand constraints includes:
Demand constraint:
Supply constraint:
Frequency control constraints:
Wherein, siFlow, V are estimated for supply node ijFor the importance of order j, tijIt is the phase for supplying node i for order j Hope assignment of traffic ratio, μjFlow, p are not launched for order jjNot launch the punishment unit price of flow, J is order set, djFor The flow reservation amount of order j, fijIt is the frequency ratio for supplying node i for order j, the frequency meets order j's than being characterized in The frequency is supplied in the case of requiring in the flow that node i provides can be used for the flow accounting of order j, and Γ (j) is to determine with order j The set that each supply node being consistent to information is constituted, Γ (i) are that each order being consistent with the directed information of supply node i is constituted Set.
16. a kind of service distributor of pushed information order, which is characterized in that including:
Information pushes request reception unit, and the information for receiving user's transmission pushes request,
Node determination unit is supplied, for determining the supply node to match with the user;
Order determination unit, the multiple orders being consistent with the supply node for determining orientation;
Assignment of traffic ratio acquiring unit, for receiving flow allocation unit flow allocation method described in accordance with the claim 1 Obtain the assignment of traffic ratio of each order in the multiple order;
Assignment of traffic ratio provides unit, for providing the assignment of traffic ratio to push server, so that the push takes Device be engaged according to assignment of traffic ratio progress menu processing.
17. device according to claim 16, wherein the assignment of traffic ratio acquiring unit is additionally operable to,
When the flow proportional of the multiple order adduction is more than 1,
Calculate the flow reservation amount of each order and the ratio of utilizable flow;
Each order is ranked up from big to small by the ratio;
M order before being chosen in each order after the sequence so that the flow proportional adduction of the m order is equal to 1;Its In, m is the integer more than 1;
Wherein, the assignment of traffic ratio provides unit and provides the assignment of traffic ratio of the selected m order to push Server, so that the push server carries out menu according to the assignment of traffic ratio of the m order in the m order Processing.
CN201710080661.3A 2017-02-15 2017-02-15 Flow distribution method, service distribution method and device for push information order Active CN108428144B (en)

Priority Applications (2)

Application Number Priority Date Filing Date Title
CN201710080661.3A CN108428144B (en) 2017-02-15 2017-02-15 Flow distribution method, service distribution method and device for push information order
PCT/CN2018/076226 WO2018149371A1 (en) 2017-02-15 2018-02-11 Flow and service allocation method and apparatus for push information order, and storage medium

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201710080661.3A CN108428144B (en) 2017-02-15 2017-02-15 Flow distribution method, service distribution method and device for push information order

Publications (2)

Publication Number Publication Date
CN108428144A true CN108428144A (en) 2018-08-21
CN108428144B CN108428144B (en) 2022-04-26

Family

ID=63155317

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201710080661.3A Active CN108428144B (en) 2017-02-15 2017-02-15 Flow distribution method, service distribution method and device for push information order

Country Status (2)

Country Link
CN (1) CN108428144B (en)
WO (1) WO2018149371A1 (en)

Cited By (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109829753A (en) * 2019-01-08 2019-05-31 聚好看科技股份有限公司 A kind of method and apparatus of pair of publicity orders distribution flow
CN109978221A (en) * 2019-01-02 2019-07-05 阿里巴巴集团控股有限公司 A kind of advertisement inventory method for pre-distributing and device
CN111047009A (en) * 2019-11-21 2020-04-21 腾讯科技(深圳)有限公司 Event trigger probability pre-estimation model training method and event trigger probability pre-estimation method
CN111523939A (en) * 2020-04-23 2020-08-11 腾讯科技(深圳)有限公司 Promotion content delivery method and device, storage medium and electronic equipment
CN112396474A (en) * 2020-12-23 2021-02-23 上海苍苔信息技术有限公司 System and method for allocating traffic according to advertiser budget
CN112435091A (en) * 2020-11-23 2021-03-02 百果园技术(新加坡)有限公司 Recommended content selection method, device, equipment and storage medium
CN114493726A (en) * 2022-04-06 2022-05-13 萨科(深圳)科技有限公司 Order monitoring method and monitoring platform

Families Citing this family (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113516495B (en) * 2020-09-30 2024-03-08 腾讯科技(深圳)有限公司 Information pushing method, device, electronic equipment and computer readable medium
CN112232878A (en) * 2020-10-19 2021-01-15 腾讯科技(深圳)有限公司 Virtual display resource processing method and device, computer equipment and storage medium
CN112598447B (en) * 2020-12-28 2023-10-10 加和(北京)信息科技有限公司 Order information processing method and device, electronic equipment and processor
CN113781090A (en) * 2021-02-24 2021-12-10 北京沃东天骏信息技术有限公司 Flow estimation method and device

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20100318432A1 (en) * 2009-06-10 2010-12-16 Yahoo! Inc. Allocation of internet advertising inventory
CN103377309A (en) * 2012-04-13 2013-10-30 腾讯科技(北京)有限公司 Method and device for displaying released information
CN104751343A (en) * 2013-12-25 2015-07-01 北京思博途信息技术有限公司 Advertisement putting method and device and advertisement putting server
WO2015141931A1 (en) * 2014-03-19 2015-09-24 에스케이플래닛 주식회사 Apparatus and method for providing advertisement
CN105791157A (en) * 2016-04-20 2016-07-20 腾讯科技(深圳)有限公司 Flow distribution method, distribution system and server

Family Cites Families (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105656964B (en) * 2014-11-10 2019-06-25 中国移动通信集团公司 The implementation method and device of data-pushing
CN104410714B (en) * 2014-12-16 2018-02-13 成都大学 Network information push method and network information push device
CN105491410B (en) * 2015-12-09 2018-10-23 优酷网络技术(北京)有限公司 A kind of distribution method and system that network video advertisement is launched

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20100318432A1 (en) * 2009-06-10 2010-12-16 Yahoo! Inc. Allocation of internet advertising inventory
CN103377309A (en) * 2012-04-13 2013-10-30 腾讯科技(北京)有限公司 Method and device for displaying released information
CN104751343A (en) * 2013-12-25 2015-07-01 北京思博途信息技术有限公司 Advertisement putting method and device and advertisement putting server
WO2015141931A1 (en) * 2014-03-19 2015-09-24 에스케이플래닛 주식회사 Apparatus and method for providing advertisement
CN105791157A (en) * 2016-04-20 2016-07-20 腾讯科技(深圳)有限公司 Flow distribution method, distribution system and server

Cited By (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109978221A (en) * 2019-01-02 2019-07-05 阿里巴巴集团控股有限公司 A kind of advertisement inventory method for pre-distributing and device
CN109829753A (en) * 2019-01-08 2019-05-31 聚好看科技股份有限公司 A kind of method and apparatus of pair of publicity orders distribution flow
CN109829753B (en) * 2019-01-08 2023-04-14 聚好看科技股份有限公司 Method and equipment for distributing flow to advertisement orders
CN111047009A (en) * 2019-11-21 2020-04-21 腾讯科技(深圳)有限公司 Event trigger probability pre-estimation model training method and event trigger probability pre-estimation method
CN111047009B (en) * 2019-11-21 2023-05-23 腾讯科技(深圳)有限公司 Event trigger probability prediction model training method and event trigger probability prediction method
CN111523939A (en) * 2020-04-23 2020-08-11 腾讯科技(深圳)有限公司 Promotion content delivery method and device, storage medium and electronic equipment
CN111523939B (en) * 2020-04-23 2023-11-28 腾讯科技(深圳)有限公司 Popularization content delivery method and device, storage medium and electronic equipment
CN112435091A (en) * 2020-11-23 2021-03-02 百果园技术(新加坡)有限公司 Recommended content selection method, device, equipment and storage medium
CN112435091B (en) * 2020-11-23 2024-03-29 百果园技术(新加坡)有限公司 Recommended content selection method, device, equipment and storage medium
CN112396474A (en) * 2020-12-23 2021-02-23 上海苍苔信息技术有限公司 System and method for allocating traffic according to advertiser budget
CN114493726A (en) * 2022-04-06 2022-05-13 萨科(深圳)科技有限公司 Order monitoring method and monitoring platform

Also Published As

Publication number Publication date
CN108428144B (en) 2022-04-26
WO2018149371A1 (en) 2018-08-23

Similar Documents

Publication Publication Date Title
CN108428144A (en) Flow allocation method, service distribution method and the device of pushed information order
CN107767164B (en) Information processing method, distribution method and device for push information order
US10803495B2 (en) Advertising creative processing method, advertising creative processing apparatus, and storage medium
US9378516B2 (en) Content provisioning for user devices
CN108574706B (en) Media file pushing method and device
CN108174248A (en) Video broadcasting method, video playing control method, device and storage medium
CN109348237A (en) A kind of direct broadcasting room management method, device, server and storage medium
CN106411697A (en) Meeting-specific state indicators
CN108427683A (en) A kind of resource put-on method and device
CN106791936A (en) The methods of exhibiting and device of a kind of virtual present
CN108900924A (en) The method and apparatus of commending friends in direct broadcasting room
CN108389076A (en) advertisement distribution method, device, server and computer readable storage medium
US20220295133A1 (en) Technologies for managing collaborative and multiplatform media content playlists
US20220179713A1 (en) Ai processing method and apparatus
CN104838417A (en) Determining individuals for online groups
US10257301B1 (en) Systems and methods providing a drive interface for content delivery
CN110196949A (en) Information-pushing method, device, electronic equipment and computer-readable medium
US20150081455A1 (en) Service providing apparatus and service providing method
CN112862544A (en) Object information acquisition method and device and storage medium
CN107872483A (en) Method for pushing, the apparatus and system of media content
KR20150081175A (en) Digital signage system capable of ensuring advertising exposure time and method thereof
CN109815106B (en) Interactive function testing method and device of information delivery platform
CN113515336B (en) Live room joining method, creation method, device, equipment and storage medium
CN114117090A (en) Resource display method and device and server
CN112232878A (en) Virtual display resource processing method and device, computer equipment and storage medium

Legal Events

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