CN104159128A - Auction-based bandwidth allocation method of video streaming in P2P overlay network - Google Patents
Auction-based bandwidth allocation method of video streaming in P2P overlay network Download PDFInfo
- Publication number
- CN104159128A CN104159128A CN201410388131.1A CN201410388131A CN104159128A CN 104159128 A CN104159128 A CN 104159128A CN 201410388131 A CN201410388131 A CN 201410388131A CN 104159128 A CN104159128 A CN 104159128A
- Authority
- CN
- China
- Prior art keywords
- node
- bandwidth
- auction
- network
- upstream
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Abstract
The invention discloses an auction-based bandwidth allocation method of video streaming in a P2P (peer-to-peer) overlay network. The method realizes the optimization of bandwidth allocation in the P2P overlay network through the following steps, and is characterized in that firstly, nodes adopt a double auction mode, on one hand, upstream bandwidth of a node is sold to other nodes, and on the hand other, bandwidth is bought from other nodes; secondly, a distributed bandwidth auction allocation method based on an ask price is provided, and the minimum bandwidth which can be allocated to a downstream node in each auction is computed. The method can not only reduce the network transmission expenditure and improve the bandwidth availability ratio of the P2P overlay network, but also promote the rational sharing of network sources.
Description
Technical field
The present invention relates to a kind of video flowing bandwidth allocation methods based on auction in P2P overlay network, comprise the structure of overlay network, the foundation of bandwidth auction model between node, and the allocation strategy of bandwidth resources.
Background technology
P2P (Peer-to-Peer) stream media system has merged P2P technology and stream media technology, and its appearance makes to realize the shared possibility that becomes of large-scale stream media on existing network basis.In P2P stream media system, utilize the feature of P2P technology, make full use of the resource of user side, allow user side serve as the function of part of server, user node, in reception and play stream media data, utilizes upstream bandwidth and hardware resource, the stream medium data of buffer memory is transmitted to other nodes, make streaming medium content distribution decentralized, the load of alleviating server with this, has very high extensibility and low-cost feature.By such flow data, share, user node needn't, directly from server request data, by technology such as rational node organization, cache managements, can make a large amount of user nodes share a data flow that is derived from server.
But, for the user in P2P network, provide high-quality video, be still faced with following challenge: for example,
Chinese invention patent Granted publication number is CN 101895580 B, name is called: extensible video stream is the bandwidth allocation methods based on auction in multi-overlay network, the technical scheme of the method can " solve the bandwidth conflict between multi-overlay network; improve the quality of node receiver, video; the interlayer dependence of Adaptive matching scalable video: the first, the allocated bandwidth optimization problem of P2P multi-overlay network is converted into the allocated bandwidth optimization problem of a series of individual layer overlay networks; The second, between node, with the form of two way auction, sell on the one hand the upstream bandwidth of oneself to other nodes, to other nodes, buy bandwidth on the other hand, thereby solve the bandwidth conflict problem of node in multi-overlay; The 3rd, a kind of adaptive " layer adds/exits " algorithm is proposed, make node when carrying out bandwidth sale and auction, can select the nerve of a covering number of plies amount that will participate according to network real time status, avoid the waste of bandwidth ".
But, although the method has solved the bandwidth conflict problem between transmission related content overlay network, for receiving node provides higher video quality, also improved the utilance of the network bandwidth.
Yet, restricted, the condition isomerism of video reception end subscriber of the uploading bandwidth of node in this bandwidth allocation methods, the high fluidity of node, data dispatch strategy etc. are too complicated, and network node is only enjoyed resource and service and the behavior of not contributing for system etc.Address the above problem the bandwidth capacity that not only needs to increase node, dispose more server and make up the deficiency of Internet resources, also need to adopt novel streaming medium content distribution technology, efficient resource allocation algorithm and Protocol Design etc. rationally to utilize active block resource, in this bandwidth allocation methods, when balanced, different downstream nodes are different to the knock-down price of same upstream node, and downstream node is not had to fairness; Each downstream node is to a plurality of upstream transmission two dimension auction message, and transport overhead is large.In P2P network uploading bandwidth limited be the bottleneck of P2P network, therefore the key research point that how limited distribution network uploading bandwidth is P2P network, consider that the geographical distribution of P2P network node disperses, the method that upstream node is sold the private information of whole network downstream node directly to households is infeasible, the present invention proposes a kind of video flowing bandwidth allocation methods based on auction in P2P overlay network, for solving rationally effectively distributing of network uploading bandwidth, realize the efficient utilization of Internet resources.
Summary of the invention
The object of the present invention is to provide a kind of video flowing bandwidth allocation methods based on auction in P2P overlay network.The method can not only reduce Internet Transmission expense, improves P2P overlay network bandwidth availability ratio, and promotes rationally sharing of Internet resources.
According to foregoing invention, conceive, the present invention adopts following technical proposals: a kind of video flowing is the bandwidth allocation methods based on auction in P2P overlay network, it is characterized in that: first, between node with the form of two way auction, sell on the one hand the upstream bandwidth of oneself to other node, to other nodes, buy bandwidth on the other hand; The second, propose based on asked distributed bandwidth auction distribution method, calculate downstream node in every bandwidth that at least can be assigned in taking turns auction.
Provide principle explanation below:
The allocated bandwidth optimization problem conversion process of overlay network is:
(1), network model and relevant parameter
Video flowing by nerve of a covering with speed
transmit; Nerve of a covering can abstractly be directed graph
, wherein
represent the node set of all these networks of participation,
the set of oriented link between representation node,
for link
mean transit delay parameter; Node adds nerve of a covering, can go out video at decoding terminals,
represent the utility function in nerve of a covering;
Node organization every takes turns auction and is divided into two subcycles: in assignment period, and auction organization node
broadcast its charge, downstream node is determined bandwidth request amount according to charge, and according to the optimum bandwidth request amount of downstream node, upstream node is used a kind of allocation strategy to sell its upstream bandwidth
; Within the auction cycle, upstream node receives after the aggregate demand of all downstream nodes that take part in auction, by the available upstream bandwidth of itself and node
relatively, according to the relation of aggregate demand and quantity delivered, determine the amount of bandwidth that downstream node at least can be assigned to, the charge of upstream node adjustment auction, according to new charge, downstream node redefines bandwidth request amount, 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 that equilibrium state experiences and is called convergence rate;
(2), optimization aim
For downstream node j, the target of its bandwidth on demand is to have enough bandwidth to receive best video quality, downstream node is when selecting best upstream node, not only consider upstream node bandwidth charge, but also consider link delay problem, should select the upstream node bandwidth on demand of link delay minimum, so downstream node is as follows in the optimization problem of nerve of a covering:
s.t.
1)
;
2)
.
Optimization aim: downstream node total utility maximizes, utility function deducts link delay and the maximization of auction cost;
Constraints: in nerve of a covering, downstream node is less than or equal to the transmission rate of this nerve of a covering to the total bandwidth of all upstream node requests;
And upstream node
optimization problem be:
s.t.
Optimization aim: upstream node auction bandwidth gained revenus maximization;
Constraints:
The salable total amount of bandwidth of upstream node is limited by its uploading bandwidth;
Above-mentioned two way auction process is:
(1), initialization
It is that network node number is that network size is set
n, initially auction the time
, the price of charge increases step-length
;
All upstream node i: initially ask a price
, in P2P overlay network, send upstream node i charge
(2), determine bandwidth request amount
Participate in the downstream node i of auction: the downstream node i that participates in auction receives the charge of upstream node
after, obtain optimum bandwidth request amount
, by optimum bandwidth request amount
send to again corresponding upstream node;
(3), charge is upgraded
Upstream node i: upstream node receives from participating in after the bandwidth request amount of all downstream nodes of auctioning, the total request amount of bandwidth in the auction of statistics upstream node i tissue
, by the total request amount of bandwidth
the uploading bandwidth having had with upstream node
relatively, if the total request amount of bandwidth
be greater than
, go to step (4), otherwise go to step (5);
(4), the demand of all nodes in judgement network
If there is node in network
, in network, there is node demand surplus,
{
If node
idemand surplus,
{
Charge
, calculate this and take turns the amount of bandwidth that auction process middle and lower reaches node j at least can be assigned to
}
Else
{
Maintain original price
, calculate this and take turns the amount of bandwidth that auction process middle and lower reaches node j at least can be assigned to
}
Order
, the charge after broadcast is upgraded
give downstream node,
Repeating step (2) and step (3),
}
(5), stop iteration, End of Auction, network reaches equilibrium state;
(6), make the auction time
represent the End of Auction time,
If upstream node charge is:
, the amount of bandwidth that downstream node is assigned to equals its bandwidth on demand amount,
,
Downstream node
utility function be:
If exist the demand of node not meet in network, auction so iteration and carry out, until all node demands are all met in network, auction reaches convergence,
Downstream node actual allocated to amount of bandwidth be:
The actual expense of answering upstream nodes to pay of downstream node is:
This method and existing bandwidth allocation methods relatively have the following advantages: this method has proposed a kind of video flowing bandwidth allocation methods based on auction in P2P overlay network, method simple transparent, and protected privacy, because auction algorithm is distributed, each user who participates in auction does not need to report himself private information, it only need to report their request amount, has reduced transport overhead; The feature with anti-cheating, prevents that deceptive information is participated in auction for node, impels selfish node in network and non-cooperative nodes to report real demand so that self maximizing the benefits.
Accompanying drawing explanation
Fig. 1 is node distribution table during network topology is set;
Fig. 2 is price step-length in step in this method (1)
when different, constringency performance compares schematic diagram;
Fig. 3 is network size in step in this method (1)
nwhen different, constringency performance compares schematic diagram;
Fig. 4 is price step-length in step in this method (1)
the average yield figure of network node when different;
Fig. 5 is that in step in this method (6), interests of the whole maximize relatively schematic diagram of performance constringency performance;
Fig. 6 is auction cyclic flow schematic diagram of the present invention.
Embodiment
Below in conjunction with accompanying drawing, describe the application example of the inventive method in detail:
1, network topology is set
This method is carried out performance simulation by the overlay network of random generation, the interstitial content that P2P overlay network is set in experiment is 200, neighbours' number of each node is 5, selects 9 kinds of network nodes that uploading bandwidth ability is different, wherein in network 66% node have 256 (
kbps) to 768 (
kbps) uploading bandwidth, the uploading bandwidth that can contribute be 150 (
kbps) to 600 (
kbps); Total uploading bandwidth of 38% node be 1024 (
kbps), the uploading bandwidth of contribution be 800 (
kbps), total uploading bandwidth amount of remaining 6% node be greater than 1024 (
kbps), the uploading bandwidth of contribution be 1000 (
kbps); Every kind of percentage difference that node distributes and accounts for, specifically as shown in Fig. 1.
This method adopt 30 frame/seconds (
fps), resolution is CIF(352*288) standard testing video sequence " Bus " test, GOP size is got 32 frames.For each sequence, use the JSVM9_11 encoder of the extended reference coding standard based on H.264/AVC, be encoded into three straton code streams, speed is 256
kbpsbasic layer and 128
kbpsenhancement layer.
The utility function that this method adopts is:
Wherein,
for rate distortion function,
, variable
,
with
the parameter of R-D model, by the decisions such as temporal resolution, spatial resolution and time delay of video sequence.This method is used
utility function, and with average peak signal to noise ratio (PSNR), weigh the receiver, video quality of node.
2, set up the algorithm model based on above topology
Each node
the role who simultaneously serves as upstream node and downstream node carries out respectively the following step within every two cycles of taking turns auction:
1) assignment period
Step 1. is collected the bandwidth on demand from all downstream nodes, and the set of the bandwidth on demand of all downstream nodes is
；
Step 2. is according to downstream node bandwidth request total amount and available upstream bandwidth
relation, adjust charge, determine the amount of bandwidth that downstream node at least can be assigned to
Step 3. repeating step 1 and 2, until the demand of all downstream nodes is all met.
2) the auction cycle
Receive the charge of upstream node
, determine optimum bandwidth request amount
.
3, in above-mentioned network topology, carry out performance evaluation
1) constringency performance of method when difference restrains step-length
As shown in Figure 1, can know in P2P overlay network, on average can utilize uploading bandwidth for 541kbps, surpass average video speed 512kbps, the uploading bandwidth total amount in network, enough meets the demand that all nodes obtain enough bandwidth in overlay network.The method is based on asked auction system, therefore only in network all upstream nodes not in demand surplus, be that arbitrary node is all need not adjust ask price time, network is at equilibrium, therefore by the average ask price of all nodes in network, judge that whether network is at equilibrium, if the front and back two-wheeled of auction process all remains unchanged, known network reaches equilibrium state.Fig. 2 is the convergence situation of the algorithm that proposes of this method when different prices increases step-length, and as can be seen from Figure 2, algorithm in this paper can reach convergence in the situation that of different step-length, and price to increase step-length larger, algorithm the convergence speed is faster.
2) convergence of algorithm performance in heterogeneous networks scale
Fig. 3 has represented that the auction algorithm of this method proposition is in the network of different scales and the algorithm the convergence speed comparison in the restriction of different neighbor node number.Network size is the number of nodes, is set to respectively 100,200 and 300, and the quantity of neighbor node is set to respectively 20,10 and 5.Y coordinate in figure represents the auction wheel number that in network, all node demands are met, and whole network is constantly balanced, from Fig. 3, can find, along with the increase of network size, algorithm the convergence speed slows down, and reason is, owing to strengthening along with network size, node competition is all the more violent; , also can find, along with the increase of neighbor node number restriction, algorithm the convergence speed is faster meanwhile, and this is owing to can providing the node of uploading bandwidth to increase, having alleviated the phenomenon to same upstream node request surplus.
3) average yield of network node during different price step-length
When Fig. 4 has represented different price iteration step lengths, the average yield of network node.As can be seen from Figure 4, along with the increase of price iteration step length, the average yield of network node reduces thereupon, and the total revenue of network node reduces.Known according to Fig. 2 and Fig. 4, iteration step length need to be weighed convergence rate and overall benefit, and iteration step is grown up, although can convergence speedup speed, overall benefit is reduced; Vice versa.
4) interests of the whole maximize performance
Analyze the algorithm of this method proposition in the situation that price iteration step length is enough little, whether can reach interests of the whole and maximize.This method is compared by centralized optimization and distributed auction mode, and distributed auction method is method in this paper.Adopting centralized optimized algorithm to reach interests of the whole maximizes, because the maximized model of interests of the whole is to utilize the fmincon function in Matlab tool box to solve, network size is crossed conference and is caused arithmetic speed excessively slow, and therefore, described P2P overlay network is comprised of 6 nodes.When the Lagrangian product in interests of the whole maximization model equates with the balanced charge of upstream node, algorithm is reaching individual interests maximized time, can reach interests of the whole maximized state, the Lagrange multiplier that interests of the whole are maximized in model calls optimization price simultaneously.Known at Fig. 5, at price iteration step length, be 0.007 o'clock, when network reaches equilibrium state, the equilibrium of upstream node charge is not equal to the maximized optimization price of interests of the whole, therefore, now only reaches individual interests and maximizes, and does not reach interests of the whole and maximizes; When price iteration step length is 0.00001, the equilibrium of upstream node charge equals the maximized optimization price of interests of the whole, and now network has not only reached individual interests maximization, but also has reached interests of the whole maximization.
Claims (1)
1. video flowing bandwidth allocation methods based on auction in P2P overlay network, is characterized in that: the first, between node, with the form of two way auction, sell on the one hand own upstream bandwidth to other node, on the other hand to other nodes purchase bandwidth; The second, propose based on asked distributed bandwidth auction distribution method, calculate downstream node in every bandwidth that at least can be assigned in taking turns auction,
The allocated bandwidth optimization problem conversion process of overlay network is:
(1), network model and relevant parameter
Video flowing by nerve of a covering with speed
transmit; Nerve of a covering can abstractly be directed graph
, wherein
represent the node set of all these networks of participation,
the set of oriented link between representation node,
for link
mean transit delay parameter; Node adds nerve of a covering, can go out video at decoding terminals,
represent the utility function in nerve of a covering;
Node organization every takes turns auction and is divided into two subcycles: in assignment period, auction organization node i broadcasts its charge, downstream node is determined bandwidth request amount according to charge, and according to the optimum bandwidth request amount of downstream node, upstream node is used a kind of allocation strategy to sell its upstream bandwidth
; Within the auction cycle, upstream node receives after the aggregate demand of all downstream nodes that take part in auction, by the available upstream bandwidth of itself and node
relatively, according to the relation of aggregate demand and quantity delivered, determine the amount of bandwidth that downstream node at least can be assigned to, the charge of upstream node adjustment auction, according to new charge, downstream node redefines bandwidth request amount, 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 that equilibrium state experiences and is called convergence rate;
(2), optimization aim
For downstream node j, the target of its bandwidth on demand is to have enough bandwidth to receive best video quality, downstream node is when selecting best upstream node, not only consider upstream node bandwidth charge, but also consider link delay problem, should select the upstream node bandwidth on demand of link delay minimum, so downstream node is as follows in the optimization problem of nerve of a covering:
s.t.
1)
;
2)
.
Optimization aim: downstream node total utility maximizes, utility function deducts link delay and the maximization of auction cost;
Constraints: in nerve of a covering, downstream node is less than or equal to the transmission rate of this nerve of a covering to the total bandwidth of all upstream node requests;
The optimization problem of upstream node i is:
s.t.
Optimization aim: upstream node auction bandwidth gained revenus maximization;
Constraints:
The salable total amount of bandwidth of upstream node is limited by its uploading bandwidth;
Above-mentioned two way auction process is:
(1), initialization
It is that network node number is that network size is set
n, initially auction the time
, the price of charge increases step-length
;
All upstream node i: initially ask a price
, in P2P overlay network, send upstream node i charge
(2), determine bandwidth request amount
Participate in the downstream node j of auction: the downstream node j that participates in auction receives the charge of upstream node
after, obtain optimum bandwidth request amount
, by optimum bandwidth request amount
send to again corresponding upstream node;
(3), charge is upgraded
Upstream node i: upstream node receives from participating in after the bandwidth request amount of all downstream nodes of auctioning, statistics upstream node
the total request amount of bandwidth in tissue auction
, by the total request amount of bandwidth
the uploading bandwidth having had with upstream node
relatively, if the total request amount of bandwidth
be greater than
, go to step (4), otherwise go to step (5);
(4), the demand of all nodes in judgement network
If there is node in network
, in network, there is node demand surplus,
{
If node
idemand surplus,
{
Charge
, calculate this and take turns the amount of bandwidth that auction process middle and lower reaches node j at least can be assigned to
}
Else
{
Maintain original price
, calculate this and take turns the amount of bandwidth that auction process middle and lower reaches node j at least can be assigned to
}
Order
, the charge after broadcast is upgraded
give downstream node,
Repeating step (2) and step (3),
}
(5), stop iteration, End of Auction, network reaches equilibrium state;
(6), make the auction time
represent the End of Auction time,
If upstream node charge is:
, the amount of bandwidth that downstream node is assigned to equals its bandwidth on demand amount,
,
The utility function of downstream node j is:
If exist the demand of node not meet in network, auction so iteration and carry out, until all node demands are all met in network, auction reaches convergence,
Downstream node actual allocated to amount of bandwidth be:
The actual expense of answering upstream nodes to pay of downstream node is:
。
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 |
|---|---|---|---|
| CN2014100007053 | 2014-01-02 | ||
| CN201410000705 | 2014-01-02 | ||
| CN201410000705.3 | 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 true CN104159128A (en) | 2014-11-19 |
| CN104159128B 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) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105450738A (en) * | 2015-11-13 | 2016-03-30 | 燕山大学 | Price mechanism-based bandwidth allocation algorithm in P2P file sharing network |
| CN105471997A (en) * | 2015-12-04 | 2016-04-06 | 燕山大学 | Method for controlling flow in P2P file sharing network based on price mechanism |
| CN107770566A (en) * | 2017-11-03 | 2018-03-06 | 中广热点云科技有限公司 | A kind of bandwidth allocation methods of P2P overlay networks |
| CN114500285A (en) * | 2021-12-28 | 2022-05-13 | 天翼云科技有限公司 | 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内容分发网络资源分配方法的研究", 《中国优秀硕士学位论文全文数据库（电子期刊）信息科技辑》 * |
Cited By (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105450738A (en) * | 2015-11-13 | 2016-03-30 | 燕山大学 | Price mechanism-based bandwidth allocation algorithm in P2P file sharing network |
| CN105450738B (en) * | 2015-11-13 | 2019-02-22 | 燕山大学 | Bandwidth allocation method in P2P file sharing network based on price mechanism |
| CN105471997A (en) * | 2015-12-04 | 2016-04-06 | 燕山大学 | Method for controlling flow 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 |
| CN107770566A (en) * | 2017-11-03 | 2018-03-06 | 中广热点云科技有限公司 | A kind of bandwidth allocation methods of P2P overlay networks |
| CN107770566B (en) * | 2017-11-03 | 2019-12-13 | 中广热点云科技有限公司 | Bandwidth allocation method of P2P overlay network |
| CN114500285A (en) * | 2021-12-28 | 2022-05-13 | 天翼云科技有限公司 | Bandwidth scheduling method and device |
| CN114500285B (en) * | 2021-12-28 | 2024-01-02 | 天翼云科技有限公司 | Bandwidth scheduling method and device |
Also Published As
| Publication number | Publication date |
|---|---|
| CN104159128B (en) | 2017-10-27 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN104023277A (en) | Method of bandwidth allocation of video stream in P2P (Peer to Peer) overlay network based on Nash bargaining solution | |
| CN101895580B (en) | Bandwidth allocation method for scalable video streaming in multi-overlay network based on auction | |
| CN104159128A (en) | Auction-based bandwidth allocation method of video streaming in P2P overlay network | |
| Hu et al. | Proxy-based multi-stream scalable video adaptation over wireless networks using subjective quality and rate models | |
| CN100477641C (en) | Data dispatching method of stream medium request broadcast system | |
| CN101997922B (en) | Cost optimization-based P2P streaming media coverage network topology structure adjustment method | |
| CN101478564A (en) | Adaptive hierarchical transmission structure design method for P2P stream media network | |
| CN111866601A (en) | Cooperative game-based video code rate decision method in mobile marginal scene | |
| CN102055808A (en) | Method and system for reducing broadcasting delay in P2P (Peer-to-Peer) live broadcasting system | |
| CN108259078A (en) | A kind of resource allocation methods and system for Integrated Electronic System on star | |
| Misra et al. | QoS-aware dispersed dynamic mapping of virtual sensors in sensor-cloud | |
| CN103024597B (en) | The optimal bit allocation method of multiple vision point video stream multi-rate multicast transmission | |
| CN109408211A (en) | A kind of equity network flow medium system data scheduling algorithm of multiple-objection optimization | |
| CN107070817A (en) | A kind of uploading bandwidth optimization method applied to the live platform of cloud | |
| Wu et al. | Balancing performance and fairness in P2P live video systems | |
| Chen et al. | Advances in multimedia communications | |
| CN103067306B (en) | The method and device of distribution bandwidth | |
| CN103281355A (en) | Fuzzy decision-based server push method | |
| Bradai et al. | Efficient content delivery scheme for layered video streaming in large-scale networks | |
| CN103596280B (en) | The adaptive bandwidth allocation method of heterogeneous network multi-user multiple access video communication | |
| Garmani et al. | The effect of caching on cp and isp policies in information-centric networks | |
| CN103997693B (en) | The motivational techniques of quality optimization are delivered in opportunistic network towards video | |
| Hu et al. | Efficient and incentive-compatible resource allocation mechanism for P2P-assisted content delivery systems | |
| Wu et al. | Multiple-tree topology construction scheme for P2P live streaming systems under flash crowds | |
| CN113194362A (en) | Video multicast grouping and code rate decision method in edge calculation scene |
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 |