The Effect of Network Topology and Channel Labels on the Performance of Label-Based Routing Algorithms

Abstract

Abstract. Designing an efficient deadlock-free routing is a point of concern for irregular topologies. In this paper, we take a step toward the goal by developing three novel deadlock-free routing algorithms in the content of a new family of algorithms called label-based routing algorithms for irregular topologies. In addition, the newly proposed family covers three previously reported routing algorithms [2,3]. Moreover, by simulating and comparing the newly and traditional proposed routing methods, it is shown that the performance of this family highly depends on the network topology and channel labeling process.

A general mathematical performance model for wormhole-switched irregular networks

“…In the former group, the message is directed to the destination using the assigned labels to network nodes and channels (graph labels). Up/down [18], prefix [19], left/right [7], l-turn [7], the methodology proposed in [16], and the three novel routing algorithms proposed in [10] are examples of such routings that use graph labeling for directing messages to their destinations. In [10], these routing algorithms were classified in a new family called label-based routing algorithms.…”

“…Obviously, that channel cannot be granted, and that situation will last forever. This situation is called cyclic dependency [10]. V a virtual channels, and class B includes V b virtual channels.…”

“…Minimal routing algorithms only supplies channels that bring the message closer to its destination[10].…”