A model of channel allocation in multichannel local networks

DOI10.1016/0305-0548(91)90031-LzbMath0723.90025OpenAlexW1984054127MaRDI QIDQ2276864

John R. Heath, Muhammad El-Taha

Publication date: 1991

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0305-0548(91)90031-l

zbMATH Keywords

polynomial algorithmdemand assignment channel allocation schememultichannel local networkspreferentially ordered parallel servers

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Network design and communication in computer systems (68M10) Queues and service in operations research (90B22) Channel models (including quantum) in information and communication theory (94A40) Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The M/M/\(\infty\) service system with ranked servers in heavy traffic. With a preface by Franz Ferschl
• Comparing ordered-entry queues with heterogeneous servers
• Sample-path analysis of processes with imbedded point processes
• A note on many-server queueing systems with ordered entry, with an application to conveyor theory
• On Arrivals That See Time Averages
• Server utilization factors in queueing loss systems with ordered entry and heterogeneous servers
• The Arrangement of Servers in an Ordered-Entry System

This page was built for publication: A model of channel allocation in multichannel local networks