Abstract
An approximation for the distribution of time delays experienced by tasks in finite-buffered multistage interconnection networks is presented. We focus on asynchronous packet-switched banyan networks which are important in ATM telecommunication systems as well as in parallel computer architectures although our method is applicable to any feed-forward network. The networks we consider are organised in a finite number of stages through each of which a task passes successively in its transmission. The method presented considers successive pairs of switches in a task’s path, the queue (output) joined on arrival at the second having length dependent on that which existed previously on arrival at the first. The transient period between arrivals at successive nodes is modelled in two ways: by solving the appropriate Kolmogorov equations and by an approximation which considers the net change in the queue length at the second node. The networks may be non-homogeneous in that different servers may have different rates and the arrival processes need not be identical. Numerical results are obtained for a range of network parameters and both analytical methods are compared with simulation results.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
A. E. Conway and D. E. O’Brien, “Estimating Response Time Distributions in Queueing Networks,” In Proc. of the IFIP WG 7.3 International Conference on the Performance of Distributed Systems and Integrated Communication Networks, Kyoto, Japan, pp. 225–244, 1992.
H. Daduna, “Passage Times for Overtake-free Paths in Gordon-Newell Networks,” Adv. Appt. Prob., 14, 1982, pp. 672–686.
A. J. Field and P. G. Harrison, “Transmission Times in Unbuffered Full Crossbars with Cyclic Arbitration,” In Proc. ICPP’ 92.
P. G. Harrison, “An Enhanced Approximation by Pair-Wise Analysis of Servers for Time Delay Distributions in Queueing Networks,” IEEE Trans. Comput., C-35, no 1, Jan. 1986, pp. 54–61.
P. G. Harrison and A. de C. Pinto, “Blocking in Asynchronous, Buffered Banyan Networks,” In Proc. of the IFIP WG 7..9 International Conference on the Performance of Distributed Systems and Integrated Communication Networks, Kyoto, Japan, ed. T. Hasegawa, H. Takagi and Y. Takahashi, North-Holland, pp. 169–188, 1992.
P. G. Harrison and A. de C. Pinto, “An Approximate Analysis of Asynchronous, Packet-switched Buffered Banyan Networks with Blocking,” Performance Evaluation, 19, 1994, pp. 223–258.
P. G. Harrison and N. M. Patel, Performance Modelling of Communication Networks and Computer Architectures, Addison-Wesley, 1992.
D. Kouvatsos and N. Xenios, “MEM for Arbitrary Queueing Networks with Multiple General Servers and Repetitive-service Blocking,” Performance Evaluation, 10, pp. 169–195, Sep. 1989.
C. P. Kruskal, M. Snir and A. Weiss, “The Distribution of Waiting Times in Clocked Multisage Interconnection Network,” IEEE Trans. Comput., 37, no 11, pp. 1337–1352, Nov. 1988.
C. Langaris and B. Conolly, “On the Waiting Time of a Two-stage Queueing System with Blocking,” European Journal of Operational Research, 19, 1985, pp. 222–232.
J. McKenna, “Asymptotic Expansions of the Sojourn Time Distribution Functions of Jobs in Closed, Product-form Queuing Networks,” Journal of the ACM, 34, no 4, 1987, pp. 985–1003.
B. Melamed and M. Yadin, “Numerical Computation of Sojourn-time Distributions in Queueing Networks,” Journal of the ACM, 31, no 4, 1984, pp. 839–854.
II. Perros, “A Bibliography of Papers on Queueing Networks with Finite Capacity Queues,” Performance Evaluation, 10, 1989, pp. 255–260.
A. de C. Pinto, “Time Delay Distribution in Buffered Multistage Interconnection Networks,” In Proc. of the 1st UK Workshop on Performance Modelling and Evaluation of ATM Networks, ed. D. D. Kouvatsos, 1993.
A. de C. Pinto, “Models of Finite-buffered Packet-switched Multistage Interconnection Networks,” PhD thesis, Dept. of Computing, Imperial College, University of London, 1994.
K. E. E. Raatikainen, “Approximating Response Time Distributions,” Performance Evaluation Review, 17, no 1, 1989, pp. 190–199.
II. J. Siegel, Interconnection Networks for Large-Scale Parallel Processing: Theory and Case Studies, 2nd ed., McGraw-Hill Publishing Co., 1990.
J. Walrand, An Introduction to Queueing Networks, Prentice-Hall, 1988.
S. Wolfram, Mathemathica: a system for doing mathematics by computer, 2nd ed., Addison-Wesley, 1991.
H. Yoon, K. Y. Lee and M. T. Liu, “Performance Analysis of Multibuffered Packet-Switching Networks in Multiprocessor Systems,” IEEE Trans. Comput., 39, no 3, pp. 319–327, Mar. 1990.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1995 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
de C. Pinto, A., Harrison, P.G. (1995). Response Time Distributions in Packet-switched Banyan Networks. In: Kouvatsos, D.D. (eds) Performance Modelling and Evaluation of ATM Networks. ATM 1994. IFIP — The International Federation for Information Processing. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-34881-0_20
Download citation
DOI: https://doi.org/10.1007/978-0-387-34881-0_20
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4757-6164-1
Online ISBN: 978-0-387-34881-0
eBook Packages: Springer Book Archive