Approximate analysis of non-exhaustive multiserver polling systems with applications to local area networks

DOI10.1016/0169-7552(89)90020-2zbMath0684.68020OpenAlexW1996297549MaRDI QIDQ4734748

V. Carl Hamacher, Ahmed E. Kamal

Publication date: 1989

Published in: Computer Networks and ISDN Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0169-7552(89)90020-2

zbMATH Keywords

performance evaluationqueuespolling systemslocal area networksmultiple serversslotted ringmean waiting-time approximationpartial- insertion rings

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Theory of software (68N99)

Related Items (3)

Polling systems with multiple coupled servers ⋮ Analysis of random polling system with an infinite number of coupled servers and correlated input process. ⋮ Analysis of infinite servers polling systems with correlated input process and state dependent vacations

This page was built for publication: Approximate analysis of non-exhaustive multiserver polling systems with applications to local area networks