Optimal H.264 Scalable Video Scheduling Policies for 3G/4G Wireless Cellular and Video Sensor Networks

. We consider the problem of optimal H.264 scalable video scheduling, with an objective of maximizing the end-user video quality while ensuring fairness in 3G/4G broadband wireless networks and video sensor networks. We propose a novel framework to characterize the video quality-based utility of the H.264 temporal and quality scalable video layers. Subsequently, we formulate the scalable video scheduling framework as a Markov decision process (MDP) for long-term average video utility maximization and derive the optimal index based-scalable video scheduling policies ISVP and ISVPF towards video quality maximization. Further, we extend this framework to multiuser and multisubchannel scenario of 4G wireless networks. In this context, we propose two novel schemes for long-term streaming video quality performance optimization based on maximum weight bipartite and greedy matching paradigms. Simulation results demonstrate that the proposed algorithms achieve superior end-user video experience compared to competing scheduling policies such as Proportional Fairness (PF), Linear Index Policy (LIP), Rate Starvation Age policy (RSA), and Quality Proportional Fair Policy (QPF).


Introduction
The advent of portable smart devices and broadband enabling wireless technologies such as LTE and WiMAX have led to the availability of a plethora of video applications and services such as video conferencing, multimedia streaming, interactive gaming, and real-time video monitoring in 3G/ 4G wireless networks.A typical scenario in a 4G network is shown in the Figure 1.Video sensor networks are another paradigm which is gaining popularity due to its application in digital security and online surveillance.This demand for such wireless broadband services is expected to continue to increase in the future with progressive innovations in wireless technologies and devices leading to universal appeal of such services combined with ubiquitous availability of smart phones.Further, video content, which is the key to such popular 3G/4G services, is expected to progressively comprise a dominating fraction of the wireless traffic.However, the erratic wireless environment coupled with the tremendous heterogeneity in the display and decoding capabilities of wireless devices such as smart phones, tablets, and notebooks renders conventional fixed profile video transmission unsuitable in such scenarios.
H.264 based scalable video coding (SVC) has gained significant popularity in the context of video transmission over wireless links owing to its several advantages over conventional video coding.SVC avoids the problem of simulcasting fixed profile video streams at different spatial and temporal profiles by embedding a base low resolution stream in a hierarchical stream consisting of several differential enhancement layers.Another significant advantage of SVC over conventional video coding is graceful degradation of video quality in the event of packet drops due to network congestion.As a result of these advantages, SVC is rapidly increasing in popularity as a de facto scheme for video coding in wireless networks.Reliable video transmission over bandwidth constrained wireless packet networks is further challenging compared to conventional broadband applications such as FTP and internet access due to the high delay sensitivity of video.Hence efficient video scheduling algorithms are critical towards QoS enforcement and end-user video quality maximization in broadband 4G networks.Considerable research has been carried out towards optimal resource allocation and scheduling with Quality of Service (QoS) constraints in wireless networks.The authors in [1] proposed an index-based Highest Urgency First (HUF) scheme towards multiuser scheduling which assigns an urgency parameter to each scheduling request and schedules the packets with the highest urgency factor.The authors in [2] employ distinct service classes to differentiate flows and schedule them according to priority.However, such generic data scheduling schemes are video agnostic.They do not utilize the unique structure of coded digital video and thus result in suboptimal schemes for video quality maximization.On the other front, some work has been carried out in terms of scheduling video data with maximum quality.The authors in [3] proposed a scheduling policy to maximize video quality rendered at the receiver by taking into account the temporal error concealment of the video frames at the receiver.The authors in [4] considered the problem of adaptive scheduling policy for real-time video transmission and derived optimal policies by employing a Markov decision process framework.However, both these works do not take the fairness of users into consideration while deriving the scheduling policies.Hence, in this paper, we consider the problem of optimal scheduler design for scalable video data transmission in downlink 3G/4G wireless networks with a constraint on user fairness.In this context, we present a novel framework to characterize the utility of the different scalable video layers in an H.264 SVC video stream.Further, we set up the video scheduling problem in 3G systems such as HSDPA where a single channel such as the high speed downlink shared channel (HS-DSCH) is scheduled amongst multiple users as an MDP and derive a novel video utility index based scalable video scheduling policy for scheduling of scalable video data in infinite queue length (ISVP) and fixed queue length (ISVPF) scenarios.Simulation results demonstrate that these schemes outperform the proportional fair resource allocation and linear index policy (LIP) based schedulers in terms of net video quality.A preliminary work on the ISVP policy has been published by us in a conference article in [5].In this work, we have enhanced the results significantly by including multichannel multiuser scenarios and performing extensive simulations with more number of users and comparing with additional policies.
Further, OFDM/OFDMA [6,7] has emerged as a ubiquitous technology for broadband wireless networks because of its significant advantages.In OFDM, a wideband channel can be decomposed into several parallel narrowband frequency flat wireless fading channels thus avoiding the problem of intersymbol interference in frequency selective channels.In such scenarios, efficient multiuser multi-sub-carrier channel allocation algorithms are critical towards QoS enforcement and video quality maximization in next generation networks.However as mentioned earlier, the existing scheduling algorithms [1,2,[8][9][10] are generic and do not take into account the structure of coded video transmission which results in suboptimal enduser video quality in broadband wireless access.Hence in this paper, we consider the problem of optimal multiuser 4G OFDMA channel allocation to maximize the video quality while maintaining QoS fairness amongst users.
The rest of the paper is organized as follows.In Section 2 we develop the utility framework for scalable coded videos.In Sections 3 and 4, we derive the optimal 3G video scheduling policies for infinite and finite queue sizes, respectively.In Section 6, we derive the optimality criteria for 4G OFDM channel allocation in multiuser streaming scenarios.In Section 7 we describe optimal channel allocation algorithms to achieve the above optimality criteria.In Section 8, we present the simulation results, and in Section 9, we conclude.

Scalable Video Utility Framework
H.264 supports three modes of video scalability-temporal, quality, and spatial.In our work, we consider video scheduling for temporal and quality scalable H.264 video and the extension to spatially scalable video sequences is relatively straight forward.Coded digital video streams such as H.264 employ a group of pictures (GOP) structure for differential pulse-code modulation (DPCM) based video coding.In a scalable video sequence, temporal scalability is achieved through dynamic GOP size scaling by insertion or deletion of additional temporal layers.An example of the temporally scalable GOP structure with dyadic temporal enhancement video layers is shown in Figure 2. The T 0 frames are the base layer intracoded video frames while T 1 frames are intercoded and those of subsequent layers such as T 2 are bidirectional predictively coded from frames in lower layers.Quality scalability is achieved by using different quantization parameters for the quality video layers.The base quality layer X 0 as shown in Figure 3 is coded with a coarse quantization parameter q 0 .The subsequent higher layer X 1 is differentially coded with a lower quantization parameter q 1 and so on for each higher layer.The highest quality corresponds to the lowest quantization parameter q min .Thus, the net video rate can be scaled dynamically by appropriately choosing the temporal and quality video layers.It can be readily seen from the above GOP description that different component frames of the H.264 salable video GOP have differing impacts on the net video quality and hence have different utilities.For example considering temporal scalability, it can be observed that the base layer T 0 has a significant impact on video quality compared to the enhancement layers T 1 , T 2 , since frames in T 0 can be decoded independently as they are intracoded.However, failing reception of T 0 frames, one cannot decode the enhancement layer frames of T 1 , T 2 .Hence, a realistic video scheduling framework is needed which ascribes differentiated video utilities accurately characterizing the impact of a particular GOP component on the net video quality.Further, we define the per bit normalized utility U (i, j) associated with temporal layer i and quality layer j as the ratio of the impact on video quality Q (i, j) to frame size B (i, j) as

Group of pictures Group of pictures
The above quantity U (i, j) can be interpreted as the utility of scheduling each bit of the video layer, thus associating a higher utility with video sequences of smaller frame sizes compared to larger ones.Below, we propose a framework to compute the quality and size parameters Q (i, j) , B (i, j) in H.264 scalable video scenarios.

Video Layer Frame Size Model.
The JSVM reference H.264 codec [11] developed jointly by the ITU-T H.264 and the ISO/IEC MPEG-4 AVC groups can be conveniently employed to characterize the frame sizes of the respective scalable video coded streams.Let V (m,n) denote the scalable video stream comprising of m+1, that is, 0, 1, . . ., m temporal layers and n + 1 quality video layers, while V (m,n) denotes the exclusive mth temporal and nth quality layer.We consider 4 temporal layers at the standard frame rates of 3.75, 7.5, 15, and 30 frames per second and 3 quantization layers in JSVM corresponding to quantization parameters (QP) 40, 36, and 32.The quantization step-size q corresponding to the quantization parameter QP is given as q = 2 ((QP−4)/6) [12].Hence, the quantization step-sizes corresponding to QP = 40, 36, 32 are q = 64, 40.32, 25.40, respectively.We employ the notation R (m,n) to denote the bit-rate of the stream V (m,n) .Table 1 illustrates the computed layer rates and frame sizes for the standard Crew video [13].For instance, the rate R (0,0) comprising of the spatial and quality base layers exclusively is given as R (0,0) = 79.2Kbps.Hence, the average base layer frame size can be derived by normalizing with respect to the base-layer frame rate of f (0,0) = 3.75 frames per second as The JSVM codec yields the cumulative bit-rate corresponding to the combination of base and enhancement layers of the video stream.Hence the rate R (0,1) corresponds to the cumulative bit-rate of the scalable video stream consisting of video layers V (0,0) and V (0,1) .The differential rate R (0,1) comprising exclusively of the differential video rate arising from the quality layer enhancement frames is given as Further, employing the dyadic video scalability model, the exclusive rate of the V (0,1) layer frames is 3.75 fps, as one such differential frame is added for each V (0,0) base layer frame.Therefore, the size of each frame belonging to layer V (0,1) is given as B (0,1) = 86.6/3.75 = 23.09Kb.Similarly one can derive the differential rate and frame sizes associated with the temporal layer V (1,0) .Further, as the cumulative rate R (1,1) incorporates the layers V (1,1) , V (0,1) , V (1,0) , and V (0,0) , the differential rate R (1,1) is given as The differential bit-rates and frame sizes of the higher enhancement layers can be derived similarly.It can be noted that because of the dyadic nature of the scalability, the differential frame rates progressively double for every higher Cumulative quality enhancement layer.Hence, the frame rates associated exclusively with enhancement layers V (2,0) and so forth are 7.5 and so on.Following the described procedure one can successively compute the corresponding bit-rates and associated frame sizes of the differential video layers.The bit-rates of several enhancement layers of the video sequence Crew are shown in Table 1.It can be seen that the frame sizes progressively decrease with increasing enhancement layer identifier due to the progressively increasing coding gain arising from the DPCM coding.

Video Layer Quality Model.
We employ the standard video quality model proposed in [12,14], which gives the quality of the scalable video stream coded at frame rate t and quantization step-size q as where q min = 25.40 is the minimum quantization-step size corresponding to QP = 32, t is frame rate or temporal resolution, t max is the maximum frame rate, Q max is the maximum video quality at t = t max , q = q min , set as Q max = 89, and c, d are the characteristic video quality parameters.The procedure for deriving the parameters c, d specific to a video sequence is given in [12].These are indicated in Table 2 for the standard video sequences Akiyo, City, Crew, and Football.The screen shots of these four standard videos are shown in Figure 4.The procedure to compute the differential video layer quality can be described as follows.Consider the standard video sequence Crew.Let the cumulative impact of the scalable video stream comprising of m temporal and n quality layers be denoted by by substituting mth layer frame rate and nth layer quantization parameter in (5).Hence, the quality associated with the video stream V (0,0) = V (0,0) consisting of the base temporal and quality layers coded at t = 3.75 fps and q = 64 corresponding to quantization parameter QP = 40 is given as 17(64/25.398)e −0.17 1 − e −7.34 (3.75/30)  1 − e −7.34 = 41.30.
Employing the frame size as computed in the section above, the per-bit normalized video utility can be computed utilizing the relation in (1) as Thus, the above utility can be employed as a convenient handle to characterize the scheduler reward towards scheduling a particular video stream.Further, similar to the rate derivation in the above section, the quantity Q (m,n) denotes the cumulative quality.Hence, the differential quality Q (1,0) associated with layer V (1,0) for instance is derived as .50 for Crew.The differential per-bit utility associated with layer V (1,0) can be computed as, U (1,0) = 2.19 and so on.The differential layer qualities and per-bit utilities of the scalable GOP frames for the standard video sequence Crew are shown in the Table 1.The utilities of the four standard video sequences mentioned above are shown in Table 3.
It can be seen from the table that the utility exhibits a decreasing trend across the enhancement layers, thus clearly demonstrating the different priorities associated with the GOP components.In the next section we derive an optimal policy towards video quality maximization while ensuring fairness in QoS.

Index-Based Scalable Video Policy (ISVP)
Employing the framework illustrated in [15], we model the scalable video scheduling scenario as a Markov decision process (MDP).The state of user u at time n is modeled as a combination of the channel state s n u and the video state v n u of the head of the queue frame of user u.Further, we also incorporate the user starvation age a n u in the system state to ensure fairness in video scheduling.We assume that s n u ∈ {1, 2, . . .L + 1}, where each state represents a maximum bitrate R(s n u ) supported by the fading channel between user u and base station at time instant n.The vector s n at time instant n defined as s n = [s n 1 , s n 2 , . . ., s n U ] T characterizes the joint channel state of all users.We assume that {s n , n ≥ 0} is an irreducible discrete time Markov Chain [16] with the L + 1 dimensional probability transition matrix P u = [p u i, j ].The objective of the scheduler is to allocate the shared wireless channel by scheduling the users in each time slot in such a way that maximizes the quality of scalable video without leading to starvation of users as shown in Figure 5. From the GOP structure illustrated previously in the context of scalable video, the video data state for each user v n u ∈ {1, 2, . . ., G}, where G is the number of frames in a GOP.Similar to above, the joint video state of the U users can be denoted as The starvation age a n u corresponds to the number of slots for which a particular user has not been served.This quantity is initialized as 0 to begin with and incremented by one for every slot for each user who is not served in that slot.If a particular user is served in the current slot, his starvation age is reset to 0. Let ω(n) denote the user scheduled at time slot n.The starvation age transition for a particular user is given as The total user starvation age is similarly denoted by vector a n obtained by stacking the starvation ages of all the users.The starvation age is important parameter as it can be used to characterize the fairness.If the starvation age of all users is almost same then we can say that fairness is achieved.If the starvation age of users is low then we can say that the users are not starved.Ideally the starvation of all users should be equal and close to zero.The system state vector g T characterizes the complete state of the system.The action ω(n) at any time instant n corresponds to choosing one of the U users.Employing the video utility framework developed above, the reward corresponding to serving user u in slot n is given as where U(v n u ) gives the utility of the video packet of user u in state v n u and K l is a constant which can control the tradeoff between quality and fairness.The transition probability T contingent on scheduling user u is given as if Our objective is to derive the optimal policy which maximizes the long-term average reward lim T → ∞ (1/T)E T (g), where E T (g) denotes the maximum reward over T time periods with initial state g.As this is an infinite horizon problem [17] with a very large state space, conventional schemes for policy derivation are impractical.We therefore employ the novel procedure proposed in [15] to derive the optimal scalable video scheduling policy termed ISVP.
Corollary 1.An index policy I u (g) close to the optimal policy for long-term expected average reward maximization in the context of the video scheduling paradigm defined above is given as Proof.As described in (10), the proposed reward structure is Replacing the channel state with the joint video and channel state vector [v T , s T ] T , reward with the proposed reward in (10) and applying Theorem 2 in [15] yields the desired result.
The above result guarantees that ISVP, which schedules the video user with the highest index I u (g), is close to the optimal policy and maximizes the video utility while minimizing the starvation age of all users.

Finite Queue Video System Model
The above proposed optimal ISVP policy maximizes the scalable video quality at the received users when the queue size is assumed to be infinity.In this section, we derive the optimal policy which maximizes scalable video quality when the buffer size in the base station is finite.The system model is identical to the one developed previously for video streaming except that the scalable video coded packets are buffered in a finite length queue at the base station.The state of user u at time n is modified to include the queue state q n u with the state space Ω qu along with the channel state s n u .The quantity q n u is a vector of utilities of the packets in the queue of user u at time instant n.The vector q n at time instant n defined as q n = [q n 1 , q n 2 , . . ., q n U ] characterizes the queue state of all the U mobile video users.Hence, the system state vector g = [(q n ) T , (s n ) T , (a n ) T ] T characterizes the complete state of the system.The action ω(n) at any time instant n corresponds to choosing one of the U users.We define the reward of scheduling a user u in slot n as Observe that the reward is proportional to the rate of the channel and also utility of the scheduled video to maximize the quality of the video.Second the penalty for not scheduling a user in a time slot is proportional to the starvation age of that user.We choose this penalty function as sum of utilities of frames in the queue with number of frames as minimum of starvation age and number of frames in the queue.Hence this penalty term is implicitly proportional to the starvation age and utility of the frames of unscheduled users.The term K v controls the weight of penalty function compared to the positive reward.Third mathematical tractability is also considered in defining the reward.For example the chosen reward is a regenerative process which simplifies the derivation of the optimum policy in future sections.

Optimal Finite Queue Length Video Scheduling Policy (ISVPF)
Similar to the previously derived policy for infinite queue lengths, let the initial policy be a random policy meaning allocate user u with probability α u .The policy iteration step is to choose the user u which maximizes the index where, , a n u−1 +1, 0, a n u+1 +1, . . ., a n U +1] and h r (i (n+1) , a (n+1) ) is the bias term of randomized policy starting in state (i (n+1) , a u ).To derive the bias term, add the expression below to (14), where e = [1, 1, . . ., 1].As this expression is independent of u adding, this will not affect the outcome.The resulting equation is To compute the index, we need to find the difference in biases.Consider two different sample paths of the stochastic process (i (n,m) , a (n,m) ), m ∈ {1, 2} such that, 2) , n ≥ 0, and a (0,1) = a u , a (0,2) = a n + e.

