PROJECT TITLE :

Throughput-Optimal Scheduling Design With Regular Service Guarantees in Wireless Networks

ABSTRACT:

Motivated by the regular service necessities of video applications for improving quality of expertise (QoE) of users, we have a tendency to consider the design of scheduling strategies in multihop wireless networks that not only maximize system throughput however also offer regular interservice times for all links. Since the service regularity of links is connected to the upper-order statistics of the arrival method and the policy operation, it's difficult to characterize and analyze directly. We overcome this obstacle by introducing a replacement quantity, specifically the time-since-last-service (TSLS), that tracks the time since the last service. By combining it with the queue length in the load, we tend to propose a completely unique most-weight-kind scheduling policy, referred to as Regular Service Guarantee (RSG) Algorithm. The distinctive evolution of the TSLS counter poses significant challenges for the analysis of the RSG Algorithm. To tackle these challenges, we have a tendency to first propose a unique Lyapunov perform to show the throughput optimality of the RSG Algorithm. Then, we prove that the RSG Algorithm will give service regularity guarantees by using the Lyapunov-drift-based analysis of the steady-state behavior of the stochastic processes. In explicit, our algorithm can achieve a degree of service regularity at intervals a issue of a elementary lower certain we have a tendency to derive. This issue may be a perform of the system statistics and style parameters and can be as low as 2 in some special networks. Our results, each analytical and numerical, exhibit important service regularity improvements over the ancient throughput-optimal policies, which reveals the importance of incorporating the metric of time-since-last-service into the scheduling policy for providing regulated service.