Kapazitätsoptimierung in paketvermittelten Datennetzen. (Capacity optimization in packet switched data networks)
In this journal the treatment of planning problems in information and data networks by methods of Operations Research has already been treated several times. Especially the subject of capacity optimization discussed in this paper has already been extensively dealt with by \textit{R. Garcia} [ibid. 4, 237-244 (1982; Zbl 0493.90031)]. Therefore this paper may be considered as a supplementary one. The specification of minimum cost capacities of packet switched data networks may be modelled as an integer nonlinear optimization problem. Garcia has solved the complementary real substitute problem with integer results, which may lead to non-optimal solutions. In this paper the model is based right on the discrete problem structure and solved by three different methods (dynamic programming and two heuristics). All three methods provide generally the same results while computer time requirements of the heuristic methods are significantly below those of dynamic programming. Results will generally lead to cheaper solutions than by Garcia.
- scientific article; zbMATH DE number 3900475
- On the capacity assignment problem in packet-switching computer networks
- scientific article; zbMATH DE number 4149863
- A heuristic approach for capacity expansion of packet networks
- A system for priority routing and capacity assignment in packet switched networks
This page was built for publication: Kapazitätsoptimierung in paketvermittelten Datennetzen. (Capacity optimization in packet switched data networks)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1089255)
