Optimal Routing in a Packet-Switched Computer Network

DOI10.1109/T-C.1974.223806zbMath0291.90031OpenAlexW2121756644MaRDI QIDQ4042820

Mario Gerla, David G. Cantor

Publication date: 1974

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

Full work available at URL: https://doi.org/10.1109/t-c.1974.223806

Mathematics Subject Classification ID

Related Items (20)

Finding the biased-shortest path with minimal congestion in networks via linear-prediction of queue length ⋮ A regularization of the Frank-Wolfe method and unification of certain nonlinear programming methods ⋮ Multiple allocation hub-and-spoke network design under hub congestion ⋮ A hill-jump algorithm of Hopfield neural network for shortest path problem in communication network ⋮ An efficient graph technique based dual-type algorithm for NMNF problems with large capacity constraints ⋮ Uniqueness of the solution for optimal static routing in open BCMP queueing networks ⋮ 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 ⋮ Heavy Tails in Queueing Systems: Impact of Parallelism on Tail Performance ⋮ An algorithm for nonlinear programs over Cartesian product sets ⋮ A decomposition algorithm for quadratic programming ⋮ Restricted Simplicial Decomposition for Symmetric Convex Cost Flow Problems ⋮ Queuing effects in the solution of constrained store-and-forward network flow problems ⋮ Routing optimization in packet switching communication networks ⋮ A polynomial algorithm for minimum quadratic cost flow problems ⋮ Finiteness in restricted simplicial decomposition ⋮ An algorithm for optimal minimax routing in ATM networks ⋮ Effect of model uncertainty on some optimal routing problems ⋮ A heuristic for the continuous capacity and flow assignment

This page was built for publication: Optimal Routing in a Packet-Switched Computer Network