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 analyze the backtracking actions of the header flit during the path setup phase in PCS, and M/G/I 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 | IEEE International Workshop on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems - Proceedings |
| Publisher | IEEE |
| Pages | 299-306 |
| Number of pages | 8 |
| Publication status | Published - 2000 |
| Event | Proceedings of the 8th Interantional Symposium on Modeling, Analysis and Simulation of Computer and Telecomunication System - San Francisco, CA, USA Duration: Aug 29 2000 → Sept 1 2000 |
Other
| Other | Proceedings of the 8th Interantional Symposium on Modeling, Analysis and Simulation of Computer and Telecomunication System |
|---|---|
| City | San Francisco, CA, USA |
| Period | 8/29/00 → 9/1/00 |
ASJC Scopus subject areas
- Modelling and Simulation