Minimum hop flow assignment and routing subject to an average message delay constraint

DOI10.1016/0045-7906(83)90006-XzbMath0536.90032OpenAlexW2038402489MaRDI QIDQ792210

N. E. Zubov

Publication date: 1983

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

Full work available at URL: https://doi.org/10.1016/0045-7906(83)90006-x

zbMATH Keywords

routingflow assignmentmessage-switched communication networksminimization of the average number of hops

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Queueing theory (aspects of probability theory) (60K25) Deterministic network models in operations research (90B10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

This page was built for publication: Minimum hop flow assignment and routing subject to an average message delay constraint