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

DOI10.1016/0377-0427(84)90021-9zbMath0547.68039OpenAlexW2054445491WikidataQ126759331 ScholiaQ126759331MaRDI QIDQ799103

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)

Cites Work

• An approach to multicriterion optimization problems for engineering design
• A bounded optimization algorithm for capacity assignment in computer communication networks
• Minimizing maximum flows in linear graphs
• Selecting Capacities in Computer Communication Systems
• Maximin Linear Discrimination, I
• A conservation law for a wide class of queueing disciplines
• The Theory of Max-Min, with Applications
• Convex Analysis
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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