CN104333779B - The bandwidth allocation methods of Stream Media Application fast cache - Google Patents

The bandwidth allocation methods of Stream Media Application fast cache Download PDF

Info

Publication number
CN104333779B
CN104333779B CN201410589677.3A CN201410589677A CN104333779B CN 104333779 B CN104333779 B CN 104333779B CN 201410589677 A CN201410589677 A CN 201410589677A CN 104333779 B CN104333779 B CN 104333779B
Authority
CN
China
Prior art keywords
user
bandwidth
bandwidth allocation
sup
time slot
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
Application number
CN201410589677.3A
Other languages
Chinese (zh)
Other versions
CN104333779A (en
Inventor
崔勇
鲍亚运
赖泽祺
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Tsinghua University
Original Assignee
Tsinghua University
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Tsinghua University filed Critical Tsinghua University
Priority to CN201410589677.3A priority Critical patent/CN104333779B/en
Publication of CN104333779A publication Critical patent/CN104333779A/en
Application granted granted Critical
Publication of CN104333779B publication Critical patent/CN104333779B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04NPICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N21/00Selective content distribution, e.g. interactive television or video on demand [VOD]
    • H04N21/20Servers specifically adapted for the distribution of content, e.g. VOD servers; Operations thereof
    • H04N21/23Processing of content or additional data; Elementary server operations; Server middleware
    • H04N21/238Interfacing the downstream path of the transmission network, e.g. adapting the transmission rate of a video stream to network bandwidth; Processing of multiplex streams
    • H04N21/2385Channel allocation; Bandwidth allocation
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04NPICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N21/00Selective content distribution, e.g. interactive television or video on demand [VOD]
    • H04N21/20Servers specifically adapted for the distribution of content, e.g. VOD servers; Operations thereof
    • H04N21/23Processing of content or additional data; Elementary server operations; Server middleware
    • H04N21/24Monitoring of processes or resources, e.g. monitoring of server load, available bandwidth, upstream requests
    • H04N21/2402Monitoring of the downstream path of the transmission network, e.g. bandwidth available

Landscapes

  • Engineering & Computer Science (AREA)
  • Multimedia (AREA)
  • Signal Processing (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

The bandwidth allocation methods of Stream Media Application fast cache of the present invention, for the scene of single base station multi-user in mobile cellular net, under the scene, channel competition can occur between multiple users, cause data awaiting transmission and video cardton, the present invention disposes bandwidth allocation agency between the base station of Cellular Networks and core net, bandwidth allocation acts on behalf of the service bandwidth of periodic collection network flow-medium application, the signal strength information of each user, the information such as the speed that each user video is played, the stream medium data size of user's request;When mobile subscriber's request stream medium data in network, the bandwidth allocation algorithm of agency's operation Stream Media Application fast cache, the distribution of Streaming Media bandwidth is carried out for the Streaming Media user in Cellular Networks, can ensure that each user can glibly play video, buffer time and the interim card of video are reduced, Consumer's Experience is improved.

Description

The bandwidth allocation methods of Stream Media Application fast cache
Technical field
The invention belongs to the Stream Media Application bandwidth resource allocation technical field in mobile cellular net, more particularly to a kind of stream The bandwidth allocation methods of media application fast cache.
Background technology
The Stream Media Applications such as current PPLive, youku.com are increasingly welcome by masses, with the wireless access skill such as 3G and LTE Art is developed rapidly, and user increasingly liked in the online video of bus, subway.Referred to according to the cisco networks of 2014 Number investigation report, the flow of current Stream Media Application has accounted for the 53% of total network traffics, it is contemplated that by 2018, be up to 69% or so.Therefore, it is very necessary and urgent to improve Consumer's Experience of the user when streaming media video is watched.
In mobile cellular net, the index for weighing mobile flow medium application is mainly buffer time.When mobile client is slow When depositing middle data less than a thresholding, video playback pause, it is necessary to wait pending data to be played again after downloading, during the interval of this section of video Between be buffer time.Video playback is more smooth, and buffer time is smaller, and Consumer's Experience is better.But in wireless mobile cellular net In, due to the bandwidth for changing, the competition between the continuous mobility of user and multi-user all may result in stream medium data Insufficient supply, cause user watch video interim card.
For the interim card problem of video, existing work is concentrated mainly on and meets the current code check of user and control wait team Arrange the two aspects.Ali et al. reduces interim card number of times by the control of the buffer size to unique user.This article root Reached according to Markov Chain streaming media data and using being analyzed, so as to reduce the number of times of interim card.But, article is not examined Consider the change of network signal intensity and the situation of multiple users, be only suitable for theoretic research and analysis, in practical application In reference value than relatively limited.
Article PROTEUS considers the change of network condition, by the signal intensity and network of predicting following a period of time Situation adjusts the download of video data, improves the experience of user.Because the accuracy predicted network condition will have a strong impact on The performance of system, therefore reliable accuracy can be reached seem particularly significant.According to investigation, the prediction of machine learning, it is accurate The method that true rate only has 70% or so, historical path prediction can reach 90% or so in the ideal case.Therefore, using prediction To improve the experience of user, there is certain risk.Chen et al. has put forward a kind of dispatching algorithm, meets the current bit of user Rate, improves resource utilization.But the method ensures the broadcasting of current video, the broadcasting situation not looked to the future, and delays Middle data are deposited also not embody the influence played.
The content of the invention
In order to overcome the shortcoming of above-mentioned prior art, it is an object of the invention to provide a kind of Stream Media Application fast cache Bandwidth allocation methods, when in a mobile cellular net base station range, having multiple user's request stream medium datas, between multi-user There is the competition of channel, the wait of data transfer and the interim card of video, the present invention can be caused to be directed to this scene, by online tune Degree, it is not necessary to be predicted to signal intensity, improves the practicality and bandwidth availability ratio of algorithm, ensure that streaming media video is broadcast The fluency put, improves the experience that user plays, and is applicable not only to the scene of single base station, can be applicable to single AP resource contentions Scene.
To achieve these goals, the technical solution adopted by the present invention is:
A kind of bandwidth allocation methods of Stream Media Application fast cache, portion is needed between the base station of Cellular Networks and core net Administration bandwidth allocation agency, when mobile subscriber's request stream medium data in network, bandwidth allocation agency is as follows each Individual user's distribution bandwidth:
Step one, in time slot t, user i is M to bandwidth allocation proxy requests stream medium data, sizei, bandwidth allocation Proxy records user;If time slot t have user leave or user data end of transmission, bandwidth allocation agency discharges the use The request at family, no longer for it distributes wide bandwidth resource;
Step 2, bandwidth allocation agency collects the signal intensity s of user ii(t), the Mean Speed p that user video is playedi, Base station records this time slot with parameter S and distributes remaining amount of bandwidth in available streaming media service bandwidth B (t) of this time slot, when When gap starts, S=B (t) is made;
Step 3, bandwidth allocation agency is allocated according to the data collected to user's request bandwidth now:Initially Change, diT bandwidth that () record bandwidth assignment agent is distributed in time slot t to user i, when time slot starts, assigns initial value 0, di(t)← 0, i=1,2 ..., N;dsupI () records bandwidth assignment agent can be to the maximum bandwidth of user i distribution, in time slot in this time slot During beginning, initial value 1, d is assignedsupI () ← 1, i=1, wherein 2 ..., N, N are user's number;Note bandwidth allocation intermediate parameters are designated as d′iT (), when time slot starts, makes d 'i(t)=di(t);Note bandwidth left amount intermediate parameters are designated as S ', when time slot starts, order S '=S;
Step 4, by the playback rate p of N number of useriIt is ranked up from small to large, and renumbers, calculates each user The data volume d for maintaining smooth playing to be needed to next time slotneed(i);
Step 5, from the 1st user to n-th user, when base station is in the remaining bandwidth S of this time slot>When 0, first is carried out Secondary bandwidth allocation:
A () calculates now this base station can be to the data volume d of user i transmissionsup(i);
If (b) dsup(i)3dneedI (), then make di(t)=d 'i(t)+dneed(i), S=S '-dneed(i), dsum=B T ()-S, now updates bandwidth allocation intermediate parameters d 'iT () and remaining bandwidth intermediate parameters S ', makes d 'i(t)=di(t), S '= S;
If (c) dsup(i)<dneed(i), then di(t)=d 'i(t)+dsup(i), S=S '-dsup(i), dsum=B (t)-S, And update bandwidth allocation intermediate parameters d 'iT () and remaining bandwidth intermediate parameters S ', makes d 'i(t)=di(t), S '=S;
Wherein dsumExpression has distributed data volume, is recording parameters;
Step 6, the now system that calculates can be to the data volume d of user i transmissionsup(i);
Step 7, if now remaining bandwidth S>When 0 and there is dsup(i) ≠ 0, then by remaining bandwidth allocation to user, From the 1st user to n-th user, the data to user's one time slot of distribution are p every timei, it is ensured that the fairness of user:
If (a) dsup(i)≥pi, then di(t)=d 'i(t)+pi, S=S '-pi, dsum=B (t)-S, and update bandwidth point With intermediate parameters d 'iT () and remaining bandwidth intermediate parameters S ', makes d 'i(t)=di(t), S '=S;
If (b) dsup(i)<pi, then di(t)=d 'i(t)+dsup(i), S=S '-dsup(i), dsum=B (t)-S, and more New bandwidth allocation intermediate parameters d 'iT () and remaining bandwidth intermediate parameters S ', makes d 'i(t)=di(t), S '=S;
Step 8, the now system that recalculates can be to the data volume d of user i transmissionsup(i), if remaining bandwidth S> When 0 and there is dsupI () ≠ 0, rerun step 7;
Step 9, according to the d of distributioniT () carries out bandwidth allocation to user present in base station;
Step 10, scheduling enters next time slot, perceives the entrance of user and leaving for user, change of service bandwidth etc., Carry out new round scheduling decision.
Here is the basic mode for arriving used herein and parameter setting:
Define 1
Data block:The stream medium data that one mobile terminal is received in a time slot, referred to as one data block.Data block must Must receive use completely, i.e., data block can only be used in next time slot.
Define 2
Signal intensity si(t):siT () is the signal intensity of user i mobile terminals when time slot t, it is assumed that a time slot Interior, signal intensity remains constant.
Define 3
Maximum throughput rate Th (si(t)):Under certain signal intensity, base station can distribute to user's per time slot Maximum transmitted code check (unit is byte/s), referred to as maximum throughput rate.General signal intensity is bigger, and the data volume that can be transmitted is got over Greatly.If allocated time slot t to user i a width of d of bandi(t) (byte/s), then it is required that di(t)≤Th(si(t))。
Define 4
Maximum service bandwidth B (t):Because base station services various applications, Stream Media Application only accounts for a portion, in time slot T can distribute to the bandwidth of Stream Media Application.It is required that
The computational methods of the user buffering time that the present invention is used are as follows:
Define 5
Video playback speed pi:The data volume of Stream Media Application each time slot mean consumption is referred to as playback rate.
Define 6
Remaining data ri(t):When time slot t starts, remaining data volume is referred to as remaining data in user cache, makes ri(0) =0.
If the data deficiencies in caching is reached, the broadcasting of user will interim card.The remaining data amount of time slot t+1 can basis The situation of previous time slot is calculated, ri(t+1)=max { (ri(t)+di(t)-tpi),0}.
Define 7
Buffer time ci(t):In time slot t because the data in caching are inadequate, the time for causing user to wait, c is madei(0)= 0。
Buffer time can be calculated according to remaining data amount, When user has obtained all of data, then the stand-by period of the time slot is 0.Then in time T, all users' is average Stand-by period can be expressed as
Optimization and the limited requirement of service bandwidth based on Consumer's Experience, problem of the invention can be turned in form:
Method for solving based on this optimization problem, the present invention devises the resource allocation algorithm of online Streaming Media bandwidth, I.e. when each time slot starts, according to above formula, the bandwidth resources to base station are allocated, after being assigned, according to point With result data are transmitted to user.The execution cycle of this algorithm is 1s, can change the execution cycle, and basic skills is constant.
The variable used in some algorithms is defined below:
Define 8
Demand data dneed(i):dneedThe data volume of (i) for needed for maintaining user in next time slot smooth playing;
dneedI the calculating of () is related to data in the caching of user,
Define 9
Data volume d is distributedsum:dsumIt is recording parameters, records the allocated amount of bandwidth in algorithm running;
Define 10
Available data dsup(i):dsup(i) be base station meet (1) (2) limited case under, can be carried for user The bandwidth of confession, dsup(i)=min { Th (si(t))-di(t),B(t)-dsum};
Compared with prior art, the invention provides one kind in mobile cellular net, the Streaming Media of single base station multi-user Using the bandwidth allocation methods of fast cache.Answered when in a mobile cellular net base station range, there are multiple user's request Streaming Medias During data, base station needs distribution bandwidth resource, and the present invention is a kind of bandwidth resources of minimal buffering time in this case Allocation algorithm, the video playback speed according to different user adjusts bandwidth allocation, can efficiently solve single base stations and multiuser Streaming Media bandwidth allocation problems, to obtain user video smooth playing, reduce the interim card and time delay of video as far as possible, improve user's body Test.
Brief description of the drawings
Fig. 1 is deployment schematic diagram of the invention.
Fig. 2 is the bandwidth allocation algorithm flow of Stream Media Application fast cache in the case of single base stations and multiuser of the invention Figure.
Specific embodiment
Describe embodiments of the present invention in detail with reference to the accompanying drawings and examples.
A kind of bandwidth allocation methods of the Stream Media Application fast cache of single base stations and multiuser of the present invention, it is intended to minimize and move The average buffer time of mobile terminal in dynamic Cellular Networks.The agency of the bandwidth allocation algorithm of Stream Media Application fast cache is deployed in Between the base station of Cellular Networks and core net, by collecting the data volume of mobile terminal request, signal intensity, user's stream medium data The parameters such as wear rate, the bandwidth resources to base station are allocated, on the premise of fair and raising bandwidth availability ratio is ensured, The bandwidth that decision-making each terminal should be obtained.Its specific deployment method of operation is as shown in figure 1, the band of Stream Media Application fast cache The controller of allocation algorithm wide is largely divided into four parts:Information receiving module, data transmission module, data reception module is adjusted Degree module.Information receiving module receives and collects the information of mobile terminal, and the bandwidth resources that now base station can provide.Number The data from server are received according to receiver module, waits instruction to be transmitted after caching.Should according to the information Streaming Media collected Performed in scheduler module with the bandwidth allocation algorithm of fast cache, bandwidth of the decision-making to each user distribution.According to bandwidth resources The result of allocation algorithm, data transmission module carries out data transmission.
When signal intensity is different, the data volume that base station can transmit be it is different, Stream Media Application fast cache Bandwidth allocation algorithm is scheduled transmission according to signal intensity and the wear rate of user video to each user in network, and Take into account the fairness of bandwidth allocation.Stream Media Application is a kind of application played when downloading, very sensitive to time delay.Work as caching Data deficiencies when, user terminal take link downloading data.The bandwidth allocation algorithm of Stream Media Application fast cache can be reduced The competition of link, improves the utilization rate of bandwidth, reduces the interim card time of video playback, improves Consumer's Experience.
The bandwidth allocation algorithm of Stream Media Application fast cache is needed according to periodic duty in time-domain, and the moment monitors letter The entrance of the information and user in road is left, and updates the measurement of bandwidth allocation, improves the utilization rate of bandwidth, it is ensured that the justice of user Property, the run time of this bandwidth resource allocation algorithm is typically defined at intervals of a time slot, slot length fixes tentatively t=1s, i.e., often Second updates a bandwidth allocation for base station.If time slot t has N number of user, then the bandwidth allocation of Stream Media Application fast cache is calculated Method needs to be scheduled N number of user.
Above is some general principles that the present invention is based on, specifically, as shown in figure 1, first, in the base station of Cellular Networks Deployment bandwidth allocation is needed to act on behalf of and core net between.Bandwidth allocation acts on behalf of the service bandwidth of periodic collection network flow-medium application B (t), the signal strength information s of each useri(t), the speed p that each user video is playedi, the stream medium data of user's request Size MiEtc. information.When mobile subscriber in network (such as cellphone subscriber, PSP user etc.) request stream medium data, in order to Ensure that each user can glibly play video, the buffering and interim card of video, agency's operation Stream Media Application are reduced as best one can The bandwidth allocation algorithm of fast cache, is distribution that Streaming Media user in Cellular Networks carries out Streaming Media bandwidth.Specific method Implemented by following step.
Step one, in time slot t, mobile device i is M to bandwidth allocation proxy requests stream medium data, sizei, agency Record user;If time slot t has user to leave, not request data, bandwidth allocation agency discharges the request of the user, width of not reallocating Bandwidth resources;
Step 2, agency is according to the signal intensity s for collecting user ii(t), the Mean Speed p that user video is playedi, base station In available streaming media service bandwidth B (t) of this time slot, this time slot is recorded with parameter S and distributes remaining amount of bandwidth, time slot is opened During the beginning, S=B (t) is made;
Step 3, agency is allocated according to the data collected, the bandwidth to user's request now.Initialization, di(t) The bandwidth that record agency distributes in time slot t to user i, it is 0, d to assign initial value at first in time sloti(t) ← 0, i=1, 2,…,N;dsupI () record agency can give the user i maximum bandwidths of distribution in this time slot, assigned at first initially in time slot Be worth is 1, dsup(i) ← 1, i=1,2 ..., N;Note bandwidth allocation intermediate parameters are designated as d 'iT (), when time slot starts, makes d 'i(t) =di(t);Note bandwidth left amount intermediate parameters are designated as S ', when time slot starts, make S '=S;
Step 4, to the playback rate p of N number of useriIt is ranked up from small to large, and renumbers, calculates each user Maintain smooth playing to the demand data amount d of next time slotneed(i);
Step 5, from the 1st user to n-th user, as remaining bandwidth S>When 0, first time bandwidth point is carried out first Match somebody with somebody:
A () calculates now base station can be to the data volume d of user i transmissionsup(i);
If (b) dsup(i)3dneedI (), then make di(t)=d 'i(t)+dneed(i), S=S '-dneed(i), dsum=B T ()-S, now updates bandwidth allocation intermediate parameters d 'iT () and remaining bandwidth intermediate parameters S ', makes d 'i(t)=di(t), S '= S;
If (c) dsup(i)<dneed(i), then di(t)=d 'i(t)+dsup(i), S=S '-dsup(i), dsum=B (t)-S, Now update bandwidth allocation intermediate parameters d 'iT () and remaining bandwidth intermediate parameters S ', makes d 'i(t)=di(t), S '=S;
Wherein dsumExpression has distributed data volume, is recording parameters;
Step 6, the now system that calculates can be to the data volume d of user i transmissionsup(i);
Step 7, if now remaining bandwidth S>When 0 and there is dsup(i) ≠ 0, then by remaining bandwidth allocation to user, From the 1st user to n-th user, the data to user's one time slot of distribution are p every timei, it is ensured that the fairness of user:
If (a) dsup(i)≥pi, then di(t)=d ' i (t)+pi, S=S '-pi, dsum=B (t)-S, now updates bandwidth Distribution intermediate parameters d 'iT () and remaining bandwidth intermediate parameters S ', makes d 'i(t)=di(t), S '=S;
If (b) dsup(i)<pi, then di(t)=d 'i(t)+dsup(i), S=S '-dsup(i), dsum=B (t)-S, now Update bandwidth allocation intermediate parameters d 'iT () and remaining bandwidth intermediate parameters S ', makes d 'i(t)=di(t), S '=S;Step 8, weight It is new to calculate the data volume d that now system be transmitted to user isup(i), if remaining bandwidth S>When 0 and there is dsup(i)≠ 0, rerun step 7;
Step 9, according to the d of distributioniT () carries out bandwidth allocation to user present in base station.
Step 10, scheduling enters next time slot, perceives the entrance of user and leaving for user, change of service bandwidth etc., Carry out new round scheduling decision.

Claims (4)

1. a kind of bandwidth allocation methods of Stream Media Application fast cache, it is characterised in that the single base station of Cellular Networks and its Deployment bandwidth allocation is needed to act on behalf of between core net, when mobile subscriber's request stream medium data in network, bandwidth allocation agency It is as follows each user's distribution bandwidth in the base station:
Step one, in time slot t, user i is M to bandwidth allocation proxy requests stream medium data, sizei, bandwidth allocation agency's note Employ family;If time slot t have user leave or user data end of transmission, what bandwidth allocation agency discharged the user please Ask, no longer for it distributes wide bandwidth resource;
Step 2, bandwidth allocation agency collects the signal intensity s of user ii(t), the Mean Speed p that user video is playedi, base station In available streaming media service bandwidth B (t) of this time slot, this time slot is recorded with parameter S and distributes remaining amount of bandwidth, time slot is opened During the beginning, S=B (t) is made;
Step 3, bandwidth allocation agency is allocated according to the data collected to user's request bandwidth now:Initialization, di T bandwidth that () record bandwidth assignment agent is distributed in time slot t to user i, when time slot starts, assigns initial value 0, di(t) ← 0, i= 1,2,…,N;dsupI () records bandwidth assignment agent and can start in time slot to the maximum bandwidth of user i distribution in this time slot When, assign initial value 1, dsupI () ← 1, i=1, wherein 2 ..., N, N are user's number;Note bandwidth allocation intermediate parameters are designated as di′ T (), when time slot starts, makes di' (t)=di(t);Note bandwidth left amount intermediate parameters are designated as S ', when time slot starts, make S ' =S;
Step 4, by the playback rate p of N number of useriIt is ranked up from small to large, and renumbers, calculates each user and maintain stream Freely it is played to the data volume d that next time slot needsneed(i);
Step 5, from the 1st user to n-th user, when base station is in the remaining bandwidth S > 0 of this time slot, carries out first time band Width distribution:
A () calculates now bandwidth allocation agency can be to the maximum bandwidth d of user i distribution in this time slotsup(i);
If (b) dsup(i)≥dneedI (), then make di(t)=di′(t)+dneed(i), S=S '-dneed(i), dsum=B (t)-S, Now update bandwidth allocation intermediate parameters di' (t) and remaining bandwidth intermediate parameters S ', makes di' (t)=di(t), S '=S;
If (c) dsup(i) < dneed(i), then di(t)=di′(t)+dsup(i), S=S '-dsup(i), dsum=B (t)-S, and Update bandwidth allocation intermediate parameters di' (t) and remaining bandwidth intermediate parameters S ', makes d 'i(t)=di(t), S '=S;
Wherein dsumExpression has distributed data volume, is recording parameters;
Step 6, calculating now bandwidth allocation agency can be to the maximum bandwidth d of user i distributionsup(i);
Step 7, if now remaining bandwidth S > 0 when and there is dsupI () ≠ 0, will carry out the second wheel bandwidth allocation, by residue Bandwidth allocation to user, from the 1st user to n-th user, it is p to distribute the data of a time slot to user every timei, Ensure the fairness of user:
If (a) dsup(i)≥pi, then di(t)=di′(t)+pi, S=S '-pi, dsum=B (t)-S, and update bandwidth allocation Between parameter di' (t) and remaining bandwidth intermediate parameters S ', makes d 'i(t)=di(t), S '=S;
If (b) dsup(i) < pi, then di(t)=di′(t)+dsup(i), S=S '-dsup(i), dsum=B (t)-S, and update band Width distribution intermediate parameters di' (t) and remaining bandwidth intermediate parameters S ', makes d 'i(t)=di(t), S '=S;
Step 8, recalculating now bandwidth allocation agency can be to the maximum bandwidth d of user i distributionsup(i), if remaining During bandwidth S > 0 and there is dsupI () ≠ 0, rerun step 7;
Step 9, according to the d of distributioniT () carries out bandwidth allocation to user present in base station;
Step 10, scheduling enters next time slot, perceives the entrance of user and leaving for user, change of service bandwidth etc., carries out New round scheduling decision.
2. bandwidth allocation methods of Stream Media Application fast cache according to claim 1, it is characterised in that the step 4 Middle dneedI () computing formula is:
d n e e d ( i ) = p i r i ( t ) = 0 p i - r i ( t ) 0 < r i ( t ) < p i ( t ) 0 r i ( t ) &GreaterEqual; p i ( t )
Wherein, riT () represents remaining data, when meaning that time slot t starts, remaining data volume, r in user cachei(0)=0, ri (t+1)=max { (ri(t)+di(t)-tpi),0};
3. bandwidth allocation methods of Stream Media Application fast cache according to claim 1, it is characterised in that the step 5 Middle dsupI () computing formula is:
dsup(i)=min { Th (si(t))-di(t),B(t)-dsum}
Wherein, Th (si(t)) represent under certain signal intensity, base station can distribute to the maximum biography of user per time slot Defeated code check, i.e. maximum throughput rate.
4. bandwidth allocation methods of Stream Media Application fast cache according to claim 1, it is characterised in that the dsup(i) Meet the limitation of following condition (1) and condition (2):
min C &OverBar; S . T . d i ( t ) &le; Th ( signal i ( t ) ) i = 1,2 , . . . , N t = 0,1 , . . . , T - - - ( 1 )
&Sigma; i = 1 N d i ( t ) &le; B ( t ) , t = 0 , 1 , ... , T - - - ( 2 )
Wherein,Represent in time T, the average stand-by period of all users,ciT () represents slow Rush the time, ci(0)=0,
CN201410589677.3A 2014-10-28 2014-10-28 The bandwidth allocation methods of Stream Media Application fast cache Active CN104333779B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201410589677.3A CN104333779B (en) 2014-10-28 2014-10-28 The bandwidth allocation methods of Stream Media Application fast cache

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201410589677.3A CN104333779B (en) 2014-10-28 2014-10-28 The bandwidth allocation methods of Stream Media Application fast cache

Publications (2)

Publication Number Publication Date
CN104333779A CN104333779A (en) 2015-02-04
CN104333779B true CN104333779B (en) 2017-06-13

Family

ID=52408417

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201410589677.3A Active CN104333779B (en) 2014-10-28 2014-10-28 The bandwidth allocation methods of Stream Media Application fast cache

Country Status (1)

Country Link
CN (1) CN104333779B (en)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111447511B (en) * 2020-03-09 2021-10-08 重庆邮电大学 Bandwidth allocation method with user perception experience quality

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101702734A (en) * 2009-10-27 2010-05-05 北京算通数字技术研究中心有限公司 Dispatching method and device of streaming media data and nodal equipment
CN103873947A (en) * 2012-12-18 2014-06-18 中国科学院声学研究所 P2P stream media playing method and system based on request forwarding

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20030225873A1 (en) * 2002-05-30 2003-12-04 Wade Michael A. Optimization of network performance through uni-directional encapsulation

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101702734A (en) * 2009-10-27 2010-05-05 北京算通数字技术研究中心有限公司 Dispatching method and device of streaming media data and nodal equipment
CN103873947A (en) * 2012-12-18 2014-06-18 中国科学院声学研究所 P2P stream media playing method and system based on request forwarding

Non-Patent Citations (3)

* Cited by examiner, † Cited by third party
Title
基于用户预览行为的流媒体带宽分配研究;王悦,陈亮,曹坏护,李海峰;《小型微型计算机系统》;20140531;第35卷(第5期);第1027-1030页 *
流媒体服务器比例带宽分配的改进算法;李旸,王镇海;《计算机工程与设计》;20091031;第2475-2479页 *
移动流媒体带宽分配及数据调度策略研究;程晓晨;《中国优秀硕士学位论文全文数据库》;20120630;I136-298 *

Also Published As

Publication number Publication date
CN104333779A (en) 2015-02-04

Similar Documents

Publication Publication Date Title
CN105407486B (en) A kind of method and device of the network capacity extension
RU2364039C2 (en) Access authorisation management and resource distribution in communication system maintaining service quality
CN104410870B (en) Method for distributing bandwidth resource of streaming media application with optimized energy consumption
CN104363635B (en) The Stream Media Application method for allocating bandwidth resources of quick energy optimization
US10270834B2 (en) System and method for online multimedia streaming services
CN105191209A (en) Systems and methods for quality of experience aware joint scheduling of buffered video on demand and best effort flows
CN101873634B (en) Method and device for scheduling bandwidth on WLAN basis
US10476644B2 (en) Method and apparatus for allocating sounding resources in a wireless network
CN104507169B (en) Reduce the three dimensional resource dynamic allocation method and device of system uplink propagation delay time
CN103945244B (en) The method and apparatus for controlling video traffic transmission
US20180098332A1 (en) Resource allocation method, apparatus, and system, and base station
CN109819422B (en) Stackelberg game-based heterogeneous Internet of vehicles multi-mode communication method
CN104980934A (en) Method and device for scheduling multi-service resources
CN107333153A (en) A kind of video transmission method, base station and system
CN112543508A (en) Wireless resource allocation method and network architecture for 5G network slice
Khorov et al. SEBRA: SAND-enabled bitrate and resource allocation algorithm for network-assisted video streaming
CN113746677A (en) 5G new air interface oriented network slice internal resource allocation method
Poojary et al. Analysis of QoE for adaptive video streaming over wireless networks
CN105245919A (en) Energy-consumption-optimization adaptive streaming media distribution method for intelligent terminal
CN104333779B (en) The bandwidth allocation methods of Stream Media Application fast cache
Pasandi et al. A cross-layer approach for supporting real-time multi-user video streaming over WLANs
WO2016000366A1 (en) Resource scheduling method and device, and computer readable storage medium
CN101958828B (en) Service multiplex processing method and device
CN106937392B (en) Wireless resource scheduling method based on user experience quality in DASH service
Peng et al. A SDN-based energy saving strategy in wireless access networks

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