CN109121020A - For the dynamic buffering dispatching method of SVC-DASH VOD system, equipment and storage equipment - Google Patents

For the dynamic buffering dispatching method of SVC-DASH VOD system, equipment and storage equipment Download PDF

Info

Publication number
CN109121020A
CN109121020A CN201811063602.6A CN201811063602A CN109121020A CN 109121020 A CN109121020 A CN 109121020A CN 201811063602 A CN201811063602 A CN 201811063602A CN 109121020 A CN109121020 A CN 109121020A
Authority
CN
China
Prior art keywords
buffer area
video
bmax
buffer
lmax
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
CN201811063602.6A
Other languages
Chinese (zh)
Other versions
CN109121020B (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.)
China University of Geosciences
Original Assignee
China University of Geosciences
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 China University of Geosciences filed Critical China University of Geosciences
Priority to CN201811063602.6A priority Critical patent/CN109121020B/en
Publication of CN109121020A publication Critical patent/CN109121020A/en
Application granted granted Critical
Publication of CN109121020B publication Critical patent/CN109121020B/en
Expired - Fee Related 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/80Generation or processing of content or additional data by content creator independently of the distribution process; Content per se
    • H04N21/83Generation or processing of protective or descriptive data associated with content; Content structuring
    • H04N21/845Structuring of content, e.g. decomposing content into time segments
    • H04N21/8456Structuring of content, e.g. decomposing content into time segments by decomposing the content in the time domain, e.g. in time segments
    • 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
    • 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/2401Monitoring of the client buffer
    • 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/25Management 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/262Content 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/26208Content 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/26216Content 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
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04NPICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N21/00Selective content distribution, e.g. interactive television or video on demand [VOD]
    • H04N21/40Client devices specifically adapted for the reception of or interaction with content, e.g. set-top-box [STB]; Operations thereof
    • H04N21/43Processing of content or additional data, e.g. demultiplexing additional data from a digital video stream; Elementary client operations, e.g. monitoring of home network or synchronising decoder's clock; Client middleware
    • H04N21/433Content storage operation, e.g. storage operation in response to a pause request, caching operations
    • H04N21/4331Caching operations, e.g. of an advertisement for later insertion during playback
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04NPICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N21/00Selective content distribution, e.g. interactive television or video on demand [VOD]
    • H04N21/40Client devices specifically adapted for the reception of or interaction with content, e.g. set-top-box [STB]; Operations thereof
    • H04N21/43Processing of content or additional data, e.g. demultiplexing additional data from a digital video stream; Elementary client operations, e.g. monitoring of home network or synchronising decoder's clock; Client middleware
    • H04N21/433Content storage operation, e.g. storage operation in response to a pause request, caching operations
    • H04N21/4335Housekeeping operations, e.g. prioritizing content for deletion because of storage space restrictions
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04NPICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N21/00Selective content distribution, e.g. interactive television or video on demand [VOD]
    • H04N21/40Client devices specifically adapted for the reception of or interaction with content, e.g. set-top-box [STB]; Operations thereof
    • H04N21/43Processing of content or additional data, e.g. demultiplexing additional data from a digital video stream; Elementary client operations, e.g. monitoring of home network or synchronising decoder's clock; Client middleware
    • H04N21/438Interfacing the downstream path of the transmission network originating from a server, e.g. retrieving MPEG packets from an IP network
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04NPICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N21/00Selective content distribution, e.g. interactive television or video on demand [VOD]
    • H04N21/40Client devices specifically adapted for the reception of or interaction with content, e.g. set-top-box [STB]; Operations thereof
    • H04N21/47End-user applications
    • H04N21/472End-user interface for requesting content, additional data or services; End-user interface for interacting with content, e.g. for content reservation or setting reminders, for requesting event notification, for manipulating displayed content
    • H04N21/47202End-user interface for requesting content, additional data or services; End-user interface for interacting with content, e.g. for content reservation or setting reminders, for requesting event notification, for manipulating displayed content for requesting content on demand, e.g. video on demand

Abstract

The present invention provides for the dynamic buffering dispatching method of SVC-DASH VOD system, equipment and storage equipment, its method includes: laterally stacked to fragment progress inside dynamic spatial cache, it realizes better program request effect, solves adverse effect of the network quality frequent fluctuation to user's viewing experience in heterogeneous network;The model asked for using fragment by layer, the fluency and smoothness of video playing are improved, while dynamic buffering mechanism is added, accelerates the promotion speed of video quality, and the fault-tolerance by increasing scheduling and the utilization rate for promoting bandwidth, further promote the smoothness of video quality.For the dynamic buffering controlling equipment and storage equipment of SVC-DASH VOD system, for realizing the dynamic buffering dispatching method for SVC-DASH VOD system.The beneficial effects of the present invention are: technical solution of the present invention has better performance in terms of the smoothness of the promotion speed of quality, the average rank of quality, video playing fluency and play quality compared with existing SVC-DASH dispatching method.

