Decentralized maximum-flow protocols

DOI10.1002/NET.3230120302MaRDI QIDQ3951886zbMATH OpenOpenAlexFDO

Authors Adrian Segall

Publication date 1982

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/net.3230120302

zbMATH Keywords

algorithmcapacitated networkcontrol messagesdecentralized regulation of flowdistributed computationmaximum flow in a networknodes with memory

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Deterministic network models in operations research (90B10) Programming involving graphs or networks (90C35)

Cites work

• Decentralized information and control: A network flow example
• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems

Cited in

(4)

• A principle for sequential reasoning about distributed algorithms
• A decentralized flow redistribution algorithm for avoiding cascaded failures in complex networks
• Inefficiencies in network models: a graph-theoretic perspective
• Near-optimal distributed maximum flow

This page was built for publication: Decentralized maximum-flow protocols

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