A k shortest path algorithm for adaptive routing in communications networks

DOI10.1109/26.2815zbMath0654.90021OpenAlexW2052455426MaRDI QIDQ3801304

No author found.

Publication date: 1988

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

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

zbMATH Keywords

communication networksadaptive routingworst case time complexitydelta routingLow-order polynomial boundsnetwork survivability measuresshortest loopless paths

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) Deterministic network models in operations research (90B10)

Related Items (3)

A hill-jump algorithm of Hopfield neural network for shortest path problem in communication network ⋮ Nonlinear neural networks for solving the shortest path problem ⋮ Unified approach to fuzzy graph problems

This page was built for publication: A k shortest path algorithm for adaptive routing in communications networks