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

Fingerprint

Switching networks
Networks (circuits)
Network performance
Markov processes
Analytical models
Experiments

Keywords

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

ASJC Scopus subject areas

  • Hardware and Architecture
  • Software

Cite this

Modelling adaptive routing in circuit switched networks. / Min, Geyong; Ould-Khaoua, Mohamed.

In: Journal of Systems Architecture, Vol. 47, No. 8, 12.2001, p. 747-757.

Research output: Contribution to journalArticle

@article{7c63b322449747038c6be04367605b31,
title = "Modelling adaptive routing in circuit switched networks",
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.",
keywords = "Interconnection networks, Markov chains, Message latency, Multicomputers, Virtual channels",
author = "Geyong Min and Mohamed Ould-Khaoua",
year = "2001",
month = "12",
doi = "10.1016/S1383-7621(01)00030-3",
language = "English",
volume = "47",
pages = "747--757",
journal = "Journal of Systems Architecture",
issn = "1383-7621",
publisher = "Elsevier",
number = "8",

}

TY - JOUR

T1 - Modelling adaptive routing in circuit switched networks

AU - Min, Geyong

AU - Ould-Khaoua, Mohamed

PY - 2001/12

Y1 - 2001/12

N2 - 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.

AB - 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.

KW - Interconnection networks

KW - Markov chains

KW - Message latency

KW - Multicomputers

KW - Virtual channels

UR - http://www.scopus.com/inward/record.url?scp=0035577815&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0035577815&partnerID=8YFLogxK

U2 - 10.1016/S1383-7621(01)00030-3

DO - 10.1016/S1383-7621(01)00030-3

M3 - Article

AN - SCOPUS:0035577815

VL - 47

SP - 747

EP - 757

JO - Journal of Systems Architecture

JF - Journal of Systems Architecture

SN - 1383-7621

IS - 8

ER -