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

DOI10.1016/0045-7906(83)90006-XzbMATH Open0536.90032OpenAlexW2038402489MaRDI QIDQ792210FDOQ792210

Authors: 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

Recommendations

• The flow deviation method: An approach to store‐and‐forward communication network design
• scientific article; zbMATH DE number 4149863
• scientific article; zbMATH DE number 3922330
• scientific article; zbMATH DE number 3887398
• On the capacity assignment problem in packet-switching computer networks

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Cited In (3)

• MINIMUM UNDERFLOW ROUTING FOR STREAM-TYPE COMMUNICATION SERVICES(<Special Issue>the 50th Anniversary of the Operations Research Society of Japan)
• A real-time methodology for minimizing mean flowtime in FMSs with routing flexibility: threshold-based alternate routing
• Dynamic load distribution with hop-by-hop forwarding based on MAX-MIN one-way delay

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

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