Fundamentals of queueing theory (2nd ed.).
Fundamentals of queueing theory (2nd ed.).
Data networks
Estimating the multiplicities of conflicts to speed their resolution in multiple access channels
Journal of the ACM (JACM)
Conflict multiplicity estimation and batch resolution algorithms
IEEE Transactions on Information Theory
Computer networks
Statistical multiplexing of VBR sources: a matrix-analytic approach
Performance Evaluation - Special issue on performance modeling of high speed telecommunication systems
CAC investigation for video and data
BC '98 Proceedings of the IFIP TC6/WG6.2 Fourth International Conference on Broadband Communications: The future of telecommunications
Circulant matching method for multiplexing ATM traffic applied to video sources
PICS '98 Proceedings of the IFIP TC6/WG6.3 Seventh International Conference on Performance of Information and Communication Systems
Some New Approaches to Random-Access Communication
Performance '87 Proceedings of the 12th IFIP WG 7.3 International Symposium on Computer Performance Modelling, Measurement and Evaluation
D-BMAP models for performance evaluation of ATM networks
Proceedings of the Second IFIP Workshop on Performance Modelling and Evaluation of ATM Networks: ATM Networks, Performance Modelling and Analysis, Volume 1
The Correlation Structure of the Output of an ATM Multiplexer
Proceedings of the IFIP TC6 WG6.3/WG6.4 Fifth International Workshop on Performance Modelling and Evaluation of ATM Networks: Performance Analysis of ATM Networks
Efficient solution of multiple server queues with application to the modeling of ATM concentrators
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 1
Information theory and communication networks: an unconsummated union
IEEE Transactions on Information Theory
Performance issues in VC-merge capable switches for multiprotocol label switching
IEEE Journal on Selected Areas in Communications
Transient analysis of tree-Like processes and its application to random access systems
SIGMETRICS '06/Performance '06 Proceedings of the joint international conference on Measurement and modeling of computer systems
| Hi-index | 0.00 |
The throughput characteristics of a random access system (RAS) which uses Q-ary tree algorithms (where Q is the number of groups into which colliding users are split) of the Capetanakis-Tsybakov-Mikhailov-Vvedenskaya type are analyzed for an infinite population of identical users generating packets. In the standard model packets are assumed to be generated according to a Poisson process. In this paper we greatly relax this assumption and consider a rich class of Markovian arrival processes, which, in general, are non-renewal. This class of arrival processes is known to lend itself very well to modeling bursty and correlated arrival processes commonly arising in computer and communication applications. Blocked and grouped channel access protocols are considered in combination with Q-ary collision resolution algorithms that exploit either binary ("collision or not") or ternary ("collision, success or idle") feedback. For the resulting RASs the corresponding maximum stable throughput is determined. It is concluded that the resulting RASs maintain their good stability characteristics under the wide range of arrival processes considered, thereby further extending the theoretical foundations of tree algorithms.