By Topic

Multispanning Tree Zone-Ordered Label-Based Routing Algorithms for Irregular Networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Moraveji, R. ; Centre for Distrib. & High Performance Comput., Univ. of Sydney, Sydney, NSW, Australia ; Moinzadeh, P. ; Sarbazi-Azad, H. ; Zomaya, A.Y.

In this paper, a diverse range of routing algorithms is classified into a new family of routings called zone-ordered label-based routing algorithms. The proposed classification is based on three common steps (factors) for generating such routings, namely, graph labeling, deadlock-free zones, and zone ordering. The main goal of this classification is to define several new routing concepts and streamline the knowledge on routing algorithms. Following the classification, a novel methodology is proposed to generate routing algorithms for irregular networks. The methodology uses the three mentioned steps to generate deadlock-free routings. Consequently, the methodology-based routings fall into the category of zone-ordered label-based routings. However, the graph labeling method (first step) used in the methodology is based on multiple spanning tree construction on the network. The simulation results show that constructing further spanning trees may result in routing algorithm with better performance.

Published in:

Parallel and Distributed Systems, IEEE Transactions on  (Volume:22 ,  Issue: 5 )