On the Maximum Stable Throughput of Tree Algorithms With Free Access

DOI10.1109/TIT.2009.2030493MaRDI QIDQ4974062zbMATH OpenFDO

Authors Gino T. Peeters, Benny Van Houdt

Publication date 8 August 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TIT.2009.2030493

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Communication theory (94A05)

Cited in

(4)

• Throughput and delay analysis of an opportunistic tree algorithm
• A strongly polynomial time algorithm for the maximum supply rate problem on trees
• A strongly polynomial time algorithm for the maximum supply rate problem on trees
• Analysis of \(d\)-ary tree algorithms with successive interference cancellation

This page was built for publication: On the Maximum Stable Throughput of Tree Algorithms With Free Access

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4974062)