Message Route Control in a Large Teletype Network
Maurice Pollack · Journal of the ACM · 1964
Communications networks can experience rapid changes in botit transmission capabilities and traffic demands.Real-time methods for obtaining optimal traffic routes are needed.Three methods, all utilizing digital computers, are shown to be feasible.Two are linear programming formulations, the third is a sequential assignment method.All three are applicable to directed networks with no more than 15 relay stations; only the third method is applicable to larger networks.The relative merits of each method and computer timing estimates are given.