New Algorithms for Online Rectangle Filling with k-Lookahead

Authors:
Haitao Wang;Amitabh Chaudhary;Danny Z. Chen
Affiliations:
Department of Computer Science and Engineering, University of Notre Dame, Notre Dame, USA IN 46556;Department of Computer Science and Engineering, University of Notre Dame, Notre Dame, USA IN 46556;Department of Computer Science and Engineering, University of Notre Dame, Notre Dame, USA IN 46556
Venue:
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
Year:
2008

Citing 8
Cited 1

Online computation and competitive analysis

Online computation and competitive analysis
Wireless Communications and Networks

Wireless Communications and Networks
Scheduling Over a Time-Varying User-Dependent Channel with Applications to High Speed Wireless Data

FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Throughput analysis in wireless networks with multiple users and multiple channels

Acta Informatica
Scheduling resource allocation with timeslot penalty for changeover

Theoretical Computer Science
Probabilistic computations: Toward a unified measure of complexity

SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
Online rectangle filling

WAOA'07 Proceedings of the 5th international conference on Approximation and online algorithms
Adaptive modulation and MIMO coding for broadband wireless data networks

IEEE Communications Magazine

An improved algorithm for online rectangle filling

WAOA'10 Proceedings of the 8th international conference on Approximation and online algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study the online rectangle filling problem which arises in channel aware scheduling of wireless networks, and present improved deterministic and first known randomized results for algorithms that are allowed a k-lookahead for k茂戮驴 2. Our main result is a deterministic min {1.848,1 + 2/(k茂戮驴 1)}-competitive online algorithm. The previous best-known solution for this problem has a competitive ratio of 2 for any k茂戮驴 2. We also present a randomized online algorithm with a competitive ratio of 1 + 1/(k+ 1). Our final result is a closely matching lower bound of $1+1/(\sqrt{k+2}+\sqrt{k+1})^2 1+1/(4(k+2))$ on the competitive ratio of any randomized online algorithm against an oblivious adversary.