Description

Dynamic buffering dispatching method, equipment and storage for SVC-DASH VOD system Equipment
Technical field
The present invention relates to audiovisual applications fields, more particularly, to the dynamic buffering dispatching party of SVC-DASH VOD system Method, equipment and storage equipment.
Background technique
Nowadays, the distribution and transmission of Web content are significant increases, and wherein video content occupies significant proportion. Predict that, by 2021, annual global IP flow is up to 3.3ZB, and video flow will occupy according to Cisco VNI (Cisco VNI) 82% ratio, occupies leading position.In terms of the transmission of video, in face of the isomerism of terminal and network, it would be desirable to be directed to The network of different equipment and variation provides the video of different quality.HTTP adaptive code stream (HAS) technology is come into being, client End can select the video slicing of different quality according to own situation, and a member of DASH as HAS, by many excellent of oneself Gesture has been developed as current state-of-the-art video flowing communications.Simultaneously as H.264/SVC (scalable video Coding server storage) can be greatly saved, and possesses more flexible shaping modes, in recent years more and more SVC-DASH scheme is suggested.
However, some problems still have, for example it will appear video quality in the network environment of frequent fluctuation and frequently cut Phenomena such as video breaks is changed or even occurred, user's viewing experience is seriously affected.Existing SVC-DASH solution is logical mostly It crosses bandwidth prediction or simple laterally stacked adjusts video quality.The present invention provides a kind of dynamics based on SVC-DASH Buffer scheduling method.To cope with negative effect of the frequent shake of bandwidth to video quality, while being directed to existing SVC-DASH Deficiency existing for solution is further to be improved.
Summary of the invention
To solve the above-mentioned problems, the present invention provides for SVC-DASH VOD system dynamic buffering dispatching method, Equipment and storage equipment are mainly comprised the steps that for the dynamic buffering dispatching method of SVC-DASH VOD system
S101: the video source of SVC format is obtained, video source is uniformly separated into n video slicing;And according to video source Each video slicing is uniformly separated into m video block by quality level, and m video block of each video slicing is stacked into m Layer, and all video blocks are stored in server;Each video block is corresponding with a fragment i and a sequence j;Its In, m and n are the integer more than or equal to 1;The value range of i is [1, n], and the value range of j is [1, m];Initialize i's and j Value is 1;
S102: initialization buffer area parameter: the variation range of buffer area height Lmax is set as [1, m], sets buffer area The variation range of length Bmax is [min, max], and it is highly the rectangle region of Lmax that the Buffer size of buffer area, which is that length is Bmax, Domain;The value for initializing Lmax is m, and the value of Bmax is max;Buffer area is divided into Lmax*Bmax memory block, these memory blocks According to coordinate [1,1], [1,2] ... [1, Bmax], [2,1] ... [2, Bmax] ... [Lmax, Bmax] sequential, for storing State video block;
S103: downloading slicing number is i, the video block of layer serial number j to first empty memory block,
S104: after the downloading for completing the video block, buffer area buffer status data and average network bandwidth are updated avgBW;The buffer status data include the newest view being downloaded in the downloading number and buffer area of each layer video block of buffer area The fragment number of frequency block;
S105: buffer area height Lmax is adjusted according to average bandwidth avgBW;
S106: section length Bmax is cached according to buffer status data point reuse;
S107: judge whether that downloading terminates or videoconference client is closed;If so, arriving step S109;If it is not, then arriving Step S108;
S108: traversing all memory blocks of buffer area, first empty memory block is searched, according to buffer area buffer status number According to the fragment i and sequence j of the next video block being downloaded of determination;Back to step S103;
S109: terminating caching program, completes dynamic buffering scheduling.
Further, in the step S105, the specific of buffer area height Lmax is adjusted according to averaging network bandwidth avgBW Step are as follows:
S201: judge whether averaging network bandwidth avgBW is more than or equal to the code rate Q of -1 layer video of kthk-1;If so, slow The value for depositing area height Lmax is k;If it is not, then arriving step S202;Wherein, k is integer, and value range is [1, m], and k's is initial Value is maximized m;
S202: being updated to k-1 for k, judges whether k is 1;If so, the value of buffer area height Lmax is 1;If it is not, then returning Return step S201;
Further, in the step S106, the specific steps of section length Bmax are cached according to buffer status data point reuse Are as follows:
S301: Rule of judgment Bmax > buf fer_len1>=min and buf fer_lenLmax<buf fer_len1It is whether same Shi Chengli;If so, Bmax is updated to Bmax-1;If it is not, then arriving step S302;Wherein, buf fer_len1For buffer area In the 1st layer video block downloading number, buf fer_lenLmaxFor the downloading number of the top video block of buffer area;
S302: Rule of judgment Bmax=buf fer_len1< max and buf fer_lenLmax=buf fer_len1Whether It sets up simultaneously;If so, Bmax is updated to Bmax+1;If it is not, then Bmax value is constant.
Further, in the step S108, according to buffer area height Lmax, caching section length Bmax and buffer status tune The specific steps of fragment i and sequence j corresponding to whole next video block being downloaded are as follows:
S401: judging whether buffer area has the layer of remaining memory block, judges since buffer area first layer, and order judges the number of plies P=1;
S402: judge whether p is less than or equal to Lmax;If so, arriving step S403;If it is not, then arriving step S406;
S403: judge the whether free remaining memory block of pth layer in buffer area;If so, arriving step S405;If it is not, then arriving step Rapid S404;
S404: p is updated to p+1, return step S402;
S405: sequence j is assigned a value of p, judges whether pth layer has video block;If so, i is equal to the newest downloading of pth layer Video block fragment number plus 1;If it is not, then i is equal to first fragment number of the 1st floor of buffer area;
S406: whether the fragment number for judging the last one video block of buffer area first layer is n;If so, terminating downloading;If It is no, then arrive step S407;
S407: download thread is hung up, and the lower No.1 that i is the 1st floor the last one fragment number of buffer area, sequence number is arranged J is 1;It loops to determine whether buffer area vacant memory block occurs, once there is vacant memory block, then continues to download;It is regarded in caching While frequency division piece, decoding plays thread and lasting taking-up video slicing to the client from buffer area is decoded broadcasting, often When taking a video slicing away, remaining video slicing successively moves forward in buffer area.
A kind of storage equipment, the storage equipment store instruction and data are for realizing for SVC-DASH VOD system Dynamic buffering dispatching method.
Dynamic buffering controlling equipment for SVC-DASH VOD system, comprising: processor and the storage equipment;It is described Processor loads and executes the instruction in the storage equipment and data for realizing the dynamic for SVC-DASH VOD system Buffer scheduling method.
Technical solution provided by the invention has the benefit that compared with existing SVC-DASH dispatching method, this The technical solution of invention is in the flat of the promotion speed of quality, the average rank of quality, video playing fluency and play quality There is better performance in terms of stability.
Detailed description of the invention
Present invention will be further explained below with reference to the attached drawings and examples, in attached drawing:
Fig. 1 is the flow chart in the embodiment of the present invention for the dynamic buffering dispatching method of SVC-DASH VOD system;
Fig. 2 is the schematic diagram of video cache section model in the embodiment of the present invention;
Fig. 3 is the detailed process in the embodiment of the present invention for the dynamic buffering dispatching method of SVC-DASH VOD system Figure;
Fig. 4 is the schematic diagram of video cache section model 1 in the embodiment of the present invention;
Fig. 5 is the schematic diagram of video cache section model 2 in the embodiment of the present invention;
Fig. 6 is the schematic diagram of video cache section model 3 in the embodiment of the present invention;
Fig. 7 is the schematic diagram of video cache section model 4 in the embodiment of the present invention;
Fig. 8 is the schematic diagram of video cache section model 5 in the embodiment of the present invention;
Fig. 9 is the schematic diagram that hardware device works in the embodiment of the present invention.
Specific embodiment
For a clearer understanding of the technical characteristics, objects and effects of the present invention, now control attached drawing is described in detail A specific embodiment of the invention.
The embodiment provides dynamic buffering dispatching method, equipment and the storages for SVC-DASH VOD system Equipment is used for video cache section model shown in Fig. 2.
Referring to FIG. 1, Fig. 1 is the dynamic buffering dispatching method for being used for SVC-DASH VOD system in the embodiment of the present invention Flow chart specifically comprises the following steps:
S101: the video source of SVC format is obtained, video source is uniformly separated into n video slicing;And according to video source Each video slicing is uniformly separated into m video block by quality level, and m video block of each video slicing is stacked into m Layer, and all video blocks are stored in server;Each video block is corresponding with a fragment i and a sequence j;Its In, m and n are the integer more than or equal to 1;The value range of i is [1, n], and the value range of j is [1, m];Initialize i's and j Value is 1;
S102: initialization buffer area parameter: the variation range of buffer area height Lmax is set as [1, m], sets buffer area The variation range of length Bmax is [min, max], and it is highly the rectangle region of Lmax that the Buffer size of buffer area, which is that length is Bmax, Domain;The value for initializing Lmax is m, and the value of Bmax is max;Buffer area is divided into Lmax*Bmax memory block, these memory blocks According to coordinate [1,1], [1,2] ... [1, Bmax], [2,1] ... [2, Bmax] ... [Lmax, Bmax] sequential, for storing State video block;Wherein, [1,1], [2,1] ... [Bmax, 1] are buffer area first layer, and [1,2], [2,2] ... [Bmax, 2] is caching Area's second layer, [1, j], [2, j] ... [Bmax, j] are buffer area jth layer, and [1, Lmax], [2, Lmax] ... [Bmax, Lmax] are Lmax layers of buffer area;
S103: downloading slicing number is i, the video block of layer serial number j to first empty memory block,
S104: after the downloading for completing the video block, buffer area buffer status data and average network bandwidth are updated avgBW;The buffer status data include the newest view being downloaded in the downloading number and buffer area of each layer video block of buffer area The fragment number of frequency block;
S105: buffer area height Lmax is adjusted according to average bandwidth avgBW;
S106: section length Bmax is cached according to buffer status data point reuse;
S107: judge whether that downloading terminates or videoconference client is closed;If so, arriving step S109;If it is not, then arriving Step S108;
S108: traversing all memory blocks of buffer area, first empty memory block is searched, according to buffer area buffer status number According to the fragment i and sequence j of the next video block being downloaded of determination;Back to step S103;
S109: terminating caching program, completes dynamic buffering scheduling.
In the step S105, the specific steps of buffer area height Lmax are adjusted according to averaging network bandwidth avgBW are as follows:
S201: judge whether averaging network bandwidth avgBW is more than or equal to the code rate Q of -1 layer video of kthk-1;If so, slow The value for depositing area height Lmax is k;If it is not, then arriving step S202;Wherein, k is integer, and value range is [1, m], and k's is initial Value is maximized m;
S202: being updated to k-1 for k, judges whether k is 1;If so, the value of buffer area height Lmax is 1;If it is not, then returning Return step S201;
In the step S106, the specific steps of section length Bmax are cached according to buffer status data point reuse are as follows:
S301: Rule of judgment Bmax > buf fer_len1>=min and buf fer_lenLmax<buf fer_len1It is whether same Shi Chengli;If so, Bmax is updated to Bmax-1;If it is not, then arriving step S302;Wherein, buf fer_len1For buffer area In the 1st layer video block downloading number, buf fer_lenLmaxFor the downloading number of the top video block of buffer area;
S302: Rule of judgment Bmax=buf fer_len1< max and buf fer_lenLmax=buf fer_len1Whether It sets up simultaneously;If so, Bmax is updated to Bmax+1;If it is not, then Bmax value is constant.
In the step S108, the fragment i of next video block being downloaded is determined according to first empty memory block The step of with sequence j are as follows:
S401: judging whether buffer area has the layer of remaining memory block, judges since buffer area first layer, and order judges the number of plies P=1;
S402: judge whether p is less than or equal to Lmax;If so, arriving step S403;If it is not, then arriving step S406;
S403: judge the whether free remaining memory block of pth layer in buffer area;If so, arriving step S405;If it is not, then arriving step Rapid S404;
S404: p is updated to p+1, return step S402;
S405: sequence j is assigned a value of p, judges whether pth layer has video block;If so, i is equal to the newest downloading of pth layer Video block fragment number plus 1;If it is not, then i is equal to first fragment number of the 1st floor of buffer area;
S406: whether the fragment number for judging the last one video block of buffer area first layer is n;If so, terminating downloading;If It is no, then arrive step S407;
S407: download thread is hung up, and the lower No.1 that i is the 1st floor the last one fragment number of buffer area, sequence number is arranged J is 1;It loops to determine whether buffer area vacant memory block occurs, once there is vacant memory block, then continues to download;It is regarded in caching While frequency division piece, decoding plays thread and lasting taking-up video slicing to the client from buffer area is decoded broadcasting, often When taking a video slicing away, remaining video slicing successively moves forward in buffer area.
It is illustrated in figure 3 in the embodiment of the present invention for the detailed of the dynamic buffering dispatching method of SVC-DASH VOD system Thin flow chart presents the implementing procedure of entire dynamic buffering dispatching method, the explanation of each variable corresponding with Fig. 3 such as 1 institute of table Show:
1 argument table 1 of table
I (1~n) Video block fragment number
J (1~m) Video block sequence number
Lmax (1~m) Buffer area height
Bmax (min~max) Cache section length
Qk(1≤k≤m) The code rate of kth layer video
buffer_lenp(1≤p≤m) The number of buffer area pth layer video block downloading
last_idq(1≤q≤n) The newest video slicing number of buffer area q floor
avgBW Averaging network bandwidth
Basic thought is: successively downloading backward since Primary layer (the 1st layer of buffer area), when all video slicings in caching Primary layer filling finish, then fill the first enhancement layer (the 2nd layer of buffer area), and so on, with the stacking of enhancement layer, depending on Frequency quality is constantly promoted, until reaching video quality highest level.At the same time, it is limited in buffer area and is stacked according to recent bandwidth Maximum level (buffer area height).(corresponding with video slicing) is arranged when sky occurs in buffer area, and there are also unfilled for front High-rise fragment, if buffer storage length does not arrive minimum value, caching shortens, such as Fig. 4.When buffer area fills up, and buffer storage length does not reach most Big value, caching is elongated, such as Fig. 5.Variable meaning in each figure is as shown in table 2.
2 argument table 2 of table
Seg id Buffer area fragment number
Layer id Buffer area sequence number
Bmax Cache section length
Lmax Buffer area height
Dynamic Area Dynamic range
Decoding Decode broadcast area
Buffering Buffer area
In such a way that sequence stacks, Caton phenomenon can be effectively reduced, while quality switching frequency is greatly reduced.Separately Outside, due to introducing dynamic buffering and level limitation, compared to simple stacking (WQUAD), method of the invention (LSDC) is excellent Gesture is mainly reflected in two o'clock:
(1) fast lifting quality
T0 indicate downloading starts, at this time buffer area be sky, tp indicate download thread start after p-th of fragment duration, depending on Number in frequency block represents it and is downloaded in which fragment duration.Assuming that hereafter bandwidth is 4 video blocks/fragment duration.? In WQUAD, caching section length remains unchanged (15), and in LSDC, 15 when buffer length is from t1 are compressed to 5 when t4, then The 15 of t37 is reverted to by 33 fragment durations.From fig. 6 it can be seen that WQUAD quality in the 13rd fragment mentions highest Layer, and be just promoted in LSDC in the 4th fragment top.This is because in LSDC, one video block of every downloading, buffer area Length adaptively adjusts, and fills buffer area high level in advance by compressed cache section length in early period, fast lifting quality is (when one After the first layer video block of video slicing is downloaded, this video slicing can be played, under the video block of a video slicing What is carried is more, then the video playing quality of this video slicing is higher), slowly expand caching section length after buffer area fills up, Maximum length is recovered after the 37th fragment duration.WQUAD has just reached saturation before the 37th fragment duration, behind it is more Remaining bandwidth wastes, and is equivalent to and pays the excess bandwidth in later period in advance and promote quality in advance.
(2) fault-tolerance is improved
In process of caching, if buffer area is filled at a certain moment, it is assumed that be at this time t0.Network fluctuates, bandwidth drop As low as 2 video blocks/fragment duration, promoted later to 4 video blocks/fragment duration.Fig. 7 is the filling feelings of preceding 15 fragment durations Condition, it can be seen from figure 7 that subsequent fragment column are all stacked to the second layer by WQUAD, and LSDC passes through the compressed cache head of district Degree, maintains Lmax for quality.After 15 fragment durations, the decline of credit rating will occur in WQUAD, and LSDC is kept not Become.In t31, LSDC buffer area compresses in length to the limit loses regulating power, starts the stacking mode as WQUAD, It is equivalent to the WQUAD of a compressed version.If hereafter bandwidth is gone up, LSDC will gradually expand caching section length, until reduction.From If LSDC fills rapidly buffer area high level video block as can be seen that bandwidth is promoted in t31 in Fig. 8, then gradually expand caching Section length recovers the caching section length of compression when to t46, remain at the grade of Lmax in the process, and WQUAD is then The grade decline that experienced 20 fragments, in the 21st broadcasting fragment ability rise quality, so LSDC has effectively evaded bandwidth Fluctuation.
By comparing with existing dispatching method, technical solution of the present invention is (flat under four kinds of different network environments Surely, gradual change, mutation, shake), scheduling strategy increased quality speed, average video quality and video playing fluency and Have in terms of smoothness and well even preferably shows.
Fig. 9 is referred to, Fig. 9 is the hardware device operation schematic diagram of the embodiment of the present invention, and the hardware device specifically includes: For the dynamic buffering controlling equipment 901 of SVC-DASH VOD system, processor 902 and storage equipment 903.
Dynamic buffering controlling equipment 901 for SVC-DASH VOD system: described for SVC-DASH VOD system Dynamic buffering controlling equipment 901 realizes the dynamic buffering dispatching method for being used for SVC-DASH VOD system.
Processor 902: the processor 902 loads and executes the instruction in the storage equipment 903 and data for real The existing dynamic buffering dispatching method for being used for SVC-DASH VOD system.
Store equipment 903: 903 store instruction of storage equipment and data;The storage equipment 903 is for realizing described Dynamic buffering dispatching method for SVC-DASH VOD system.
The beneficial effects of the present invention are: technical solution of the present invention is in matter compared with existing SVC-DASH dispatching method The promotion speed of amount, the average rank of quality, video playing fluency and play quality smoothness in terms of have preferably Performance.
The foregoing is merely presently preferred embodiments of the present invention, is not intended to limit the invention, it is all in spirit of the invention and Within principle, any modification, equivalent replacement, improvement and so on be should all be included in the protection scope of the present invention.

