“School of Computer Science”

Back to Papers Home
Back to Papers of School of Computer Science

Paper   IPM / Computer Science / 11024
School of Computer Science
  Title:   One-to-one and one-to-many node-disjoint routing algorithms for WK-recursive meshes
  Author(s): 
1.  S. Bakhshi
2.  H. Sarbazi-Azad
  Status:   In Proceedings
  Proceeding: I-SPAN
  Year:  2008
  Pages:   227-232
  Publisher(s):   IEEE Computer Society
  Supported by:  IPM
  Abstract:
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.

Download TeX format
back to top
scroll left or right