Effective Routing and Scheduling in Adversarial Queueing Networks

  • Jay Sethuraman
  • Chung-Piaw Teo
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2764)

Abstract

Scheduling and packet-routing have emerged as important problems in modern computer and communication systems. In this paper, we consider such problems in the setting of an arbitrary synchronous, adversarial network. In an adversarial network, the nature of the incoming traffic is decided by an adversary, operating under a reasonable rate restriction. Such networks have attracted attention in recent years as they appear to be a convenient and useful way to model packet injections into a communication network; in addition, these networks inspire algorithm developers to design robust algorithms that provide a performance guarantee regardless of the nature of the incoming traffic. Thus, the adversarial input model provides a valuable, complementary point of view to that of the more traditional stochastic model.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network flows: theory, algorithms, and applications. Prentice Hall, Englewood Cliffs (1993)Google Scholar
  2. 2.
    Aiello, W., Kushilevitz, E., Ostrovsky, R., Rosen, A.: Adaptive Packet Routing for Bursty Adversarial Traffic. Journal of Computer and System Sciences 60, 482–509 (2000); Preliminary version in Proceedings of the 30th STOC, pp. 359–368 (1998)Google Scholar
  3. 3.
    Andrews, M., Awerbuch, B., Fernandez, A., Kleinberg, J., Leighton, T., Liu, Z.: Universal-stability results for greedy contention-resolution protocols. In: Proceedings of the 37th FOCS, pp. 380–389 (1996)Google Scholar
  4. 4.
    Andrews, M., Awerbuch, B., Fernandez, A., Leighton, F.T., Liu, Z., Kleinberg, J.: Universal-stability results and performance bounds for greedy contention resolution protocols. Journal of the ACM 48(1), 39–69 (2001)CrossRefMathSciNetGoogle Scholar
  5. 5.
    Andrews, M., Fernandez, A., Goel, A., Zhang, L.: Source Routing and Scheduling in Packet Networks. In: Proceedings of the 42nd FOCS, pp. 168–177 (2001)Google Scholar
  6. 6.
    Awerbuch, B., Berenbrink, P., Brinkmann, A., Scheideler, C.: Simple Routing Strategies for Adversarial Systems. In: Proceedings of the 42nd FOCS, pp. 158–167 (2001)Google Scholar
  7. 7.
    Belov, I.S., Stolin, Y.N.: An algorithm in a single path operations scheduling problem. Mathematical Economics and Functional Analysis, 248–257 (1974) (in Russian)Google Scholar
  8. 8.
    Bertsimas, D., Sethuraman, J.: From fluid relaxations to practical algorithms for job shop scheduling: the makespan objective. Mathematical Programming 92(1), 61–102 (2002)MATHCrossRefMathSciNetGoogle Scholar
  9. 9.
    Borodin, A., Kleinberg, J., Raghavan, P., Sudan, M., Williamson, D.P.: Adversarial Queueing Theory. Journal of the ACM 48(1), 13–38 (2001); Preliminary version in Proceedings of the 28th STOC, 376–385 (1996)CrossRefMathSciNetGoogle Scholar
  10. 10.
    Cruz, R.: A Calculus for network delay, part II: network analysis. IEEE Transactions on Information Theory 37, 132–141 (1991)MATHCrossRefMathSciNetGoogle Scholar
  11. 11.
    Fiala, T.: Kozelíto algorithmus a három gép problémára. Alkalmazott Matematikai Lapok 3, 389–398 (1977)MATHMathSciNetGoogle Scholar
  12. 12.
    Gamarnik, D.: Stability of Adaptive and Non-Adaptive Packet Routing Policies in Adversarial Queueing Networks. In: Proceedings of 31st STOC (1999)Google Scholar
  13. 13.
    Karp, R.M., Leighton, F.T., Rivest, R.L., Thompson, C.D., Vazirani, U.V., Vazirani, V.V.: Global Wire Routing in Two-Dimensional Arrays. Algorithmica 2, 113–129 (1987)MATHCrossRefMathSciNetGoogle Scholar
  14. 14.
    Sevastyanov, S.V.: On an asymptotic approach to some problems in scheduling theory. In: Abstracts of papers at 3rd All-Union Conference of Problems of Theoretical Cybernetics, Novosibirsk, pp. 67–69 (1974); Inst. Mat. Sibirsk. Otdel. Akad. Nauk SSSRGoogle Scholar
  15. 15.
    Sevastyanov, S.V.: Efficient construction of schedules close to optimal for the cases of arbitrary and alternative routes of parts. Soviet Math. Dokl. 29(3), 447–450 (1984)Google Scholar
  16. 16.
    Sevastyanov, S.V.: Bounding algorithm for the routing problem with arbitrary paths and alternative servers. Kibernetika 22(6), 74–79 (1986); Translation in Cybernetics 22, 773–780Google Scholar
  17. 17.
    Sevastyanov, S.V.: On some geometric methods in scheduling theory: a survey. Discrete Applied Mathematics 55, 59–82 (1994)CrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Jay Sethuraman
    • 1
  • Chung-Piaw Teo
    • 2
  1. 1.IEOR DepartmentColumbia UniversityNew YorkUSA
  2. 2.Department of Decision SciencesNational University of SingaporeSingapore

Personalised recommendations