CN104918134B - It is a kind of based on receive assorted agreed-upon price interactive video in multiple viewpoints data packet dispatching method - Google Patents
It is a kind of based on receive assorted agreed-upon price interactive video in multiple viewpoints data packet dispatching method Download PDFInfo
- Publication number
- CN104918134B CN104918134B CN201510180595.8A CN201510180595A CN104918134B CN 104918134 B CN104918134 B CN 104918134B CN 201510180595 A CN201510180595 A CN 201510180595A CN 104918134 B CN104918134 B CN 104918134B
- Authority
- CN
- China
- Prior art keywords
- mrow
- msub
- viewpoint
- video data
- user
- 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.)
- Expired - Fee Related
Links
- 238000000034 method Methods 0.000 title claims abstract description 38
- 230000002452 interceptive effect Effects 0.000 title claims abstract description 19
- 230000005540 biological transmission Effects 0.000 claims abstract description 22
- 238000005457 optimization Methods 0.000 claims abstract description 12
- 239000011248 coating agent Substances 0.000 claims abstract description 11
- 238000000576 coating method Methods 0.000 claims abstract description 11
- 230000000737 periodic effect Effects 0.000 abstract description 3
- 238000010586 diagram Methods 0.000 description 3
- 238000011161 development Methods 0.000 description 2
- 238000011156 evaluation Methods 0.000 description 2
- 230000003993 interaction Effects 0.000 description 1
- 238000011160 research Methods 0.000 description 1
- 230000000630 rising effect Effects 0.000 description 1
- 238000012546 transfer Methods 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N21/00—Selective content distribution, e.g. interactive television or video on demand [VOD]
- H04N21/60—Network structure or processes for video distribution between server and client or between remote clients; Control signalling between clients, server and network components; Transmission of management data between server and client, e.g. sending from server to client commands for recording incoming content stream; Communication details between server and client
- H04N21/65—Transmission of management data between client and server
- H04N21/658—Transmission by the client directed to the server
- H04N21/6587—Control parameters, e.g. trick play commands, viewpoint selection
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N21/00—Selective content distribution, e.g. interactive television or video on demand [VOD]
- H04N21/20—Servers specifically adapted for the distribution of content, e.g. VOD servers; Operations thereof
- H04N21/25—Management operations performed by the server for facilitating the content distribution or administrating data related to end-users or client devices, e.g. end-user or client device authentication, learning user preferences for recommending movies
- H04N21/258—Client or end-user data management, e.g. managing client capabilities, user preferences or demographics, processing of multiple end-users preferences to derive collaborative data
- H04N21/25866—Management of end-user data
- H04N21/25891—Management of end-user data being end-user preferences
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N21/00—Selective content distribution, e.g. interactive television or video on demand [VOD]
- H04N21/20—Servers specifically adapted for the distribution of content, e.g. VOD servers; Operations thereof
- H04N21/25—Management operations performed by the server for facilitating the content distribution or administrating data related to end-users or client devices, e.g. end-user or client device authentication, learning user preferences for recommending movies
- H04N21/262—Content or additional data distribution scheduling, e.g. sending additional data at off-peak times, updating software modules, calculating the carousel transmission frequency, delaying a video stream transmission, generating play-lists
- H04N21/26208—Content or additional data distribution scheduling, e.g. sending additional data at off-peak times, updating software modules, calculating the carousel transmission frequency, delaying a video stream transmission, generating play-lists the scheduling operation being performed under constraints
- H04N21/26216—Content or additional data distribution scheduling, e.g. sending additional data at off-peak times, updating software modules, calculating the carousel transmission frequency, delaying a video stream transmission, generating play-lists the scheduling operation being performed under constraints involving the channel capacity, e.g. network bandwidth
Landscapes
- Engineering & Computer Science (AREA)
- Databases & Information Systems (AREA)
- Multimedia (AREA)
- Signal Processing (AREA)
- Computer Graphics (AREA)
- Computer Networks & Wireless Communication (AREA)
- Two-Way Televisions, Distribution Of Moving Picture Or The Like (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses it is a kind of based on receive assorted agreed-upon price interactive video in multiple viewpoints data packet dispatching method, first, in user terminal, each user determines the video data bag request of the viewpoint of itself to this method, and feeds back to server；Then, server receives the video data bag request of the viewpoint of each user, and by the video data packet scheduling optimization modeling of interactive multi-view into receiving assorted model of bargain；Then, server end lists optimal condition using Lagrange duality and constraints（KKT conditions）Solving-optimizing model, determine the probability that the video data coating of each viewpoint of server end is sent；Finally, server end updates the probability that the video data coating of all viewpoints is sent.This method can be in the case where network bandwidth resources be limited, and server is asked according to the video data bag of the viewpoint of user's periodic feedback, and the video data bag of viewpoint is dispatched to all users, realizes the performance balance between network transmission efficiency and user fairness.
Description
Technical field
The present invention relates to it is a kind of based on receive assorted agreed-upon price interactive video in multiple viewpoints data packet dispatching method, belong to more matchmakers
Volume data transmission technique field.
Background technology
With the fast development of network multimedia related-art technology and the continuous upgrading of Video service, people have been discontented with
Traditional single viewpoint video is enough to, then multi-view point video technology is arisen at the historic moment and to become current video research field most heavy
One of development trend wanted.The most prominent feature of multi-view point video is exactly interactivity, and how to embody this feature becomes regard more
Point Video Applications need to solve the problems, such as.Interactive video in multiple viewpoints data transfer is regarded accordingly according to the transmission of the demand of user
The video data of point, it is possible to reduce the data volume of transmission and meet requirement of the user to video quality.
Current interactive multi-view video system server end can provide the video data of multiple viewpoints, user terminal
User according to itself preference, can select the viewpoint of server end, in watching process, can arbitrarily switch the viewpoint of demand, real
Interacting for user terminal and server end is showed.
The video data of multiple viewpoints due to Server Side Include, compared to the data of traditional single viewpoint video,
The data volume of multi-view point video is bigger.Under limited network bandwidth resources, when network congestion occurs, existing interactive mode is more
The data packet dispatching method of viewpoint video, in the video data packet scheduling of viewpoint, if to meet user terminal most users
Viewpoint demand is target, is preferentially sent by the video data bag of the viewpoint of most users demand, and between ignoring all users
Fairness, the greatest differences of each user video quality can be caused；If the fairness between all users as target, is put down
Etc. ground dispatch the video data bags of all viewpoints, without considering that user to the different demands of viewpoint, then can cause network transmission to imitate
Rate reduces.
The content of the invention
, it is an object of the invention to provide it is a kind of based on receive assorted agreed-upon price interactive video in multiple viewpoints data packet dispatching side
Method, in order to ensure higher network transmission efficiency, while the fairness between user is taken into account, this method can provide in network bandwidth
In the case that source is limited, server is asked according to the video data bag of the viewpoint of user's periodic feedback, is dispatched to all users
The video data bag of viewpoint, realize the performance balance between network transmission efficiency and user fairness.
In order to achieve the above object, idea of the invention is that：
First, in user terminal, each user determines the video data bag request of the viewpoint of itself, and feeds back to server；
Then, server receives the video data bag request of the viewpoint of each user, and by the number of interactive video in multiple viewpoints
According to packet scheduling optimization modeling into receiving assorted model of bargain；
Then, server end lists optimal condition (KKT, Karush- using Lagrange duality and constraints
Kuhn-Tucker conditions) solving-optimizing model, determine the probability that the video data coating of each viewpoint of server end is sent；
Finally, the change that server end is asked according to the video data bag of user's viewpoint, the video counts of all viewpoints are updated
The probability sent according to coating, realize that network transmission optimizes,
Conceived according to foregoing invention, the present invention uses following technical proposals：
It is a kind of based on receive assorted agreed-upon price interactive video in multiple viewpoints data packet dispatching method, it is comprised the following steps that：
Step 1. determines user's n own views m video data demand packet
(1) defines the preference of the video data bag of viewpoint
In user terminal, user n is defined to the preference of viewpoint m video data bag, is designated asIts expression formula is：
N=1,2 ..., N, m=1,2 ..., M
Wherein,It is the direction of viewpoint m in server end, M is number of views,It is user n head direction, N is to use
Number of users in the end of family,It is the direction of viewpoint m in server endWith user n head directionBetween angle；
(2) defines preference function u of the user to the video data bag of viewpointn,m, its expression formula is：
Wherein, Ε is for judging whether user n asks to server to send the threshold value of viewpoint m video data bag；If
un,mFor 1, then user n asks to send viewpoint m video data bag to server, and otherwise user n does not regard to server request transmission
Point m video data bag；
Step 2. establishes the assorted model of bargain of receiving of the video data packet scheduling optimization of viewpoint
(1) defines viewpoint m utility function um, its expression formula is：
Wherein, xmIt is the probability that viewpoint m video data bag being serviced device is sent；
(2) defines viewpoint m minimum utility functionIts expression formula is：
Wherein, ε is a normal number；
(3) establishes objective optimisation problems
According to described viewpoint m utility function and minimum utility function, the video data packet scheduling for establishing viewpoint is optimal
That changes receives assorted model of bargain, specific as follows：
Target problem：
Constraints：
①.0≤xm≤ 1, m=1 ..., M,
②.
③.
Optimization aim：While possessing higher network transmission efficiency, the fairness between all users is taken into account；
Constraints：
1. the video data bag being serviced device of each viewpoints of is sent to the probability of user between 0 and 1；
2. the probability sum that the video data bag being serviced device of all viewpoints of is sent to user is 1；
3. the probability that the video data bag being serviced device of each viewpoints of is sent to user is more than minimum probability；
Step 3. solving-optimizing model determines the sending probability of all viewpoint video packets
(1) carries out logarithm process to former target problem, obtains：
(2) defines Lagrange duality：
Wherein, λ, αmAnd βmLagrange multiplier is represented, the logarithm problem has convex object function, and constraints is convex
Collection；
(3) is solved using KKT conditions：Optimal condition (KKT bars are listed according to Lagrange duality and constraints
Part), it is as follows：
0≤xm≤1；
The optimum probability that viewpoint m video data bag being serviced device is sent is calculated, its calculating formula is：
Step 4. updates the sending probability of the video data bag of all viewpoints
User's head is adapted to towards change, display device periodically follows the trail of the head direction of renewal user, and user terminal is each
The video data bag that user's repeat step 1 sends new viewpoint asks, to server, server end repeat step 2 to 3, to update institute
The probability that the video data coating for having viewpoint is sent, realizes that network transmission optimizes.
This method has advantages below compared with the prior art：
The present invention it is a kind of based on receive assorted agreed-upon price interactive video in multiple viewpoints data packet dispatching method, this method introduce
What the video data packet scheduling of viewpoint optimized receive assorted model of bargain, server is according to the viewpoint video number of user's periodic feedback
Asked according to bag, dispatch the video data bag of viewpoint to all users with optimum probability, possess the same of higher network transmission efficiency
When, take into account the fairness between all users.
Brief description of the drawings
Fig. 1 is the general flow chart of the inventive method；
Fig. 2 is the video data bag sending probability fairness schematic diagram of each viewpoint；
Fig. 3 is each user satisfaction schematic diagram；
Fig. 4 is average user satisfaction schematic diagram.
Embodiment
Embodiments of the invention are described in further detail below in conjunction with the accompanying drawings：It is a kind of based on receiving the interaction of assorted agreed-upon price
The data packet dispatching method of formula multi-view point video, it is characterised in that first, in user terminal, each user determines itself to this method
The video data bag request of viewpoint, and feed back to server；Then, the video data bag of the viewpoint of each user of server reception please
Ask, and by the data packet dispatching optimization modeling of interactive video in multiple viewpoints into receiving assorted model of bargain；Then, server end utilizes
Lagrange duality and constraints list optimal condition (KKT, Karush-Kuhn-Tucker condition) solving-optimizing model,
Determine the probability that the video data coating of each viewpoint of server end is sent；Finally, server end is according to the video of user's viewpoint
The change of data packet request, the probability that the video data coating of all viewpoints is sent is updated, realizes that network transmission optimizes.
The present embodiment is tested under premised on technical solution of the present invention, as shown in figure 1, giving detailed implementation
Mode and specific operating process, it is main to include determining user's n own views m video data demand packet, establish regarding for viewpoint
Receive assorted model of bargain, the solving-optimizing model that frequency data packet dispatching optimizes determine that the transmission of all viewpoint video packets is general
The performance evaluation of rate, the sending probability of all viewpoint video packets of renewal and the inventive method.
1. determine user's n own views m video data demand packet
(1) defines the video data bag preference of viewpoint
The video sequence that the present invention chooses 8 viewpoints carries out instance analysis, and each view sequence includes 96 frames, uses
H.264/AVC standard is to each viewpoint absolute coding, and resolution ratio is 640 × 480 after coding, and each gop size is 8, is quantified
Parameter is chosen for 28,8 viewpoints and is evenly distributed in identical differential seat angle between 20 ° and 160 °.In user terminal, display device
The head direction of user is periodically obtained, the head direction of first kind user is evenly distributed between 45 ° to 135 °, and second
The head of class user towards being evenly distributed in 0 ° between 45 ° or 135 ° to 180 °,It is viewpoint m in server end
Direction, 8 be number of views,It is user n head direction, N is the number of users in user terminal, then user n regards to viewpoint m
The preference of frequency packet is：
N=1,2 ..., N, m=1,2 ..., 8
WhereinIt is the direction of viewpoint m in server endWith user n head directionBetween angle；
(2) defines preference function u of the user to the video data bag of viewpointn,m, its expression formula is：
Wherein, Ε is for judging whether user n asks to server to send the threshold value of viewpoint m video data bag；If
un,mFor 1, then user n asks to send viewpoint m video data bag to server, and otherwise user n does not regard to server request transmission
Point m video data bag；
2. establish the assorted model of bargain of receiving of the video data packet scheduling optimization of viewpoint
(1) defines viewpoint m utility function um, its expression formula is：
Wherein, xmIt is the probability that viewpoint m video data bag being serviced device is sent；
(2) defines viewpoint m minimum utility functionIts expression formula is：
Wherein, ε is a normal number；
(3) establishes objective optimisation problems
According to described viewpoint m utility function and minimum utility function, the video data packet scheduling for establishing viewpoint is optimal
That changes receives assorted model of bargain, specific as follows：
Target problem：
Constraints：
①.0≤xm≤ 1, m=1 ..., M,
②.
③.
Optimization aim：While possessing higher network transmission efficiency, the fairness between all users is taken into account；
Constraints：
1. the video data bag being serviced device of each viewpoints of is sent to the probability of user between 0 and 1；
2. the probability sum that the video data bag being serviced device of all viewpoints of is sent to user is 1；
3. the probability that the video data bag being serviced device of each viewpoints of is sent to user is more than minimum probability；
3. solving-optimizing model determines the sending probability of all viewpoint video packets
(1) carries out logarithm process to former target problem, obtains：
(2) defines Lagrange duality：
Wherein, λ, αmAnd βmLagrange multiplier is represented, the logarithm problem has convex object function, and constraints is convex
Collection；
(3) is solved using KKT conditions：Optimal condition (KKT bars are listed according to Lagrange duality and constraints
Part), it is as follows：
0≤xm≤1；
The optimum probability that viewpoint m video data bag being serviced device is sent is calculated, its calculating formula is：
4. the sending probability of the video data bag of all viewpoints of renewal
User's head is adapted to towards change, display device periodically follows the trail of the head direction of renewal user, and user terminal is each
The video data bag that user's repeat step 1 sends new viewpoint asks, to server, server end repeat step 2 to 3, to update institute
The probability that the video data coating for having viewpoint is sent, realizes that network transmission optimizes；
5. using performance evaluation is carried out after the inventive method, the optimization of each viewpoint data packet dispatching is realized
In order to analyze the performance of the inventive method, the data packet dispatching with following two existing interactive video in multiple viewpoints
Method is compared：
Ratio is dispatched：Using the viewpoint demand for meeting user terminal most users as target, preferentially send by most users demand
Viewpoint video data bag；
Equity dispatching：Fairness between all users coequally dispatches the video data bag of all viewpoints as target；
(1) fairness of each viewpoint video packet sending probabilities of
Fig. 2 compared for each viewpoint video packet hair during the data packet dispatching method using three kinds of interactive video in multiple viewpoints
Send the difference between the fairness of probability, during equity dispatching the fairness of each viewpoint video packet sending probability it is permanent for 1 thus
Do not drawn in figure；As illustrated, the fairness of each viewpoint video packet sending probability of the inventive method is better than ratio
Example scheduling, and when the second class user people amount ratio is relatively low, the public affairs of each viewpoint video packet sending probability of the inventive method
Levelling is substantially better than ratio scheduling；Difference between two kinds of dispatching methods subtracts with the increase of the second class user number ratio
It is small, when the first kind is identical with the second class user number, the justice of each viewpoint video packet sending probability of two kinds of dispatching methods
Property is very close；
(2) satisfaction of each users of
The satisfaction pair of each user when Fig. 3 reflects the data packet dispatching method using three kinds of interactive video in multiple viewpoints
Than now total number of users amount is 50, and first kind user number accounts for 80%；As can be seen from the figure equity dispatching has relative smooth
Curve, and the difference of satisfaction is maximum between ratio scheduling different user, and each user satisfaction difference of the inventive method is then located
Therebetween；
(3) average users satisfaction
Fig. 4 reflects the average user satisfaction tape using the data packet dispatching method of three kinds of interactive video in multiple viewpoints
The influence of wide size variation；As illustrated, rising is all presented with bandwidth increase in the average user satisfaction of three kinds of dispatching methods
Trend, because more bandwidth mean that more data can be sent；When adoption rate is dispatched, first kind user satisfaction
Highest by contrast, and the second class user satisfaction is conversely minimum；Equity dispatching has opposite result compared to ratio scheduling；
And the inventive method can obtain balance therebetween.
Claims (1)
1. it is a kind of based on receive assorted agreed-upon price interactive video in multiple viewpoints data packet dispatching method, it is characterised in that this method is first
First, in user terminal, each user determines the video data bag request of the viewpoint of itself, and feeds back to server；Then, server connects
The video data bag request of the viewpoint of each user is received, and by the data packet dispatching optimization modeling Cheng Na of interactive video in multiple viewpoints
Assorted model of bargain；Then, server end is listed optimal condition (KKT conditions) using Lagrange duality and constraints and solved
Optimized model, determine the probability that the video data coating of each viewpoint of server end is sent；Finally, server end regards according to user
The video data bag request change of point, the probability that the video data coating of all viewpoints is sent is updated, realizes that network transmission is optimal
Change, it is comprised the following steps that：
Step 1. determines user's n own views m video data demand packet
(1) defines the preference of the video data bag of viewpoint
In user terminal, user n is defined to the preference of viewpoint m video data bag, is designated asIts expression formula is：
Wherein,It is the direction of the viewpoint m in server end, M is number of views,It is user n head direction, N is user
Number of users in end,It is the direction of viewpoint m in server endWith user n head directionBetween angle；
(2) defines preference function u of the user to the video data bag of viewpointN, m, its expression formula is：
<mrow>
<msub>
<mi>u</mi>
<mrow>
<mi>n</mi>
<mo>,</mo>
<mi>m</mi>
</mrow>
</msub>
<mo>=</mo>
<mfenced open = "{" close = "">
<mtable>
<mtr>
<mtd>
<mrow>
<mn>1</mn>
<mo>,</mo>
</mrow>
</mtd>
<mtd>
<mrow>
<msubsup>
<mi>&xi;</mi>
<mi>m</mi>
<mi>n</mi>
</msubsup>
<mo>&GreaterEqual;</mo>
<mi>E</mi>
<mo>;</mo>
</mrow>
</mtd>
</mtr>
<mtr>
<mtd>
<mrow>
<mn>0</mn>
<mo>,</mo>
</mrow>
</mtd>
<mtd>
<mrow>
<msubsup>
<mi>&xi;</mi>
<mi>m</mi>
<mi>n</mi>
</msubsup>
<mo><</mo>
<mi>E</mi>
<mo>.</mo>
</mrow>
</mtd>
</mtr>
</mtable>
</mfenced>
</mrow>
Wherein, Ε is for judging whether user n asks to server to send the threshold value of viewpoint m video data bag；If un,mFor
1, then user n is to server request transmission viewpoint m video data bag, and otherwise user n is to server request transmission viewpoint m's
Video data bag；
Step 2. establishes the assorted model of bargain of receiving of the video data packet scheduling optimization of viewpoint
(1) defines viewpoint m utility function um, its expression formula is：
<mrow>
<msub>
<mi>u</mi>
<mi>m</mi>
</msub>
<mo>=</mo>
<msub>
<mi>x</mi>
<mi>m</mi>
</msub>
<mo>&CenterDot;</mo>
<munderover>
<mo>&Sigma;</mo>
<mrow>
<mi>n</mi>
<mo>=</mo>
<mn>1</mn>
</mrow>
<mi>N</mi>
</munderover>
<msub>
<mi>u</mi>
<mrow>
<mi>n</mi>
<mo>,</mo>
<mi>m</mi>
</mrow>
</msub>
<mo>,</mo>
</mrow>
Wherein, xmIt is the probability that viewpoint m video data bag being serviced device is sent；
(2) defines viewpoint m minimum utility functionIts expression formula is：Its
In, ε is a normal number；
(3) establishes objective optimisation problems
According to described viewpoint m utility function and minimum utility function, the video data packet scheduling optimization of viewpoint is established
Receive assorted model of bargain, it is specific as follows：
Target problem：Optimization aim is：Possess higher network transmission efficiency
Meanwhile take into account the fairness between all users；
Constraints：
①.0≤xm≤ 1, m=1 ..., M, represent each viewpoint video data bag being serviced device be sent to user probability be 0
Between 1；
②.Represent all viewpoints video data bag being serviced device be sent to user probability sum be 1；
③.M=1 ..., M, represent that the utility function of each viewpoint is not less than defined minimum effectiveness
Function；
Step 3. solving-optimizing model determines the sending probability of all viewpoint video packets
(1) carries out logarithm process to target problem, obtains：
<mrow>
<mi>m</mi>
<mi>a</mi>
<mi>x</mi>
<msubsup>
<mo>&Sigma;</mo>
<mrow>
<mi>m</mi>
<mo>=</mo>
<mn>1</mn>
</mrow>
<mi>M</mi>
</msubsup>
<mi>l</mi>
<mi>n</mi>
<mrow>
<mo>(</mo>
<msub>
<mi>x</mi>
<mi>m</mi>
</msub>
<mo>&CenterDot;</mo>
<munderover>
<mo>&Sigma;</mo>
<mrow>
<mi>n</mi>
<mo>=</mo>
<mn>1</mn>
</mrow>
<mi>N</mi>
</munderover>
<msub>
<mi>u</mi>
<mrow>
<mi>n</mi>
<mo>,</mo>
<mi>m</mi>
</mrow>
</msub>
<mo>-</mo>
<msubsup>
<mi>u</mi>
<mi>m</mi>
<mi>min</mi>
</msubsup>
<mo>)</mo>
</mrow>
<mo>;</mo>
</mrow>
(2) defines Lagrange duality：
<mrow>
<mi>L</mi>
<mrow>
<mo>(</mo>
<mi>X</mi>
<mo>,</mo>
<mi>&lambda;</mi>
<mo>,</mo>
<mi>&alpha;</mi>
<mo>,</mo>
<mi>&beta;</mi>
<mo>)</mo>
</mrow>
<mo>=</mo>
<msubsup>
<mo>&Sigma;</mo>
<mrow>
<mi>m</mi>
<mo>=</mo>
<mn>1</mn>
</mrow>
<mi>M</mi>
</msubsup>
<mi>l</mi>
<mi>n</mi>
<mrow>
<mo>(</mo>
<msub>
<mi>x</mi>
<mi>m</mi>
</msub>
<mo>&CenterDot;</mo>
<munderover>
<mo>&Sigma;</mo>
<mrow>
<mi>n</mi>
<mo>=</mo>
<mn>1</mn>
</mrow>
<mi>N</mi>
</munderover>
<msub>
<mi>u</mi>
<mrow>
<mi>n</mi>
<mo>,</mo>
<mi>m</mi>
</mrow>
</msub>
<mo>-</mo>
<msubsup>
<mi>u</mi>
<mi>m</mi>
<mi>min</mi>
</msubsup>
<mo>)</mo>
</mrow>
<mo>+</mo>
<mi>&lambda;</mi>
<mrow>
<mo>(</mo>
<msubsup>
<mo>&Sigma;</mo>
<mrow>
<mi>m</mi>
<mo>=</mo>
<mn>1</mn>
</mrow>
<mi>M</mi>
</msubsup>
<msub>
<mi>x</mi>
<mi>m</mi>
</msub>
<mo>-</mo>
<mn>1</mn>
<mo>)</mo>
</mrow>
<mo>+</mo>
<msubsup>
<mo>&Sigma;</mo>
<mrow>
<mi>m</mi>
<mo>=</mo>
<mn>1</mn>
</mrow>
<mi>M</mi>
</msubsup>
<msub>
<mi>&alpha;</mi>
<mi>m</mi>
</msub>
<msub>
<mi>x</mi>
<mi>m</mi>
</msub>
<mo>-</mo>
<msubsup>
<mo>&Sigma;</mo>
<mrow>
<mi>m</mi>
<mo>=</mo>
<mn>1</mn>
</mrow>
<mi>M</mi>
</msubsup>
<msub>
<mi>&beta;</mi>
<mi>m</mi>
</msub>
<mrow>
<mo>(</mo>
<msub>
<mi>x</mi>
<mi>m</mi>
</msub>
<mo>-</mo>
<mn>1</mn>
<mo>)</mo>
</mrow>
<mo>,</mo>
</mrow>
Wherein, λ, αmAnd βmLagrange multiplier is represented, the logarithm problem has convex object function, and constraints is convex set；
(3) is solved using KKT conditions：Optimal condition (KKT conditions) is listed according to Lagrange duality and constraints, such as
Under：
<mrow>
<mfrac>
<mrow>
<mo>&part;</mo>
<mi>L</mi>
</mrow>
<mrow>
<mo>&part;</mo>
<msub>
<mi>x</mi>
<mi>m</mi>
</msub>
</mrow>
</mfrac>
<mo>=</mo>
<mfrac>
<mrow>
<msubsup>
<mo>&Sigma;</mo>
<mrow>
<mi>n</mi>
<mo>=</mo>
<mn>1</mn>
</mrow>
<mi>N</mi>
</msubsup>
<msub>
<mi>u</mi>
<mrow>
<mi>n</mi>
<mo>,</mo>
<mi>m</mi>
</mrow>
</msub>
</mrow>
<mrow>
<msub>
<mi>x</mi>
<mi>m</mi>
</msub>
<mo>&CenterDot;</mo>
<msubsup>
<mo>&Sigma;</mo>
<mrow>
<mi>n</mi>
<mo>=</mo>
<mn>1</mn>
</mrow>
<mi>N</mi>
</msubsup>
<msub>
<mi>u</mi>
<mrow>
<mi>n</mi>
<mo>,</mo>
<mi>m</mi>
</mrow>
</msub>
<mo>-</mo>
<msubsup>
<mi>u</mi>
<mi>m</mi>
<mi>min</mi>
</msubsup>
</mrow>
</mfrac>
<mo>+</mo>
<mi>&lambda;</mi>
<mo>+</mo>
<msub>
<mi>&alpha;</mi>
<mi>m</mi>
</msub>
<mo>-</mo>
<msub>
<mi>&beta;</mi>
<mi>m</mi>
</msub>
<mo>=</mo>
<mn>0</mn>
<mo>;</mo>
</mrow>
<mfenced open = "" close = "">
<mtable>
<mtr>
<mtd>
<mrow>
<munderover>
<mo>&Sigma;</mo>
<mrow>
<mi>m</mi>
<mo>=</mo>
<mn>1</mn>
</mrow>
<mi>M</mi>
</munderover>
<msub>
<mi>x</mi>
<mi>m</mi>
</msub>
<mo>=</mo>
<mn>1</mn>
<mo>,</mo>
<mi>&lambda;</mi>
<mo>&NotEqual;</mo>
<mn>0</mn>
<mo>;</mo>
<msub>
<mi>&alpha;</mi>
<mi>m</mi>
</msub>
<msub>
<mi>x</mi>
<mi>m</mi>
</msub>
<mo>=</mo>
<mn>0</mn>
<mo>,</mo>
<msub>
<mi>&alpha;</mi>
<mi>m</mi>
</msub>
<mo>&GreaterEqual;</mo>
<mn>0</mn>
<mo>;</mo>
<msub>
<mi>&beta;</mi>
<mi>m</mi>
</msub>
<mrow>
<mo>(</mo>
<msub>
<mi>x</mi>
<mi>m</mi>
</msub>
<mo>-</mo>
<mn>1</mn>
<mo>)</mo>
</mrow>
<mo>=</mo>
<mn>0</mn>
<mo>,</mo>
<msub>
<mi>&beta;</mi>
<mi>m</mi>
</msub>
<mo>&GreaterEqual;</mo>
<mn>0</mn>
<mo>;</mo>
</mrow>
</mtd>
</mtr>
<mtr>
<mtd>
<mrow>
<mn>0</mn>
<mo>&le;</mo>
<msub>
<mi>x</mi>
<mi>m</mi>
</msub>
<mo>&le;</mo>
<mn>1</mn>
<mo>;</mo>
</mrow>
</mtd>
</mtr>
</mtable>
</mfenced>
The optimum probability that viewpoint m video data bag being serviced device is sent is calculated, its calculating formula is：
<mrow>
<msubsup>
<mi>x</mi>
<mi>m</mi>
<mo>*</mo>
</msubsup>
<mo>=</mo>
<mfrac>
<mn>1</mn>
<mi>M</mi>
</mfrac>
<mo>+</mo>
<mi>&epsiv;</mi>
<mo>&CenterDot;</mo>
<mrow>
<mo>(</mo>
<msubsup>
<mo>&Sigma;</mo>
<mrow>
<mi>n</mi>
<mo>=</mo>
<mn>1</mn>
</mrow>
<mi>N</mi>
</msubsup>
<msub>
<mi>u</mi>
<mrow>
<mi>n</mi>
<mo>,</mo>
<mi>m</mi>
</mrow>
</msub>
<mo>-</mo>
<mfrac>
<mn>1</mn>
<mi>M</mi>
</mfrac>
<mo>&CenterDot;</mo>
<munderover>
<mo>&Sigma;</mo>
<mrow>
<mi>m</mi>
<mo>=</mo>
<mn>1</mn>
</mrow>
<mi>M</mi>
</munderover>
<munderover>
<mo>&Sigma;</mo>
<mrow>
<mi>n</mi>
<mo>=</mo>
<mn>1</mn>
</mrow>
<mi>N</mi>
</munderover>
<msub>
<mi>u</mi>
<mrow>
<mi>n</mi>
<mo>,</mo>
<mi>m</mi>
</mrow>
</msub>
<mo>)</mo>
</mrow>
<mo>,</mo>
<mi>m</mi>
<mo>=</mo>
<mn>1</mn>
<mo>,</mo>
<mn>...</mn>
<mo>,</mo>
<mi>M</mi>
<mo>;</mo>
</mrow>
Step 4. updates the sending probability of the video data bag of all viewpoints
User's head is adapted to towards change, display device periodically follows the trail of the head direction of renewal user, each user of user terminal
Repeat step 1, the video data bag for sending new viewpoint ask to own to server, server end repeat step 2 to 3, renewal
The probability that the video data coating of viewpoint is sent, realizes that network transmission optimizes.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510180595.8A CN104918134B (en) | 2015-04-16 | 2015-04-16 | It is a kind of based on receive assorted agreed-upon price interactive video in multiple viewpoints data packet dispatching method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510180595.8A CN104918134B (en) | 2015-04-16 | 2015-04-16 | It is a kind of based on receive assorted agreed-upon price interactive video in multiple viewpoints data packet dispatching method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN104918134A CN104918134A (en) | 2015-09-16 |
| CN104918134B true CN104918134B (en) | 2018-01-02 |
Family
ID=54086769
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510180595.8A Expired - Fee Related CN104918134B (en) | 2015-04-16 | 2015-04-16 | It is a kind of based on receive assorted agreed-upon price interactive video in multiple viewpoints data packet dispatching method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN104918134B (en) |
Families Citing this family (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP4030767A1 (en) * | 2016-11-30 | 2022-07-20 | Panasonic Intellectual Property Corporation of America | Three-dimensional model distribution method and three-dimensional model distribution device |
| CN107070817B (en) * | 2017-05-18 | 2020-10-09 | 中山大学 | Uploading bandwidth optimization method applied to cloud live broadcast platform |
| CN108551586B (en) * | 2018-03-14 | 2020-06-05 | 上海交通大学 | Multi-user 360-degree video stream server-side code rate self-adaptive distribution method and system |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101868986A (en) * | 2007-11-01 | 2010-10-20 | 汤姆森许可贸易公司 | Method of multicasting |
| WO2010150050A1 (en) * | 2009-06-23 | 2010-12-29 | Nokia Corporation | Method and apparatus for allocating power for cooperative communications |
| US8276181B1 (en) * | 2007-12-21 | 2012-09-25 | General Instrument Corporation | Content distribution system and method for optimizing multiplexed transport channels |
| CN104023277A (en) * | 2014-06-10 | 2014-09-03 | 上海大学 | Method of bandwidth allocation of video stream in P2P (Peer to Peer) overlay network based on Nash bargaining solution |
| CN104159110A (en) * | 2014-04-02 | 2014-11-19 | 上海大学 | Video transmission bandwidth optimal allocation method based on Nash Bargaining Theory |
-
2015
- 2015-04-16 CN CN201510180595.8A patent/CN104918134B/en not_active Expired - Fee Related
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101868986A (en) * | 2007-11-01 | 2010-10-20 | 汤姆森许可贸易公司 | Method of multicasting |
| US8276181B1 (en) * | 2007-12-21 | 2012-09-25 | General Instrument Corporation | Content distribution system and method for optimizing multiplexed transport channels |
| WO2010150050A1 (en) * | 2009-06-23 | 2010-12-29 | Nokia Corporation | Method and apparatus for allocating power for cooperative communications |
| CN104159110A (en) * | 2014-04-02 | 2014-11-19 | 上海大学 | Video transmission bandwidth optimal allocation method based on Nash Bargaining Theory |
| CN104023277A (en) * | 2014-06-10 | 2014-09-03 | 上海大学 | Method of bandwidth allocation of video stream in P2P (Peer to Peer) overlay network based on Nash bargaining solution |
Also Published As
| Publication number | Publication date |
|---|---|
| CN104918134A (en) | 2015-09-16 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102802089B (en) | Shifting video code rate regulation method based on experience qualitative forecast | |
| Fu et al. | A systematic framework for dynamically optimizing multi-user wireless video transmission | |
| CN101552913B (en) | Multi-channel video communication system and processing method | |
| CN104918134B (en) | It is a kind of based on receive assorted agreed-upon price interactive video in multiple viewpoints data packet dispatching method | |
| CN100578429C (en) | Multi-mouse long-distance control method to service end | |
| CN103249007A (en) | Method for establishing D2D multicast communication and allocating wireless source thereof in IMT-A system | |
| CN100583869C (en) | Dispatching method for service transmission priority in multiple service communication system | |
| CN101043618B (en) | Apparatus and method for controlling frame rate in multi-way video communication | |
| CN106791887B (en) | Distributed caching and transmission optimization method for videos in wireless network | |
| CN103796244B (en) | A kind of many net access selection methods of the wireless isomer of equally loaded | |
| CN102438181A (en) | Method and system for adjusting time for sending heartbeat message in Internet protocol television (IPTV) system | |
| CN103269493A (en) | Method and device for pushing bandwidth services | |
| CN106375790A (en) | QoE-driven adaptive scheduling method of multichannel HAS code rate | |
| CN103067977B (en) | Data concurrence transmission method based on cross-layer optimization in wireless heterogeneous network system | |
| CN104486690B (en) | A kind of mobile video transmission optimization method based on Transmission Control Protocol | |
| CN103037391B (en) | Low-power consumption RRC (Radio Resource Control) protocol optimal control method based on data stream prediction | |
| Zhong et al. | A Q-learning driven energy-aware multipath transmission solution for 5G media services | |
| WO2013004191A1 (en) | Message push method and instant communication server | |
| CN102231849A (en) | Digital television video on demand system and on demand method | |
| CN101304548A (en) | Multimedia broadcast/multicast service data transmission system, method and terminal | |
| CN109451517A (en) | A kind of caching placement optimization method based on mobile edge cache network | |
| Kim et al. | Edge computing assisted adaptive streaming scheme for mobile networks | |
| CN102186211A (en) | Load distribution method for end-to-end multilink parallel transmission | |
| CN104125081A (en) | Multi-terminal cooperation system and method based on strategy | |
| CN103067474A (en) | Processing method and device for communication in distributed file system |
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 | ||
| CF01 | Termination of patent right due to non-payment of annual fee | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20180102 |