Stability and performance of stack algorithms for random access communication modeled as a tree structured QBD Markov chain

Communications in Statistics. Part C: Stochastic Models

Volumn 17, Issue 3, 2001, Pages 247-270

  Van Houdt, B ^a   Blondia, C ^a  

^a UNIVERSITY OF ANTWERP   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 1642468196     PISSN: 08820287     EISSN: None     Source Type: Journal    
DOI: 10.1081/stm-100002273     Document Type: Article

References (18)

1. Capetanakis, J. I. Tree algorithms for packet broadcast channels. IEEE Trans. Inform. Theory, 1979, 25 (5), 319-329.
2. Massey, J. L. Multi-users communication networks. CISM Courses and Lectures No. 256, Ed. G. Longo, Springer Verlag Wien-New York, 1981.
3. Massey, J. L. Some new approaches to random-access communications. Performance, P. J. Courtois and G. Latouche (editors), 1987.
4. Flajolet, P.; Jacques, P. Analytic models for tree communication protocols. INRIA, Technical Report No 648, 1987.
5. Fayolle, G.; Flajolet, P.; Hofri, M.; Jacquet, P. Analysis of a stack algorithm for random multiple-access communication. IEEE Transactions on Information Theory, 1985, IT-21 (2), 244-254.
6. Greenberg, A. G.; Flajolet, P.; Ladner, R. E. Estimating the multiplicity of conficts to speed their resolution in mulitple access channels. Journal of the Association for Computing Machinery, 1987, 34 (2), 289-325.
7. Seri, M.; Sidi, M. Splitting algorithms in channels with markovian capture. European Transactions on Telecommunications and related Technologies, 1994, 5(1), 19-26.
8. Lin, Y-D. On IEEE 802.14 medium access control protocol. IEEE Communication Surveys, 1998.
9. Yeung, R. W.; Alfa, A. S. The quasi-birth-death type markov chain with a tree structure. Stochastic Models, 1999, 75 (4), 639-659.
10. Yeung, R. W.; Sengupta, B. Matrix product-form solutions for markov chain with a tree structure. Adv. Appl. Prob., 1994, 26, 965-987.
11. Takine, T.; Sengupta, B.; Yeung, R. W. A generalization of the matrix M/G/1 paradigm for markov chains with a tree structure. Stochastic Models, 1995, 11 (3), 411-421.
12. HE, Q. Classification of markov processes of matrix M/G/1 type with a tree structure and its applications to the MMAP[K]/G[K]/1 queue. Stochastic Models, 2000, 16 (5).
13. HE, Q. Classification of markov processes of M/G/1 type with a tree structure and its applications to queueing models. O.R Letters, 1999, 26, 67-80.
14. Bertsekas, D.; Gallager, R. Data networks. Prentice-Hall, Inc., 1992.
15. Blondia, C. A discrete-time batch markovian arrival process as B-ISDN traffic model. Belgian Journal of Operations Research, Statistics and Computer Science, 1993, 32 (3,4).
16. Blondia, C.; Casals, O. Statistical multiplexing of VBR sources: A matrixanalytical approach. Performance Evaluation, 1992, 16, 5-20.
17. Van Houdt, B.; Blondia, C. Throughput of Q-ary splitting algorithms for contention resolution in communication networks. Submitted to Adv. in Perf. Eval., 2001.
18. Van Houdt, B. Performance analysis of contention resolution algorithms in random access systems. PhD dissertation, University of Antwerp (UA), 2001.