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

DOI10.1016/0045-7906(83)90006-XMaRDI QIDQ792210zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

flow assignmentmessage-switched communication networksminimization of the average number of hopsrouting

Mathematics Subject Classification ID

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

Review text

Flow assignment and routing problems for message-switched communication networks are considered. The particular problem to be addressed is one of minimizing the average number of hops subject to the average message delay constraint. The presented method is a centralized one and is based on the flow deviation method.

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

Cited in

(3)

• A real-time methodology for minimizing mean flowtime in FMSs with routing flexibility: threshold-based alternate routing
• MINIMUM UNDERFLOW ROUTING FOR STREAM-TYPE COMMUNICATION SERVICES(<Special Issue>the 50th Anniversary of the Operations Research Society of Japan)
• 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)