DocumentCode
2743313
Title
Modelling Finite Buffer Slotted Ring Network Using Matrix Geometric Method
Author
Shah, Syed Asif Ali ; Shah, Wajiha ; Hayat, M. Faisal ; Menghwar, Gordhan Das
Author_Institution
Inst. of Broadband Commun., Vienna Univ. of Technol., Vienna, Austria
fYear
2009
fDate
25-27 Nov. 2009
Firstpage
535
Lastpage
539
Abstract
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.
Keywords
Markov processes; delays; probability; queueing theory; telecommunication networks; 2D Markov chain; discrete time queueing technique; finite station buffer; matrix geometric method; packet rejection delay; packet rejection probability; slotted ring network; Computer networks; Differential equations; Local area networks; Markov processes; Performance analysis; Protocols; Queueing analysis; Solid modeling; Stationary state; Throughput; Matrix Geometric Method; blocking probability; delay; slotted ring network; throughput;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer Modeling and Simulation, 2009. EMS '09. Third UKSim European Symposium on
Conference_Location
Athens
Print_ISBN
978-1-4244-5345-0
Electronic_ISBN
978-0-7695-3886-0
Type
conf
DOI
10.1109/EMS.2009.50
Filename
5358718
Link To Document