A queueing theoretic methodology for the analysis of separable conflict resolution algorithms with variable length elementary events

From MaRDI portal
Publication:1331296

DOI10.1007/BF01158961zbMath0811.68090OpenAlexW2073647217MaRDI QIDQ1331296

Mart L. Molle, George C. Polyzos

Publication date: 21 August 1994

Published in: Queueing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01158961






Cites Work




This page was built for publication: A queueing theoretic methodology for the analysis of separable conflict resolution algorithms with variable length elementary events