Original title: Online competitive algorithms for maximizing weighzed throughput of unit jobs. ITI Series 2003-172
Authors: Bartal, Y. ; Chin, F. Y. L. ; Chrobak, M. ; Fung, S. P. Y. ; Jawor, W. ; Lavi, R. ; Sgall, Jiří ; Tichý, Tomáš
Document type: Research reports
Year: 2003
Language: eng
Abstract: We study an online buffer management problem for networks supporting Quality-of-Service (QoS) applications, equivalently as an online scheduling problem forunit-length jobs, where each job is specified by its release time, deadline, and a nonnegative weight (QoS value). The goal is to maximize the emph{weighted throughput}, that is the total weight of scheduled jobs.
Keywords: quality-of-service applications; scheduling problem
Project no.: CEZ:AV0Z1019905 (CEP), CEZ:AV0Z1019905 (CEP), LN00A056 (CEP), ME 476, GA201/01/1195 (CEP), IAA1019401 (CEP)
Funding provider: GA MŠk, GA MŠk, GA ČR, GA AV ČR

Institution: Institute of Mathematics AS ČR (web)
Document availability information: Fulltext is available at the institute of the Academy of Sciences.
Original record: http://hdl.handle.net/11104/0072430

Permalink: http://www.nusl.cz/ntk/nusl-26045


The record appears in these collections:
Research > Institutes ASCR > Institute of Mathematics
Reports > Research reports