A Characterization of universal stability for directed graphs in the adversarial queueing model
In this paper we provide a characterization of universal stability for digraphs in the general case that the packets are not restricted to follow simple paths. Furthermore, we consider a variation of the Nearest To Go protocol and we show that stability under this queueing policy is equivalent to un...
| Autores: | , , |
|---|---|
| Tipo de recurso: | informe técnico |
| Fecha de publicación: | 2002 |
| País: | España |
| Institución: | Universitat Politècnica de Catalunya (UPC) |
| Repositorio: | UPCommons. Portal del coneixement obert de la UPC |
| Idioma: | inglés |
| OAI Identifier: | oai:upcommons.upc.edu:2117/96840 |
| Acceso en línea: | https://hdl.handle.net/2117/96840 |
| Access Level: | acceso abierto |
| Palabra clave: | Universal stability Nearest To Go protocol Directed graphs Adversarial queueing model Àrees temàtiques de la UPC::Informàtica |
| Sumario: | In this paper we provide a characterization of universal stability for digraphs in the general case that the packets are not restricted to follow simple paths. Furthermore, we consider a variation of the Nearest To Go protocol and we show that stability under this queueing policy is equivalent to universal stability. |
|---|