Mostrar el registro sencillo del ítem

Stability bounds in networks with dynamic link capacities

dc.contributor.authorCholvi, Vicent
dc.date.accessioned2012-05-28T14:36:38Z
dc.date.available2012-05-28T14:36:38Z
dc.date.issued2008
dc.identifierhttp://dx.doi.org/10.1016/j.ipl.2008.09.020
dc.identifier.citationInformation Processing Letters, 109, 2, p. 151-154
dc.identifier.issn200190
dc.identifier.urihttp://hdl.handle.net/10234/38978
dc.description.abstractWe address the problem of stability in networks where the link capacities can change dynamically. We show that every network running a greedy scheduling policy is universally stable at any injection rate r < 1 / (C d), where d is the largest number of links crossed by any packet and C is the maximum link capacity. We also show that system-wide time priority scheduling policies are universally stable at any injection rate r < 1 / (C (d - 1)). © 2008 Elsevier B.V. All rights reserved.
dc.language.isoeng
dc.publisherElsevier
dc.rights.urihttp://rightsstatements.org/vocab/CNE/1.0/*
dc.subjectAdversarial queueing theory
dc.subjectGreedy scheduling protocols
dc.subjectInterconnection networks
dc.subjectNetwork stability
dc.subjectPacket switched networks
dc.subjectPerformance evaluation
dc.titleStability bounds in networks with dynamic link capacities
dc.typeinfo:eu-repo/semantics/article
dc.identifier.doihttp://dx.doi.org/10.1016/j.ipl.2008.09.020
dc.rights.accessRightsinfo:eu-repo/semantics/restrictedAccess


Ficheros en el ítem

FicherosTamañoFormatoVer

No hay ficheros asociados a este ítem.

Este ítem aparece en la(s) siguiente(s) colección(ones)

  • LSI_Articles [361]
    Articles de publicacions periòdiques escrits per professors del Departament de Llenguatges i Sistemes Informàtics

Publisher version

Mostrar el registro sencillo del ítem