An Empirical Study of Off-Line Permutation Packet Routing on Two-Dimensional Meshes Based on the Mul - Computers, IEEE Transactions on
نویسنده
چکیده
In this paper we present the multistage off-line method, a new and rather natural way to model off-line packet routing problems, which reduces the problem of off-line packet routing to that of finding edge disjoint paths on a multistage graph. The multistage off-line method can model any kind of routing pattern on any graph and can incorporate the size of the maximum queue allowed in any processor. The paths for the packets are computed by a greedy heuristic method. Based on the multistage off-line method, we study the permutation packet routing problem on two-dimensional meshes. We ran millions of experiments based on random generated data and, for all of our experiments, we were able to compute a solution of length equal to the maximum distance a packet had to travel, and thus, match the actual lower bound for each routing pattern.
منابع مشابه
An Empirical Study of Off-Line Permutation Packet Routing on Two-Dimensional Meshes Based on the Multistage Routing Method
متن کامل
2 Ieee Transactions on Computers
| In this paper we present the multistage oo-line method, a new and rather natural way to model oo-line packet routing problems, which reduces the problem of oo-line packet routing to that of nding edge disjoint paths on a multistage graph. The multistage oo-line method can model any kind of routing pattern on any graph and can incorporate the size of the maximum queue allowed in any processor....
متن کاملAn Emperical Study of Oo-line Permutation Packet Routing on 2-dimensional Meshes Based on the Multistage Routing Method
In this paper we present the multistage oo-line method, a new and rather natural way to model oo-line packet routing problems, which reduces the problem of oo-line packet routing to that of nding edges disjoint paths on a multistage graph. The multistage oo-line method can model any kind of routing pattern on any graph and can incorporate the size of the maximum queue allowed to be created in a...
متن کاملA New Approach to O -Line Packet Routing Case Study: 2-Dimensional Meshes
In this paper we present the multistage oo-line routing model, a new and rather natural, way to model oo-line packet routing problems. With this model, the problem of oo-line packet routing reduces to the problem of nding edge disjoint paths on a multistage graph. The multistage oo-line routing model can model any kind of routing pattern on any graph. Furthermore, it incorporates the size of th...
متن کاملPermutation Routing and Sorting on Meshes with Row and Column Buses
We study the problems of permutation routing and sorting on several models of meshes with xed and reconngurable row and column buses. We describe two fast and fairly simple deterministic algorithms for permutation routing on two-dimensional networks, and a more complicated algorithm for multi-dimensional networks. The algorithms are obtained by converting two known oo-line routing schemes into ...
متن کامل