BIB-VERSION:: CS-TR-v2.0
          ID:: STAN//CS-TN-97-59
       ENTRY:: September 18, 1997
ORGANIZATION:: Stanford University, Department of Computer Science
       TITLE:: Stability of Networks and Protocols in the Adversarial Queueing
               Model for Packet Routing
        TYPE:: Technical Note
      AUTHOR:: Goel, Ashish
        DATE:: September 1997
       PAGES:: 10
    ABSTRACT:: The adversarial queueing theory model for packet routing was
               suggested by Borodin et al. We give a complete and simple
               characterization of all networks that are universally stable
               in this model. We show that a specific greedy protocol, SIS
               (Shortest In System), is stable against a large class of
               stochastic adversaries. New applications such as multicast
               packet scheduling and job scheduling with precedence
               constraints xsare suggested for the adversarial model.
       NOTES:: [Adminitrivia V1/Prg/19970918]
         END:: STAN//CS-TN-97-59