Throughput and delay analysis of an opportunistic tree algorithm

DOI10.1080/15326349.2015.1069202zbMath1393.68036OpenAlexW2294111358MaRDI QIDQ2803401

No author found.

Publication date: 4 May 2016

Published in: Stochastic Models (Search for Journal in Brave)

Full work available at URL: https://hdl.handle.net/10067/1339240151162165141

zbMATH Keywords

delayrandom accesscognitive radiotree algorithmsmaximum stable throughput

Mathematics Subject Classification ID

Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Network protocols (68M12)

Cites Work

• NeXt generation/dynamic spectrum access/cognitive radio wireless networks: a survey
• Solving nonlinear matrix equations arising in tree-like stochastic processes.
• STABILITY AND PERFORMANCE OF STACK ALGORITHMS FOR RANDOM ACCESS COMMUNICATION MODELED AS A TREE STRUCTURED QBD MARKOV CHAIN
• Tree algorithms for packet broadcast channels
• Splitting protocols in presence of capture
• <tex>Q</tex>-ary collision resolution algorithms in random-access systems with free or blocked channel access
• The quasi-birth-death type markov chain with a tree structure
• Information theory and communication networks: an unconsummated union
• A generalization of the matrix M/G/l paradigm for Markov chains with a tree structure
• On the Maximum Stable Throughput of Tree Algorithms With Free Access
• Performance evaluation of a production/inventory system with periodic review and endogenous lead times

This page was built for publication: Throughput and delay analysis of an opportunistic tree algorithm