Optimal rate allocation in wireless networks with delay constraints
The optimal rate allocation problem with end-to-end delay constraints in wireless networks is
highly challenging due to the dynamics incurred by delay related factors, such as traffic …
highly challenging due to the dynamics incurred by delay related factors, such as traffic …
Performance tradeoffs in wireless scheduling with flow aggregration
R Rom, HP Tan - 2003 IEEE Wireless Communications and …, 2003 - ieeexplore.ieee.org
We develop Markov models for various schedulers in order to evaluate their performance
tradeoffs at wireless links. While FIFO scheduling aggregates flows into a single flow just …
tradeoffs at wireless links. While FIFO scheduling aggregates flows into a single flow just …
A low-complexity congestion control and scheduling algorithm for multihop wireless networks with order-optimal per-flow delay
Quantifying the end-to-end delay performance in multihop wireless networks is a well-known
challenging problem. In this paper, we propose a new joint congestion control and …
challenging problem. In this paper, we propose a new joint congestion control and …
Instability of maxweight scheduling algorithms
MaxWeight scheduling algorithms provide an effective mechanism for achieving queue
stability and guaranteeing maximum throughput in a wide variety of scenarios. The …
stability and guaranteeing maximum throughput in a wide variety of scenarios. The …
Stability analyses of longest-queue-first link scheduling in MC-MR wireless networks
Longest-queue-first (LQF) link scheduling is a greedy link scheduling in multihop wireless
networks. Its stability performance in single-channel single-radio (SC-SR) wireless networks …
networks. Its stability performance in single-channel single-radio (SC-SR) wireless networks …
Throughput optimal decentralized scheduling of multi-hop networks with end-to-end deadline constraints: II wireless networks with interference
Consider a multihop wireless network serving multiple flows in which wireless link
interference constraints are described by a link interference graph. For such a network, we …
interference constraints are described by a link interference graph. For such a network, we …
Throughput-optimal opportunistic scheduling in the presence of flow-level dynamics
We consider multiuser scheduling in wireless networks with channel variations and flow-
level dynamics. Recently, it has been shown that the MaxWeight algorithm, which is …
level dynamics. Recently, it has been shown that the MaxWeight algorithm, which is …
A fair scheduling algorithm with traffic classification for wireless networks
Wireless channels are characterized by more serious bursty and location-dependent errors.
Many packet scheduling algorithms have been proposed for wireless networks to guarantee …
Many packet scheduling algorithms have been proposed for wireless networks to guarantee …
Fair scheduling in wireless packet networks
Fair scheduling of delay and rate-sensitive packet flows over a wireless channel is not
addressed effectively by most contemporary wireline fair scheduling algorithms because of …
addressed effectively by most contemporary wireline fair scheduling algorithms because of …
Delay-guaranteed cross-layer scheduling in multihop wireless networks
D Xue, E Ekici - IEEE/ACM Transactions on Networking, 2012 - ieeexplore.ieee.org
In this paper, we propose a cross-layer scheduling algorithm that achieves a throughput “ε-
close” to the optimal throughput in multihop wireless networks with a tradeoff of O ([1/(ε)]) in …
close” to the optimal throughput in multihop wireless networks with a tradeoff of O ([1/(ε)]) in …