Multiple-access protocols and time-constrained communication
ACM Computing Surveys (CSUR)
Analysis of polling systems
M/G/1/N queue with vacation time and limited service discipline
Performance Evaluation
Delay analyses of token-passing protocols with limited token holding times
IEEE INFOCOM '92 Proceedings of the eleventh annual joint conference of the IEEE computer and communications societies on One world through communications (Vol. 3)
A discrete-time analysis of the cyclic reservation multiple access protocol
Performance Evaluation - Special issue on performance modeling of high speed telecommunication systems
E-DCP, an extension of the distributed-control polling MAC protocol (DCP) for integrated services
Computer Networks and ISDN Systems - Special issue: media-access techniques for high-speed LANs and MANs
Analysis of the Quality of Service in a MAN Environment
Proceedings of the IFIP WG10.3 International Conference on Decentralized and Distributed Systems
Metropolitan Area Networks (MANs): Protocols, Modeling and Performance Evaluation
Performance Evaluation of Computer and Communication Systems, Joint Tutorial Papers of Performance '93 and Sigmetrics '93
Effects of the Target Token Rotation Time on the Performance of a Timed-Token Protocol
Performance '90 Proceedings of the 14th IFIP WG 7.3 International Symposium on Computer Performance Modelling, Measurement and Evaluation
Client requirements for real-time communication services
IEEE Communications Magazine
Performance analysis of the timed token protocol of FDDI and FDDI-II
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.24 |
This paper presents a method designed to estimate bounds on the Quality of Service (QoS) provided by LAN/MAN networks. This method is a result of the amalgamation of a number of previous approaches. It can be applied whenever the LAN/MAN technologies are characterized by MAC protocols with a cyclic behaviour. The key idea is the definition of a worst-case model of the communication system and its study via an embedded Markov chain. Two solution techniques have been identified. The first is based on the z-transform technique, and provides a closed formula for the probability generating function (PGF) of the distribution of the number of packets in the system. The second exploits the theory developed by Neuts for M/G/1 type Markov chains to provide a numerical solution for the distribution of delay and buffer size. The method, and an assessment of its accuracy, are presented by studying a general model of a MAC protocol which behaves like a polling system with an exhaustive-limited service discipline. Finally, the method is applied to FDDI and CRMA.