Bounds for the optimal decentralized access protocol in a local area network

DOI10.1016/0166-5316(86)90035-0zbMath0603.68017OpenAlexW2233778373MaRDI QIDQ3740207

Zvi Rosberg

Publication date: 1986

Published in: Performance Evaluation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-5316(86)90035-0

zbMATH Keywords

optimal schedulingdistributed protocolsingle server queueoptimal long-run average waiting cost

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Theory of operating systems (68N25)

Related Items (1)

Mathematical theory of queueing networks

This page was built for publication: Bounds for the optimal decentralized access protocol in a local area network