Adversarial queueing model for continuous network dynamics

In this paper we start the study of generalizing the Adversarial Queueing Theory (AQT) model towards a continuous scenario in which the usually assumed synchronicity of the evolution is not required anymore. We consider a model, named "continuous AQT" (CAQT), in which packets can have arbi...

Descripción completa

Detalles Bibliográficos
Autores: Blesa Aguilera, Maria Josep|||0000-0001-8246-9926, Calzada, Daniel, Fernández Anta, Antonio, López, Luís, Martínez Fernández, Andrés, Santos, Agustín, Serna Iglesias, María José|||0000-0001-9729-8648
Tipo de recurso: informe técnico
Fecha de publicación:2005
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/84188
Acceso en línea:https://hdl.handle.net/2117/84188
Access Level:acceso abierto
Palabra clave:Adversarial Queueing Theory (AQT)
Packet delays
Protocols
Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica
Descripción
Sumario:In this paper we start the study of generalizing the Adversarial Queueing Theory (AQT) model towards a continuous scenario in which the usually assumed synchronicity of the evolution is not required anymore. We consider a model, named "continuous AQT" (CAQT), in which packets can have arbitrary (not null and not infinite) lengths, and the network links may have different speeds (or bandwidths) and propagation delays. We show that, in such a general model, having bounded queues implies bounded end-to-end packet delays and vice versa. From the network point of view, we show that networks with directed acyclic topologies are universally stable, i.e., stable independently of the protocols and the traffic patterns used in it, and that this even holds for traffic patterns that make links to be fully loaded. Concerning packet scheduling protocols, we show that the well-known LIS, SIS, FTG and NTS protocols remain universally stable in our model. We also show that the CAQT model is strictly stronger than the AQT model by presenting scheduling policies that are unstable under the former while they are universally stable under the latter.