결함 허용 순열 라우팅

Abstract

In this paper, we consider the problem of -fault tolerant permutation routing, in which each node is the source of one packet and, at the same time, is the destination of one packet. For each packet, identical copies of it must be delivered to the destination, along the node-disjoint paths, respectively. We consider the wrap-arounded -way Benes networks and present a randomized -fault tolerant permutation routing algorithm in which, for any link within the network, the number of packets that pass the link is bounded by with high probability.