输入缓存ATM交换中多FIFO队列的最佳排队策略

对于每个输入端口具有多ＦＩＦＯ（先入先出）队列的输入缓存ＡＴＭ交换网，信元（Ｐａｃｋｅｔ）的排队策略是研究如何将进入输入端口的信元安排在不同排队队列中．最佳排队策略是给定信元排队规则，以使交换吞吐率（Ｔｈｒｏｕｇｈｐｕｔ）达到最大的策略．作者着重研究了输入端口具有２－ＦＩＦＯ缓冲队列的交换网，并从数学上证明了该交换网络的最佳排队策略，其结论亦可应用于每输入端口具有ｋ－ＦＩＦＯ（ｋ＞２）缓冲队列的交换网

Optimal Queuing Policy for Input-buffered ATM Switches with Multi-FIFO Queues

For input buffered ATM switches with multiple FIFO queues per input port, a packet queuing policy specifies how packets are assigned to join different queues at an input port. An optimal queuing policy is a policy that can maximize the switch throughput when it is used together with a given packet scheduling strategy. In this paper, we focus on a switch with 2 FIFO queues per input port and we show mathematically the optimal queuing policy for the switch. This result can be easily applied for the input buffered switches with arbitrary number of FIFO queues per input port.