Bounds for Queue Lengths in a Contention Packet Broadcast System

DOI10.1109/TCOM.1986.1096465MaRDI QIDQ3751499zbMATH OpenOpenAlexFDO

Authors Wojciech Szpankowski

Publication date 1986

Published in IEEE Transactions on Communications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tcom.1986.1096465

zbMATH Keywords

communication networkqueueing networkbroadcast channelaverage queue lengthsALOHA-type protocol

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Communication theory (94A05) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Recommendations

• scientific article; zbMATH DE number 4157661
• Output Processes in Contention Packet Broadcasting Systems
• On queueing problems in random-access communications
• Per-queue stability analysis of a random access system
• scientific article; zbMATH DE number 4028589

Cited in

(3)

• A random access G-network: stability, stable throughput, and queueing analysis
• Mathematical theory of queueing networks
• Analysis of the shortest relay queue policy in a cooperative random access network with collisions

This page was built for publication: Bounds for Queue Lengths in a Contention Packet Broadcast System

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