Skip to main content
SpringerLink
Log in

Stochastic Analysis of Deterministic Routing Algorithms in the Presence of Self-Similar Traffic

  • Published:
The Journal of Supercomputing Aims and scope Submit manuscript

Abstract

Many performance models for deterministic routing in multicomputer interconnection networks have been derived and analyzed under the assumption of the traditional Poisson stochastic arrival process, which is inherently unable to capture traffic self-similarity revealed by many real-world parallel applications. In an effort towards understanding the network performance under various traffic loads and different design alternatives, this paper presents an analytical model for dimension-ordered routing in k-ary n-cubes when subjected to self-similar traffic. As the service time, blocking probability and waiting time experienced by a message vary from a dimension to another, the design of such a model for dimension-ordered routing poses greater challenges. The developed analytical model is then used to investigate the efficiency of two different ways to organize virtual channels for deterministic routing and to evaluate the impact of self-similar traffic with various Hurst parameters on network performance.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. V. Adve and M. K. Vernon. Performance analysis of mesh interconnection networks with deterministic routing. IEEE Trans. Parallel and Distributed Systems, 5(3):225–246, 1994.

    Article  Google Scholar 

  2. A. Agarwal. Limits on interconnection network performance. IEEE Trans. Parallel and Distributed Systems, 2(4): 398–412, 1991.

    Article  Google Scholar 

  3. A. T. Andersen and B. F. Nielsen. A Markovian approach for modeling packet traffic with long-range dependence. IEEE J. Selected Areas on Communications, 16(5):719–732, 1998.

    Google Scholar 

  4. Y. M. Boura and C. R. Das. Performance analysis of buffering schemes in wormhole routers. IEEE Trans. Computers, 46(5):580–587, 1997.

    Google Scholar 

  5. B. Ciciani, M. Colajanni, and C. Paolucci. Performance evaluation of deterministic wormhole routing in k-ary n-cubes. Parallel Computing, 24(14):2053–2076, 1998.

    Article  Google Scholar 

  6. M. Colajanni, B. Ciciani, and S. Tucci. Performance analysis of circuit-switching interconnection networks with deterministic and adaptive routing. Performance Evaluation, 34(1):1–26, 1998.

    Article  Google Scholar 

  7. W. J. Dally and C. L. Seitz. Deadlock-free message routing in multiprocessor interconnection networks. IEEE Trans. Computers, 36(5):547–553, 1987.

    Google Scholar 

  8. W. J. Dally. Performance analysis of k-ary n-cubes interconnection networks. IEEE Trans. Computers, 39(6):775–785, 1990.

    Article  Google Scholar 

  9. W. J. Dally, Virtual channel flow control. IEEE Trans. Parallel and Distributed Systems, 3(2):194–205, 1992.

    Google Scholar 

  10. J. T. Draper and J. Ghosh. A comprehensive analytical model for wormhole routing in multicomputer systems. Journal of Parallel and Distributed Computing, 32(2):202–214, 1994.

    Google Scholar 

  11. J. Duato. A new theory of deadlock-free adaptive routing in wormhole routing networks. IEEE Trans. Parallel and Distributed Systems, 4(12):1320–1331, 1993.

    Article  Google Scholar 

  12. J. Duato, S. Yalamanchili, and L. Ni. Interconnection networks: An engineering approach, IEEE Computer Society Press, Silver Spring, MD, 1997.

    Google Scholar 

  13. W. Fischer and K. Meier-Hellstern. The Markov-modulated Poisson process (MMPP) cookbook. Performance Evaluation, 18(2):149–171, 1993.

    Article  MathSciNet  Google Scholar 

  14. H. Heffes. A class of data traffic processes—Covariance function characterization and related queueing results. Bell System Technical Journal, 59(6):897–929, 1980.

    MATH  Google Scholar 

  15. J. Kim and C. R. Das. Hypercube communication delay with wormhole routing. IEEE Trans. Computers, 43(7):806–814, 1994.

    Google Scholar 

  16. L. Kleinrock. Queueing Systems: Theory, Vol. 1, John Wiley & Sons, New York, 1975.

    Google Scholar 

  17. W. E. Leland, M. S. Taqqu, W. Willinger, and D. V. Wilson. On the self-similar nature of Ethernet traffic (extended version). IEEE/ACM Trans. Networking, 2(1):1–15, 1994.

    Article  Google Scholar 

  18. D. M. Lucantoni, G. L. Choudhury, and W. Whitt. The transient BMAP/G/1 queue. Communications in Statistics Stochastic Models, 10(1):145–182, 1994.

    MathSciNet  Google Scholar 

  19. G. Min, M. Ould-Khaoua, D. D. Kouvatsos, and I. U. Awan. Impact of self-similar traffic on the performance of routing algorithms. Proc. PMEO-PDS ‘2004 in conjunction with IPDPS ‘2004, CD-ROM, IEEE Computer Society Press, 2004.

  20. G. Min and M. Ould-Khaoua. A performance model for wormhole-switched k-ary n-cube networks under self-similar traffic. IEEE Trans. Computers, 53(5):1–13, 2004.

    Google Scholar 

  21. D. Manjunath and B. Sikdar. Input queued switches for variable length packets: Analysis for poisson and self-similar traffic. Computer Communications, 25(6):590–610, 2002.

    Article  Google Scholar 

  22. M. F. Neuts and J. Li. The Bernoulli splitting of a Markovian arrival process, http://www.maths.adelaide.edu.au/jli/papers/split.pdf, 2002.

  23. M. Ould-Khaoua. A performance model for Duato's fully adaptive routing algorithm in k-ary n-cubes. IEEE Trans. Computers, 48(12):1–8, 1999.

    Article  MathSciNet  Google Scholar 

  24. K. Park and W. Willinger. Self-Similar Network Traffic and Performance Evaluation, John Wiley & Sons, New York, 2000.

    Google Scholar 

  25. J. Sahuquillo, T. Nachiondo, J. C. Cano, and J. A. Gil. A. Pont, Self-similarity in SPLASH-2 workloads on shared memory multiprocessors systems. Proc. EURO-PDP 2000, 293–300, IEEE Computer Society Press, 2000.

  26. H. Sarbazi-Azad, A. Khonsari, and M. Ould-Khaoua. Performance analysis of deterministic routing in wormhole k-ary n-cubes with virtual channels. Journal of Interconnection Networks, 3(1/2):67–83, 2002.

    Google Scholar 

  27. H. P. Schwefel and L. Lipsky. Impact of aggregated, self-similar ON/OFF traffic on delay in stationary queueing models (extended version). Performance Evaluation, 43(4):203–221, 2001.

    Article  Google Scholar 

  28. W. Willinger, M. S. Taqqu, R. Sherman, and D. V. Wilson. Self-similarity through high-variability: Statistical analysis of ethernet LAN traffic at the source level. IEEE/ACM Trans. Networking, 5(1):71–86, 1997.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computing, School of Informatics, University of Bradford, Bradford, BD7 1DP, UK

    Geyong Min, Demetres D. Kouvatsos & Irfan U. Awan

  2. Department of Computing Science, University of Glasgow, Glasgow, G12 8RZ, UK

    Mohamed Ould-Khaoua

Authors
  1. Geyong Min
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mohamed Ould-Khaoua
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Demetres D. Kouvatsos
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Irfan U. Awan
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Geyong Min.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Min, G., Ould-Khaoua, M., Kouvatsos, D.D. et al. Stochastic Analysis of Deterministic Routing Algorithms in the Presence of Self-Similar Traffic. J Supercomput 35, 245–258 (2006). https://doi.org/10.1007/s11227-006-4668-7

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11227-006-4668-7

Keywords

Search

Navigation