Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques

Volume 2764 of the series Lecture Notes in Computer Science pp 153-164

Effective Routing and Scheduling in Adversarial Queueing Networks

  • Jay SethuramanAffiliated withIEOR Department, Columbia University
  • , Chung-Piaw TeoAffiliated withDepartment of Decision Sciences, National University of Singapore

* Final gross prices may vary according to local VAT.

Get Access


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.