skip to main content
10.1145/967900.967975acmconferencesArticle/Chapter ViewAbstractPublication PagessacConference Proceedingsconference-collections
Article

Communication delay in hypercubic networks with LRD traffic

Published:14 March 2004Publication History

ABSTRACT

Realistic network traffic can exhibit the Long-Range Dependent (LRD) feature which is characterised by a hyperbolically decaying correlation function and has strong effects on the performance of communication networks. As the convergence of simulations to a steady state under LRD workloads is often very slow, analytical models become cost-effective and versatile tools that can help designers to investigate system performance. This paper designs an analytical performance model for computing communication delay in adaptively routed hypercubic networks in the presence of LRD traffic. The model is derived in the context of pipelined circuit switching. The tractability and reasonable accuracy of the analytical model make it a practical and cost-effective evaluation tool to study the performance behaviour of hypercubic networks under LRD traffic.

References

  1. A. T. Andersen, 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 ScholarGoogle ScholarDigital LibraryDigital Library
  2. J. Beran, R. Sherman, M. S. Taqqu, W. Willinger, Long-range dependence in variable-bit-rate video traffic, IEEE Trans. Communications, 43(2--4), 1566--1579, 1995.Google ScholarGoogle Scholar
  3. Y. M. Boura, C. R. Das, T. M. Jacob, A performance model for adaptive routing in hypercubes, Proc. 1st Int. Workshop on Parallel Processing, pp. 11--16, 1994.Google ScholarGoogle Scholar
  4. I. Chlamtac, A. Ganz, M. G. Kienzle, A performance model of a connection-oriented hypercube interconnection system, Performance Evaluation, 25(2), 151--167, 1996. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. M.E. Crovella, A. Bestavros, Self-similarity in World Wide Web traffic: Evidence and possible causes, IEEE/ACM Trans. Networking, 5(6), 835--846, 1997. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. W.J. Dally, Virtual channel flow control, IEEE Trans. Parallel & Distributed Systems, 3(2), 194--205, 1992. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. J. Duato, S. Yalamanchili, L. Ni, Interconnection networks: An engineering approach, IEEE Computer Society Press, Los Alamitos, CA, 1997. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. W. Fischer, K. Meier-Hellstern, The Markov-modulated Poisson process (MMPP) cookbook, Performance Evaluation, 18(2), 149--171, 1993. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. R. J. Fretwell, D. D. Kouvatsos, LRD and SRD traffics: Review of results and open issues for the batch renewal process, Performance Evaluation, 48(1/4), 267--284, 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. L. Kleinrock, Queueing Systems: Theory, vol. 1, John Wiley & Sons, New York, 1975. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. W. E. Leland, M. S. Taqqu, W. Willinger, D. V. Wilson, On the self-similar nature of Ethernet traffic (extended version), IEEE/ACM Trans. Networking, 2(1), 1--15, 1994. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. S. Loucif, M. Ould-Khaoua, L. M. Mackenzie, Modelling fully-adaptive routing in hypercubes, Telecommunication Systems, 13(1), pp. 111--118, 2000.Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. D. Manjunath, B. Sikdar, Input queued switches for variable length packets: analysis for Poisson and self-similar traffic, Computer Communications, 25(6), 590--610, 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. G. Min, M. Ould-Khaoua, A performance model of pipelined circuit switching in hypercubes, Journal of Microprocessors and Microsystems, 25(4), 213--220, 2001.Google ScholarGoogle ScholarCross RefCross Ref
  15. M.F. Neuts, J. Li, The Bernoulli splitting of a Markovian arrival process, http://www.maths.adelaide.edu.au/jli/papers/split.pdfGoogle ScholarGoogle Scholar
  16. 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. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. K. Park, W. Willinger, Self-similar network traffic and performance evaluation, John Wiley & Sons, New York, 2000. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. J. Sahuquillo, T. Nachiondo, J. C. Cano, 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. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. H.P. Schwefel, L. Lipsky, Impact of aggregated, self-similar ON/OFF traffic on delay in stationary queueing models (extended version), Performance Evalution, 43(4), 203--221, 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. T. Yoshihara, S. Kasahara, Y. Takahashi, Practical timescale fitting of self-similar traffic with Markov-modulated Poisson process, Telecommunication Systems, 17(1--2), 185--211, 2001.Google ScholarGoogle Scholar
  1. Communication delay in hypercubic networks with LRD traffic

      Recommendations

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in
      • Published in

        cover image ACM Conferences
        SAC '04: Proceedings of the 2004 ACM symposium on Applied computing
        March 2004
        1733 pages
        ISBN:1581138121
        DOI:10.1145/967900

        Copyright © 2004 ACM

        Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        • Published: 14 March 2004

        Permissions

        Request permissions about this article.

        Request Permissions

        Check for updates

        Qualifiers

        • Article

        Acceptance Rates

        Overall Acceptance Rate1,650of6,669submissions,25%
      • Article Metrics

        • Downloads (Last 12 months)0
        • Downloads (Last 6 weeks)0

        Other Metrics

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader