Show simple item record

dc.contributor.authorÁlvarez Faura, M. del Carme
dc.contributor.authorDíaz Cort, Josep
dc.contributor.authorBlesa Aguilera, Maria Josep
dc.contributor.authorFernández Anta, Antonio
dc.contributor.authorSerna Iglesias, María José
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament de Ciències de la Computació
dc.identifier.citationAlvarez, C., Diaz, J., Blesa, M., Fernández, A., Serna, M. "Adversarial models for priority-based networks". 2003.
dc.description.abstractWe propose several variations of the adversarial queueing model. The priority model takes into account the case in which the packets can have different priorities, assigned by the adversary at injection time. The variable priority model is an extension of the priority model in which the adversary may change the priority of packets at each time step. The failure and reliable models are designed to cope with dynamic networks in which the adversary controls, under different constraints, the edge failures. We address stability issues in the proposed adversarial models. We show that the set of universally stable networks in the adversarial model remains the same in the priority, variable priority, failure and reliable models. From the point of view of queueing policies we show that several queueing policies that are universally stable in the adversarial model remain so in the priority, failure and reliable models. However, we show that LIS, a universally stable queueing policy in the adversarial model, is not universally stable in any of the other models. Moreover, we show that no greedy queueing policy is universally stable in the variable priority model. Finally we analyze the problem of deciding stability of a given network under a fixed protocol. We provide a characterization of the networks that are stable under FIFO and LIS in the failure model (and therefore in the reliable and priority models). This characterization allows us to show that the stability problem under FIFO and LIS in the failure model can be solved in polynomial time.
dc.format.extent17 p.
dc.subjectÀrees temàtiques de la UPC::Informàtica::Informàtica teòrica
dc.subject.otherAdversarial queueing model
dc.subject.otherPriority model
dc.subject.otherQueueing policies
dc.subject.otherPriority-based networks stability
dc.subject.otherAdversarial queueing theory
dc.subject.otherContention-resolution protocols
dc.subject.otherPacket-switched networks
dc.titleAdversarial models for priority-based networks
dc.typeExternal research report
dc.rights.accessOpen Access
dc.description.versionPostprint (published version)
upcommons.citation.authorAlvarez, C., Diaz, J., Blesa, M., Fernández, A., Serna, M.

Files in this item


This item appears in the following Collection(s)

Show simple item record

All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder