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 arbitrary 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 nfs 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.
Unable to display preview. Download preview PDF.
- 1.Blesa, M., Calzada, D., Fernández, A., López, L., Martínez, A., Santos, A., Serna, M.: Adversarial queueing model for continuous network dynamics. Research Report LSI-05-10-R, Dept. Llenguatges i Sistemes Informàtics, UPC (2005)Google Scholar
- 4.Awerbuch, B., Berenbrink, P., Brinkmann, A., Scheideler, C.: Simple routing strategies for adversarial systems. In: 42th. IEEE Symposium on Foundations of Computer Science, pp. 158–167. IEEE Computer Society Press, Los Alamitos (2001)Google Scholar
- 5.Anshelevich, E., Kempe, D., Kleinberg, J.: Stability of load balancing algorithms in dynamic adversarial systems. In: 34th. Annual ACM Symposium on Theory of Computing, pp. 399–406. ACM Press, New York (2002)Google Scholar
- 9.Koukopoulos, D., Mavronicolas, M., Spirakis, P.: Instability of networks with quasi-static link capacities. In: 10th Internaltional Colloquium on Structural Information Complexity. Proceedings in Informatics, vol. 17, pp. 179–194. Carleton Scientific, Ottawa (2003)Google Scholar
- 15.Rosén, A., Tsirkin, M.: On delivery times in packet networks under adversarial traffic. In: 16th ACM Symposium on Parallel Algorithms and Architectures, pp. 1–10. ACM Press, New York (2004)Google Scholar