An Adversarial Queueing Model for Online Server Routing
3,00 €
Area 09 – Ingegneria industriale e dell'informazione
Tweet
SINTESI
We propose a new model for online server routing, based on adversarial queueing theory [3]. The model addresses questions such as whether a server routing algorithm is stable, i.e., it is such that the number of unserved requests in the system remains bounded at any time, or whether the algorithm has bounded flow time, i.e., it is such that every request remains in the system for a bounded amount of time. We consider a number of natural algorithms in this model and we analyze their stability and performance.
| pagine: | 20 |
| formato: | 17 x 24 |
| ISBN: | 978-88-548-0975-8 |
| data pubblicazione: | Febbraio 2007 |
| marchio editoriale: | Aracne |
| collana: | Dipartimento di Informatica e Sistemistica “Antonio Ruberti” della “Sapienza” Università di Roma | 2006/7 |
SINTESI
