Online computation and competitive analysis
Online computation and competitive analysis
Better online buffer management
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Considering suppressed packets improves buffer management in QoS switches
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Online Scheduling of Equal-Length Jobs: Randomization and Restarts Help
SIAM Journal on Computing
Minimum energy transmission scheduling subject to deadline constraints
Wireless Networks
Optimal transmission scheduling over a fading channel with energy and deadline constraints
IEEE Transactions on Wireless Communications
IEEE Transactions on Information Theory
Energy-Efficient Transmissions With Individual Packet Delay Constraints
IEEE Transactions on Information Theory
Optimal Rate Control for Delay-Constrained Data Transmission Over a Wireless Channel
IEEE Transactions on Information Theory
| Hi-index | 0.00 |
We consider online scheduling weighted packets with time constraints over a fading channel. Packets arrive at the transmitter in an online manner. Each packet has a value and a deadline by which it should be sent. The fade state of the channel determines the throughput obtained per unit of time and the channel's quality may change over time. In this paper, we design online algorithms to maximize weighted throughput, defined as the total value of the packets sent by their respective deadlines. Competitive ratio is employed to measure an online algorithm's performance. For this problem and one of its variants, we present two online algorithms with competitive ratios 2.618 and 2 respectively.