Daniel Calzada

Learn More
In this paper we initiate the generalization of the Adversarial Queueing Theory (aqt) model to capture the dynamics of continuous scenarios in which the usually assumed synchronicity of the evolution is not required anymore. We propose an asynchronous model, named continuous aqt (caqt), in which packets can have arbitrary lengths, and the network links may(More)
In this paper we initiate the generalization of the Adversarial Queueing Theory (aqt) model to capture the dynamics of continuous scenarios in which the usually assumed synchronicity of the evolution is not required anymore. We propose an asynchronous model, named continuous aqt (caqt), in which packets can have arbitrary lengths, and the network links may(More)
In this paper we start the study of generalization of the Adversarial Queueing Theory model with initial results. We first show that having bounded queues implies bounded packet end-to-end delays and viceversa. Then, we show that networks with a directed acyclic graph topology are always stable (queue sizes are bounded) even if the links are fully loaded.
  • 1