Min-max vs. max-min flow control algorithms for optimal computer network capacity assignment

DOI10.1016/0377-0427(84)90021-9MaRDI QIDQ799103zbMATH OpenOpenAlexWikidataFDO

Authors Carol A. Niznik

Publication date 1984

Published in Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0377-0427(84)90021-9

zbMATH Keywords

flow control algorithmscapacity assignmentmax-min algorithmmin-max algorithmstore and forward computer communication network

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Theory of software (68N99)

Recommendations

• scientific article; zbMATH DE number 3908345
• scientific article; zbMATH DE number 4149863
• On the capacity assignment problem in packet-switching computer networks
• scientific article; zbMATH DE number 3922330
• scientific article; zbMATH DE number 647749

Cites work

• scientific article; zbMATH DE number 3425889 (Why is no real title available?)
• scientific article; zbMATH DE number 3702432 (Why is no real title available?)
• scientific article; zbMATH DE number 3705813 (Why is no real title available?)
• scientific article; zbMATH DE number 3786106 (Why is no real title available?)
• scientific article; zbMATH DE number 3790243 (Why is no real title available?)
• scientific article; zbMATH DE number 51950 (Why is no real title available?)
• scientific article; zbMATH DE number 3466802 (Why is no real title available?)
• scientific article; zbMATH DE number 3562833 (Why is no real title available?)
• scientific article; zbMATH DE number 3603173 (Why is no real title available?)
• scientific article; zbMATH DE number 3247810 (Why is no real title available?)
• A bounded optimization algorithm for capacity assignment in computer communication networks
• A conservation law for a wide class of queueing disciplines
• An approach to multicriterion optimization problems for engineering design
• Convex Analysis
• Maximin Linear Discrimination, I
• Minimizing maximum flows in linear graphs
• Selecting Capacities in Computer Communication Systems
• The Theory of Max-Min, with Applications

Cited in

(2)

• scientific article; zbMATH DE number 3908345 (Why is no real title available?)
• scientific article; zbMATH DE number 647749 (Why is no real title available?)

This page was built for publication: Min-max vs. max-min flow control algorithms for optimal computer network capacity assignment

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