direkt zum Inhalt springen

direkt zum Hauptnavigationsmenü

Sie sind hier

TU Berlin

Inhalt des Dokuments

Preprints

Throughput maximization for periodic packet scheduling
Zitatschlüssel Report-013-2010
Autor Britta Peis and Andreas Wiese
Jahr 2010
Nummer 013
Institution Technische Universität Berlin, Institut für Mathematik
Zusammenfassung In the periodic packet routing problem a number of tasks periodically create packets which have to be transported through a network. Due to capacity constraints on the edges, it might not be possible to find a schedule which delivers all packets of all tasks in a feasible way. In this case one aims to find a feasible schedule for as many tasks as possible, or, if weights on the tasks are given, for a subset of tasks of maximal weight. In this paper we investigate this problem on trees and grids with row-column paths. We distinguish between direct schedules (i.e., schedules in which each packet is delayed only in its start vertex) and not necessarily direct schedules. For these settings we present constant factor approximation algorithms, separately for the weighted and the cardinality case. Abstract. Our results combine discrete optimization with real-time scheduling. We use new techniques which are specially designed for our problem as well as novel adaptions of existing methods.
Typ der Publikation Preprint
Link zur Publikation Download Bibtex Eintrag