A Challenge for Routing Algorithms in Optical Multistage Interconnection Networks

Abstract

<B>Problem statement:</B> A class of dynamic interconnection networks is Multistage Interconnection Networks (MINs) that connects input devices to output devices through a number of switch stages. MINs have assumed importance in recent years; because of their cost-effectiveness. Optical MINs are one type of MINs that have large transmission capacity in the communication networks. There is a major problem in Optical MIN that is crosstalk, which is caused by coupling two signals within a switching element. <B>Approach:</B> To avoid crosstalk in Optical MINs many algorithms have been proposed by many researchers that we review applying five routing algorithms and scheduling them in the Optical MINs. <B>Results:</B> The comparative results of routing algorithms show affective of avoiding crosstalk in number of passes and execution time for different algorithm. <B>Conclusion:</B> The challenge between these routing algorithms is thoroughly investigated, by applying them on Optical MIN and showing which algorithm has better performance to avoid crosstalk

Class-Based Weighted Fair Queuing Scheduling on Dual-Priority Delta Networks

“…To this end, a number of packet scheduling algorithms have been proposed, with the most prominent ones including strict priority queuing [1], roundrobin [2] and its variations (e.g., weighted round-robin [3,4], deficit round-robin [5], smoothed round-robin [6]), generalized processor sharing (GPS) [7], weighted fair queuing (P-GPS) [8], class-based weighted fair queuing [9], virtual clock [10], and self-clocked fair queuing [11]. In a number of works (e.g., [12][13][14]), packets enter the MIN without a priority (as opposed to the previous approaches where the where priorities are assigned to packets before they enter the MIN), and the MIN internally prioritizes packets aiming either to offload the most heavily loaded queues and reduce blockings [12] or avoid crosstalk in optical MINs ( [13,14]); in essence, however, only the priority source changes (internal versus externally defined), while for selecting the most prominent packet for forwarding, one of the previously listed algorithms is applied.…”