On the Maximum Stable Throughput of Tree Algorithms With Free Access

DOI10.1109/TIT.2009.2030493zbMath1367.94055MaRDI QIDQ4974062

Gino T. Peeters, Benny Van Houdt

Publication date: 8 August 2017

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

Mathematics Subject Classification ID

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

Related Items (1)

Throughput and delay analysis of an opportunistic tree algorithm

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