The Modeling of Adaptive Routing in Data-Communication Networks

DOI10.1109/TCOM.1977.1093715zbMath0362.68100OpenAlexW2083050082MaRDI QIDQ4136587

Adrian Segall

Publication date: 1977

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

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (16)

Fenchel duality and smoothness of solution of the optimal routing problem ⋮ Optimal stopping and control of dynamic routing in networks ⋮ On continuous network flows ⋮ Optimal stopping and control with two kinds of boundary conditions: application to dynamic routeing in networks ⋮ Optimal control of dynamic routing in networks with randomly perturbed flows ⋮ A robust adaptive congestion control strategy for large scale networks with differentiated services traffic ⋮ A linear programming approach to routing control in networks of constrained linear positive systems ⋮ Dynamic routing for computer queueing networks ⋮ A decentralized routing control scheme for data communication networks ⋮ Optimal stochastic switching of dynamic routing in networks ⋮ Routing optimization in packet switching communication networks ⋮ Unloading of congestion in deterministic queueing networks ⋮ Optimal control of store-and-forward networks ⋮ Unnamed Item ⋮ Control of dynamic routing in networks with Markov jump parameters ⋮ Control of the transition probabilities of input rates of a flow in a network

This page was built for publication: The Modeling of Adaptive Routing in Data-Communication Networks