Multistage Off-Line Permutation Packet Routing on a Mesh:An Approach with Elementary Mathematics  

作　　者：Kevin Chiew 

机构地区：[1]School of Information Systems,Singapore Management University,80 Stamford Road,Singapore 178902

出　　处：《Journal of Computer Science & Technology》2009年第1期175-180,共6页计算机科学技术学报（英文版）

摘　　要：Various methods have been proposed for off-line permutation packet routing on a mesh. One of the methods is known as multistage routing, in which the first stage is crucial. For the first stage of routing, the previous study normally converts it to a problem of graph theory and proves the existence of solutions. However, there is a lack of simple algorithms to the first stage of routing. This article presents an explicit and simple approach for the first stage of routing based on elementary mathematics.Various methods have been proposed for off-line permutation packet routing on a mesh. One of the methods is known as multistage routing, in which the first stage is crucial. For the first stage of routing, the previous study normally converts it to a problem of graph theory and proves the existence of solutions. However, there is a lack of simple algorithms to the first stage of routing. This article presents an explicit and simple approach for the first stage of routing based on elementary mathematics.

关 键 词：permutation packet routing explicit algorithm 

分 类 号：TP393.09[自动化与计算机技术—计算机应用技术]