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.
The research of the first author was partially supported by an NSF CAREER Award and an IBM Faculty partnership award. The research of the second author was partially supported by a Fellowship from the Singapore-MIT Alliance Program.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network flows: theory, algorithms, and applications. Prentice Hall, Englewood Cliffs (1993)
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)
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)
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)
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)
Awerbuch, B., Berenbrink, P., Brinkmann, A., Scheideler, C.: Simple Routing Strategies for Adversarial Systems. In: Proceedings of the 42nd FOCS, pp. 158–167 (2001)
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)
Bertsimas, D., Sethuraman, J.: From fluid relaxations to practical algorithms for job shop scheduling: the makespan objective. Mathematical Programming 92(1), 61–102 (2002)
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)
Cruz, R.: A Calculus for network delay, part II: network analysis. IEEE Transactions on Information Theory 37, 132–141 (1991)
Fiala, T.: KozelÃto algorithmus a három gép problémára. Alkalmazott Matematikai Lapok 3, 389–398 (1977)
Gamarnik, D.: Stability of Adaptive and Non-Adaptive Packet Routing Policies in Adversarial Queueing Networks. In: Proceedings of 31st STOC (1999)
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)
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 SSSR
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)
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–780
Sevastyanov, S.V.: On some geometric methods in scheduling theory: a survey. Discrete Applied Mathematics 55, 59–82 (1994)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sethuraman, J., Teo, CP. (2003). Effective Routing and Scheduling in Adversarial Queueing Networks. In: Arora, S., Jansen, K., Rolim, J.D.P., Sahai, A. (eds) Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques. RANDOM APPROX 2003 2003. Lecture Notes in Computer Science, vol 2764. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45198-3_14
Download citation
DOI: https://doi.org/10.1007/978-3-540-45198-3_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40770-6
Online ISBN: 978-3-540-45198-3
eBook Packages: Springer Book Archive