Abstract
The MetaRing is a Medium Access Control (MAC) protocol for high-speed LANs and MANs. The MetaRing MAC protocol offers its users synchronous, and asynchronous types of services and can operate under two basic access control modes: buffer insertion for variable size packets, and slotted for fixed length packets (i.e., cells). The latter mode of operation is considered in this paper, which only reports performance results of an analysis related to the asynchronous type of service. In this paper we propose and solve a specific worst-case model that enables us to calculate quantiles of the queue length distribution at cell departure time as a function of the offered load, and for three different arrival processes: Poisson, Batch Poisson (B-Poisson), and Batch Markov Modulated Poisson Process (BMMPP). The model proposed is a discrete time discrete state Markov chain of M/G/1-Type, and hence we used a matrix analytic methodology to solve it. Exploitation of the structure of the blocks belonging to the transition probability matrix considerably reduces the computational costs. Our results show that the more realistic the arrival process is, the longer the tail of the queue length distribution.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
