Modelling adaptive routing in circuit switched networks

Research output: Contribution to journalArticle

9 Citations (Scopus)

Abstract

A performance model of circuit switched k-ary n-cubes with deterministic routing has recently been proposed by Sharma and Varvarigos [IEEE Trans. Parallel Distrib. Syst. 8 (4) (1997) 349]. Many studies have revealed that using adaptive routing along with virtual channels considerably improves network performance over deterministic routing. This paper presents the first analytical model for calculating the message latency in circuit switched k-ary n-cube networks with adaptive routing. The main feature of the proposed model is the use of Markov chains to compute the path set-up time and to capture the effects of using virtual channels to reduce message blocking in the network. The mean waiting time that a message experiences at a source node is calculated using an M/G/1 queueing system. The validity of the model is demonstrated by comparing analytical results with those obtained through simulation experiments.

Original languageEnglish
Pages (from-to)747-757
Number of pages11
JournalJournal of Systems Architecture
Volume47
Issue number8
DOIs
Publication statusPublished - Dec 2001

Keywords

  • Interconnection networks
  • Markov chains
  • Message latency
  • Multicomputers
  • Virtual channels

ASJC Scopus subject areas

  • Hardware and Architecture
  • Software

Fingerprint Dive into the research topics of 'Modelling adaptive routing in circuit switched networks'. Together they form a unique fingerprint.

  • Cite this