An efficient randomized algorithm for input-queued switch scheduling
An efficient randomized algorithm for input-queued switch scheduling
复制标题
DOI：
10.1109/his.2001.946686
复制
发表时间：
2001-08
期刊：
影响因子：
--
通讯作者：
Devavrat Shah;P. Giaccone;B. Prabhakar
中科院分区：
文献类型：
--
作者：
Devavrat Shah;P. Giaccone;B. Prabhakar
在设计用于输入排队交换机的高性能交换机中的基本问题是在每个时隙中确定用于分组传输的输入和输出之间的良好匹配。线速度的快速增长使得这变得非常困难：找到好的匹配需要时间，并且在最高线速度下的时间很少。当为具有大量端口的交换机设计交换机时，也会出现类似的困难。随机算法已被证明是特别有效的，在提供良好的可扩展的解决方案的问题，决策需要在有限的时间内和/或很少的信息。随机算法的主要思想简单地说：基于一些随机选择的样本的决策通常是基于状态的完整知识的决策的一个很好的替代。本文研究交换机调度的随机化算法设计。我们开始通过检查的困难，实现众所周知的确定性解决方案，如最大重量匹配算法，讨论了一个简单的随机L。Tassiulas（1998）提出了一套新的随机算法，并讨论了它们的理论和性能。
The essential problem in the design of high-performance schedulers for input-queued switches is the determination, in each time slot of a good matching between inputs and outputs for the transfer of packets. The rapid increase of line rates is making this very difficult: finding good matchings takes time, and there is very little time at the highest line speeds. A similar difficulty arises when designing schedulers for switches with a large number of ports. Randomized algorithms have proved particularly effective in providing good scalable solutions to problems where decisions need to be made within a limited amount of time and/or with little information. The main idea of randomized algorithms is simply stated: Basing decisions on a few randomly chosen samples is often a good surrogate for basing decisions with complete knowledge of the state. This paper is about the design of randomized algorithms for switch scheduling. We begin by examining the difficulty of implementing well known deterministic solutions like the maximum weight matching algorithm, discuss a simple randomized proposed by L. Tassiulas (1998), develop a suite of novel randomized algorithms, and discuss their theory and performance.