Ir al contenido (pulsa Retorno)

Universitat Politècnica de Catalunya

    • Català
    • Castellano
    • English
    • LoginRegisterLog in (no UPC users)
  • mailContact Us
  • world English 
    • Català
    • Castellano
    • English
  • userLogin   
      LoginRegisterLog in (no UPC users)

UPCommons. Global access to UPC knowledge

Banner header
60.662 UPC E-Prints
You are here:
View Item 
  •   DSpace Home
  • E-prints
  • Departaments
  • Departament de Ciències de la Computació
  • Reports de recerca
  • View Item
  •   DSpace Home
  • E-prints
  • Departaments
  • Departament de Ciències de la Computació
  • Reports de recerca
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Adversarial models for priority-based networks

Thumbnail
View/Open
R03-25.ps (309,8Kb)
Share:
 
  View Usage Statistics
Cita com:
hdl:2117/97323

Show full item record
Álvarez Faura, M. del CarmeMés informacióMés informacióMés informació
Díaz Cort, JosepMés informacióMés informacióMés informació
Blesa Aguilera, Maria JosepMés informacióMés informacióMés informació
Fernández Anta, Antonio
Serna Iglesias, María JoséMés informacióMés informacióMés informació
Document typeResearch report
Defense date2003-06
Rights accessOpen Access
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
Abstract
We 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.
CitationAlvarez, C., Diaz, J., Blesa, M., Fernández, A., Serna, M. "Adversarial models for priority-based networks". 2003. 
Is part ofLSI-03-25-R
URIhttp://hdl.handle.net/2117/97323
Collections
  • Departament de Ciències de la Computació - Reports de recerca [1.107]
Share:
 
  View Usage Statistics

Show full item record

FilesDescriptionSizeFormatView
R03-25.ps309,8KbPostscriptView/Open

Browse

This CollectionBy Issue DateAuthorsOther contributionsTitlesSubjectsThis repositoryCommunities & CollectionsBy Issue DateAuthorsOther contributionsTitlesSubjects

© UPC Obrir en finestra nova . Servei de Biblioteques, Publicacions i Arxius

info.biblioteques@upc.edu

  • About This Repository
  • Contact Us
  • Send Feedback
  • Privacy Settings
  • Inici de la pàgina