Advances in Multimedia 7
Let ń be the first time instant at which user u is scheduled, then The difference in biases is equal to the average difference in the reward acquired in these two sample paths.However in this scenario, the reward differs only in cost term for user u till time slot ń = n 0 .Therefore, where ).Since ń follows a geometrical distribution with parameter α u the average value of the difference in biases considered above is where the last equality follows from the fact that for n 0 > L n u , the term Φ(q n u ) is equal to 0. Hence the final index I u (i n , a n ) for finite queue video scheduling is given by (20)

Multiuser OFDMA Video Streaming Model
In the previous section, we have derived the optimal policy for a single shared channel scenario.In this section, we extend this to a multiple channel scenario by deriving an optimal channel allocation policy for 4G wireless systems.Consider a 4G OFDMA cellular base station BS streaming videos to a set of U cellular users.Let the users be indexed by u, 1 ≤ u ≤ U.The H.264 scalable coded video packets of these users are buffered at the Base station in their respective individual queues of infinite queue lengths.Consider N different OFDMA sub-channels to be allocated by the BS to the users for video transmission refer to Figure 6.Similar to the standard scheduling models established in literature we consider slotted time and channel allocation at every time slot.In this wireless video streaming scenario we wish to design a scheduler for multiuser sub-channel allocation towards video quality maximization while maintaining fairness amongst users.As already described above, the scalable coded video stream can be adapted to comprise varying combinations of temporal, quality, and spatial scalable layers.
As described in Section 2, each video layer is naturally of varying utility with respect to its graded impact on the net video quality.These utility parameters for different frame components of the scalable GOP structure had been derived therein and are key towards resource allocation for video quality maximization.The normalized utility representing the per bit impact on net video quality can be computed efficiently employing the framework described in this work.Below we model this wireless video streaming scenario as a multidimensional Markov decision process (MDP) to derive the optimal multiuser multichannel OFDMA video streaming policy.Let the user state be modelled as a combination of the N dimensional channel state vector, s n u = [s n (u, 1), s n (u, 2), . . ., s n (u, N)] T , where s n (u, c) represents a maximum supported bit-rate of R(s n (u, c)) between the BS and user u over channel c at time slot n, video state of the head of the line packet v n u .This video state corresponds to the identity of the frame in the scalable GOP.Hence the joint multiuser multichannel state S n ∈ R N×U can be obtained from the individual channel state vectors as Similarly the joint video state vector v n ∈ R U of the U users can be defined as Let the starvation age of user be denoted by a n u .This starvation age is initialised to 0 to begin with and is incremented by one in every time slot if the user is not scheduled, while being reinitialised to 0 once the user is scheduled.Hence the update relation for this starvation age parameter a n u can be described as where ω(n) ⊂ {1, 2, . . ., U} is the set of users scheduled to transmit in time slot n.The action is choosing any N users among U users at every time slot.The net video quality reward of assigning users u 1 , u 2 , . . ., u N in time slot n to channels 1 through N, respectively, is given as where, U(v n ui ) denotes the video utility achieved by scheduling user u i over the ith channel and K v is the penalty factor corresponding to the starvation age.Deriving the optimal policy to maximize the above long-term reward for this multidimensional MDP yields the optimal scheduler policy for video quality maximization.However it is significantly challenging to obtain the optimal policy solution of this MDP.This arises due to the fact that the above MDP has an extremely large state space which grows exponentially with the number of users and channels.Thus it is inefficient to employ conventional policy and value iteration techniques to derive the optimal policy as they require a significantly large time for convergence.Hence in such scenarios, one can initialize with a random policy and employ a one step policy iteration to derive a policy that is sufficiently close to the optimal policy [18].Now consider an initial random policy for individual user selection towards sub-channel allocation.The policy improvement step towards deriving the optimal policy for allocation of N sub-channels towards video quality maximization is to choose the set of N different users which maximizes the index I u (i n , a n ) given as where i n = (S n , v n ) is the joint multiuser multichannel and video queue state at time slot n and h r (j (n+1) , a u ) is the bias term of the randomized policy starting in state (i (n+1) , a (n+1) ).
The starvation age of each user in n + 1 time slot a (n+1) is obtained by incrementing the previous starvation age by one if the user is not scheduled and assigning 0 if user is scheduled.This is represented by Hence the optimal video policy depends on the bias term which is derived employing the procedure below.Let u = {u 1 , u 1 . . ., u N } be the set of users scheduled in time slot n.
To simplify the above equation, we add the following u independent term given as where e = [1, 1, . . ., 1] T .Adding the above term to the (23), the resulting expression for the index I u (i n , a n ) can be simplified as From the above equation, it is clear that the optimal index depends only on the difference in the bias terms (h r (i n+1 , a (n+1) ) − h r (i n+1 , a n + e)).To compute this consider two different sample paths of the stochastic process of the randomized policy (i (n,m) , a (n,m) ), m ∈ {1, 2} such that 2) , n ≥ 0 and a (0,1) = a (n+1) , a (0,2) = a n + e.Let n i be the first time instant at which user u i is scheduled.It can be readily observed that the difference in biases is equal to the average difference in the reward acquired in these two sample paths.However in this scenario, the rewards differ only in cost term for users u i till time slot n i .Therefore, Hence, employing the above relations for the starvation age vector, the expression for the bias difference h r (i (n+1) , a (n+1) ) − h r (i (n+1) , a n + e) can be derived as Since the policy is random, n i is a random variable which follows geometric distribution with p = N/U.Therefore the expected value of the difference in bias term can be further simplified as Substituting the above expression in (23), the resulting expression for the user video scheduler index I u (i n , a n ) can be simplified as Let w(u, c) be defined as Then the index I u (i n , a n ) can be simplified as Therefore the optimal video scheduler policy chooses N users such that it maximises the sum component index Next we describe a fast algorithm to compute the multiuser multi-sub-channel allocation towards video quality maximization based on the above index optimization.

