Modelling of pipelined circuit switching in multicomputer networks

Geyong Min; Hamid Sarbazi-Azad; Mohamed Ould-Khaoua

doi:10.1109/MASCOT.2000.876552

Modelling of pipelined circuit switching in multicomputer networks

Geyong Min, Hamid Sarbazi-Azad, Mohamed Ould-Khaoua

Electrical and Computer Engineering

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

5 Citations (Scopus)

Abstract

Several recent studies have revealed that pipelined circuit switching (PCS) can provide superior performance characteristics over wormhole routing. This paper proposes an original analytical model of PCS in k-ary n- cube networks augmented with virtual channel support. The model uses random walk theory to analyse the backtracking actions of the header flit during the path setup phase in PCS, and M/G/l queueing systems to compute the mean waiting time that a message experiences at a source before entering the network. Results from simulation experiments show close agreement to those predicted by the model.

Original language	English
Title of host publication	Proceedings - IEEE Computer Society's Annual International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems, MASCOTS
Publisher	IEEE Computer Society
Pages	299-305
Number of pages	7
Volume	2000-January
ISBN (Print)	076950728X
DOIs	https://doi.org/10.1109/MASCOT.2000.876552
Publication status	Published - 2000
Event	8th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems, MASCOTS 2000 - San Francisco, United States Duration: Aug 29 2000 → Sept 1 2000

Other

Other	8th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems, MASCOTS 2000
Country/Territory	United States
City	San Francisco
Period	8/29/00 → 9/1/00

Keywords

Adaptive routing
K-ary N-cubes
Message latency
Multicomputer
Performance analysis
Queueing theory
Virtual channels

ASJC Scopus subject areas

Electrical and Electronic Engineering
Computer Networks and Communications
Software
Modelling and Simulation

Access to Document

10.1109/MASCOT.2000.876552

Cite this

Min, G., Sarbazi-Azad, H., & Ould-Khaoua, M. (2000). Modelling of pipelined circuit switching in multicomputer networks. In Proceedings - IEEE Computer Society's Annual International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems, MASCOTS (Vol. 2000-January, pp. 299-305). Article 876552 IEEE Computer Society. https://doi.org/10.1109/MASCOT.2000.876552

Modelling of pipelined circuit switching in multicomputer networks. / Min, Geyong; Sarbazi-Azad, Hamid; Ould-Khaoua, Mohamed.
Proceedings - IEEE Computer Society's Annual International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems, MASCOTS. Vol. 2000-January IEEE Computer Society, 2000. p. 299-305 876552.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Min, G, Sarbazi-Azad, H & Ould-Khaoua, M 2000, Modelling of pipelined circuit switching in multicomputer networks. in Proceedings - IEEE Computer Society's Annual International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems, MASCOTS. vol. 2000-January, 876552, IEEE Computer Society, pp. 299-305, 8th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems, MASCOTS 2000, San Francisco, United States, 8/29/00. https://doi.org/10.1109/MASCOT.2000.876552

@inproceedings{8d9192d320f54992a1ac4ca63b1d4209,

title = "Modelling of pipelined circuit switching in multicomputer networks",

abstract = "Several recent studies have revealed that pipelined circuit switching (PCS) can provide superior performance characteristics over wormhole routing. This paper proposes an original analytical model of PCS in k-ary n- cube networks augmented with virtual channel support. The model uses random walk theory to analyse the backtracking actions of the header flit during the path setup phase in PCS, and M/G/l queueing systems to compute the mean waiting time that a message experiences at a source before entering the network. Results from simulation experiments show close agreement to those predicted by the model.",

keywords = "Adaptive routing, K-ary N-cubes, Message latency, Multicomputer, Performance analysis, Queueing theory, Virtual channels",

author = "Geyong Min and Hamid Sarbazi-Azad and Mohamed Ould-Khaoua",

year = "2000",

doi = "10.1109/MASCOT.2000.876552",

language = "English",

isbn = "076950728X",

volume = "2000-January",

pages = "299--305",

booktitle = "Proceedings - IEEE Computer Society's Annual International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems, MASCOTS",

publisher = "IEEE Computer Society",

note = "8th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems, MASCOTS 2000 ; Conference date: 29-08-2000 Through 01-09-2000",

}

TY - GEN

T1 - Modelling of pipelined circuit switching in multicomputer networks

AU - Min, Geyong

AU - Sarbazi-Azad, Hamid

AU - Ould-Khaoua, Mohamed

PY - 2000

Y1 - 2000

N2 - Several recent studies have revealed that pipelined circuit switching (PCS) can provide superior performance characteristics over wormhole routing. This paper proposes an original analytical model of PCS in k-ary n- cube networks augmented with virtual channel support. The model uses random walk theory to analyse the backtracking actions of the header flit during the path setup phase in PCS, and M/G/l queueing systems to compute the mean waiting time that a message experiences at a source before entering the network. Results from simulation experiments show close agreement to those predicted by the model.

AB - Several recent studies have revealed that pipelined circuit switching (PCS) can provide superior performance characteristics over wormhole routing. This paper proposes an original analytical model of PCS in k-ary n- cube networks augmented with virtual channel support. The model uses random walk theory to analyse the backtracking actions of the header flit during the path setup phase in PCS, and M/G/l queueing systems to compute the mean waiting time that a message experiences at a source before entering the network. Results from simulation experiments show close agreement to those predicted by the model.

KW - Adaptive routing

KW - K-ary N-cubes

KW - Message latency

KW - Multicomputer

KW - Performance analysis

KW - Queueing theory

KW - Virtual channels

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

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

U2 - 10.1109/MASCOT.2000.876552

DO - 10.1109/MASCOT.2000.876552

M3 - Conference contribution

AN - SCOPUS:84949791692

SN - 076950728X

VL - 2000-January

SP - 299

EP - 305

BT - Proceedings - IEEE Computer Society's Annual International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems, MASCOTS

PB - IEEE Computer Society

T2 - 8th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems, MASCOTS 2000

Y2 - 29 August 2000 through 1 September 2000

ER -

Modelling of pipelined circuit switching in multicomputer networks

Abstract

Other

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this