Result: On-line stream merging in a general setting
Title:
On-line stream merging in a general setting
Authors:
Source:
Computing and combinatorics (COCOON 2001), Guilin, China, August 20-23, 2001Theoretical computer science. 296(1):27-46
Publisher Information:
Amsterdam: Elsevier, 2003.
Publication Year:
2003
Physical Description:
print, 18 ref
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Informatique théorique, Theoretical computing, Algorithmique. Calculabilité. Arithmétique ordinateur, Algorithmics. Computability. Computer arithmetics, Logiciel, Software, Performances des systèmes informatiques. Fiabilité, Computer systems performance. Reliability, Algorithme compétitif, Competitive algorithms, Algorithme optimal, Optimal algorithm, Algoritmo óptimo, Analyse algorithme, Algorithm analysis, Análisis algoritmo, Arbre binaire, Binary tree, Arbol binario, Informatique théorique, Computer theory, Informática teórica, Largeur bande, Bandwidth, Anchura banda, Modèle client serveur, Client server model, Modelo cliente servidor, Ordonnancement, Scheduling, Ordonamiento, Traitement en ligne, On line processing, Tratamiento en línea, Vidéo à la demande, Video on demand, Video a petición
Document Type:
Conference
Conference Paper
File Description:
text
Language:
English
Author Affiliations:
Department of Computer Science, University of Hong Kong, Pokfulam Road, Hong-Kong
ISSN:
0304-3975
Rights:
Copyright 2003 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems
Accession Number:
edscal.14570824
Database:
PASCAL Archive
Further Information
This paper is concerned with on-line scheduling algorithms for merging streams in a video-on-demand system so as to minimize the server bandwidth. We present the first algorithm that has a constant competitive factor (precisely, 5). Our algorithm, unlike previous ones, is not limited to the scenario where clients are equipped with large buffer and client receiving bandwidth. It remains 5-competitive in all settings of buffer size and receiving bandwidth. Technically speaking, our algorithm is based on a novel observation that the behavior of any schedule can be modeled by a rectilinear (binary) tree on a grid. This observation eases the analysis of our algorithm as well as the optimal algorithm.