Strathprints Home | Open Access | Browse | Search | User area | Copyright | Help | Library Home | SUPrimo

A general analytical model of adaptive wormhole routing in k-ary n-cubes

Khonsari, A. and Ould-Khaoua, M. and Ferguson, J.D. (2003) A general analytical model of adaptive wormhole routing in k-ary n-cubes. In: International Symposium on Performance Evaluation of Computer and Telecommunication Systems, 2003-07-20 - 2003-07-24, Montreal, Canada.

[img]
Preview
PDF (strathprints002531.pdf)
Download (502Kb) | Preview

    Abstract

    Several analytical models of fully adaptive routing have recently been proposed for k-ary n-cubes and hypercube networks under the uniform traffic pattern. Although, hypercube is a special case of k-ary n-cubes topology, the modeling approach for hypercube is more accurate than kary n-cubes due to its simpler structure. This paper proposes a general analytical model to predict message latency in wormhole-routed k-ary n-cubes with fully adaptive routing that uses a similar modeling approach to hypercube. The analysis focuses Duato's fully adaptive routing algorithm [12], which is widely accepted as the most general algorithm for achieving adaptivity in wormhole-routed networks while allowing for an efficient router implementation. The proposed model is general enough that it can be used for hypercube and other fully adaptive routing algorithms.

    Item type: Conference or Workshop Item (Paper)
    ID code: 2531
    Keywords: adaptive routing, hypercube, hypercube networks, telecommunications systems, networking, computer systems, Electronic computers. Computer science
    Subjects: Science > Mathematics > Electronic computers. Computer science
    Department: Faculty of Science > Computer and Information Sciences
    Related URLs:
      Depositing user: Strathprints Administrator
      Date Deposited: 13 Feb 2007
      Last modified: 20 Jul 2013 21:51
      URI: http://strathprints.strath.ac.uk/id/eprint/2531

      Actions (login required)

      View Item

      Fulltext Downloads: