Delay-Constrained Input-Queued Switch

Deng, Lei; Wong, Wing Shing; Chen, Po‐Ning; Han, Yunghsiang S.; Hou, Hanxu

doi:10.1109/jsac.2018.2874110

Cited by 15 publications

(7 citation statements)

References 36 publications

(136 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Two algorithmic works focus on scheduling policies in switches and/or routers to efficiently steer the Tactile Internet traffic. Shin et al [169] introduce a low-latency scheduling algorithm in cut-through switching-based networks, and Deng et al [170] investigate delay-constrained input-queued switching using virtual output queueing for the Tactile Internet.…”

Section: Switchingmentioning

confidence: 99%

See 1 more Smart Citation

A Comprehensive Survey of the Tactile Internet: State-of-the-Art and Research Directions

Promwongsa

Ebrahimzadeh

Naboulsi

et al. 2021

IEEE Commun. Surv. Tutorials

View full text Add to dashboard Cite

The Internet has made several giant leaps over the years, from a fixed to a mobile Internet, then to the Internet of Things, and now to a Tactile Internet. The Tactile Internet goes far beyond data, audio and video delivery over fixed and mobile networks, and even beyond allowing communication and collaboration among things. It is expected to enable haptic communications and allow skill set delivery over networks. Some examples of potential applications are telesurgery, vehicle fleets, augmented reality and industrial process automation. Several papers already cover many of the Tactile Internet-related concepts and technologies, such as haptic codecs, applications, and supporting technologies. However, none of them offers a comprehensive survey of the Tactile Internet, including its architectures and algorithms. Furthermore, none of them provides a systematic and critical review of the existing solutions. To address these lacunae, we provide a comprehensive survey of the architectures and algorithms proposed to date for the Tactile Internet. In addition, we critically review them using a well-defined set of requirements and discuss some of the lessons learned as well as the most promising research directions.

show abstract

Section: Switchingmentioning

confidence: 99%

“…In [170], Deng et al study the delay-constrained inputqueued switch using virtual output queueing, where each packet has a deadline and it will expire if it is not delivered before its deadline. More specifically, the capacity region is first characterized in terms of the timely throughput of all input-output pairs.…”

Section: Switchingmentioning

confidence: 99%

A Comprehensive Survey of the Tactile Internet: State-of-the-Art and Research Directions

Promwongsa

Ebrahimzadeh

Naboulsi

et al. 2021

IEEE Commun. Surv. Tutorials

View full text Add to dashboard Cite

show abstract

“…(In general, we may have L t i = 0 for some t; meaning that i has no packet to send in frame t.) The arrival time and the deadline of device i's packet in frame t are denoted by a t i and d t i , respectively. The considered traffic pattern is similar to but more general than the well-known frame-synchronized traffic pattern [20,21]. Device i has ēi units of energy stored in its battery.…”

Section: S Mmentioning

confidence: 99%

Massive IoT Access With NOMA in 5G Networks and Beyond Using Online Competitiveness and Learning

Mlika,

Cherkaoui

2020

Preprint

View full text Add to dashboard Cite

This paper studies the problem of online user grouping, scheduling and power allocation in beyond 5G cellular-based Internet of things networks. Due to the massive number of devices trying to be granted to the network, non-orthogonal multiple access method is adopted in order to accommodate multiple devices in the same radio resource block. Different from most previous works, the objective is to maximize the number of served devices while allocating their transmission powers such that their real-time requirements as well as their limited operating energy are respected. First, we formulate the general problem as a mixed integer non-linear program (MINLP) that can be transformed easily to MILP for some special cases. Second, we study its computational complexity by characterizing the NP-hardness of different special cases. Then, by dividing the problem into multiple NOMA grouping and scheduling subproblems, efficient online competitive algorithms are proposed. Further, we show how to use these online algorithms and combine their solutions in a reinforcement learning setting to obtain the power allocation and hence the global solution to the problem. Our analysis are supplemented by simulation results to illustrate the performance of the proposed algorithms with comparison to optimal and stateof-the-art methods.

show abstract

“…D ELAY-CONSTRAINED applications become widespread nowadays. Typical examples include multimedia communication systems such as realtime streaming and video conferencing [2], tactile Internet [3], [4], networked control systems (NCSs) such as remote control of unmanned aerial vehicles (UAVs) [5], [6], and cyber-physical systems (CPSs) such as medical tele-operations, X-by-wire vehicles/avionics, factory automation, and robotic collaboration [7]- [9]. In such applications, each packet has a hard deadline: if it is not delivered before the deadline, it becomes useless and will be removed from the system.…”

Section: Introductionmentioning

confidence: 99%

Comparing Delay-Constrained ALOHA and CSMA: A Learning-Based Low-Complexity Approximate Approach

Deng

Zhang

et al. 2021

IEEE Open J. Commun. Soc.

Self Cite

View full text Add to dashboard Cite

Supporting delay-constrained traffic becomes more and more critical in multimedia communication systems, tactile Internet, networked control systems, and cyber-physical systems, etc. In delay-constrained traffic, each packet has a hard deadline. When it is not delivered before the hard deadline, it becomes useless and will be removed from the system. This feature is completely different from that of traditional delay-unconstrained traffic and brings new challenge to network protocol design. In this work, we study the widely-used (slotted) ALOHA and CSMA wireless access protocols but under the new delay-constrained setting. Our goal is to compare delay-constrained ALOHA and CSMA for different system settings and thus give network operators guidelines on protocol selection. We use two Markov chains to analyze delay-constrained ALOHA and CSMA, respectively. However, the number of states of Markov chains increases exponentially with respect to the number of users in the network. Therefore, we can only compare the exact performance of delay-constrained ALOHA and CSMA for small-scale networks. To address the curse of dimensionality, we design a single-user parameterized ALOHA (resp. CSMA) system, where the parameters are to be learned to approximate the original multi-user ALOHA (resp. CSMA) system. In addition, our low-complexity approach preserves the Markov-chain structure of the systems and thus enables us to compute some other interested performance metrics such as average delivery time. We use our low-complexity approach to reveal the conditions under which ALOHA (resp. CSMA) outperforms CSMA (resp. ALOHA) in the delay-constrained setting via extensive simulations.INDEX TERMS Delay-constrained communications, ALOHA, CSMA, Markov chain, machine learning.

show abstract

Delay-Constrained Input-Queued Switch

Cited by 15 publications

References 36 publications

A Comprehensive Survey of the Tactile Internet: State-of-the-Art and Research Directions

A Comprehensive Survey of the Tactile Internet: State-of-the-Art and Research Directions

Massive IoT Access With NOMA in 5G Networks and Beyond Using Online Competitiveness and Learning

Comparing Delay-Constrained ALOHA and CSMA: A Learning-Based Low-Complexity Approximate Approach

Contact Info

Product

Resources

About