On-Line Resource Management with Application to Routing and Scheduling |
| |
Authors: | S Leonardi A Marchetti-Spaccamela |
| |
Affiliation: | (1) Dipartimento di Informatica e Sistemistica, Università di Roma ``La Sapienza,' via Salaria 113, 00198-Roma, Italy. leon@dis.uniroma1.it, marchetti@dis.uniroma1.it., IT |
| |
Abstract: | We propose a framework to model on-line resource management problems based on an on-line version of positive linear programming.
We consider both min cost problems and max benefit problems and propose logarithmic competitive algorithms that are optimal
up to a constant factor.
The proposed framework provides a general methodology that applies to a wide class of on-line problems: shop scheduling,
packet routing, and in general a class of packing and assignment problems. Previously studied problems as on-line multiprocessor
scheduling and on-line virtual circuit routing can also be modeled within this framework.
Received December 18, 1996; revised March 2, 1997. |
| |
Keywords: | , On-line algorithms, Competitive analysis, Routing, Scheduling, Linear programming, |
本文献已被 SpringerLink 等数据库收录! |
|