Routing in computer networks

DOI10.1002/NET.3230010202MaRDI QIDQ5643889zbMATH OpenOpenAlexFDO

Authors

Publication date 1971

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/net.3230010202

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Cited in

(9)

• A hill-jump algorithm of Hopfield neural network for shortest path problem in communication network
• Routing Algorithmen in Datennetzen - eine vergleichende Simulationsstudie. (Routing algorithms in data networks - a comparing simulation study)
• OVERALL DESIGN OF RELIABLE CENTRALIZED VOICE/DATA COMMUNICATION NETWORK
• New formulations and solution procedures for the hop constrained network design problem.
• Routing and capacity assignment in backbone communication networks
• 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
• LARGE SCALE NETWORK ARCHITECTURE SYNTHESIS: INTERACTIVE STRATEGY
• A dual scheme for traffic assignment problems

This page was built for publication: Routing in computer networks

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