On-line scheduling in the presence of overload
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Dover: An Optimal On-Line Scheduling Algorithm for Overloaded Uniprocessor Real-Time Systems
SIAM Journal on Computing
Better bounds for online scheduling
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Multiprocessor scheduling with rejection
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
A better algorithm for an ancient scheduling problem
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
A Supermodular Relaxation for Scheduling with Release Dates
Proceedings of the 5th International IPCO Conference on Integer Programming and Combinatorial Optimization
Scheduling Jobs that Arrive Over Time (Extended Abstract)
WADS '95 Proceedings of the 4th International Workshop on Algorithms and Data Structures
Improved Bounds for the Online Scheduling Problem
SIAM Journal on Computing
Allocating dynamic time-spectrum blocks in cognitive radio networks
Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing
eBay in the Sky: strategy-proof wireless spectrum auctions
Proceedings of the 14th ACM international conference on Mobile computing and networking
A 1.47-approximation algorithm for a preemptive single-machine scheduling problem
Operations Research Letters
On-line scheduling on a single machine: maximizing the number of early jobs
Operations Research Letters
Truthful multi-attribute auction with discriminatory pricing in cognitive radio networks
Proceedings of the 1st ACM workshop on Cognitive radio architectures for broadband
Truthful multi-attribute auction with discriminatory pricing in cognitive radio networks
ACM SIGMOBILE Mobile Computing and Communications Review
| Hi-index | 0.00 |
In this paper we study the online spectrum scheduling using a market driven approach. We assume that each new arrival spectrum request, when it arrives, requests for the exclusive usage of some channels for a certain time interval. The spectrum owner has to decide immediately whether to grant its exclusive usage or not. If it is granted, the secondary user will be charged a payment. We assume that existing running requests can be preempted with a penalty depending on its bid value, its requested time duration and the remaining unserved time. For various possible known information, we present efficient scheduling algorithms to schedule requests and prove that the competitive ratios of our methods are asymptotically optimum, i.e., within small constant factors of the optimum online methods. Our extensive simulations show that our algorithms perform almost optimum: most of our methods can get a total profit that is more than 80% of the optimum.