Stability of networks and protocols in the adversarial queueing model for packet routing
Stability of networks and protocols in the adversarial queueing model for packet routing
复制标题
数据包路由对抗排队模型中网络和协议的稳定性
DOI：
--
复制
发表时间：
2001
期刊：
影响因子：
--
通讯作者：
Ashish Goel
中科院分区：
文献类型：
--
作者：
Ashish Goel
Borodin等人提出了包路由的对抗性排队理论模型，我们给出了该模型中所有普遍稳定网络的一个完整而简单的刻画。我们表明，同样的特征也适用于网络是稳定的，分组转发协议是FIFO（先进先出）。我们还表明，一个特定的贪婪协议，SIS（最短的系统），对0/1随机对手是稳定的。John Wiley & Sons，Inc.
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 the same characterization also holds for networks which are stable given that the packet forwarding protocol is FIFO (First in First out). We also show that a specific greedy protocol, SIS (Shortest in System), is stable against 0/1 stochastic adversaries. © 2001 John Wiley & Sons, Inc.