Throughput of \(Q\)-ary splitting algorithms for contention resolution in communication networks

DOI10.4310/CIS.2004.V4.N2.A2zbMath1096.68014OpenAlexW2033687940MaRDI QIDQ2493521

Benny Van Houdt, Chris Blondia

Publication date: 20 June 2006

Published in: Communications in Information and Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4310/cis.2004.v4.n2.a2

zbMATH Keywords

batch Markovian arrival processrandom access algorithms

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Applications of queueing theory (congestion, allocation, storage, traffic, etc.) (60K30) Communication theory (94A05)

Related Items (2)

Analyzing priority queues with 3 classes using tree-like processes ⋮ On the link between Markovian trees and tree-structured Markov chains

This page was built for publication: Throughput of \(Q\)-ary splitting algorithms for contention resolution in communication networks