Return to search

Performance modelling of wormhole-routed hypercubes with bursty traffice and finite buffers

An open queueing network model (QNM) is proposed for wormhole-routed hypercubes with finite
buffers and deterministic routing subject to a compound Poisson arrival process (CPP) with geometrically
distributed batches or, equivalently, a generalised exponential (GE) interarrival time distribution. The GE/G/1/K
queue and appropriate GE-type flow formulae are adopted, as cost-effective building blocks, in a queue-by-queue
decomposition of the entire network. Consequently, analytic expressions for the channel holding time, buffering
delay, contention blocking and mean message latency are determined. The validity of the analytic approximations
is demonstrated against results obtained through simulation experiments. Moreover, it is shown that the wormholerouted
hypercubes suffer progressive performance degradation with increasing traffic variability (burstiness).

Identiferoai:union.ndltd.org:BRADFORD/oai:bradscholars.brad.ac.uk:10454/478
Date January 2005
CreatorsKouvatsos, Demetres D., Assi, Salam, Ould-Khaoua, M.
Source SetsBradford Scholars
LanguageEnglish
Detected LanguageEnglish
TypeArticle
Rights© 2005 United Kingdom Simulation Society. Reproduced in acccordance with the publisher's self-archiving policy.
Relationhttp://ducati.doc.ntu.ac.uk/uksim/journal/Vol-6/No.3-4/CRC-Salam.pdf

Page generated in 0.0016 seconds