Deciding stability under FIFO in the adversarial queuing model in polynomial time

All of RECERCAT

To access the full text documents, please follow this link: http://hdl.handle.net/2117/84113

Title:	Deciding stability under FIFO in the adversarial queuing model in polynomial time
Author:	Blesa Aguilera, Maria Josep
Other authors:	Universitat Politècnica de Catalunya. Departament de Llenguatges i Sistemes Informàtics; Universitat Politècnica de Catalunya. ALBCOM - Algorismia, Bioinformàtica, Complexitat i Mètodes Formals
Abstract:	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.
Subject(s):	-Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica -FIFO -Network topologies -Polynomial time
Rights:
Document type:	Article - Published version Report
Share: