Modelling Finite Buffer Slotted Ring Network Using Matrix Geometric Method

Various analytical methods are proposed and used to evaluate the performance of a given slotted ring network. In this paper a station buffer of a slotted ring is analyzed using discrete time queueing technique with an assumption that the time is divided into small segments known as slots. We analyzed and propose the Matrix Geometric Method (MGM) as the solution technique for the model under discussion. Our model has finite station buffer and its behaviour is evaluated through MGM technique by utilizing the characteristics of two-dimensional markov chain. Various performance measures are validated with their corresponding results such as, throughput, delay and probability of packet rejection.

[1]  Byung-Seok Park,et al.  Performance comparison of a class of slotted ring networks , 1995, Proceedings IEEE Symposium on Computers and Communications.

[2]  J. W. Cohen,et al.  QUEUEING, PERFORMANCE AND CONTROL IN ATM , 1991 .

[3]  Tom Burr,et al.  Introduction to Matrix Analytic Methods in Stochastic Modeling , 2001, Technometrics.

[4]  Beatrice Meini,et al.  Numerical methods for structured Markov chains , 2005 .

[5]  M. E. Woodward,et al.  Communication and computer networks - modelling with discrete-time queues , 1993 .

[6]  Nail Akar,et al.  A novel computational method for solving finite qbd processes , 2000 .

[7]  Bart van Arem,et al.  Analysis of a Queuing Model for Slotted Ring Networks , 1990, Comput. Networks ISDN Syst..

[8]  Peter J. B. King,et al.  Modeling a Slotted Ring Local Area Network , 1987, IEEE Transactions on Computers.

[9]  Armand M. Makowski,et al.  Matrix-Geometric Solution for Finite Capacity Queues with Phase-Type Distributions , 1987, Performance.

[10]  Guy Latouche,et al.  A general class of Markov processes with explicit matrix-geometric solutions , 1986 .

[11]  Levent Gun,et al.  Experimental results on matrix-analytical solution techniques–extensions and comparisons , 1989 .

[12]  Marcel F. Neuts.  The probabilistic significance of the rate matrix in matrix-geometric invariant vectors , 1980 .

[13]  William J. Stewart,et al.  Explicit and Iterative Numerical Approaches to Solving Queueing Models , 1985, Oper. Res..

[14]  Shuji Tasaka,et al.  Performance comparison of high-speed ring networks with nodes of finite buffer capacity , 1993 .

[15]  Wayne M. Loucks,et al.  Short-Packet Transfer Performance in Local Area Ring Networks , 1985, IEEE Transactions on Computers.

[16]  Ronald W. Wolff,et al.  Performance analysis of a slotted ring LAN by a single-buffer model , 1994 .

[17]  YangQing,et al.  Approximate Analysis of Single and Multiple Ring Networks , 1989 .

[18]  Wah Chun Chan.  Performance analysis of telecommunications and local area networks , 1999 .

[19]  Laxmi N. Bhuyan,et al.  Approximate Analysis of Single and Multiple Ring Networks , 1989, IEEE Trans. Computers.

[20]  Marco Ajmone Marsan,et al.  Modelling slotted multi-channel ring all-optical networks , 1997, Proceedings Fifth International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems.

[21]  Charles R. Johnson,et al.  Matrix analysis , 1985, Statistical Inference for Engineers and Data Scientists.