Theory of Computing Systems

, Volume 44, Issue 3, pp 304–331 | Cite as

Adversarial Queueing Model for Continuous Network Dynamics

  • Maria Blesa
  • Daniel Calzada
  • Antonio Fernández
  • Luis López
  • Andrés L. Martínez
  • Agustín Santos
  • Maria Serna
  • Christopher Thraves
Article

Abstract

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 continuousaqt (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.

Keywords

Adversarial queueing theory Packet-switched networks Stability of networks Stability of queueing policies 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Àlvarez, C., Blesa, M., Serna, M.: A characterization of universal stability in the adversarial queueing model. SIAM J. Comput. 34, 41–66 (2004) MATHCrossRefMathSciNetGoogle Scholar
  2. 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
  3. 3.
    Àlvarez, C., Blesa, M., Díaz, J., Fernández, A., Serna, M.: Adversarial models for priority-based networks. Networks 45, 23–35 (2005) MATHCrossRefMathSciNetGoogle Scholar
  4. 4.
    Andrews, M., Awerbuch, B., Fernández, A., Kleinberg, J., Leighton, T., Liu, Z.: Universal stability results for greedy contention–resolution protocols. J. ACM 48, 39–69 (2001) CrossRefMathSciNetGoogle Scholar
  5. 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. 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
  7. 7.
    Bhattacharjee, R., Goel, A., Lotker, Z.: Instability of FIFO at arbitrarily low rates in the adversarial queueing model. SIAM J. Comput. 34, 318–332 (2004) MATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    Borodin, A., Kleinberg, J., Raghavan, P., Sudan, M., Williamson, D.: Adversarial queueing theory. J. ACM 48, 13–38 (2001) CrossRefMathSciNetGoogle Scholar
  9. 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 [10] Google Scholar
  10. 10.
    Borodin, A., Ostrovsky, R., Rabani, Y.: Stability preserving transformations: packet routing networks with edge capacities and speeds. J. Interconnect. Netw. 5(1), 1–12 (2004) CrossRefGoogle Scholar
  11. 11.
    Cruz, R.: A calculus for network delay. Part I (network elements in isolation) and II (network analysis). IEEE Trans. Inform. Theory 37, 114–141 (1991) MATHCrossRefMathSciNetGoogle Scholar
  12. 12.
    Echagüe, J., Cholvi, V., Fernández, A.: Universal stability results for low rate adversaries in packet switched networks. IEEE Commun. Lett. 7, 578–580 (2003) CrossRefGoogle Scholar
  13. 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
  14. 14.
    Koukopoulos, D., Mavronicolas, M., Spirakis, P.: Performance and stability bounds for dynamic networks. In: 7th International Conference on Parallel Architectures, Algorithms and Networks, pp. 239–246. IEEE Computer Society Press, Los Alamitos (2004) CrossRefGoogle Scholar
  15. 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. 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

Copyright information

© Springer Science+Business Media, LLC 2007

Authors and Affiliations

  • Maria Blesa
    • 1
  • Daniel Calzada
    • 2
  • Antonio Fernández
    • 3
  • Luis López
    • 3
  • Andrés L. Martínez
    • 3
  • Agustín Santos
    • 3
  • Maria Serna
    • 1
  • Christopher Thraves
    • 4
  1. 1.ALBCOM, LSIUniversitat Politècnica de CatalunyaBarcelonaSpain
  2. 2.ATC, EUIUniversidad Politécnica de MadridMadridSpain
  3. 3.LADyR, GSyCESCET, Universidad Rey Juan CarlosMadridSpain
  4. 4.DIMUniversidad de ChileSantiagoChile

Personalised recommendations