Bipartite User Subchannel Index Maximization
The above multiuser index maximization can be readily viewed as a maximum weight bipartite matching computation.Consider a bipartite graph (U, C, E) such that the partitions contain the U users and the N channels as the nodes  and the U × N edges between each user u to each channel c are associated with the weight w(u, c) as shown in Figure 7.The optimal index computation for video scheduling thus reduces to computing the maximally wighted bipartite user sub-channel matching.This can be achieved through the Hungarian algorithm-based sub channel allocation given below.The input to the algorithm is a matrix W whose (i, j)th element represents weight of the edge between user i and channel j which is equal to w(i, j).The algorithm is described below.
The Hungarian method given in Algorithm 1 thus yields the optimal index based user sub-channel allocation for long term video quality maximization.However, it has a complexity of O((U + N) 3 ).Hence to reduce the computational complexity we present a suboptimal greedy algorithm of complexity O(U 2 ) in Algorithm 2.

Simulation Results
We compare the performance of the proposed video optimal policies with LIP proposed in [15], proportional fair (PF) scheduling policy, and two heuristic policies.The LIP is an index policy with index I l u (s n , a n ) defined exclusively in terms of the channel state vector s n and multiuser starvation vector The LIP is an optimal policy for maximizing bit rate with a constraint on fairness.It is generic in sense it does not depend on the type of data transmitted.Whereas the policies ISVP, ISVPF we have proposed are suited for transmission of video data through wireless channel.These policies take advantage of the scalability of video and hence they are dynamically scalable with the state of the changing wireless environment.
The PF scheduling policy is equivalent to an index policy where ω(n) is the scheduled user in slot n and τ is the damping coefficient.As the above two policies are generic, we also compare our results with two other heuristic policies.
The first heuristic policy is the Quality Proportional Fair (QPF) policy.It is similar to PF policy except that the rate is replace by product of utility and rate.The QPF scheduling policy is equivalent to an index policy The second heuristic policy is Rate Starvation Age policy (RSA).It is an Index policy with index directly proportional to rate and starvation age.The index I RSA u is defined as These policies are extended appropriately for comparison in multichannel scenarios.For multi channel scenario, we applied Greedy matching and Hungarian matching algorithms with the weights of the edges equal to above indexes I LIP and I PF .For finite queue case whenever the buffer is full, the incoming packets are dropped.
We consider the performance measures Ψ, the expected per-slot long-term utility, χ, the expected starvation age and ρ d , the probability that a user is not served for longer than d time slots, for evaluation of the policies.We consider an L + 1 = 5 channel state model with supported rate states R(s n u ) ∈ {38.4,76.8, 102.6, 153.6, 204.8}Kbps.We considered U = 12 users transmitting the standard videos Akiyo, City, Crew, and Football.We use T = 10 5 slots and P = 100 sample paths of the Markov chain.The state transition matrix is similar to the one considered in [15], with β = 0.999.The K u value is varied for the ISVP and LIP schemes while τ is varied for the PF scheme.The starvation age and utility are calculated for different values of parameter K u in the range [0, 500].In case of the PF policy, the parameter τ is varied appropriately in the range [0, 1].
Figure 8 shows a comparison of the video utility of the proposed ISVP policy with LIP, PF, RSA, and QPF policies.It can be observed that the proposed ISVP policy yields the maximum video utility amongst the five competing policies.Further, as K u → ∞ and τ → 1, the LIP and PF policies effectively converge to the round-robin policy.Hence, the utility and starvation age coincide at this point.Further when K u = 0 the index remains same for ISVP and QPF policies so they also coincide.Figure 9 shows the plot between utility and the probability ρ d that a user is starved for more than d slots.This is also plotted by varying the parameters as mentioned above.We observe that the utility is maximum for a particular probability for the proposed ISVP scheme compared to other policies.Thus, the proposed ISVP scheduler maximizes the net video quality while not compromising on fairness.Further the ISVP policy we proposed is an index policy and index calculation is of order O(1) similar to PF and LIP policy so the cost of computation remains same which is O(U).
Figures 10 and 11 show a comparison of the video utility of the proposed ISVPF policy with that LIP, RSA, QPF, and PF policies when each user queue sizes are equal to L u = 500.It can be observed that the proposed ISVPF policy yields the maximum video utility amongst the five competing policies.
(1) Identify the largest element α of the matrix W and replace each element w(u, c) with α − w(u, c).
(2) From every row of the resultant matrix subtract the row minimum that is, w(i, j) = w(i, j) − min j (w(i, j)), ∀i.
(3) From every column of the matrix subtract the column minimum that is, w(i, j) = w(i, j) − min i (w(i, j)); ∀ j. (4) while True do (5) In every row match a row and column if there is only one 0 in a row and strike off the other 0's in the matched column that is, i ↔ j, if w(i, j) = 0, and w(i , j) / = 0, ∀i / = i, ∀i ∈ {1, 2, . . ., U} (6) In every column match a row and column if there is only one 0 in the column and strike off the other 0's in the matched row that is, i ↔ j, if w(i, j) = 0, and w(i, j ) / = 0, ∀ j / = j, ∀ j ∈ {1, 2, . . ., N} (7) if Allocation is not complete then (8) Draw minimum number of lines passing through all zeroes.(9) Identify the smallest number θ amongst all elements through which no line is passing.(10) For each element subtract θ if no line is passing through and add θ if two lines are passing through.( 11) else (12) break (13) end if (14) end while Algorithm 1: Hungarian matching.
(1) for i = 0 to N do (2) Match the ith channel with user u having the highest weight w(u, i). Figure 9 shows the plot between utility and the probability ρ d that a user is starved for more than d slots.We observe that the utility is maximum for a particular probability for the proposed ISVPF scheme compared to other policies.Thus, the proposed ISVPF scheduler maximizes the net video quality for finite buffers at the base station while not compromising on fairness.
In this section, we compare through simulations the performance of the proposed optimal multichannel allocation policies, Hungarian MultiChannel Optimal Allocation (HMOA), and Greedy MultiChannel Sub-Optimal Allocation (GMOA) with that of the LIP policy proposed in [15] and the standard Proportional Fair (PF) scheduler.Since these are designed for single shared channel scheduling we extend them to multichannel scheduling, by employing the Hungarian (HMLIP, HMPF) and Greedy matching (GMLIP, GMPF) paradigms described above.It can be observed from Figures 12 and 13 that the proposed HMOA policy yields the maximum video quality amongst the competing multiuser multichannel video scheduling policies.Although the GMOA is not optimal but it performs better than PF policy.Further, as K u → ∞ and τ → 1, the LIP and PF policies effectively converge to the round-robin policy.Hence, the utility and starvation age coincide at this point.

