Loading...

Efficient parallel routing algorithms for cartesian and composition networks

Bakhshi, M ; Sharif University of Technology | 2008

252 Viewed
  1. Type of Document: Article
  2. DOI: 10.1007/978-3-540-89985-3_37
  3. Publisher: 2008
  4. Abstract:
  5. The Cartesian and Composition products are two well known graph products, also applied to interconnection networks area. The Cartesian and Composition network products possess great characteristics of fault resilience according to their high connectivity. In this paper, we study the existence and construction of parallel routing paths in these two well-known product networks. To prove the existence of certain number of parallel paths in these product networks, we need to compute their connectivity. By assuming the availability of certain number of faulty nodes, we propose some new shortest-path parallel routing algorithms. These algorithms can be used both in faulty networks and to route different data from different paths to a specified target node. We also study the concept of container length and wide diameter of the two mentioned product networks. Comparison between wide diameters and diameters of the two networks exhibit the efficiency of these product networks in constructing node disjoint paths. © 2008 Springer-Verlag
  6. Keywords:
  7. Cartesian products ; Composition product ; Connectivity ; Fault tolerant routing ; Parallel routing ; Computer science ; Routing algorithms ; Telecommunication networks
  8. Source: 13th International Computer Society of Iran Computer Conference on Advances in Computer Science and Engineering, CSICC 2008, Kish Island, 9 March 2008 through 11 March 2008 ; Volume 6 CCIS , 2008 , Pages 299-307 ; 18650929 (ISSN); 3540899847 (ISBN); 9783540899846 (ISBN)
  9. URL: https://link.springer.com/chapter/10.1007/978-3-540-89985-3_37