The Modeling of Adaptive Routing in Data-Communication Networks

DOI10.1109/TCOM.1977.1093715MaRDI QIDQ4136587zbMATH OpenOpenAlexFDO

Authors 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)

Cited in

(16)

• On continuous network 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
• Optimal control of dynamic routing in networks with randomly perturbed flows
• Optimal stopping and control with two kinds of boundary conditions: application to dynamic routeing in networks
• Routing optimization in packet switching communication networks
• Unloading of congestion in deterministic queueing networks
• Optimal stochastic switching of dynamic routing in networks
• Control of dynamic routing in networks with Markov jump parameters
• Control of the transition probabilities of input rates of a flow in a network
• Dynamic routing for computer queueing networks
• scientific article; zbMATH DE number 4189174 (Why is no real title available?)
• A decentralized routing control scheme for data communication networks
• Optimal control of store-and-forward networks
• Optimal stopping and control of dynamic routing in networks
• Fenchel duality and smoothness of solution of the optimal routing problem

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

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