The capacity and non-simultaneously multicommodity flow problem in wide area network and data flow management

The paper presents a formulation of the capacity and non-simultaneously multicommodity flow assignment problem in a wide area computer network and dataflow management. The problem consists of selection of non-simultaneously multicommodity flow routes and channel capacities in order to minimize the average delay per packet subject to a budget constraint.