Claims (6)

1. being used for the dynamic buffering dispatching method of SVC-DASH VOD system, it is characterised in that: the following steps are included:
S101: the video source of SVC format is obtained, video source is uniformly separated into n video slicing;And according to the quality of video source Each video slicing is uniformly separated into m video block by level, and m video block of each video slicing is stacked into m layers, And all video blocks are stored in server;Each video block is corresponding with a fragment i and a sequence j;Wherein, M and n is the integer more than or equal to 1;The value range of i is [1, n], and the value range of j is [1, m];Initialize the value of i and j It is 1;
S102: initialization buffer area parameter: the variation range of buffer area height Lmax is set as [1, m], setting caches section length The variation range of Bmax is [min, max], and it is highly the rectangular area of Lmax that the Buffer size of buffer area, which is that length is Bmax,; The value for initializing Lmax is m, and the value of Bmax is max;Buffer area is divided into Lmax*Bmax memory block, these memory blocks are pressed It is described for storing according to coordinate [1,1], [1,2] ... [1, Bmax], [2,1] ... [2, Bmax] ... [Lmax, Bmax] sequential Video block;Wherein, [1,1], [2,1] ... [Bmax, 1] are buffer area first layer, and [1,2], [2,2] ... [Bmax, 2] is buffer area The second layer, [1, j], [2, j] ... [Bmax, j] are buffer area jth layer, and [1, Lmax], [2, Lmax] ... [Bmax, Lmax] are slow Deposit area's Lmax floor;
S103: downloading slicing number is i, the video block of layer serial number j to first empty memory block,
S104: after the downloading for completing the video block, buffer area buffer status data and average network bandwidth avgBW are updated;Institute State point of the newest video block being downloaded in the downloading number and buffer area that buffer status data include each layer video block of buffer area Piece number;
S105: buffer area height Lmax is adjusted according to average bandwidth avgBW;
S106: section length Bmax is cached according to buffer status data point reuse;
S107: judge whether that downloading terminates or videoconference client is closed;If so, arriving step S109;If it is not, then arriving step S108;
S108: traversing all memory blocks of buffer area, searches first empty memory block, true according to buffer area buffer status data The fragment i and sequence j of fixed next video block being downloaded;Back to step S103;
S109: terminating caching program, completes dynamic buffering scheduling.
2. being used for the dynamic buffering dispatching method of SVC-DASH VOD system as described in claim 1, it is characterised in that: in step In rapid S105, the specific steps of buffer area height Lmax are adjusted according to averaging network bandwidth avgBW are as follows:
S201: judge whether averaging network bandwidth avgBW is more than or equal to the code rate Q of -1 layer video of kthk-1;If so, buffer area The value of height Lmax is k;If it is not, then arriving step S202;Wherein, k is integer, and value range is [1, m], and the initial value of k takes Maximum value m;
S202: being updated to k-1 for k, judges whether k is 1;If so, the value of buffer area height Lmax is 1;If it is not, then returning to step Rapid S201.
3. being used for the dynamic buffering dispatching method of SVC-DASH VOD system as described in claim 1, it is characterised in that: in step In rapid S106, the specific steps of section length Bmax are cached according to buffer status data point reuse are as follows:
S301: Rule of judgment Bmax > buffer_len1>=min and buffer_lenLmax<buffer_len1Whether set up simultaneously; If so, Bmax is updated to Bmax-1;If it is not, then arriving step S302;Wherein, buffer_len1For the 1st layer of view in buffer area The downloading number of frequency block, buffer_lenLmaxFor the downloading number of the top video block of buffer area;
S302: Rule of judgment Bmax=buffer_len1< max and buffer_lenLmax=buffer_len1Whether simultaneously at It is vertical;If so, Bmax is updated to Bmax+1;If it is not, then Bmax value is constant.
4. being used for the dynamic buffering dispatching method of SVC-DASH VOD system as described in claim 1, it is characterised in that: in step In rapid S108, the step of fragment i and sequence j of next video block being downloaded are determined according to first empty memory block Are as follows:
S401: judging whether buffer area has the layer of remaining memory block, judges since buffer area first layer, and order judges number of plies p= 1;
S402: judge whether p is less than or equal to Lmax;If so, arriving step S403;If it is not, then arriving step S406;
S403: judge the whether free remaining memory block of pth layer in buffer area;If so, arriving step S405;If it is not, then arriving step S404;
S404: p is updated to p+1, return step S402;
S405: sequence j is assigned a value of p, judges whether pth layer has video block;If so, i is equal to the view of the newest downloading of pth layer The fragment number of frequency block plus 1;If it is not, then i is equal to first fragment number of the 1st floor of buffer area;
S406: whether the fragment number for judging the last one video block of buffer area first layer is n;If so, terminating downloading;If it is not, Then arrive step S407;
S407: download thread is hung up, and the lower No.1 that i is the 1st floor the last one fragment number of buffer area is arranged, and sequence j is 1;It loops to determine whether buffer area vacant memory block occurs, once there is vacant memory block, then continues to download;In buffered video point While piece, decoding plays thread and lasting taking-up video slicing to the client from buffer area is decoded broadcasting, Mei Dangqu A video slicing is walked, remaining video slicing successively moves forward in buffer area.
5. a kind of storage equipment, it is characterised in that: the storage equipment store instruction and data are for realizing Claims 1 to 4 Any dynamic buffering dispatching method for being used for SVC-DASH VOD system.
6. being used for the dynamic buffering controlling equipment of SVC-DASH VOD system, it is characterised in that: include: processor and claim Storage equipment described in 5;The processor loads and executes instruction and data in the storage equipment and wants for realizing right The dynamic buffering dispatching method that any one is used for SVC-DASH VOD system described in asking 1~4.
CN201811063602.6A 2018-09-12 2018-09-12 Dynamic cache scheduling method, device and storage device for SVC-DASH on-demand system Expired - Fee Related CN109121020B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201811063602.6A CN109121020B (en) 2018-09-12 2018-09-12 Dynamic cache scheduling method, device and storage device for SVC-DASH on-demand system

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201811063602.6A CN109121020B (en) 2018-09-12 2018-09-12 Dynamic cache scheduling method, device and storage device for SVC-DASH on-demand system

Publications (2)

Publication Number Publication Date
CN109121020A true CN109121020A (en) 2019-01-01
CN109121020B CN109121020B (en) 2020-01-17

Family

ID=64859149

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201811063602.6A Expired - Fee Related CN109121020B (en) 2018-09-12 2018-09-12 Dynamic cache scheduling method, device and storage device for SVC-DASH on-demand system

Country Status (1)

Country Link
CN (1) CN109121020B (en)

Citations (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102761776A (en) * 2012-08-01 2012-10-31 重庆大学 Video and audio synchronizing method of P2PVoD (peer-to-peer video on demand) system based on SVC (scalable video coding)
CN103402136A (en) * 2013-07-29 2013-11-20 重庆大学 Self-adaptive cache adjustment control method and device and self-adaptive player
WO2014011559A1 (en) * 2012-07-09 2014-01-16 Qualcomm Incorporated Smoothing of difference reference picture
GB2506911A (en) * 2012-10-12 2014-04-16 Canon Kk Streaming data corresponding to divided image portions (tiles) via a description file including spatial and URL data
CN103905820A (en) * 2012-12-28 2014-07-02 中国科学院声学研究所 Client side video quality self-adaption method and system based on SVC
CN104270646A (en) * 2014-09-22 2015-01-07 何震宇 Self-adaption transmission method and system based on mobile streaming media
CN104396260A (en) * 2012-07-02 2015-03-04 索尼公司 Video coding system with temporal layers and method of operation thereof
CN104811746A (en) * 2015-03-31 2015-07-29 康佳集团股份有限公司 Method and system for achieving integration of SVC (scalable video coding) and DASH (dynamic adaptive streaming over HTTP (hypertext transport protocol)) through multiple connections
CN106028057A (en) * 2016-05-05 2016-10-12 北京邮电大学 Caching method for adaptive streaming content of scalable coding in mobile CCN (Content-Centric Network)

Patent Citations (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104396260A (en) * 2012-07-02 2015-03-04 索尼公司 Video coding system with temporal layers and method of operation thereof
CN108235006A (en) * 2012-07-02 2018-06-29 索尼公司 Video coding system and its operating method with time domain layer
WO2014011559A1 (en) * 2012-07-09 2014-01-16 Qualcomm Incorporated Smoothing of difference reference picture
CN102761776A (en) * 2012-08-01 2012-10-31 重庆大学 Video and audio synchronizing method of P2PVoD (peer-to-peer video on demand) system based on SVC (scalable video coding)
GB2506911A (en) * 2012-10-12 2014-04-16 Canon Kk Streaming data corresponding to divided image portions (tiles) via a description file including spatial and URL data
CN103905820A (en) * 2012-12-28 2014-07-02 中国科学院声学研究所 Client side video quality self-adaption method and system based on SVC
CN103402136A (en) * 2013-07-29 2013-11-20 重庆大学 Self-adaptive cache adjustment control method and device and self-adaptive player
CN104270646A (en) * 2014-09-22 2015-01-07 何震宇 Self-adaption transmission method and system based on mobile streaming media
CN104811746A (en) * 2015-03-31 2015-07-29 康佳集团股份有限公司 Method and system for achieving integration of SVC (scalable video coding) and DASH (dynamic adaptive streaming over HTTP (hypertext transport protocol)) through multiple connections
CN106028057A (en) * 2016-05-05 2016-10-12 北京邮电大学 Caching method for adaptive streaming content of scalable coding in mobile CCN (Content-Centric Network)

Non-Patent Citations (3)

* Cited by examiner, † Cited by third party
Title
SIMGE GIZEM OZCAN ET AL.: "Rate adaptation algorithm with backward quality increasing property for SVC-DASH", 《2017 IEEE 7TH INTERNATIONAL CONFERENCE ON CONSUMER ELECTRONICS - BERLIN》 *
朱海波: "可伸缩视频编码传输速率控制技术研究", 《中国博士学位论文全文数据库信息科技辑,2014年第5期》 *
蒋宇浩等: "可伸缩视频编码在移动互联网中的应用与实现", 《微电子学与计算机》 *

Also Published As

Publication number Publication date
CN109121020B (en) 2020-01-17

Similar Documents

Publication Publication Date Title
US10110650B2 (en) Client side stream switching
US9503490B2 (en) Dash client and receiver with buffer water-level decision-making
CN108551586B (en) Multi-user 360-degree video stream server-side code rate self-adaptive distribution method and system
US9374406B2 (en) Dash client and receiver with a download rate estimator
KR101500892B1 (en) Variable bit video streams for adaptive streaming
US9167007B2 (en) Stream complexity mapping
EP2300928B1 (en) Client side stream switching
US20140136653A1 (en) Dash client and receiver with download rate acceleration
US20130227158A1 (en) Media-quality adaptation mechanisms for dynamic adaptive streaming
CA2505853A1 (en) Transmission of video
JP2015513840A5 (en)
WO2013184374A1 (en) Techniques for adaptive video streaming
US10148990B2 (en) Video streaming resource optimization
CN112714315B (en) Layered buffering method and system based on panoramic video
US9313243B2 (en) Video streaming over data networks
CN109121020A (en) For the dynamic buffering dispatching method of SVC-DASH VOD system, equipment and storage equipment
CN108900874B (en) Streaming media self-adaption request method and device based on SVC-DASH framework
CN115988267B (en) Video code rate self-adaptive adjustment method and system based on DASH
CN109121019B (en) Dynamic cache scheduling method, device and storage device for SVC-DASH on-demand system
CN116347126A (en) Real-time video transmission optimizing coding and decoding method
CN109121018B (en) Dynamic cache scheduling method, device and storage device for SVC-DASH on-demand system
Apostolopoulos et al. Supporting interactive scanning operations in VOD systems
Wakamiya et al. Video streaming systems with cooperative caching mechanisms
Umezawa et al. Interruption time reduction methods by predicting data reception for steaming delivery on hybrid broadcasting environments
FOKUS Periodic Broadcasting with VBR-Encoded Video

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant
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: 20200117

Termination date: 20210912