Skip to main content
Article thumbnail
Location of Repository

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

By Demetres D. Kouvatsos, Salam Assi and M. Ould-Khaoua


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)

Topics: Wormhole routing, Hypercubes, Compound Poisson process, Generalised exponential message latency, Simulation
Year: 2005
OAI identifier:
Provided by: Bradford Scholars

Suggested articles


  1. (1994). A Comprehensive Analytical Model for Wormhole Routing in Multicomputer Systems”. doi
  2. (1993). A New Theory of Deadlock-Free Adaptive Routing in Wormhole Networks”. doi
  3. (1993). A Survey of Wormhole Rrouting Techniques in Direct Networks”. doi
  4. (1997). An Analytical Model for Wormhole Routing with Finite Size Input Buffers”. In: doi
  5. (2003). Analysis of k-Ary n-Cubes with DimensionOrdered Routing”. doi
  6. (1987). Deadlock-Free Message Routing in Multiprocessor Interconnection Networks”. doi
  7. (1994). Entropy Maximisation and Queueing Network Models”. doi
  8. (1994). Hypercube Communication Delay with Wormhole Routing”. doi
  9. (1997). Interconnection Networks: An Engineering Approach”. doi
  10. (1997). iPSC/2 system: A Second Generation Hypercube”. doi
  11. (2003). On The Relative Performance Merits of Switching Techniques Under Bursty Loads”. doi
  12. (2002). Performance Analysis of Deterministic Routing in Wormhole k-Ary n-Cubes with Virtual Channels”. doi
  13. (2001). The Measured Network Traffic of Compiler-Parallelized Programs”. doi
  14. (1997). The SGI Origin: A ccNUMA Highly Scalable Server”. doi
  15. (1992). Virtual-Channel Flow Control”. doi

To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.