Conclusions
In this paper, we developed a novel framework to characterize the differential utility of the H.264 scalable video stream layers.Based on the proposed framework, a utilitystarvation based reward paradigm has been proposed to characterize the scheduling decisions.The end-user video quality maximization has been formulated as an appropriate Markov decision process, and an optimal index based ISVP and ISVPF have been derived towards scheduling the scalable video frames for net video quality maximization in next generation wireless networks.We demonstrated through simulations that the derived ISVP and ISVPF policies achieve better utility compared to PF, LIP, RSA, and QPF policies.Further, we extended this to multiuser multichannel scenarios.The multichannel allocation problem was formulated as an MDP, and the optimal index based channel allocation policy was derived towards video quality maximization which also ensured fairness of video QoS.Two novel index based video scheduling schemes, namely, the Hungarian and Advances in Multimedia Greedy MultiChannel Allocation were derived for multiuser multichannel video scheduling.Simulation results demonstrate that the proposed HMOA and GMOA schemes achieve a significantly higher video quality for a given starvation age compared to standard LIP and PF policies.

Figure 7 :
Figure 7: Bipartite graph with users and channels as nodes of the graph.

Table 1 :
Calculation bit rate for SVC video with 4 temporal and 3 quantization layers for Crew video.

Table 2 :
Quality parameter values c, d for standard videos.

Table 3 :
Utility for different standard videos.