Abstractcustomer which exceeds its deadline will either leave the queue without service or stay in the queue to get unsucWe consider the problem of scheduling impatient CUS-cessful service. One application of this problem is the tomers in a non-preemptive G/GI/1 queue. Every CUS-transmission of time-constrained messages over a comtomer has a random deadline to the beginning of its munication channel. These messages have to reach their service. Given the distribution of the customer dead-receivers within a certain time interval of their transmislines (rather than their exact values), a scheduling pol-sion or they are useless to the receivers and considered icy decides the customer service order and also which lost. Two possible scenarios are often encountered in this customer(s) to reject, since those whose deadlines have kind of queueing system [l]. The first is that the server expired do not leave the queue automatically. Our ob-of the queue is aware of each customer's deadline. The jective is to find an optimal policy which maximizes the messages whose delay times exceed their deadlines are number of customers served before their deadlines. We discarded without transmission. In the second scenario, show that LIFO (last-in first-out) is an optimal service the Server is only aware of the deadline distribution of order when the deadlines are i.i.d. random variables with the customers. Therefore some server work is useless a concave cumulative distribution function. After ana-because of the expiration of customers' deadlines. For lyzhg the rejection strategy, we claim that there is an example, there may be a delay before a dial tone in an optimal policy in the LIFO-TO (time-out) class, as de-overloaded call processing system. If some people start fined in the paper. For the M/GI/1 queue, we further dialing before a dial tone is heard, the system will not prove that unforced idle times are not allowed under this receive all the digits dialed. However, the call is still prooptimal policy. We also show that the optimal LIFO-TO cessed and an unsuccessful call results [4]. A similar case policy assigns a fixed critical time (i.e., its maximum can arise in dealing with time-critical voice or video cells waiting time) to every customer. When the customer in an ATM (Asynchronous Transfer Mode) network.waiting times are unknown, we show that the optimal policy for a M/M/l queue the When the customers, deadlines are available, the (push-shortest time t o extinction (STE) and the shortest time Out) Policy, with a fixed buffer size Among Other * a rejection to extinction with inserted idle time (STEI) were proved to be optimal under certain conditions, These policies this may be applied in determining scheduling and buffer management maximize the fraction of customers served within their policies for critical the cells in an ATM (Asynchronous respective deadlines out of an arrival stream. The results for single server queues can be found in [7], [8] and Transfer Mode) network.[2]. In [13], earlier results are extended to mult...
This paper investigates the design of the joint user pairing and power allocation scheme with transmission mode switching (TMS) in downlink multiple-input-single-output (MISO) systems. Firstly, the closed-form expressions of the boundary of achievable rate region of two candidate transmission modes, i.e., non-orthogonal multiple access based maximum ratio transmission (NOMA-MRT) and minimum mean square error beamforming (MMSE-BF), are obtained. By obtaining the outer boundary of the union of the achievable rate regions of the two transmission modes, an adaptive switching method is developed to achieve a larger rate region. Secondly, based on the idea that the solution to the problem of weighted sum rate (WSR) optimization must be on the boundary of the achievable rate region, the optimal solutions to the problem of WSR optimization for NOMA-MRT and MMSE-BF are obtained for the two-user case, respectively. Subsequently, by exploiting the aforementioned optimal solutions for two transmission modes and the high efficiency of TMS, a suboptimal user pairing and power allocation algorithm (JUPA) is proposed to further improve the sum rate performance for the multiuser case. Compared with the exhaustive search-based user pairing and power allocation algorithm (ES-PPA), the proposed JUPA can enjoy a much lower computational complexity and only suffers a slight sum rate performance loss, and it outperforms other traditional schemes. Finally, numerical results are provided to validate the analyses and the proposed algorithms.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.