CN104159128B - A kind of video flowing bandwidth allocation methods based on auction in P2P overlay networks - Google Patents
A kind of video flowing bandwidth allocation methods based on auction in P2P overlay networks Download PDFInfo
- Publication number
- CN104159128B CN104159128B CN201410388131.1A CN201410388131A CN104159128B CN 104159128 B CN104159128 B CN 104159128B CN 201410388131 A CN201410388131 A CN 201410388131A CN 104159128 B CN104159128 B CN 104159128B
- Authority
- CN
- China
- Prior art keywords
- mrow
- node
- bandwidth
- auction
- msubsup
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Abstract
The invention discloses a kind of video flowing in P2P overlay networks the bandwidth allocation methods based on auction.This method realizes that bandwidth allocation is optimized in P2P overlay networks using following step, it is characterised in that：First, between node in the form of two way auction, the upstream bandwidth of oneself is on the one hand sold to other nodes, on the other hand bandwidth is bought to other nodes；Second, propose, based on asked distributed bandwidth auction distribution method, to calculate the bandwidth that downstream node can be at least assigned in every wheel auction.This method can not only reduce network transmission expense, improve P2P overlay network bandwidth availability ratios, and promote the rationally shared of Internet resources.
Description
Technical field
The present invention relates to a kind of video flowing in P2P overlay networks the bandwidth allocation methods based on auction, including nerve of a covering
The foundation of bandwidth auction theory between the structure of network, node, and bandwidth resources allocation strategy.
Background technology
P2P (Peer-to-Peer) stream media system has merged P2P technologies and stream media technology, and its appearance causes existing
Have and realize that large-scale stream media is shared on network foundation and be possibly realized.In P2P stream media systems, the characteristics of using P2P technologies, fill
Divide the resource using user terminal, allow user terminal to serve as the function of part of server, user node is in reception and playing stream media
While data, using upstream bandwidth and hardware resource, the stream medium data of caching is transmitted to other nodes, made in Streaming Media
Hold distribution decentralized, alleviate the load of server with this, with very high scalability and inexpensive feature.By such
Flow data is shared, and user node need not pass through the skills such as rational node organization, cache management directly from server request data
Art, can make the shared data stream from server of substantial amounts of user node.
But, for providing high-quality video for the user in P2P networks, still suffer from following challenge：For example,
Chinese invention patent Authorization Notice No. is CN 101895580B, entitled：Extensible video stream is in multi-overlay network
In the bandwidth allocation methods based on auction, the technical scheme of this method " can solve the bandwidth conflict between multi-overlay network, improve section
Point receives the quality of video, the interlayer dependence of Adaptive matching scalable video：First, by P2P multi-overlay networks
Bandwidth allocation optimization problem is converted into a series of bandwidth allocation optimization problem of individual layer overlay networks；Second, with two-way between node
The form of auction, on the one hand sells the upstream bandwidth of oneself to other nodes, on the other hand buys bandwidth to other nodes, so that
Solve the problems, such as the bandwidth conflict of multi-overlay interior joint；3rd, propose a kind of adaptive " layer is added/exited " algorithm, envoy
Point can select the nerve of a covering layer number to be participated in while bandwidth sale and auction is carried out according to network real time status,
Avoid the waste of bandwidth ".
But, although this method solves the problems, such as to transmit the bandwidth conflict between related content overlay network, is receiving node
There is provided higher video quality, the utilization rate of the network bandwidth is also improved.
However, the uploading bandwidth of the bandwidth allocation methods interior joint is restricted, the condition isomerism of video reception end subscriber,
High fluidity, data dispatch strategy of node etc. are excessively complicated, and network node only enjoys resource and service without doing tribute for system
Behavior offered etc..Solving the above problems not only needs to increase the bandwidth capacity of node, disposes more servers to make up network
The deficiency of resource, in addition it is also necessary to using novel streaming medium content distribution technology, efficient resource allocation algorithm and Protocol Design etc.
Rationally to utilize active block resource, in the bandwidth allocation methods, when balanced different downstream nodes to same upstream node into
Friendship valency is different, does not have fairness to downstream node；Each downstream node is opened to the two-dimentional auction message of multiple upstream transmissions, transmission
Pin is big.In P2P networks uploading bandwidth it is limited be P2P networks bottleneck, therefore how limited distribution network uploading bandwidth is P2P
The crucial research point of network, it is contemplated that the distribution of P2P network node geos is scattered, and upstream node sells whole network downstream node directly to households
The method of private information is infeasible, and the present invention proposes a kind of video flowing bandwidth based on auction in P2P overlay networks
Distribution method, reasonable effective distribution for solving uploading bandwidth in network, realizes the efficient utilization of Internet resources.
The content of the invention
It is an object of the invention to provide a kind of video flowing in P2P overlay networks the bandwidth allocation methods based on auction.
This method can not only reduce network transmission expense, improve P2P overlay network bandwidth availability ratios, and promote the reasonable of Internet resources
It is shared.
Conceived according to foregoing invention, the present invention uses following technical proposals：A kind of video flowing is based in P2P overlay networks
The bandwidth allocation methods of auction, it is characterised in that：First, between node in the form of two way auction, on the one hand sell the upper of oneself
Row bandwidth gives other nodes, on the other hand buys bandwidth to other nodes；Second, propose to be based on asked distributed band
Width auction distribution method, calculates the bandwidth that downstream node can be at least assigned in every wheel auction.
Principle explanation is given below：
The bandwidth allocation optimization problem conversion process of overlay network is：
1. network model and relevant parameter
Video flowing is transmitted by nerve of a covering with speed R；Nerve of a covering can abstract be digraph G=(V, E), and wherein V is represented
All node sets for participating in the network, E represents the set of directed link between node, dijFor the average transmission of link (i, j)
Delay parameter；Node adds nerve of a covering, and video can be gone out in decoding terminals, and Δ D () represents the utility function in nerve of a covering；
The often wheel auction of node organization is divided into two subcycles：In assignment period, auction organization node i broadcasts it will
Valency, downstream node determines bandwidth request amount according to charge, and according to the optimum bandwidth request amount of downstream node, upstream node uses one
Plant allocation strategy and sell its upstream bandwidthWithin the auction cycle, upstream node receives all downstream nodes taken part in auction
Aggregate demand after, by its available upstream bandwidth with nodeCompare, according to aggregate demand and the relation of quantity delivered, determine downstream joint
The amount of bandwidth that point can be at least assigned to, meanwhile, the charge of upstream node adjustment auction, afterwards, according to new charge, downstream node
Bandwidth request amount is redefined, until all node demands are all met in network, system reaches equilibrium state, now system
It is optimal distribution；System reaches the auction wheel number referred to as convergence rate that equilibrium state is undergone；
2. optimization aim
For downstream node j, the target of its bandwidth on demand is that have enough bandwidth to receive optimal video quality, downstream joint
Point considers upstream node bandwidth charge when selecting optimal upstream node, not only, but also in view of link delay problem, Ying Xuan
The minimum upstream node bandwidth on demand of link delay is selected, therefore downstream node is as follows in the optimization problem of nerve of a covering：
s.t.
1)
2)
Optimization aim：Downstream node total utility is maximized, i.e., utility function subtracts link delay and auction cost is maximized,
Here rijRepresent the amount of bandwidth of downstream node j upstream nodes i requests, piRepresent upstream node i charge；
Constraints：In nerve of a covering, the total bandwidth that downstream node is asked to all upstream nodes is less than or equal to the covering
The transmission rate of net；
And upstream node i optimization problem is then：
s.t.
Optimization aim：Revenus maximization obtained by upstream node auction bandwidth；
Constraints：
The salable total amount of bandwidth of upstream node is limited by its uploading bandwidth；
Above-mentioned two way auction process is：
(1), initialize
It is that network node number is N, initial auction time t=0, the price increase step-length δ of charge to set network size；
All upstream node i：Initial chargeUpstream node i charges are sent in P2P overlay networks；
(2) bandwidth request amount, is determined
Participate in the downstream node j of auction：The downstream node j for participating in auction receives the charge of upstream nodeAfterwards, obtain
Optimum bandwidth request amountBy optimum bandwidth request amountIt is then forwarded to corresponding upstream node；
(3), charge updates
Upstream node i：Upstream node is received after the bandwidth request amount of all downstream nodes for participating in auction, statistics
The total request amount of bandwidth in upstream node i tissue auctionsBy the total request amount of bandwidthGathered around with upstream node
Some uploading bandwidthsCompare, if the total request amount of bandwidthIt is more than(4) are then gone to step, are otherwise gone to step (5)；
(4) demand of all nodes in network, is judged
If there is node in networkThere is node demand surplus in network, i.e.,
{
If node i demand surplus, i.e.,
{
ChargeCalculate the amount of bandwidth that this wheel auction process middle and lower reaches node j can be at least assigned to
HereT is represented, upstream node i charges areWhen, the band of downstream node j upstream nodes i applications
Width amount
}
Else
{
Maintain original priceCalculate the amount of bandwidth that this wheel auction process middle and lower reaches node j can be at least assigned to
}
Make t=t+1, the charge after broadcast renewalTo downstream node,
Repeat step (2) and step (3),
}
(5) iteration, is stopped, End of Auction, network reaches equilibrium state；
(6) auction time t=T, is made to represent the End of Auction time,
If upstream node charge is：The amount of bandwidth that downstream node is assigned to is equal to its bandwidth on demand amount, i.e.,
Downstream node j utility function is：
If the demand that there is node in network is not met, then auction iteration is carried out, until all nodes are needed in network
Ask and be all met, then auction reaches convergence,
The amount of bandwidth that downstream node is actually allocated to is：
The expense that downstream node is actual to answer upstream nodes to pay is：
This method is compared with advantages below with existing bandwidth allocation methods：Method proposes a kind of video flowing in P2P
Bandwidth allocation methods based on auction in overlay network, method simple transparent, and privacy is protected, because auction algorithm is
Distributed, each user for participating in auction need not report its own private information, and it only needs to report their request
Amount, reduces transport overhead；The characteristics of with anti-cheating property, prevent node deceptive information from participating in auction, promote network
In selfish node and non-cooperative nodes report real demand so that itself maximizing the benefits.
Brief description of the drawings
Fig. 1 is that network topology sets interior joint distribution table；
Fig. 2 is constringency performance comparison schematic diagram when price step-length λ is different in step (1) in this method；
Fig. 3 is constringency performance comparison schematic diagram when network size N is different in step (1) in this method；
Fig. 4 is the average yield figure of network node when price step-length λ is different in step (1) in this method；
Fig. 5 maximizes performance constringency performance comparison schematic diagram for interests of the whole in step (6) in this method；
Fig. 6 is auction cyclic flow schematic diagram of the invention.
Embodiment
The application example of the inventive method is described in detail below in conjunction with the accompanying drawings：
1st, network topology is set
This method carries out performance simulation by the overlay network generated at random, and the section of P2P overlay networks is set in an experiment
Count out as 200, neighbours' number of each node is 5, the different network node of 9 kinds of uploading bandwidth abilities of selection, wherein
66% node possesses 256 (kbps) to 768 (kbps) uploading bandwidth in network, and the uploading bandwidth that can be contributed is 150
(kbps) arrive
600(kbps)；Total uploading bandwidth of 38% node is 1024 (kbps), and the uploading bandwidth of contribution is 800
(kbps), total uploading bandwidth amount of remaining 6% node is more than 1024 (kbps), and the uploading bandwidth of contribution is 1000
(kbps)；The percentage that every kind of Node distribution is accounted for is different, specific as shown in Figure 1.
This method uses 30 frames/second (fps), resolution ratio to enter for CIF (352*288) standard testing video sequence " Bus "
Row test, GOP sizes take 32 frames.For each sequence, the JSVM9_ based on extended reference coding standard H.264/AVC is used
11 encoders, are encoded into three straton code streams, and speed is 256kbps Primary layer and 128kbps enhancement layer.
The utility function that this method is used for：Δ D (r)=De(0)-De(r)
Wherein, De() is rate distortion function, i.e.,Variable θ, R0And D0It is the ginseng of R-D models
Number, is determined by temporal resolution, spatial resolution and delay of video sequence etc..This method uses Δ D (r)=De(0)-De(r)
Utility function, and with average peak signal to noise ratio (PSNR) weigh node reception video quality.
2nd, the algorithm model based on above topology is set up
Each node i functions simultaneously as the role of upstream node and downstream node, within two cycles of every wheel auction respectively
Perform the following steps：
1) assignment period
Step 1. collects the bandwidth on demand from all downstream nodes, and the collection of the bandwidth on demand of all downstream nodes is combined into
Step 2. is according to downstream node bandwidth request total amount and available upstream bandwidthRelation, adjustment charge, it is determined that under
The amount of bandwidth that trip node can be at least assigned to
Step 3. repeat step 1 and 2, until the demand of all downstream nodes is all met.
2) the auction cycle
Receive the charge of upstream nodeDetermine optimum bandwidth request amount
3rd, performance evaluation is carried out in above-mentioned network topology
1) constringency performance of method when difference restrains step-length
As shown in figure 1, it is known that in P2P overlay networks, average is 541kbps using uploading bandwidth, more than average
Uploading bandwidth total amount in video rate 512kbps, network, meets all nodes and enough bandwidth is obtained in overlay network enough
Demand.This method is to be based on asked auction system, therefore only all upstream nodes are not located in demand mistake in network
Surplus, i.e., when any node is without adjustment charge price, network is at equilibrium, therefore is averaged with all nodes in network
Charge price judges whether network is at equilibrium, if the front and rear two-wheeled of auction process all keeps constant, understands network
Reach equilibrium state.Fig. 2 is convergence situation of the algorithm of this method proposition when different prices increases step-length, can from Fig. 2
To find out, set forth herein algorithm can reach convergence in the case of different step-lengths, and price increase step-length is bigger, algorithm
Convergence rate is faster.
2) convergence of algorithm performance in heterogeneous networks scale
Fig. 3 illustrates the auction algorithm of this method proposition in the network of different scales and the limitation of different neighbor node numbers
Algorithm the convergence speed compares.Network size is the number of nodes, is respectively set to 100,200 and 300, neighbor node
Quantity is respectively set to 20,10 and 5.Y-coordinate in figure represents the auction wheel number that all node demands in network are met, i.e.,
The balanced moment of whole network, it can be found that with the increase of network size, algorithm the convergence speed slows down, reason from Fig. 3
It is that, due to being increased with network size, node competition is all the more violent；Meanwhile, it is also seen that, the increasing limited with neighbor node number
Plus, algorithm the convergence speed is faster, and this is due to that can provide the node increase of uploading bandwidth, alleviates and same upstream node is asked
Superfluous phenomenon.
3) during different price step-length network node average yield
When Fig. 4 illustrates different price iteration step lengths, the average yield of network node.Figure 4, it is seen that with
The increase of price iteration step length, the average yield of network node is reduced therewith, i.e., the total revenue of network node is reduced.According to Fig. 2
Understood with Fig. 4, iteration step length needs balance convergence rate and global benefit, iteration step is grown up, although can accelerate convergence rate, but
Reduce global benefit；Vice versa.
4) interests of the whole maximize performance
The algorithm of this method proposition is analyzed in the case where price iteration step length is sufficiently small, if interests of the whole can be reached
Maximize.This method is optimized with centralization and distributed auction mode is compared, distributed auction method is carried herein
The method gone out.Reach that interests of the whole are maximized using centralized optimized algorithm, because the maximized model of interests of the whole is profit
Solved with the fmincon functions in Matlab tool boxes, network size crosses conference and causes arithmetic speed excessively slow, therefore, institute
The P2P overlay networks stated are made up of 6 nodes.Lagrangian product and upstream node in interests of the whole maximize model
Equilibrium charge it is equal when, algorithm is when reaching that individual interests are maximized, while can reach interests of the whole maximized state,
The Lagrange multiplier that interests of the whole are maximized in model calls optimizing price.Understood in Fig. 5 a, be in price iteration step length
When 0.007, when network reaches equilibrium state, the balanced charge of upstream node is not equal to the maximized optimization price of interests of the whole,
Therefore, individual interests maximization is now only reached, not up to interests of the whole are maximized；Such as scheme b to understand, when price iteration step length is
When 0.00001, the balanced charge of upstream node is equal to the maximized optimization price of interests of the whole, and now network has not only reached individual
Body benefit, but also reached interests of the whole maximization.
Claims (1)
1. a kind of video flowing bandwidth allocation methods based on auction in P2P overlay networks, it is characterised in that：First, between node
In the form of two way auction, the upstream bandwidth of oneself is on the one hand sold to other nodes, on the other hand band is bought to other nodes
It is wide；Second, the bandwidth that downstream node can be at least assigned in every wheel auction is calculated, is to be based on asked, its specific mistake
Journey is as follows：
A. network model and relevant parameter
Video flowing is transmitted by nerve of a covering with speed R；Nerve of a covering can abstract be digraph G=(V, E), and wherein V represents all
The node set of the network is participated in, E represents the set of directed link between node, dijFor the mean transit delay of link (i, j)
Parameter；Node adds nerve of a covering, and video can be gone out in decoding terminals, and Δ D () represents the utility function in nerve of a covering；
The often wheel auction of node organization is divided into two subcycles：In assignment period, auction organization node i broadcasts its charge, under
Swim node and bandwidth request amount is determined according to charge, according to the optimum bandwidth request amount of downstream node, upstream node uses a kind of point
Its upstream bandwidth is sold with strategyWithin the auction cycle, upstream node receives the total of all downstream nodes taken part in auction
After demand, by its available upstream bandwidth with nodeCompare, according to aggregate demand and the relation of quantity delivered, determine downstream node extremely
The amount of bandwidth that can be assigned to less, meanwhile, the charge of upstream node adjustment auction, afterwards, according to new charge, downstream node is again
Bandwidth request amount is determined, until all node demands are all met in network, system reaches equilibrium state, and now system reaches
Optimum allocation；System reaches the auction wheel number referred to as convergence rate that equilibrium state is undergone；
B. optimization aim
For downstream node j, the target of its bandwidth on demand is that have enough bandwidth to receive optimal video quality, and downstream node exists
When selecting optimal upstream node, upstream node bandwidth charge is not only considered, but also in view of link delay problem, chain should be selected
The minimum upstream node bandwidth on demand of road delay, therefore downstream node is as follows in the optimization problem of nerve of a covering：
P1:
s.t.
1)
2)
Optimization aim：Downstream node total utility is maximized, i.e., utility function subtracts link delay and auction cost is maximized, here
rijRepresent the amount of bandwidth of downstream node j upstream nodes i requests, piRepresent upstream node i charge；
Constraints：In nerve of a covering, the total bandwidth that downstream node is asked to all upstream nodes is less than or equal to the nerve of a covering
Transmission rate；
And upstream node i optimization problem is then：
P2:
s.t.
<mrow>
<munder>
<mo>&Sigma;</mo>
<mrow>
<mi>j</mi>
<mo>:</mo>
<mrow>
<mo>(</mo>
<mi>i</mi>
<mo>,</mo>
<mi>j</mi>
<mo>)</mo>
</mrow>
<mo>&Element;</mo>
<mi>E</mi>
</mrow>
</munder>
<msub>
<mi>x</mi>
<mrow>
<mi>i</mi>
<mi>j</mi>
</mrow>
</msub>
<mo>&le;</mo>
<msubsup>
<mi>C</mi>
<mi>i</mi>
<mi>u</mi>
</msubsup>
<mo>,</mo>
<mo>&ForAll;</mo>
<mi>i</mi>
<mo>:</mo>
<mrow>
<mo>(</mo>
<mi>i</mi>
<mo>,</mo>
<mi>j</mi>
<mo>)</mo>
</mrow>
<mo>&Element;</mo>
<mi>E</mi>
</mrow>
Optimization aim：Revenus maximization obtained by upstream node auction bandwidth；
Constraints：
The salable total amount of bandwidth of upstream node is limited by its uploading bandwidth；
Above-mentioned two way auction process is：
(1), initialize
It is that network node number is N, initial auction time t=0, the price increase step-length δ of charge to set network size；
All upstream node i：Initial chargeUpstream node i is sent in P2P overlay networks will
Valency；
(2) bandwidth request amount, is determined
Participate in the downstream node j of auction：The downstream node j for participating in auction receives the charge of upstream nodeAfterwards, optimal band is obtained
Wide request amountBy optimum bandwidth request amountIt is then forwarded to corresponding upstream node；
(3), charge updates
Upstream node i：Upstream node is received after the bandwidth request amount of all downstream nodes for participating in auction, counts upstream
The total request amount of bandwidth in the auction of node i tissueBy the total request amount of bandwidthWith upstream node
The uploading bandwidth possessedCompare, if the total request amount of bandwidthIt is more than(4) are then gone to step, are otherwise turned
Step (5)；
(4) demand of all nodes in network, is judged
If there is node in networkThere is node demand surplus in network, i.e.,
<mrow>
<munder>
<mo>&Sigma;</mo>
<mrow>
<mi>j</mi>
<mo>:</mo>
<mrow>
<mo>(</mo>
<mi>i</mi>
<mo>,</mo>
<mi>j</mi>
<mo>)</mo>
</mrow>
<mo>&Element;</mo>
<mi>E</mi>
</mrow>
</munder>
<msub>
<mi>r</mi>
<mrow>
<mi>i</mi>
<mi>j</mi>
</mrow>
</msub>
<mo>></mo>
<msubsup>
<mi>C</mi>
<mi>i</mi>
<mi>u</mi>
</msubsup>
<mo>,</mo>
<mo>&ForAll;</mo>
<mi>i</mi>
</mrow>
{
If node i demand surplus, i.e.,
{
ChargeCalculate the amount of bandwidth that this wheel auction process middle and lower reaches node j can be at least assigned to
HereT is represented, upstream node i charges areWhen, the amount of bandwidth of downstream node j upstream nodes i applications
}
Else
{
Maintain original priceCalculate the amount of bandwidth that this wheel auction process middle and lower reaches node j can be at least assigned to
}
Make t=t+1, the charge after broadcast renewalTo downstream node,
Repeat step (2) and step (3),
}
(5) iteration, is stopped, End of Auction, network reaches equilibrium state；
(6) auction time t=T, is made to represent the End of Auction time,
If upstream node charge is：The amount of bandwidth that downstream node is assigned to is equal to its bandwidth on demand amount, i.e.,
Downstream node j utility function is：
<mrow>
<msup>
<mi>U</mi>
<mo>*</mo>
</msup>
<mrow>
<mo>(</mo>
<msup>
<mi>P</mi>
<mi>T</mi>
</msup>
<mo>,</mo>
<msup>
<mi>r</mi>
<mo>*</mo>
</msup>
<mo>)</mo>
</mrow>
<mo>=</mo>
<mi>&Delta;</mi>
<mi>D</mi>
<mrow>
<mo>(</mo>
<munder>
<mo>&Sigma;</mo>
<mrow>
<mi>i</mi>
<mo>:</mo>
<mrow>
<mo>(</mo>
<mi>i</mi>
<mo>,</mo>
<mi>j</mi>
<mo>)</mo>
</mrow>
<mo>&Element;</mo>
<msub>
<mi>E</mi>
<mi>m</mi>
</msub>
</mrow>
</munder>
<msubsup>
<mi>r</mi>
<mrow>
<mi>i</mi>
<mi>j</mi>
</mrow>
<mo>*</mo>
</msubsup>
<mo>)</mo>
</mrow>
<mo>-</mo>
<munder>
<mo>&Sigma;</mo>
<mrow>
<mi>i</mi>
<mo>:</mo>
<mrow>
<mo>(</mo>
<mi>i</mi>
<mo>,</mo>
<mi>j</mi>
<mo>)</mo>
</mrow>
<mo>&Element;</mo>
<msub>
<mi>E</mi>
<mi>m</mi>
</msub>
</mrow>
</munder>
<msub>
<mi>d</mi>
<mrow>
<mi>i</mi>
<mi>j</mi>
</mrow>
</msub>
<mo>&CenterDot;</mo>
<msubsup>
<mi>r</mi>
<mrow>
<mi>i</mi>
<mi>j</mi>
</mrow>
<mo>*</mo>
</msubsup>
<mo>-</mo>
<munder>
<mo>&Sigma;</mo>
<mrow>
<mi>i</mi>
<mo>:</mo>
<mrow>
<mo>(</mo>
<mi>i</mi>
<mo>,</mo>
<mi>j</mi>
<mo>)</mo>
</mrow>
<mo>&Element;</mo>
<msub>
<mi>E</mi>
<mi>m</mi>
</msub>
</mrow>
</munder>
<msub>
<mi>v</mi>
<mrow>
<mi>i</mi>
<mi>j</mi>
</mrow>
</msub>
<mrow>
<mo>(</mo>
<msubsup>
<mi>p</mi>
<mi>i</mi>
<mo>*</mo>
</msubsup>
<mo>)</mo>
</mrow>
</mrow>
If the demand that there is node in network is not met, then auction iteration carry out, until network in all node demands all
It is met, then auction reaches convergence,
The amount of bandwidth that downstream node is actually allocated to is：
<mrow>
<msub>
<mi>x</mi>
<mrow>
<mi>i</mi>
<mi>j</mi>
</mrow>
</msub>
<mrow>
<mo>(</mo>
<msubsup>
<mi>p</mi>
<mi>i</mi>
<mo>*</mo>
</msubsup>
<mo>)</mo>
</mrow>
<mo>=</mo>
<msub>
<mi>r</mi>
<mrow>
<mi>i</mi>
<mi>j</mi>
</mrow>
</msub>
<mrow>
<mo>(</mo>
<msubsup>
<mi>p</mi>
<mi>i</mi>
<mo>*</mo>
</msubsup>
<mo>)</mo>
</mrow>
<mo>=</mo>
<msub>
<mi>x</mi>
<mrow>
<mi>i</mi>
<mi>j</mi>
</mrow>
</msub>
<mrow>
<mo>(</mo>
<msubsup>
<mi>p</mi>
<mi>i</mi>
<mn>0</mn>
</msubsup>
<mo>)</mo>
</mrow>
<mo>+</mo>
<munderover>
<mo>&Sigma;</mo>
<mrow>
<mi>t</mi>
<mo>=</mo>
<mn>1</mn>
</mrow>
<mi>T</mi>
</munderover>
<mrow>
<mo>(</mo>
<msub>
<mi>x</mi>
<mrow>
<mi>i</mi>
<mi>j</mi>
</mrow>
</msub>
<mo>(</mo>
<msubsup>
<mi>p</mi>
<mi>i</mi>
<mi>t</mi>
</msubsup>
<mo>)</mo>
<mo>-</mo>
<msub>
<mi>x</mi>
<mrow>
<mi>i</mi>
<mi>j</mi>
</mrow>
</msub>
<mo>(</mo>
<msubsup>
<mi>p</mi>
<mi>i</mi>
<mrow>
<mi>t</mi>
<mo>-</mo>
<mn>1</mn>
</mrow>
</msubsup>
<mo>)</mo>
<mo>)</mo>
</mrow>
</mrow>
The expense that downstream node is actual to answer upstream nodes to pay is：
<mrow>
<msub>
<mi>v</mi>
<mrow>
<mi>i</mi>
<mi>j</mi>
</mrow>
</msub>
<mrow>
<mo>(</mo>
<msubsup>
<mi>p</mi>
<mi>i</mi>
<mo>*</mo>
</msubsup>
<mo>)</mo>
</mrow>
<mo>=</mo>
<msub>
<mi>x</mi>
<mrow>
<mi>i</mi>
<mi>j</mi>
</mrow>
</msub>
<mrow>
<mo>(</mo>
<msubsup>
<mi>p</mi>
<mi>i</mi>
<mn>0</mn>
</msubsup>
<mo>)</mo>
</mrow>
<mo>&CenterDot;</mo>
<msubsup>
<mi>p</mi>
<mi>i</mi>
<mn>0</mn>
</msubsup>
<mo>+</mo>
<munderover>
<mo>&Sigma;</mo>
<mrow>
<mi>t</mi>
<mo>=</mo>
<mn>1</mn>
</mrow>
<mi>T</mi>
</munderover>
<msubsup>
<mi>p</mi>
<mi>i</mi>
<mi>t</mi>
</msubsup>
<mo>&CenterDot;</mo>
<mrow>
<mo>(</mo>
<msub>
<mi>x</mi>
<mrow>
<mi>i</mi>
<mi>j</mi>
</mrow>
</msub>
<mo>(</mo>
<msubsup>
<mi>p</mi>
<mi>i</mi>
<mi>t</mi>
</msubsup>
<mo>)</mo>
<mo>-</mo>
<msub>
<mi>x</mi>
<mrow>
<mi>i</mi>
<mi>j</mi>
</mrow>
</msub>
<mo>(</mo>
<msubsup>
<mi>p</mi>
<mi>i</mi>
<mrow>
<mi>t</mi>
<mo>-</mo>
<mn>1</mn>
</mrow>
</msubsup>
<mo>)</mo>
<mo>)</mo>
</mrow>
<mo>.</mo>
</mrow>
3
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410388131.1A CN104159128B (en) | 2014-01-02 | 2014-08-08 | A kind of video flowing bandwidth allocation methods based on auction in P2P overlay networks |
Applications Claiming Priority (4)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410000705.3 | 2014-01-02 | ||
| CN201410000705 | 2014-01-02 | ||
| CN2014100007053 | 2014-01-02 | ||
| CN201410388131.1A CN104159128B (en) | 2014-01-02 | 2014-08-08 | A kind of video flowing bandwidth allocation methods based on auction in P2P overlay networks |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN104159128A CN104159128A (en) | 2014-11-19 |
| CN104159128B true CN104159128B (en) | 2017-10-27 |
Family
ID=51884518
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410388131.1A Active CN104159128B (en) | 2014-01-02 | 2014-08-08 | A kind of video flowing bandwidth allocation methods based on auction in P2P overlay networks |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN104159128B (en) |
Families Citing this family (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105450738B (en) * | 2015-11-13 | 2019-02-22 | 燕山大学 | Bandwidth allocation method in P2P file sharing network based on price mechanism |
| CN105471997B (en) * | 2015-12-04 | 2019-02-22 | 燕山大学 | Method for controlling flow in P2P file sharing network based on price mechanism |
| CN107770566B (en) * | 2017-11-03 | 2019-12-13 | 中广热点云科技有限公司 | Bandwidth allocation method of P2P overlay network |
| CN114500285B (en) * | 2021-12-28 | 2024-01-02 | 天翼云科技有限公司 | Bandwidth scheduling method and device |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7373587B1 (en) * | 1990-06-25 | 2008-05-13 | Barstow David R | Representing sub-events with physical exertion actions |
| CN101895580A (en) * | 2010-07-15 | 2010-11-24 | 上海大学 | Bandwidth allocation method for scalable video streaming in multi-overlay network based on auction |
-
2014
- 2014-08-08 CN CN201410388131.1A patent/CN104159128B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7373587B1 (en) * | 1990-06-25 | 2008-05-13 | Barstow David R | Representing sub-events with physical exertion actions |
| CN101895580A (en) * | 2010-07-15 | 2010-11-24 | 上海大学 | Bandwidth allocation method for scalable video streaming in multi-overlay network based on auction |
Non-Patent Citations (1)
| Title |
|---|
| 基于拍卖理论的P2P内容分发网络资源分配方法的研究;张云鹤;《中国优秀硕士学位论文全文数据库（电子期刊）信息科技辑》;20131130(第11期);全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN104159128A (en) | 2014-11-19 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN104023277B (en) | Video flowing in P2P overlay networks based on receive it is assorted negotiate a price solution bandwidth allocation methods | |
| CN104159128B (en) | A kind of video flowing bandwidth allocation methods based on auction in P2P overlay networks | |
| CN111866601B (en) | Cooperative game-based video code rate decision method in mobile marginal scene | |
| CN100556163C (en) | A kind of video sharing method of mobile flow medium | |
| CN101895580B (en) | Bandwidth allocation method for scalable video streaming in multi-overlay network based on auction | |
| CN103763334B (en) | Multimedia cooperative sharing method based on P2P-BT in VANET | |
| Su et al. | Incentive mechanisms in p2p media streaming systems | |
| CN102055808A (en) | Method and system for reducing broadcasting delay in P2P (Peer-to-Peer) live broadcasting system | |
| CN106385641A (en) | SDN-based live broadcast video streaming media distribution method | |
| CN103024597B (en) | The optimal bit allocation method of multiple vision point video stream multi-rate multicast transmission | |
| CN103561457B (en) | A kind of multi-target networks power distribution method in heterogeneous wireless network collaboration communication | |
| CN115629873A (en) | System and method for controlling unloading of vehicle-road cloud cooperative tasks and stability of task queue | |
| CN107070817A (en) | A kind of uploading bandwidth optimization method applied to the live platform of cloud | |
| Mehrabi et al. | Joint optimization of QoE and fairness through network assisted adaptive mobile video streaming | |
| Meng et al. | Hierarchical evolutionary game based dynamic cloudlet selection and bandwidth allocation for mobile cloud computing environment | |
| Stiemerling et al. | A system for peer-to-peer video streaming in resource constrained mobile environments | |
| Garmani et al. | The effect of caching on cp and isp policies in information-centric networks | |
| Tao et al. | A resource allocation game with restriction mechanism in VANET cloud | |
| CN103596280A (en) | Heterogeneous network multi-user multi-access video communication self-adaptation bandwidth allocation method | |
| CN103945545A (en) | Heterogeneous network resource optimizing method | |
| Qiao et al. | Multiple time-scale energy scheduling with energy harvesting aided heterogeneous cloud radio access networks | |
| Tan et al. | QoE-driven DASH multicast scheme for 5G mobile edge network | |
| Yin et al. | Joint cloud computing and wireless networks operations: a game theoretic approach | |
| CN110351778A (en) | Mobile communication and received terrestrial digital broadcasting emerging system, method and its user terminal | |
| Hao et al. | Dynamic pricing with traffic engineering for adaptive video streaming over software-defined content delivery networking |
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 |