摘要： iSLIP算法要求仅在第1次迭代后更新指针，以避免连接饿死，但该指针更新方式在某些流量下会造成网络阻塞。通过理论分析和ESL建模仿真，评估在实际网络流量随机的情况下，每次迭代更新指针时的算法性能，结果表明每次迭代更新指针不会导致链接饿死，其性能在伯努利流量和on-off流量下与仅在第1次迭代时更新指针的性能相当。

关键词: 纵横式交换矩阵, iSLIP指针, ESL仿真, 流量

Abstract: iSLIP algorithm requires the user update the pointer only after the first iteration, or there may be connection starved. But this pointer update mode will cause some trouble in the network under some traffics. This paper evaluates the algorithm performance while updating the pointer after every iteration under random network traffic. Results show that updating pointer after every iteration will not starve the connection. Under the Bernoulli traffic and on-off traffic, its performance is as good as the former one.

Key words: CrossBar, iSLIP pointer, ESL simulation, traffic

中图分类号: 

• TP393.03