登入選單

返回Google圖書搜尋

Stability of Networks and Protocols in the Adversarial Queueing Model for Packet Routing

Stanford University. Computer Science Department

出版	1997
URL	http://books.google.com.hk/books?id=mje0XwAACAAJ&hl=&source=gbs_api

註釋

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.