Distributed asynchronous optimal routing in data networks

DOI10.1109/TAC.1986.1104261MaRDI QIDQ3714925zbMATH OpenFDO

Authors Dimitri P. Bertsekas, John N. Tsitsiklis

Publication date 1986

Published in IEEE Transactions on Automatic Control (Search for Journal in Brave)

zbMATH Keywords

robustnessdata networksgradient projection typedistributed optimal routing algorithmsrealistic distributed operating environment

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Recommendations

• An optimal distributed routing algorithm
• Asymptotic optimality of shortest path routing algorithms
• An optimal distributed routing algorithm using dual decomposition techniques
• Convergence of gradient projection routing methods in an asynchronous stochastic quasi-static virtual circuit network
• A distributed adaptive routing algorithm

Cited in

(22)

• Some aspects of parallel and distributed iterative algorithms - a survey
• On the stability of asynchronous iterative processes
• Distributed iterative aggregation algorithms for box-constrained minimization problems and optimal routing in data networks
• Optimal scaling of a gradient method for distributed resource allocation
• UNIVERSAL ROUTING AND PERFORMANCE ASSURANCE FOR DISTRIBUTED NETWORKS
• Simultaneous routing and flow rate optimization in energy-aware computer networks
• Modal consensus, synchronization and formation control with distributed endogenous internal models
• Asymptotic analysis of the effect of arrival model uncertainties in some optimal routing problems
• Optimal adaptive routing with efficient flapping prevention
• Asynchronous algorithms for computing equilibrium prices in a capital asset pricing model
• Asymptotic optimality of shortest path routing algorithms
• Effect of model uncertainty on some optimal routing problems
• Convergence of gradient projection routing methods in an asynchronous stochastic quasi-static virtual circuit network
• Error bounds and convergence analysis of feasible descent methods: A general approach
• An optimal distributed routing algorithm using dual decomposition techniques
• Measurement-based optimal routing on overlay architectures for unicast sessions
• A distributed optimization algorithm in connection-less networks
• scientific article; zbMATH DE number 7774260 (Why is no real title available?)
• Dynamic routing to heterogeneous collections of unreliable servers
• Integer Programming and Combinatorial Optimization
• Asynchronous throughput-optimal routing in malicious networks
• Inverse source problem in a forced network

This page was built for publication: Distributed asynchronous optimal routing in data networks

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