Delay-Constrained Input-Queued Switch
Publication in refereed journal

香港中文大學研究人員
替代計量分析
.

其它資訊
摘要In this paper, we study the delay-constrained input-queued switch, where each packet has a deadline and it will expire if it is not delivered before its deadline. Such new scenario is motivated by the proliferation of real-time applications in multimedia communication systems, tactile Internet, networked controlled systems, and cyber-physical systems. The delay-constrained input-queued switch is completely different from the well-understood delay-unconstrained one and thus poses new challenges. We focus on three fundamental problems centering around the performance metric of timely throughput: (i) how to characterize the capacity region? (ii) how to design a feasibility/throughput-optimal scheduling policy? and (iii) how to design a network-utility-maximization scheduling policy? We use three different approaches to solve these three fundamental problems. The first approach is based on Markov Decision Process (MDP) theory, which can solve all three problems. However, it suffers from the curse of dimensionality. The second approach breaks the curse of dimensionality by exploiting the combinatorial features of the problem. It gives a new capacity region characterization with only a polynomial number of linear constraints. The third approach is based on the framework of Lyapunov optimization, where we design a polynomial-time maximum-weight T-disjoint-matching scheduling policy which is proved to he feasibility/throughput-optimal. Our three approaches apply to the frame-synchronized traffic pattern but our MDP-based approach can be extended to more general traffic patterns.
著者Lei Deng, Wing Shing Wong, Po-Ning Chen, Yunghsiang S. Han, Hanxu Hou
期刊名稱IEEE Journal on Selected Areas in Communications
出版年份2018
月份11
卷號36
期次11
出版社Institute of Electrical and Electronics Engineers (IEEE)
頁次2464 - 2474
國際標準期刊號0733-8716
電子國際標準期刊號1558-0008
語言美式英語

上次更新時間 2021-15-06 於 00:32