Optimal Routing in a Packet-Switched Computer Network
From MaRDI portal
Cited in
(20)- An algorithm for nonlinear programs over Cartesian product sets
- A hill-jump algorithm of Hopfield neural network for shortest path problem in communication network
- Multiple allocation hub-and-spoke network design under hub congestion
- Finding the biased-shortest path with minimal congestion in networks via linear-prediction of queue length
- A decomposition algorithm for quadratic programming
- A regularization of the Frank-Wolfe method and unification of certain nonlinear programming methods
- Routing optimization in packet switching communication networks
- Effect of model uncertainty on some optimal routing problems
- A polynomial algorithm for minimum quadratic cost flow problems
- A heuristic for the continuous capacity and flow assignment
- An algorithm for optimal minimax routing in ATM networks
- Restricted Simplicial Decomposition for Symmetric Convex Cost Flow Problems
- An efficient graph technique based dual-type algorithm for NMNF problems with large capacity constraints
- Queuing effects in the solution of constrained store-and-forward network flow problems
- Finiteness in restricted simplicial decomposition
- Parallel optimization for traffic assignment
- The internet, evolutionary variational inequalities, and the time-dependent Braess paradox
- Processors selection and traffic splitting in a parallel processors system
- Uniqueness of the solution for optimal static routing in open BCMP queueing networks
- Heavy Tails in Queueing Systems: Impact of Parallelism on Tail Performance
This page was built for publication: Optimal Routing in a Packet-Switched Computer Network
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4042820)
