Adversarial Queueing Model for Continuous Network Dynamics
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 have different speeds (or bandwidths) and propagation delays. With respect to the standard aqt model, these new features turn out to be significant for the stability of packet scheduling policies that take them into account, but not so much for the stability of networks.
From the network point of view, we show that networks with directed acyclic topologies are universally stable, i.e., stable independently of the scheduling policies and traffic patterns used in it. Interestingly enough, this even holds for traffic patterns that make links to be fully loaded. Finally, it turns out that the set of universally stable networks remains the same as in the aqt model and, therefore, the property of universal stability of networks is decidable in polynomial time.
Concerning packet scheduling policies, we show that the well-known lis, sis, ftgand nfsscheduling policies remain universally stable in the caqt model. We introduce other scheduling policies that, although being universally stable in the aqt model, they are unstable under the caqt model.
KeywordsAdversarial queueing theory Packet-switched networks Stability of networks Stability of queueing policies
Unable to display preview. Download preview PDF.
- 2.Àlvarez, C., Blesa, M., Serna, M.: The impact of failure management on the stability of communication networks. In: 10th International Conference on Parallel and Distributed Systems, pp. 153–160. IEEE Computer Society Press, Los Alamitos (2004) 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
- 6.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
- 9.Borodin, A., Ostrovsky, R., Rabani, Y.: Stability preserving transformations: Packet routing networks with edge capacities and speeds. In: 12th Annual ACM-SIAM Symposium on Discrete Algorithms (soda’01), pp. 601–610 (2001). Full version in  Google Scholar
- 13.Koukopoulos, D., Mavronicolas, M., Spirakis, P.: Instability of networks with quasi-static link capacities. In: 10th International Colloquium on Structural Information Complexity. Proceedings in Informatics, vol. 17, pp. 179–194. Carleton Scientific (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
- 16.Weinard, M.: The necessity of timekeeping in adversarial queueing. In: 4th International Workshop on Efficient and Experimental Algorithms, LNCS, vol. 3503, pp. 440–451. Springer, Berlin (2005) Google Scholar