关键词：调度算法；SLIP；QCSMA；开环仿真；闭环仿真；TCP
摘 要：We compare the delays experienced by packet flows when transmitted using ifferent scheduling algorithms across a crossbar switch. The two scheduling algorithms e consider are iterative SLIP and QCSMA.We first compare them under the assumptions that all packets have the same length, and then under the assumption that the half the packets have the maximum allowable length and half have the minimum allowable length. Our findings suggest that the variation in packet length has a non-negligible effect on throughput vs delay results. For long-lived TCP connections with varying packet lengths, QCSMA derived schedulers seem to do only marginally better than SLIP.