Delay-optimal scheduling for two-hop relay networks with randomly varying connectivity: join the shortest queue-longest connected queue policy

DOI10.1155/2017/4362652zbMath1426.90115OpenAlexW2769746798MaRDI QIDQ1992746

Joon-Sang Park, Seung Jun Baek

Publication date: 5 November 2018

Published in: Mathematical Problems in Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2017/4362652

Mathematics Subject Classification ID

Stochastic network models in operations research (90B15) Deterministic scheduling theory in operations research (90B35) Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Dynamic scheduling for minimum delay in tandem and parallel constrained queueing models
• Delay Optimal Buffered Decode-and-Forward for Two-Hop Networks With Random Link Connectivity
• Resource Allocation and Cross-Layer Control in Wireless Networks
• Dynamic server allocation to parallel queues with randomly varying connectivity
• Queue-Aware Distributive Resource Control for Delay-Sensitive Two-Hop MIMO Cooperative Systems
• Multiaccess fading channels. I. Polymatroid structure, optimal resource allocation and throughput capacities
• Opportunistic Relaying in Wireless Networks
• Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks

This page was built for publication: Delay-optimal scheduling for two-hop relay networks with randomly varying connectivity: join the shortest queue-longest connected queue policy