A minimum principle/queueing theory approach to routing in message- switched networks

DOI10.1016/0045-7906(78)90004-6zbMATH Open0395.94038OpenAlexW2059295407MaRDI QIDQ1253239FDOQ1253239

Authors: J. S. Meditch 

Publication date: 1978

Published in: Computers and Electrical Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0045-7906(78)90004-6

zbMATH Keywords

QueueingMessage-Switched Store-And- Forward Data Communication NetworksMinimum Message-Delay Routing

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) Data structures (68P05) Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20)

This page was built for publication: A minimum principle/queueing theory approach to routing in message- switched networks

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