Optimal Congestion Control in Single Destination Networks

DOI10.1109/TCOM.1985.1096380zbMath0572.90025OpenAlexW2105688031MaRDI QIDQ3690538

G. I. Stassinopoulos, Panagiotis Konstantopoulos

Publication date: 1985

Published in: IEEE Transactions on Communications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tcom.1985.1096380

zbMATH Keywords

arrival ratesalgorithm for optimal routing in communication networksflow control policyminimal value for the maximal delayoptimal congestion controlsingle destination networks

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

Related Items (5)

Fenchel duality and smoothness of solution of the optimal routing problem ⋮ On continuous network flows ⋮ A linear programming approach to routing control in networks of constrained linear positive systems ⋮ Distributed shortest-path protocols for time-dependent networks ⋮ Universally maximum flow with piecewise-constant capacities

This page was built for publication: Optimal Congestion Control in Single Destination Networks