skip to main content
10.1145/133057.133107acmconferencesArticle/Chapter ViewAbstractPublication PagesmetricsConference Proceedingsconference-collections
Article
Free Access

Analytical models of combining Banyan networks

Authors Info & Claims
Published:01 June 1992Publication History

ABSTRACT

We present in this paper an analytical model of a multistage combining Banyan network with output buffered switches, in hot-sport traffic. In a combining network, packets bound for the same destination are combined into one if they meet at a switch; this alleviates the problem of tree-saturation caused by hot-spot traffic. We model the flow processes in the network as Markov chains and recursively approximate the departure processes of each stage of the network in terms of the departure processes of the preceding stage. This model is used to predict the throughput of the combining network, and comparison with simulation results shows the prediction to be accurate.

A modified combining scheme based on low priorites for hot packets is proposed and analyzed. It is shown that this scheme yields substantial improvements in throughput over the standard combining scheme.

References

  1. 1.S. Chalasani and A. Varma. Analysis and simulation of multistage interconnection networks under non-uni'~orm traffic. In Proceedings of PARBASE-90, pages 258-265, March 1990.Google ScholarGoogle Scholar
  2. 2.W. Crowther et al. Performance measurements on a 128-node Butterfly parallel processor. In Proceedings of the 1985 International Conference on Parallel Processing, pages 531-540, August 1985.Google ScholarGoogle Scholar
  3. 3.D. M. Dias and M. Kumar. Preventing congestion in multistage networks in the presence of hotspots. In Proceedings of the 1989 International Conference on Parallel Processing, volume 1, pages 9-13, 1989.Google ScholarGoogle Scholar
  4. 4.A. I. Elwalid and D. Mitra. Analysis and design of rate-based congestion control of high speed networks, I: stochastic fluid models, access regulation. Queueing Systems, 9:29-64, 1991. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. 5.A. Gottleib et al. The NYU Ultracomputer- designing a MIMD shared memory parallel computer. IEEE Transactions on Computers, c-32(2):175-189, February 1983.Google ScholarGoogle Scholar
  6. 6.H. Heffes and D. Lucantoni. A Markov modulated characterization of packetized voice and data traffic and related statistical multiplexer performance. IEEE ,}ournal on Selected Areas in Communications, 4(6):858- 868, 1986.Google ScholarGoogle Scholar
  7. 7.G. Lee. A performance bound of combining networks. IEEE Transactions on Computers, c-38(10):1387-1395, October 1989. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. 8.G. Lee, C. P. Kruskal, and D. J. Kuck. The effectiveness of combining in shared memory parallel computers in the presence of hotspots. In Proceedings of the 1986 International Conference on Parallel Processing, }pages 35-41, 1986.Google ScholarGoogle Scholar
  9. 9.A. A. Merchant. Banyan networks with non-uniform traffic, variable service times and finite buffers. In preparation.Google ScholarGoogle Scholar
  10. 10.A. A. Merchant. A Markov chain approximation for the analysis of Banyan networks. In Proceedings of SIG- METRICS 1991. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. 11.A. A. Merchant. Analytical Models for the Performance Evaluation of Buffered Banyan Networks. PhD thesis, Stanford University, 1991. Available as Stanford Technical Report STAN-CS-90-1347. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. 12.G. F. P~ster et al. The IBM Research Parallel Processor Prototype (RP3): introduction and architecture. In Proceedings of the 1985 International Conference on Parallel Processing, pages 764-771, August 1985.Google ScholarGoogle Scholar
  13. 13.G. F. Pfister and V. A. Norton. "Hot spot" contention and combining in multistage interconnection networks. IEEE Transactions on Computers, c-34(10):943-948, October 1985.Google ScholarGoogle Scholar

Index Terms

  1. Analytical models of combining Banyan networks

        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
          SIGMETRICS '92/PERFORMANCE '92: Proceedings of the 1992 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
          June 1992
          267 pages
          ISBN:0897915070
          DOI:10.1145/133057

          Copyright © 1992 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: 1 June 1992

          Permissions

          Request permissions about this article.

          Request Permissions

          Check for updates

          Qualifiers

          • Article

          Acceptance Rates

          Overall Acceptance Rate459of2,691submissions,17%

        PDF Format

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader