Upload
cerise
View
32
Download
0
Tags:
Embed Size (px)
DESCRIPTION
Minimum Cost Scheduling of Stored Video in Dynamic Bandwidth Allocation Networks. IEEE Transactions on Consumer Electronics, Vol. 53, No. 2, MAY 2007. Myeong-jin Lee, Member, IEEE. Reporter : M9756003 張益瑞. Outline. Introduction - PowerPoint PPT Presentation
Citation preview
Minimum Cost Scheduling of Stored Video in Dynamic Bandwidth Allocation Networks
Reporter : M9756003 張益瑞
IEEE Transactions on Consumer Electronics, Vol. 53, No. 2, MAY 2007
Myeong-jin Lee, Member, IEEE
112/04/20 1
Outline
Introduction Service Cost Minimization Framework for Stored
Video Transmission Problems in Conventional Optimal Video Streaming
Algorithms Proposed Algorithm for Minimum Cost Scheduling Experimental Results Conclusion
112/04/20 2
Introduction
Most current and future video applications will require the playback of stored video over a high-speed network.
Dynamic bandwidth allocation methods.
Renegotiated constant bit-rate (RCBR)
112/04/20 3
Service Cost Minimization Framework for Stored Video Transmission
Dynamic Bandwidth Allocation for Video Streaming
Cost for RCBR Service of Stored Video
112/04/20 4
Dynamic Bandwidth Allocation for Video Streaming Compressed video sources show burstiness over
multiple time-scales, periods of milliseconds to several seconds.
RCBR has the key advantage that the signaling cost and the network function for renegotiations are as simple as those of the constant bit-rate (CBR) service.
112/04/20 5
Cost for RCBR Service of Stored Video
S=segmentR=transmission rateL=segment length
C=costS*=scheduled result
α=bandwidth cost parameterβ= renegotiation cost parameterN=the number of transmission segments in S*
112/04/20 6
Problems in Conventional Optimal Video Streaming Algorithms Cost Functions for Transmission Segments
The Need for Minimum Cost Scheduling for Video Streaming
112/04/20 7
Cost Functions for Transmission Segments
The transmission cost of a single isolated segment
α=bandwidth cost parameterβ= renegotiation cost parameter
the transmission cost of a group of successivesegments from Sk to Sk+n can be represented as follows.
112/04/20 8
Cost Functions for Transmission Segments
•To show the effect of short transmission segments on the cost, the cumulative cost ratio is defined as follows.
•This represents the ratio of the transmission cost for short segments to the overall cost for the whole video sequence.
112/04/20 9
The Need for Minimum Cost Scheduling for Video Streaming
Cumulative number of renegotiations for video streaming underRCBR service.
112/04/20 10
The Need for Minimum Cost Scheduling for Video Streaming
Service cost for stored video under RCBR service
112/04/20 11
Proposed Algorithm for Minimum Cost Scheduling Segment Merging as a Tool for Cost
Minimization
Relative Cost Flags for Segment Merging
Proposed Minimum Cost Scheduling Algorithm
112/04/20 12
Segment Merging as a Tool for Cost Minimization
We define as the segment merging operator, the new ⊕segment after merging successive segments is represented by the algorithm.
The new transmission rate should be the maximum between those two segments in order to satisfy the decoder buffer underflow constraint.
112/04/20 13
Relative Cost Flags for Segment Merging
To determine the segment merging, relative cost flags are defined for each segment. They are calculated using (7) and (8).
112/04/20 14
Relative Cost Flags for Segment Merging
Merging of neighboring segments for minimum cost scheduling based on relative cost flags
There are three possible combinations of the left-hand and the right-hand relative cost flags.
112/04/20 15
Relative Cost Flags for Segment Merging
Merging of neighboring segments for minimum cost scheduling based on relative cost flags
There are three cases of segment merging.1.Not merged 2.merged into the left-hand segment. 3.merged into the right-hand segment.
112/04/20 16
Proposed Minimum Cost Scheduling Algorithm
Video traffic smoothing algorithm for the minimum service cost
112/04/20 17
Experimental Results
Mpeg video 40,000frame GOP pattern is IBBPBBPBBPBB We assumed that renegotiation requests are
always accepted by networks.
112/04/20 18
Experimental Results
Service cost reduction during execution of the proposedminimum cost scheduling algorithm.
112/04/20 19
Experimental Results
Scheduled results of the proposed algorithm. Bond sequence
112/04/20 20
Experimental Results
Overall service cost of the proposed algorithm. Bond and news sequence.
112/04/20 21
Experimental Results
Overall service cost of the proposed algorithm. Bond and news sequence.112/04/20 22
Experimental Results
Overall service cost of the proposed algorithm. Bond and news sequence.
112/04/20 23
Experimental Results
Characteristics of the scheduled traffic. Bond and news sequence.
112/04/20 24
Experimental Results
Characteristics of the scheduled traffic. Bond and news sequence.
112/04/20 25
Experimental Results
Characteristics of the scheduled traffic. Bond and news sequence.
112/04/20 26
Conclusion A minimum cost scheduling algorithm is
proposed for high-quality video streaming in dynamic bandwidth allocation networks.
The proposed algorithm can be easily extended to other service environments with different service pricing models.
112/04/20 27