Loading...

One-to-one and one-to-many node-disjoint routing algorithms for WK-recursive networks

Bakhshi, S ; Sharif University of Technology | 2008

355 Viewed
  1. Type of Document: Article
  2. DOI: 10.1109/I-SPAN.2008.37
  3. Publisher: 2008
  4. Abstract:
  5. Recently, routing with disjoint paths has received much attention to provide more performance and fault tolerance. On the other hand, WK-recursive mesh network has been studied extensively due to its favorable properties such as high degree of stability and resilience. The connectivity of a network is an important measure of fault tolerance, while the diameter represents the worst-case transmission delay between two arbitrary nodes. In this paper, we propose one-to-one and one-to-many disjoint routings mechanisms for WK-recursive mesh networks to further exhibit the performance and fault tolerance of such networks. © 2008 IEEE
  6. Keywords:
  7. Decoding ; Errors ; Fault tolerance ; Ketones ; Parallel algorithms ; Parallel processing systems ; Quality assurance ; Recursive functions ; Reliability ; Degree of stability ; Disjoint paths ; International symposium ; Mesh networks ; Node-disjoint ; Parallel architectures ; Routings ; Transmission delays ; Routing algorithms
  8. Source: Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks, I-SPAN, 7 May 2008 through 9 May 2008, Sydney, NSW ; 2008 , Pages 227-232 ; 9780769531250 (ISBN)
  9. URL: https://ieeexplore.ieee.org/document/4520220