Min-max vs. max-min flow control algorithms for optimal computer network capacity assignment
DOI10.1016/0377-0427(84)90021-9zbMATH Open0547.68039OpenAlexW2054445491WikidataQ126759331 ScholiaQ126759331MaRDI QIDQ799103FDOQ799103
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
Recommendations
flow control algorithmscapacity assignmentmax-min algorithmmin-max algorithmstore and forward computer communication network
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
- Convex Analysis
- Title not available (Why is that?)
- Title not available (Why is that?)
- The Theory of Max-Min, with Applications
- Title not available (Why is that?)
- A conservation law for a wide class of queueing disciplines
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Selecting Capacities in Computer Communication Systems
- 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
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Maximin Linear Discrimination, I
Cited In (2)
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)