Mostra el registre d'ítem simple

dc.contributor.authorBlesa Aguilera, Maria Josep
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament de Llenguatges i Sistemes Informàtics
dc.date.accessioned2016-03-10T10:02:16Z
dc.date.available2016-03-10T10:02:16Z
dc.date.issued2005-05
dc.identifier.citationBlesa, M. "Deciding stability under FIFO in the adversarial queuing model in polynomial time". 2005.
dc.identifier.urihttp://hdl.handle.net/2117/84113
dc.description.abstractIn 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.
dc.format.extent25 p.
dc.language.isoeng
dc.relation.ispartofseriesLSI-05-3-R
dc.subjectÀrees temàtiques de la UPC::Informàtica::Informàtica teòrica
dc.subject.otherFIFO
dc.subject.otherNetwork topologies
dc.subject.otherPolynomial time
dc.titleDeciding stability under FIFO in the adversarial queuing model in polynomial time
dc.typeExternal research report
dc.contributor.groupUniversitat Politècnica de Catalunya. ALBCOM - Algorismia, Bioinformàtica, Complexitat i Mètodes Formals
dc.rights.accessOpen Access
local.identifier.drac1904658
dc.description.versionPostprint (published version)
local.citation.authorBlesa, M.


Fitxers d'aquest items

Thumbnail

Aquest ítem apareix a les col·leccions següents

Mostra el registre d'ítem simple