Abstract
In this correspondence, we consider the problem of delay optimal rate allocation in a (potentially asymmetric) multiaccess channel. The rate feasibility region of such a network is well studied and is shown to be of a polymatroid structure. We consider this problem with unsaturated sources, i.e., jobs arrive at sources at random times and the source has the possibility of being empty. In such a setting, all stable rate allocation policies result in a throughput matched with the average arrival rate. Hence, we are interested in rate allocation policies that minimize expected delay in the system. In this correspondence, we show that a policy of threshold type is optimal in minimizing the average queueing delay. We study the average delay criterion as the limit of an infinite-horizon discounted cost function when the discount factor approaches 1.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.