Universal stability of undirected graphs in the adversarial queueing model

In this paper we study the universal stability of undirected graphs in the adversarial queueing model for packet routing. In this setting packets must be injected in some edge and have to traverse a path before leaving the system. Restrictions on the allowed types of path that packets must traverse...

Descripción completa

Detalles Bibliográficos
Autores: Álvarez Faura, M. del Carme|||0000-0003-2352-0546, Serna Iglesias, María José|||0000-0001-9729-8648, Blesa Aguilera, Maria Josep|||0000-0001-8246-9926
Tipo de recurso: informe técnico
Fecha de publicación:2002
País:España
Institución:Universitat Politècnica de Catalunya (UPC)
Repositorio:UPCommons. Portal del coneixement obert de la UPC
Idioma:inglés
OAI Identifier:oai:upcommons.upc.edu:2117/97553
Acceso en línea:https://hdl.handle.net/2117/97553
Access Level:acceso abierto
Palabra clave:Stability
Undirected graphs
Adversarial queueing model
Packet routing
Àrees temàtiques de la UPC::Informàtica
id ES_5a470fce2e48620ff3cf05efce685c61
oai_identifier_str oai:upcommons.upc.edu:2117/97553
network_acronym_str ES
network_name_str España
repository_id_str
spelling Universal stability of undirected graphs in the adversarial queueing modelÁlvarez Faura, M. del Carme|||0000-0003-2352-0546Serna Iglesias, María José|||0000-0001-9729-8648Blesa Aguilera, Maria Josep|||0000-0001-8246-9926StabilityUndirected graphsAdversarial queueing modelPacket routingÀrees temàtiques de la UPC::InformàticaIn this paper we study the universal stability of undirected graphs in the adversarial queueing model for packet routing. In this setting packets must be injected in some edge and have to traverse a path before leaving the system. Restrictions on the allowed types of path that packets must traverse provide different packet models. We consider three natural models, and provide polynomial time algorithms for testing universal stability. In the three cases we obtain a different characterization, thus showing that slight variations gives raise to non equivalent models. We finally extend the results to show that the universal stability of digraphs, in the case in which packets follow directed paths without repeated vertices, can be decided in polynomial time.20022002-03-0120162016-11-30reporthttp://purl.org/coar/resource_type/c_93fcVoRhttp://purl.org/coar/version/c_970fb48d4fbd8a85info:eu-repo/semantics/reportapplication/postscripthttps://hdl.handle.net/2117/97553reponame:UPCommons. Portal del coneixement obert de la UPCinstname:Universitat Politècnica de Catalunya (UPC)Inglésengopen accesshttp://purl.org/coar/access_right/c_abf2info:eu-repo/semantics/openAccessoai:upcommons.upc.edu:2117/975532026-05-27T15:37:01Z
dc.title.none.fl_str_mv Universal stability of undirected graphs in the adversarial queueing model
title Universal stability of undirected graphs in the adversarial queueing model
spellingShingle Universal stability of undirected graphs in the adversarial queueing model
Álvarez Faura, M. del Carme|||0000-0003-2352-0546
Stability
Undirected graphs
Adversarial queueing model
Packet routing
Àrees temàtiques de la UPC::Informàtica
title_short Universal stability of undirected graphs in the adversarial queueing model
title_full Universal stability of undirected graphs in the adversarial queueing model
title_fullStr Universal stability of undirected graphs in the adversarial queueing model
title_full_unstemmed Universal stability of undirected graphs in the adversarial queueing model
title_sort Universal stability of undirected graphs in the adversarial queueing model
dc.creator.none.fl_str_mv Álvarez Faura, M. del Carme|||0000-0003-2352-0546
Serna Iglesias, María José|||0000-0001-9729-8648
Blesa Aguilera, Maria Josep|||0000-0001-8246-9926
author Álvarez Faura, M. del Carme|||0000-0003-2352-0546
author_facet Álvarez Faura, M. del Carme|||0000-0003-2352-0546
Serna Iglesias, María José|||0000-0001-9729-8648
Blesa Aguilera, Maria Josep|||0000-0001-8246-9926
author_role author
author2 Serna Iglesias, María José|||0000-0001-9729-8648
Blesa Aguilera, Maria Josep|||0000-0001-8246-9926
author2_role author
author
dc.subject.none.fl_str_mv Stability
Undirected graphs
Adversarial queueing model
Packet routing
Àrees temàtiques de la UPC::Informàtica
topic Stability
Undirected graphs
Adversarial queueing model
Packet routing
Àrees temàtiques de la UPC::Informàtica
description In this paper we study the universal stability of undirected graphs in the adversarial queueing model for packet routing. In this setting packets must be injected in some edge and have to traverse a path before leaving the system. Restrictions on the allowed types of path that packets must traverse provide different packet models. We consider three natural models, and provide polynomial time algorithms for testing universal stability. In the three cases we obtain a different characterization, thus showing that slight variations gives raise to non equivalent models. We finally extend the results to show that the universal stability of digraphs, in the case in which packets follow directed paths without repeated vertices, can be decided in polynomial time.
publishDate 2002
dc.date.none.fl_str_mv 2002
2002-03-01
2016
2016-11-30
dc.type.none.fl_str_mv report
http://purl.org/coar/resource_type/c_93fc
VoR
http://purl.org/coar/version/c_970fb48d4fbd8a85
dc.type.openaire.fl_str_mv info:eu-repo/semantics/report
format report
dc.identifier.none.fl_str_mv https://hdl.handle.net/2117/97553
url https://hdl.handle.net/2117/97553
dc.language.none.fl_str_mv Inglés
eng
language_invalid_str_mv Inglés
language eng
dc.rights.none.fl_str_mv open access
http://purl.org/coar/access_right/c_abf2
dc.rights.openaire.fl_str_mv info:eu-repo/semantics/openAccess
rights_invalid_str_mv open access
http://purl.org/coar/access_right/c_abf2
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/postscript
dc.source.none.fl_str_mv reponame:UPCommons. Portal del coneixement obert de la UPC
instname:Universitat Politècnica de Catalunya (UPC)
instname_str Universitat Politècnica de Catalunya (UPC)
reponame_str UPCommons. Portal del coneixement obert de la UPC
collection UPCommons. Portal del coneixement obert de la UPC
repository.name.fl_str_mv
repository.mail.fl_str_mv
_version_ 1869408685147553793
score 15,300719

Similares en LA Referencia