Computing the throughput of dynamic networks

MaRDI QIDQ788617zbMATH OpenFDO

Authors L. K. Mejzin

Publication date 1983

Published in Automation and Remote Control (Search for Journal in Brave)

zbMATH Keywords

large networktransport networkflow computationassembly line controlproduction streamsubnetwork of fixed structure

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Production models (90B30)

Recommendations

• Computing the throughput of a network with dedicated lines
• scientific article; zbMATH DE number 4046840
• scientific article; zbMATH DE number 4203691
• Constructing maximal dynamic flows from static flows
• Throughput properties of a queueing network with distributed dynamic routing and flow control

Cited in

(5)

• Computing the throughput of a network with dedicated lines
• Throughput calculation for basic stochastic rendezvous networks
• Calculation of traffic flow breakdown probability to optimize link throughput
• A Dynamic Algorithm for Network Propagation
• Applying the network flow model to evaluate an FMC's throughput

This page was built for publication: Computing the throughput of dynamic networks

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