Deciding stability under FIFO in the adversarial queuing model in polynomial time
In spite of the importance of the FIFO protocol and the research efforts invested in obtaining results for it, deciding whether a given network is stable under FIFO was still an open question. In this work, we address the general case of this problem and try to characterize the property of stability...
| Autor: | |
|---|---|
| Tipo de recurso: | informe técnico |
| Fecha de publicación: | 2005 |
| 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/84113 |
| Acceso en línea: | https://hdl.handle.net/2117/84113 |
| Access Level: | acceso abierto |
| Palabra clave: | FIFO Network topologies Polynomial time Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica |
| Sumario: | In spite of the importance of the FIFO protocol and the research efforts invested in obtaining results for it, deciding whether a given network is stable under FIFO was still an open question. In this work, we address the general case of this problem and try to characterize the property of stability under FIFO in terms of network topologies. We show that this property is decidable in polynomial time. |
|---|